BiDoRA: Bi-level Optimization-Based Weight-Decomposed Low-Rank Adaptation
Not on the map. Why?
Abstract (arXiv)
Parameter-efficient fine-tuning (PEFT) is a flexible and efficient method for adapting large language models (LLMs) to downstream tasks. Among these methods, weight-decomposed low-rank adaptation (DoRA) is a promising approach that decomposes weight matrices into magnitude and direction components to mimic full fine-tuning (FT) better. However, DoRA's simultaneous optimization of these components makes it over-expressive, increases the risk of overfitting, and creates a coupled updating pattern that limits its learning capacity. To address these issues, we propose Bi-level Optimization-Based Weight-Decomposed Low-Rank Adaptation (BiDoRA), a novel PEFT method based on a bi-level optimization framework. BiDoRA fundamentally differs from DoRA by optimizing the magnitude and direction in two separate, asynchronous loops using distinct training and validation data splits. This decoupled optimization process effectively mitigates overfitting and allows for more flexible updates that align even more closely with FT. For instance, weight decomposition analysis shows BiDoRA achieves a magnitude-direction update correlation of -8.042, significantly closer to the FT ideal compared to -1.784 for DoRA. Evaluation of BiDoRA on diverse tasks spanning natural language understanding, generation, token classification, and extremely small biomedical datasets reveals that it consistently outperforms DoRA and a wide range of leading PEFT methods. This improvement is statistically significant, as demonstrated on the GLUE benchmark where BiDoRA surpasses DoRA with a p-value of 2.4×10-4 in terms of the Wilcoxon signed-rank test. The code for BiDoRA is available at https://github.com/t2ance/BiDoRA.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 47 of its 72 references that are in the map. First posted on arXiv 13 Oct 2024.
Builds on
47 of 72 references.
References · 47
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
- 2014CIDEr: Consensus-based Image Description Evaluationcited by 2,027
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,538
- 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 998
- 2018Neural Network Acceptability Judgmentscited by 952
35 more
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
- 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
- 2019Meta-Learning with Implicit Gradientscited by 523
- 2020Pre-trained Models for Natural Language Processing: A Surveycited by 504
- 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 458
- 2019Optimizing Millions of Hyperparameters by Implicit Differentiationcited by 303
- 2023Side Adapter Network for Open-Vocabulary Semantic Segmentationcited by 296
- 2023VeRA: Vector-based Random Matrix Adaptationcited by 294
- 2017The E2E Dataset: New Challenges For End-to-End Generationcited by 252
- 2017Forward and Reverse Gradient-Based Hyperparameter Optimizationcited by 232
- 2016Hyperparameter optimization with approximate gradientcited by 231
- 2020AdapterDrop: On the Efficiency of Adapters in Transformerscited by 223
- 2019Towards moderate overparameterization: global convergence guarantees for training shallow neural networkscited by 176
- 2020Exploring Versatile Generative Language Model Via Parameter-Efficient Transfer Learningcited by 139
- 2017Bilateral Multi-Perspective Matching for Natural Language Sentencescited by 120
- 2019Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networkscited by 120
- 2024Parameter-Efficient Fine-Tuning with Discrete Fourier Transformcited by 67
- 2023Residual Prompt Tuning: Improving Prompt Tuning with Residual Reparameterizationcited by 64
- 2017All You Need is Beyond a Good Init: Exploring Better Solution for Training Extremely Deep Convolutional Neural Networks with Orthonormality and Modulationcited by 58
- 2021iDARTS: Differentiable Architecture Search with Stochastic Implicit Gradientscited by 51
- 2021Stability and Generalization of Bilevel Programming in Hyperparameter Optimizationcited by 31
- 2020How Important is the Train-Validation Split in Meta-Learning?cited by 30
- 2024AutoLoRA: Automatically Tuning Matrix Ranks in Low-Rank Adaptation Based on Meta Learningcited by 30
- 2022Betty: An Automatic Differentiation Library for Multilevel Optimizationcited by 27
- 2024Learning Spectral-Decomposed Tokens for Domain Generalized Semantic Segmentationcited by 21
- 2023Making Scalable Meta Learning Practicalcited by 17
- 2024LaMDA: Large Model Fine-Tuning via Spectrally Decomposed Low-Dimensional Adaptationcited by 16
- 2021Generalization Guarantees for Neural Architecture Search with Train-Validation Splitcited by 14
- 2024AFLoRA: Adaptive Freezing of Low Rank Adaptation in Parameter Efficient Fine-Tuning of Large Modelscited by 14
- 2022Understanding Benign Overfitting in Gradient-Based Meta Learningcited by 11
- 2022Provable Generalization of Overparameterized Meta-learning Trained with SGDcited by 9
- 2024MaCP: Minimal yet Mighty Adaptation via Hierarchical Cosine Projectioncited by 6
- 2016Topic Model Based Multi-Label Classification from the Crowdcited by 4
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2026Learning Rate Matters: Vanilla LoRA May Suffice for LLM Fine-tuningcited by 9
- 2025A First-order Generative Bilevel Optimization Framework for Diffusion Modelscited by 4
- 2025EDoRA: Efficient Weight-Decomposed Low-Rank Adaptation via Singular Value Decompositioncited by 3
- 2025MAP: Revisiting Weight Decomposition for Low-Rank Adaptationcited by 1
- 2026Learning Rate Matters: Vanilla LoRA May Suffice for LLM Fine-tuning4 Feb 2026
- 2025MAP: Revisiting Weight Decomposition for Low-Rank Adaptation29 May 2025
- 2025A First-order Generative Bilevel Optimization Framework for Diffusion Models12 Feb 2025
- 2025EDoRA: Efficient Weight-Decomposed Low-Rank Adaptation via Singular Value Decomposition21 Jan 2025