LoRA's Second Descent Extends Beyond Parameter Parity
Not on the map. Why?
Abstract (arXiv)
Double descent has sparked considerable interest, with recent work relating it to the data, the model and the learning configuration. Practical fine-tuning commonly involves training a small adapter on top of frozen pretrained weights, as in low-rank adaptation (LoRA). The adapter's rank is the hyperparameter that sets its capacity, yet how this rank relates to double descent has not been well explored. We quantify this relation under label noise on four vision backbones and a 7B language model with a module-matched rank sweep (MMRS), which extends past full rank and compares every rank with dense fine-tuning of the same modules, paired by seed. On DeiT-Tiny, risk is lowest at rank one and rises sharply as the adapter becomes able to fit the noisy labels, forming an interpolation cliff. Past the peak, risk falls again, but every tested post-peak rank that still saves parameters remains above dense risk. Rank-one LoRA outperforms dense fine-tuning on three of the four vision backbones, consistent with strong regularization at small rank. LoRA thus exhibits a second descent, but matches dense risk only after losing its parameter advantage, first on DeiT-Tiny at four times dense's projection weights. Code is available at https://anonymous.4open.science/r/lora-second-descent-C7B5.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 57 of its 68 references that are in the map. First posted on arXiv 3 Oct 2026.
Builds on
57 of 68 references.
References · 57
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
- 2017Selective Classification for Deep Neural Networkscited by 852
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
38 more
- 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 671
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
- 2021How to train your ViT? Data, Augmentation, and Regularization in Vision Transformerscited by 569
- 2019Benign Overfitting in Linear Regressioncited by 549
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
- 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 497
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
- 2024LoRA Learns Less and Forgets Lesscited by 328
- 2021Learning with Noisy Labels Revisited: A Study Using Real-World Human Annotationscited by 256
- 2023A Rank Stabilization Scaling Factor for Fine-Tuning with LoRAcited by 243
- 2017High-dimensional dynamics of generalization error in neural networkscited by 241
- 2019Two models of double descent for weak featurescited by 195
- 2021Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationcited by 132
- 2018Bias-Reduced Uncertainty Estimation for Deep Neural Classifierscited by 113
- 2020Optimal Regularization Can Mitigate Double Descentcited by 109
- 2024LoRA vs Full Fine-tuning: An Illusion of Equivalencecited by 109
- 2023The Expressive Power of Low-Rank Adaptationcited by 102
- 2024Asymmetry in Low-Rank Adapters of Foundation Modelscited by 86
- 2024LoRA-Pro: Are Low-Rank Adapters Properly Optimized?cited by 77
- 2018A jamming transition from under- to over-parametrization affects loss landscape and generalizationcited by 67
- 2020Triple descent and the two kinds of overfitting: Where & why do they appear?cited by 65
- 2024Riemannian Preconditioned LoRA for Fine-Tuning Foundation Modelscited by 52
- 2023Unifying Grokking and Double Descentcited by 50
- 2023Double Descent Demystified: Identifying, Interpreting & Ablating the Sources of a Deep Learning Puzzlecited by 37
- 2025RandLoRA: Full-rank parameter-efficient fine-tuning of large modelscited by 35
- 2023A U-turn on Double Descent: Rethinking Parameter Counting in Statistical Learningcited by 33
- 2025PoLAR: Polar-Decomposed Low-Rank Adapter Representationcited by 20
- 2020Double Double Descent: On Generalization Errors in Transfer Learning between Linear Regression Taskscited by 16
- 2022On double-descent in uncertainty quantification in overparametrized modelscited by 16
- 2025LoRA-MGPO: Mitigating Double Descent in Low-Rank Adaptation via Momentum-Guided Perturbation Optimizationcited by 10
- 2025GraLoRA: Granular Low-Rank Adaptation for Parameter-Efficient Fine-Tuningcited by 10
- 2026Learning Rate Scaling across LoRA Ranks and Transfer to Full Finetuningcited by 9
- 2025Mitigating Unintended Memorization with LoRA in Federated Learning for LLMscited by 7
- 2024CleaR: Towards Robust and Generalized Parameter-Efficient Fine-Tuning for Noisy Label Learningcited by 6
- 2025How Much is Too Much? Exploring LoRA Rank Trade-offs for Retaining Knowledge and Domain Robustnesscited by 5
- 2022Investigating the Impact of Model Width and Density on Generalization in Presence of Label Noisecited by 3
- 2026Why LoRA Resists Label Noise: A Theoretical Framework for Noise-Robust Parameter-Efficient Fine-Tuningcited by 3
50 most cited of 57 All 57 (JSON)
Built on by
Not cited yet.