mlsanityData to 7 Oct 2026

Come Together, But Not Right Now: A Progressive Strategy to Boost Low-Rank Adaptation

arXiv 2506.05713 ↗First posted 6 Jun 2025cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Low-rank adaptation (LoRA) has emerged as a leading parameter-efficient fine-tuning technique for adapting large foundation models, yet it often locks adapters into suboptimal minima near their initialization. This hampers model generalization and limits downstream operators such as adapter merging and pruning. Here, we propose CoTo, a progressive training strategy that gradually increases adapters' activation probability over the course of fine-tuning. By stochastically deactivating adapters, CoTo encourages more balanced optimization and broader exploration of the loss landscape. We provide a theoretical analysis showing that CoTo promotes layer-wise dropout stability and linear mode connectivity, and we adopt a cooperative-game approach to quantify each adapter's marginal contribution. Extensive experiments demonstrate that CoTo consistently boosts single-task performance, enhances multi-task merging accuracy, improves pruning robustness, and reduces training overhead, all while remaining compatible with diverse LoRA variants. Code is available at https://github.com/zwebzone/coto.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 56 of its 81 references that are in the map. First posted on arXiv 6 Jun 2025.

Builds on

56 of 81 references.

References · 56

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
  3. 2024The Llama 3 Herd of Modelscited by 14,192
  4. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  5. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  6. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  7. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  8. 2023SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesiscited by 4,290
  9. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  10. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  11. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  12. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
38 more
  1. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  2. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
  3. 2022DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generationcited by 3,286
  4. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  5. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  6. 2021Learning to Prompt for Vision-Language Modelscited by 2,269
  7. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  8. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  9. 2013Describing Textures in the Wildcited by 2,110
  10. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  11. 2015A large annotated corpus for learning natural language inferencecited by 1,837
  12. 2013Fine-Grained Visual Classification of Aircraftcited by 1,701
  13. 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,488
  14. 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,219
  15. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  16. 2016Deep Networks with Stochastic Depthcited by 973
  17. 2023The Flan Collection: Designing Data and Methods for Effective Instruction Tuningcited by 734
  18. 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 724
  19. 2018On Lazy Training in Differentiable Programmingcited by 671
  20. 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
  21. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  22. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
  23. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 365
  24. 2023LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Compositioncited by 359
  25. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 317
  26. 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 286
  27. 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
  28. 2023A Rank Stabilization Scaling Factor for Fine-Tuning with LoRAcited by 231
  29. 2023ZipLoRA: Any Subject in Any Style by Effectively Merging LoRAscited by 194
  30. 2023Towards Building the Federated GPT: Federated Instruction Tuningcited by 184
  31. 2024FLoRA: Federated Fine-Tuning Large Language Models with Heterogeneous Low-Rank Adaptationscited by 144
  32. 2024LoRA-GA: Low-Rank Adaptation with Gradient Approximationcited by 134
  33. 2023LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuningcited by 132
  34. 2024Low-Rank Few-Shot Adaptation of Vision-Language Modelscited by 103
  35. 2024Higher Layers Need More LoRA Expertscited by 101
  36. 2024LoRA-Pro: Are Low-Rank Adapters Properly Optimized?cited by 70
  37. 2024LoraRetriever: Input-Aware LoRA Retrieval and Composition for Mixed Tasks in the Wildcited by 68
  38. 2024Parameter-Efficient Fine-Tuning with Discrete Fourier Transformcited by 67

50 most cited of 56 All 56 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 5.

5 papers.