arXiv Machine Learning

Exploring Bad Minima in Transfer Learning

The paper investigates whether strong generalization on a source task guarantees transferability to a related target task in transfer learning. The authors hypothesize a negative answer and conduct adversarial attacks on the transfer learning process to find counterexamples. Their empirical results reveal a strong relationship between source-task generalization and transferability, though they do not rule out the possibility that good source generalization is sufficient for successful transfer.

arXiv Computer Vision
Oct 9

Boosting the Local Invariance for Better Adversarial Transferability

The paper introduces LI-Boost, a technique that enhances the local invariance of adversarial perturbations to improve their transferability across models. By demonstrating a positive correlation between local invariance and transferability, the authors show that LI-Boost significantly boosts five categories of transfer-based attacks on ImageNet, including CNNs, ViTs, defense mechanisms, commercial APIs, and vision-language models. Extensive experiments confirm the method’s effectiveness across diverse architectures and attack types.

By Bohan Liu, Xiaosen Wang
arXiv Machine Learning
Sep 14

Guided Adversarial Robust Transfer Learning with Source Mixing

Guided Adversarial Robust Transfer (GART) learning is a new transfer learning method that relaxes the requirement for source data to closely resemble the target population. By optimizing an adversarial loss over a mixture of source distributions, GART achieves faster convergence and improved prediction performance when target data are scarce. Experiments on simulated data and on multi‑institutional biobank‑linked electronic health records for high‑density lipoprotein cholesterol demonstrate higher robustness and accuracy compared to existing transfer learning approaches.

By Xin Xiong, Zijian Guo, Tianxi Cai
arXiv AI
Sep 17

Limits of Transfer Learning

The paper investigates the theoretical limits of transfer learning, demonstrating that careful selection of transferable information and its dependence on target problems is crucial. It establishes that the degree of probabilistic change in a transfer-learning algorithm imposes an upper bound on achievable improvement. These findings extend the algorithmic search framework to a broad class of learning tasks involving transfer.

By Jake Williams, Abel Tadesse, Tyler Sam, Huey Sun, George D. Montanez
arXiv AI
Sep 18

Information-Geometric Inverse Distillation for Enhancing Adversarial Transferability

The paper introduces Inverse Knowledge Distillation (IKD), an attack‑agnostic technique that enhances adversarial transferability by maximizing the discrepancy between benign and adversarial prediction distributions on a surrogate model. IKD employs a CE/KL‑equivalent soft‑label objective to push adversarial predictions away from a fixed benign anchor, leveraging Fisher‑sensitive surrogate directions. The authors provide theoretical analysis showing CE and KL induce identical gradients, derive a lower bound on Fisher‑subspace overlap, and demonstrate through extensive ImageNet experiments that IKD consistently improves black‑box attack performance across CNN, ViT, and defended models.

By Wenyuan Wu, Yuan Sun, Yingke Chen, Chao Su, Xi Peng, Dezhong Peng, Xu Wang
arXiv Machine Learning
Aug 27

Rethinking the Transferable Adversarial Attacks and Robust Defense in Federated Learning

The paper investigates how adversarial examples transfer between client models in federated learning and explores the relationship between these examples and client data distributions. It proposes a defense strategy based on adversarial training that leverages the transferability of model robustness. Experiments on real-life datasets demonstrate that the new attack and defense methods outperform existing state‑of‑the‑art approaches.

By Zuobin Xiong, Deval Mukherjee, Homook Cho, Wei Li