When pre-training hurts LoRA fine-tuning: a dynamical analysis via single-index models
Not on the map. Why?
Abstract (arXiv)
Pre-training on a source task is usually expected to facilitate fine-tuning on similar downstream problems. In this work, we mathematically show that this naive intuition is not always true: excessive pre-training can computationally slow down fine-tuning optimization. We study this phenomenon for low-rank adaptation (LoRA) fine-tuning on single-index models trained under one-pass SGD. Leveraging a summary statistics description of the fine-tuning dynamics, we precisely characterize how the convergence rate depends on the initial fine-tuning alignment and the degree of non-linearity of the target task. The key take away is that even when the pre-training and downstream tasks are well aligned, strong pre-training can induce a prolonged search phase and hinder convergence. Our theory thus provides a unified picture of how pre-training strength and task difficulty jointly shape the dynamics and limitations of LoRA fine-tuning in a nontrivial tractable model. On the practical side, we empirically show that our theoretical findings extend beyond our toy model and remain relevant in the context of a vision-transformer model trained on real data.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 41 of its 55 references that are in the map. First posted on arXiv 2 Feb 2026.
Builds on
41 of 55 references.
References · 41
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,085
- 2020Pre-trained Models for Natural Language Processing: A Surveycited by 505
- 2021Pre-Trained Models: Past, Present and Futurecited by 319
- 2014The Loss Surfaces of Multilayer Networkscited by 280
- 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 230
- 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
- 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 150
- 2020Online stochastic gradient descent on non-convex losses from high-dimensional inferencecited by 119
29 more
- 2017Optimal Errors and Phase Transitions in High-Dimensional Generalized Linear Modelscited by 116
- 2019Dynamics of stochastic gradient descent for two-layer neural networks in the teacher-student setupcited by 112
- 2018A high-bias, low-variance introduction to Machine Learning for physicistscited by 108
- 2023The Expressive Power of Low-Rank Adaptationcited by 102
- 2013Multi-digit Number Recognition from Street View Imagery using Deep Convolutional Neural Networkscited by 84
- 2023How Two-Layer Neural Networks Learn, One (Giant) Step at a Timecited by 68
- 2024A Survey on LoRA of Large Language Modelscited by 67
- 2023Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Modelscited by 61
- 2025Overtrained Language Models Are Harder to Fine-Tunecited by 58
- 2024The Impact of Initialization on LoRA Finetuning Dynamicscited by 54
- 2024The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponentscited by 52
- 2022Phase diagram of Stochastic Gradient Descent in high-dimensional two-layer neural networkscited by 50
- 2024LoRA Training in the NTK Regime has No Spurious Local Minimacited by 48
- 2024Computational-Statistical Gaps in Gaussian Single-Index Modelscited by 44
- 2023From high-dimensional & mean-field dynamics to dimensionless ODEs: A unifying approach to SGD in two-layers networkscited by 43
- 2024Asymptotics of feature learning in two-layer networks after one gradient-stepcited by 38
- 2025LoRA-One: One-Step Full Gradient Could Suffice for Fine-Tuning Large Language Models, Provably and Efficientlycited by 38
- 2024Repetita Iuvant: Data Repetition Allows SGD to Learn High-Dimensional Multi-Index Functionscited by 37
- 2024Low-Rank Adaptation for Foundation Models: A Comprehensive Reviewcited by 37
- 2021An Analytical Theory of Curriculum Learning in Teacher-Student Networkscited by 27
- 2022Gaussian Universality of Perceptrons with Random Labelscited by 26
- 2025LoRA Training Provably Converges to a Low-Rank Global Minimum or It Fails Loudly (But it Probably Won't Fail)cited by 20
- 2024Optimal Protocols for Continual Learning via Statistical Physics and Control Theorycited by 14
- 2024A theoretical perspective on mode collapse in variational inferencecited by 14
- 2025Understanding the Learning Dynamics of LoRA: A Gradient Flow Perspective on Low-Rank Adaptation in Matrix Factorizationcited by 13
- 2025Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapterscited by 11
- 2025On the Convergence Rate of LoRA Gradient Descentcited by 10
- 2025Does Low Rank Adaptation Lead to Lower Robustness against Training-Time Attacks?cited by 4
- 2025Generalization performance of narrow one-hidden layer networks in the teacher-student settingcited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.