SAFT:稀疏微调实现参数高效对抗训练
Sparse Fine-Tuning for Parameter-Efficient Adversarial Training
AI 导读
SAFT(Sparse Adversarial Fine-Tuning)方法通过对抗梯度显著性识别鲁棒性关键参数(RCPs),仅更新约 5% 的参数进行对抗训练。实验显示,SAFT 在干净样本与鲁棒准确率上均优于 LoRA 类方法,鲁棒性接近或超过全参数对抗训练,同时缓解了大模型的内存开销与干净-鲁棒精度权衡。该论文已被 NeurIPS 2026 接收。
正文 · 原文
Abstract:Deep neural networks achieve strong performance across many tasks but remain vulnerable to adversarial perturbations. Adversarial training (AT) is one of the most effective defenses, yet it suffers from high memory cost on large models and the persistent clean-robust accuracy trade-off. Recent work introduces parameter-efficient fine-tuning, such as LoRA, into AT, but this constraint induces a notable robustness gap relative to full-parameter AT. In this work, we revisit parameter-efficient adversarial fine-tuning from a parameter space perspective. Through gradient analysis, we find that adversarial optimization is highly concentrated on a small subset of parameters, which we call Robustness-Critical Parameters (RCPs), suggesting that robustness is encoded in a sparse subspace. Building on this observation, we propose Sparse Adversarial Fine-Tuning (SAFT), which identifies RCPs via adversarial gradient saliency and performs AT by updating only these parameters while freezing the rest. Across architectures and datasets, SAFT outperforms LoRA-based methods in both clean and robust accuracy with fewer trainable parameters, and approaches or surpasses full parameter AT in robustness while updating only about 5\% of parameters.
| Comments: | Accepted by NeurIPS 2026 |
| Subjects: | Machine Learning (cs.LG); Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2610.39455 [cs.LG] |
| (or arXiv:2610.39455v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2610.39455 arXiv-issued DOI via DataCite |
Submission history
From: Zhaoxin Wang Wang [view email]
[v1]
Thu, 29 Oct 2026 06:27:35 UTC (134 KB)
来源:arXiv cs.AI · arxiv.org