FineGates: LLMs Finetuning with Compression using Stochastic Gates
Not on the map. Why?
Abstract (arXiv)
Large Language Models (LLMs), with billions of parameters, present significant challenges for full finetuning due to the high computational demands, memory requirements, and impracticality of many real-world applications. When faced with limited computational resources or small datasets, updating all model parameters can often result in overfitting. To address this, lightweight finetuning techniques have been proposed, like learning low-rank adapter layers. These methods aim to train only a few additional parameters combined with the base model, which remains frozen, reducing resource usage and mitigating overfitting risks. In this work, we propose an adaptor model based on stochastic gates that simultaneously sparsify the frozen base model with task-specific adaptation. Our method comes with a small number of trainable parameters and allows us to speed up the base model inference with competitive accuracy. We evaluate it in additional variants by equipping it with additional low-rank parameters and comparing it to several recent baselines. Our results show that the proposed method improves the finetuned model accuracy comparatively to the several baselines and allows the removal of up to 20-40% without significant accuracy loss.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 30 of its 37 references that are in the map. First posted on arXiv 17 Dec 2024.
Builds on
30 of 37 references.
References · 30
- 2017Attention Is All You Needcited by 59,932
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,718
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
18 more
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
- 2023VeRA: Vector-based Random Matrix Adaptationcited by 294
- 2022Structured Pruning Learns Compact and Accurate Modelscited by 167
- 2023QA-LoRA: Quantization-Aware Low-Rank Adaptation of Large Language Modelscited by 154
- 2023LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuningcited by 132
- 2018Implicit Reparameterization Gradientscited by 84
- 2023One-for-All: Generalized LoRA for Parameter-Efficient Fine-tuningcited by 84
- 2022SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapterscited by 83
- 2024Low-Rank Quantization-Aware Training for LLMscited by 42
- 2024APT: Adaptive Pruning and Tuning Pretrained Language Models for Efficient Training and Inferencecited by 29
- 2022Parameter-Efficient Sparsity for Large Language Models Fine-Tuningcited by 27
- 2024Knowledge Editing in Language Models via Adapted Direct Preference Optimizationcited by 17
- 2024AdaRankGrad: Adaptive Gradient-Rank and Moments for Memory-Efficient LLMs Training and Fine-Tuningcited by 16
- 2024NoRA: Nested Low-Rank Adaptation for Efficient Fine-Tuning Large Modelscited by 13
- 2021Support Recovery with Stochastic Gates: Theory and Application for Linear Modelscited by 8
- 2023Multi-modal Differentiable Unsupervised Feature Selectioncited by 5
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.