mlsanityData to 14 Oct 2026

SwitchLoRA: Switched Low-Rank Adaptation Can Learn Full-Rank Information

arXiv 2406.06564 ↗First posted 3 Jun 2024cs.LG cs.AI cs.CLcited by 2

Not on the map. Why?

Abstract (arXiv)

In the training of large language models, parameter-efficient techniques such as LoRA optimize memory usage and reduce communication overhead and memory usage during the fine-tuning phase. However, applying such techniques directly during the pre-training phase results in poor performance, primarily because the premature implementation of low-rank training significantly reduces model accuracy. Existing methods like ReLoRA and GaLore have attempted to address this challenge by updating the low-rank subspace. However, they still fall short of achieving the accuracy of full-rank training. Specifically, ReLoRA restricts the frequency of updates to preserve optimizer states consistency, hindering its ability to closely approximate full-rank training behavior. Meanwhile, GaLore relies on Singular Value Decomposition (SVD) to approximate the full-rank space, which introduces accuracy loss during the approximation process. In this paper, we introduce SwitchLoRA, a parameter-efficient training technique that frequently and smoothly replaces the trainable parameters of LoRA adapters with alternative parameters. SwitchLoRA updates the low-rank subspace incrementally, targeting only a few dimensions at a time to minimize the impact on optimizer states. This allows a higher update frequency, thereby enhancing accuracy by enabling the updated parameters to more closely mimic full-rank behavior during the pre-training phase. Our results demonstrate that SwitchLoRA actually surpasses full-rank training, reducing perplexity from 15.23 to 15.01 on the LLaMA 1.3B model, while also cutting communication overhead by 54% and memory usage by 13%. Furthermore, after full fine-tuning the SwitchLoRA pre-trained model and the full-rank pre-trained model on the GLUE benchmark, the SwitchLoRA pre-trained model showed an average accuracy gain of about 1% over the full-rank pre-trained model.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 39 of its 59 references that are in the map. First posted on arXiv 3 Jun 2024.

Builds on

39 of 59 references.

References · 39

  1. 2017Attention Is All You Needcited by 60,361
  2. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  3. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  4. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  5. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  6. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
  7. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  8. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  9. 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,868
  10. 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,301
  11. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  12. 2021Efficient Large-Scale Language Model Training on GPU Clusters Using Megatron-LMcited by 632
27 more
  1. 2020What is the State of Neural Network Pruning?cited by 583
  2. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
  3. 2021Documenting Large Webtext Corpora: A Case Study on the Colossal Clean Crawled Corpuscited by 492
  4. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
  5. 20218-bit Optimizers via Block-wise Quantizationcited by 403
  6. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 377
  7. 2017Implicit Regularization in Matrix Factorizationcited by 322
  8. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 306
  9. 2023VeRA: Vector-based Random Matrix Adaptationcited by 300
  10. 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 269
  11. 2023A Rank Stabilization Scaling Factor for Fine-Tuning with LoRAcited by 243
  12. 2022DyLoRA: Parameter Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptationcited by 233
  13. 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 204
  14. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  15. 2020Towards Resolving the Implicit Bias of Gradient Descent for Matrix Factorization: Greedy Low-Rank Learningcited by 150
  16. 2023LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuningcited by 137
  17. 2015Convolutional neural networks with low-rank regularizationcited by 103
  18. 2022SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapterscited by 83
  19. 2024Chain of LoRA: Efficient Fine-tuning of Language Models via Residual Learningcited by 82
  20. 2023Delta-LoRA: Fine-Tuning High-Rank Parameters with the Delta of Low-Rank Matricescited by 74
  21. 2020Train Large, Then Compress: Rethinking Model Size for Efficient Training and Inference of Transformerscited by 67
  22. 2021Pufferfish: Communication-efficient Models At No Extra Costcited by 61
  23. 2019PruneTrain: Fast Neural Network Training by Dynamic Sparse Model Reconfigurationcited by 41
  24. 2024LoRA-drop: Efficient LoRA Parameter Pruning based on Output Evaluationcited by 38
  25. 2023Cuttlefish: Low-Rank Model Training without All the Tuningcited by 25
  26. 2023Maestro: Uncovering Low-Rank Structures via Trainable Decompositioncited by 8
  27. 2024Sparse Spectral Training and Inference on Euclidean and Hyperbolic Neural Networkscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.