Why LoRA Resists Label Noise: A Theoretical Framework for Noise-Robust Parameter-Efficient Fine-Tuning
Not on the map. Why?
Abstract (arXiv)
Parameter-efficient fine-tuning methods like Low-Rank Adaptation (LoRA) have become the dominant paradigm for adapting large pretrained models. We present a theoretical framework explaining an underexplored property: LoRA's inherent resistance to label noise. Our analysis reveals three key insights. First, we prove that rank-r LoRA cannot memorize all possible label assignments once the sample size exceeds O(r(d+k-r)), limiting its capacity to fit arbitrary noise. Second, we derive an optimal rank balancing approximation bias and noise-induced variance, showing it decreases with noise rate. Third, we establish temporal separation: clean patterns are learned early while noise memorization occurs later. We propose RACT (Rank-Aware Curriculum Training), leveraging rank discrepancy for noise detection. Experiments validate our predictions, with RACT achieving 91.1% F1 for noise detection on AG News while maintaining 91.46% accuracy, competitive with baselines that lack noise detection capability.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 36 of its 57 references that are in the map. First posted on arXiv 22 Jan 2026.
Builds on
36 of 57 references.
References · 36
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2023GPT-4 Technical Reportcited by 18,132
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
24 more
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2018On the Spectral Bias of Neural Networkscited by 1,321
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
- 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 691
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 670
- 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
- 2017Exploring Generalization in Deep Learningcited by 595
- 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 580
- 2019Benign Overfitting in Linear Regressioncited by 544
- 2019Does Learning Require Memorization? A Short Tale about a Long Tailcited by 452
- 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 414
- 2019Confident Learning: Estimating Uncertainty in Dataset Labelscited by 411
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
- 2021Pervasive Label Errors in Test Sets Destabilize Machine Learning Benchmarkscited by 388
- 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 365
- 2019Unsupervised Label Noise Modeling and Loss Correctioncited by 327
- 2017Implicit Regularization in Matrix Factorizationcited by 318
- 2024LoRA Learns Less and Forgets Lesscited by 313
- 2021The Low-Rank Simplicity Bias in Deep Networkscited by 150
- 2023The Expressive Power of Low-Rank Adaptationcited by 100
- 2021On the geometry of generalization and memorization in deep neural networkscited by 71
- 2024LoRA Training in the NTK Regime has No Spurious Local Minimacited by 48
Built on by
Citing papers per year: 2026: 2.
2 papers.