Efficient Adversarial Training in LLMs with Continuous Attacks
<|reference_start|>Efficient Adversarial Training in LLMs with Continuous Attacks: Large language models (LLMs) are vulnerable to adversarial attacks that can bypass their safety guardrails. In many domains, adversarial training has proven to be one of the most promising methods to reliably improve robustness against such attacks. Yet, in the context of LLMs, current methods for adversarial training are hindered by the high computational costs required to perform discrete adversarial attacks at each training iteration. We address this problem by instead calculating adversarial attacks in the continuous embedding space of the LLM, which is orders of magnitudes more efficient. We propose a fast adversarial training algorithm (C-AdvUL) composed of two losses: the first makes the model robust on continuous embedding attacks computed on an adversarial behaviour dataset; the second ensures the usefulness of the final model by fine-tuning on utility data. Moreover, we introduce C-AdvIPO, an adversarial variant of IPO that does not require utility data for adversarially robust alignment. Our empirical evaluation on four models from different families (Gemma, Phi3, Mistral, Zephyr) and at different scales (2B, 3.8B, 7B) shows that both algorithms substantially enhance LLM robustness against discrete attacks (GCG, AutoDAN, PAIR), while maintaining utility. Our results demonstrate that robustness to continuous perturbations can extrapolate to discrete threat models. Thereby, we present a path toward scalable adversarial training algorithms for robustly aligning LLMs.<|reference_end|>
@article{xhonneux2024efficient,
    title={Efficient Adversarial Training in LLMs with Continuous Attacks},
    author={Sophie Xhonneux, Alessandro Sordoni, Stephan G"unnemann, Gauthier
  Gidel, Leo Schwinn},
    journal={arXiv preprint arXiv:2405.15589},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.15589},
    primaryClass={cs.LG cs.CR}
}