mlsanityData to 7 Oct 2026

Quantized Side Tuning: Fast and Memory-Efficient Tuning of Quantized Large Language Models

arXiv 2401.07159 ↗First posted 13 Jan 2024cs.LG cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

Finetuning large language models (LLMs) has been empirically effective on a variety of downstream tasks. Existing approaches to finetuning an LLM either focus on parameter-efficient finetuning, which only updates a small number of trainable parameters, or attempt to reduce the memory footprint during the training phase of the finetuning. Typically, the memory footprint during finetuning stems from three contributors: model weights, optimizer states, and intermediate activations. However, existing works still require considerable memory and none can simultaneously mitigate memory footprint for all three sources. In this paper, we present Quantized Side Tuing (QST), which enables memory-efficient and fast finetuning of LLMs by operating through a dual-stage process. First, QST quantizes an LLM's model weights into 4-bit to reduce the memory footprint of the LLM's original weights; QST also introduces a side network separated from the LLM, which utilizes the hidden states of the LLM to make task-specific predictions. Using a separate side network avoids performing backpropagation through the LLM, thus reducing the memory requirement of the intermediate activations. Furthermore, QST leverages several low-rank adaptors and gradient-free downsample modules to significantly reduce the trainable parameters, so as to save the memory footprint of the optimizer states. Experiments show that QST can reduce the total memory footprint by up to 2.3 × and speed up the finetuning process by up to 3 × while achieving competent performance compared with the state-of-the-art. When it comes to full finetuning, QST can reduce the total memory footprint up to 7 ×.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 43 of its 72 references that are in the map. First posted on arXiv 13 Jan 2024.

Builds on

43 of 72 references.

References · 43

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  5. 2022Training language models to follow instructions with human feedbackcited by 15,712
  6. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  7. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  8. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  9. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  10. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  11. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  12. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
31 more
  1. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  2. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  3. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  4. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  5. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  6. 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedbackcited by 3,634
  7. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  8. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  9. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  10. 2020Learning to summarize from human feedbackcited by 2,562
  11. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  12. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
  13. 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,968
  14. 2020Reformer: The Efficient Transformercited by 1,658
  15. 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
  16. 2016Progressive Neural Networkscited by 1,332
  17. 2021A General Language Assistant as a Laboratory for Alignmentcited by 1,023
  18. 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 998
  19. 2018Neural Network Acceptability Judgmentscited by 952
  20. 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 934
  21. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 886
  22. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
  23. 2022Super-NaturalInstructions: Generalization via Declarative Instructions on 1600+ NLP Taskscited by 858
  24. 2016Training Deep Nets with Sublinear Memory Costcited by 825
  25. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
  26. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  27. 2021MetaICL: Learning to Learn In Contextcited by 450
  28. 2022LST: Ladder Side-Tuning for Parameter and Memory Efficient Transfer Learningcited by 228
  29. 2017The Reversible Residual Network: Backpropagation Without Storing Activationscited by 215
  30. 2021UniPELT: A Unified Framework for Parameter-Efficient Language Model Tuningcited by 162
  31. 2023AutoPEFT: Automatic Configuration Search for Parameter-Efficient Fine-Tuningcited by 49

Built on by

Cited by year (2026 to 7 Oct)

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

9 papers.