mlsanityData to 14 Oct 2026

BoostLoRA: Growing Effective Rank by Boosting Adapters

arXiv 2604.27308 ↗First posted 30 Apr 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Parameter-efficient fine-tuning (PEFT) methods face a tradeoff between adapter size and expressivity: ultra-low-parameter adapters are confined to fixed low-rank subspaces, capping performance even with extended training. We propose BoostLoRA, a gradient-boosting framework that overcomes this limit by iteratively training and merging minimal adapters on the examples the current model gets wrong. A ROTATE SVD basis strategy assigns each round to an orthogonal subspace, so cumulative effective rank grows linearly with the number of rounds while each adapter remains ultra-low-rank. After merging, adapters are discarded, leaving zero inference overhead. On Qwen2.5-3B, BoostLoRA reaches 89.1% on GSM8K and 68.8% on MATH-500, surpassing both the best single-shot ultra-low parameter adapter (TinyLoRA) and full fine-tuning; on code generation it reaches 57.2% on MBPP and 80.4% on HumanEval while full fine-tuning drops below the zero-shot baseline. We also demonstrate cross-architecture transfer on protein binding classification with ESM2-650M and cross-entropy training. BoostLoRA is, to our knowledge, the first PEFT method whose effective rank grows with training, separating per-round parameter cost from total representational capacity.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 38 references that are in the map. First posted on arXiv 30 Apr 2026.

Builds on

23 of 38 references.

References · 23

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  3. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  4. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  5. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  6. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  7. 2023Let's Verify Step by Stepcited by 3,789
  8. 2021Program Synthesis with Large Language Modelscited by 3,637
  9. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  10. 2025SimpleRL-Zoo: Investigating and Taming Zero Reinforcement Learning for Open Base Models in the Wildcited by 511
  11. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
  12. 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 269
11 more
  1. 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 204
  2. 2024Chain of LoRA: Efficient Fine-tuning of Language Models via Residual Learningcited by 82
  3. 2024StepCoder: Improve Code Generation with Reinforcement Learning from Compiler Feedbackcited by 77
  4. 2024LoRA-XS: Low-Rank Adaptation with Extremely Small Number of Parameterscited by 76
  5. 2024LoRA Soups: Merging LoRAs for Practical Skill Composition Taskscited by 52
  6. 2017Learning Deep ResNet Blocks Sequentially using Boosting Theorycited by 32
  7. 2025Multi-Turn Code Generation Through Single-Step Rewardscited by 28
  8. 2024MELoRA: Mini-Ensemble Low-Rank Adapters for Parameter-Efficient Fine-Tuningcited by 19
  9. 2026Learning to Reason in 13 Parameterscited by 14
  10. 2025Evaluating Parameter Efficient Methods for RLVRcited by 12
  11. 2025Beyond Simple Concatenation: Fairly Assessing PLM Architectures for Multi-Chain Protein-Protein Interactions Predictioncited by 2

Built on by

Not cited yet.