Low Rank Adaptation for Adversarial Perturbation
Han Liu, Shanghao Shi, Yevgeniy Vorobeychik, Chongjie Zhang, Ning Zhang

TL;DR
This paper reveals that adversarial perturbations in machine learning models have a low-rank structure and leverages this property to enhance black-box attack efficiency and effectiveness.
Contribution
The paper provides theoretical and empirical evidence of low-rank structure in adversarial perturbations and introduces a low-rank based method to improve black-box attack performance.
Findings
Adversarial perturbations exhibit an inherent low-rank structure.
Using low-rank projections improves attack efficiency and success rates.
The method outperforms conventional black-box attack techniques across various models and datasets.
Abstract
Low-Rank Adaptation (LoRA), which leverages the insight that model updates typically reside in a low-dimensional space, has significantly improved the training efficiency of Large Language Models (LLMs) by updating neural network layers using low-rank matrices. Since the generation of adversarial examples is an optimization process analogous to model training, this naturally raises the question: Do adversarial perturbations exhibit a similar low-rank structure? In this paper, we provide both theoretical analysis and extensive empirical investigation across various attack methods, model architectures, and datasets to show that adversarial perturbations indeed possess an inherently low-rank structure. This insight opens up new opportunities for improving both adversarial attacks and defenses. We mainly focus on leveraging this low-rank property to improve the efficiency and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
