mlsanityData to 7 Oct 2026

Increasing Model Capacity for Free: A Simple Strategy for Parameter Efficient Fine-tuning

arXiv 2407.01320 ↗First posted 1 Jul 2024cs.LG cs.AI cs.CLcited by 6

Not on the map. Why?

Abstract (arXiv)

Fine-tuning large pre-trained foundation models, such as the 175B GPT-3, has attracted more attention for downstream tasks recently. While parameter-efficient fine-tuning methods have been proposed and proven effective without retraining all model parameters, their performance is limited by the capacity of incremental modules, especially under constrained parameter budgets. To overcome this challenge, we propose CapaBoost, a simple yet effective strategy that enhances model capacity by leveraging low-rank updates through parallel weight modules in target layers. By applying static random masks to the shared weight matrix, CapaBoost constructs a diverse set of weight matrices, effectively increasing the rank of incremental weights without adding parameters. Notably, our approach can be seamlessly integrated into various existing parameter-efficient fine-tuning methods. We extensively validate the efficacy of CapaBoost through experiments on diverse downstream tasks, including natural language understanding, question answering, and image classification. Our results demonstrate significant improvements over baselines, without incurring additional computation or storage costs. Our code is available at urlhttps://github.com/LINs-lab/CapaBoost.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 59 of its 76 references that are in the map. First posted on arXiv 1 Jul 2024.

Builds on

59 of 76 references.

References · 59

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  5. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  6. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  7. 2016Layer Normalizationcited by 5,579
  8. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  9. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
  10. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  11. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  12. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
38 more
  1. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  2. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  4. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
  5. 2022Visual Prompt Tuningcited by 1,674
  6. 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,538
  7. 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
  8. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
  9. 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,219
  10. 2019How Can We Know What Language Models Know?cited by 953
  11. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
  12. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
  13. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 658
  14. 2018Universal Transformerscited by 613
  15. 2015Variational Dropout and the Local Reparameterization Trickcited by 489
  16. 2020AdapterHub: A Framework for Adapting Transformerscited by 441
  17. 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 422
  18. 2019A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmarkcited by 419
  19. 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
  20. 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 283
  21. 2023LongLoRA: Efficient Fine-tuning of Long-Context Large Language Modelscited by 243
  22. 2021Training Neural Networks with Fixed Sparse Maskscited by 212
  23. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
  24. 2021Training Graph Neural Networks with 1000 Layerscited by 169
  25. 2021Composable Sparse Fine-Tuning for Cross-Lingual Transfercited by 144
  26. 2022Neural Prompt Searchcited by 133
  27. 2020Dynamic Model Pruning with Feedbackcited by 125
  28. 2020Masking as an Efficient Alternative to Finetuning for Pretrained Language Modelscited by 92
  29. 2020Low-Rank Bottleneck in Multi-head Attention Modelscited by 88
  30. 2021Lessons on Parameter Sharing across Layers in Transformerscited by 85
  31. 2023One-for-All: Generalized LoRA for Parameter-Efficient Fine-tuningcited by 84
  32. 2022SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapterscited by 83
  33. 2021Cross-Attention is All You Need: Adapting Pretrained Transformers for Machine Translationcited by 74
  34. 2020Can weight sharing outperform random architecture search? An investigation with TuNAScited by 68
  35. 2019Generalization Guarantees for Neural Networks via Harnessing the Low-rank Structure of the Jacobiancited by 67
  36. 2020Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpotcited by 66
  37. 2021Initialization and Regularization of Factorized Neural Layerscited by 58
  38. 2020Weight-Sharing Neural Architecture Search: A Battle to Shrink the Optimization Gapcited by 50

50 most cited of 59 All 59 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 3.

6 papers.