arXiv Machine Learning

Merge Now, Regret Later: The Hidden Cost of Model Merging Is Adversarial Transferability

arXiv:2509. 23689v2 Announce Type: replace Abstract: Model Merging (MM) has proven to be an effective alternative to multi-task learning, where several fine-tuned models are merged, without access to the tasks' training data, into one model that retains performance across different tasks.

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
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 AI
Sep 1

Watch your steps: Dormant Adversarial Behaviors that Activate upon LLM Finetuning

The paper introduces FAB, an attack that uses meta‑learning to embed dormant adversarial behaviors into large language models (LLMs). These behaviors remain inactive until the model is finetuned by downstream users, at which point the model can exhibit unwanted actions such as unsolicited advertising, jailbreakability, or over‑refusal. FAB is shown to be effective across multiple LLMs and resilient to various finetuning settings.

By Thibaud Gloaguen, Mark Vero, Robin Staab, Martin Vechev
arXiv AI
1d ago

Beyond Boundaries: A Comprehensive Survey of Transferable Attacks on AI Systems

The paper surveys transferable attacks on AI systems, noting that such attacks can be crafted in one setting and then applied to others, thereby lowering costs and increasing security risks. It introduces a unified taxonomy across six axes—cross-instance, cross-domain, cross-modality, cross-model, cross-task, and cross-deployment—while distinguishing source-target changes from attacker resources. The survey also links transfer mechanisms to enhancement methods, highlights inconsistencies and gaps in current research, and proposes a research agenda for better benchmarking and defense strategies.

By Guangjing Wang, Ce Zhou, Yuanda Wang, Bocheng Chen, Hanqing Guo, Qiben Yan
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
Sep 10

Approaching the Harm of Gradient Attacks While Only Flipping Labels

The paper investigates the impact of label‑flipping attacks on distributed machine learning, where an adversary can only flip a limited number of training labels. It formalizes the attack as a per‑round constrained optimization problem, derives a greedy label‑selection rule for logistic regression, and shows that this rule is provably optimal under mean aggregation. Experiments demonstrate that optimized label flipping can significantly degrade model accuracy, outperforming random flips, and that the attack transfers to other robust aggregators such as coordinate‑wise median and trimmed mean.

By Abdessamad El-Kabid, El-Mahdi El-Mhamdi