Sketch to Adapt: Fine-Tunable Sketches for Efficient LLM Adaptation
Not on the map. Why?
Abstract (arXiv)
Adapting pre-trained large language models (LLMs) is crucial but challenging due to their enormous size. Parameter-efficient fine-tuning (PEFT) techniques typically employ additive adapters applied to frozen model weights. To further reduce memory usage, model weights are often compressed through quantization. However, existing PEFT methods often yield suboptimal model quality because they rely on restrictive assumptions, such as low-rank constraints on adapters to limit the number of trainable parameters. We find that sketching, a popular data compression technique, can serve as an efficient LLM adaptation strategy while avoiding the low-rank assumption. We introduce SketchTune, a compressive adaptation strategy that compresses LLM weights into compact fine-tunable sketches, integrating compression and adaptation into a unified framework. This integration eliminates the need for complex two-path computation in existing PEFT techniques, enabling faster and more memory-efficient training and inference. SketchTune is supported by mathematical insights into matrix classes that are better approximated using sketching rather than low-rank methods. Our extensive evaluations with Llama and Mistral models demonstrate that SketchTune outperforms leading PEFT methods across diverse tasks while using substantially smaller base models and comparable trainable parameters. As a highlight, SketchTune outperforms LoRA, DoRA, and S2FT on commonsense and math benchmarks using 2.6-3.5× smaller base models and exceeds LoftQ in accuracy by 14.48% on GSM8K with 7.3× fewer trainable parameters. Our code is available at https://github.com/LeanModels/SketchTune.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 52 of its 76 references that are in the map. First posted on arXiv 8 Oct 2024.
Builds on
52 of 76 references.
References · 52
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2022Large Language Models are Zero-Shot Reasonerscited by 4,323
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
38 more
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 861
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
- 2023The Flan Collection: Designing Data and Methods for Effective Instruction Tuningcited by 734
- 2023Instruction Tuning with GPT-4cited by 676
- 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 642
- 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 641
- 2020Up or Down? Adaptive Rounding for Post-Training Quantizationcited by 600
- 2021Documenting Large Webtext Corpora: A Case Study on the Colossal Clean Crawled Corpuscited by 481
- 2021Recent Advances in Natural Language Processing via Large Pre-Trained Language Models: A Surveycited by 457
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
- 20218-bit Optimizers via Block-wise Quantizationcited by 395
- 2016Solving General Arithmetic Word Problemscited by 353
- 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
- 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 317
- 2023VeRA: Vector-based Random Matrix Adaptationcited by 294
- 2023OpenChat: Advancing Open-source Language Models with Mixed-Quality Datacited by 250
- 2021Training Neural Networks with Fixed Sparse Maskscited by 212
- 2023Controlling Text-to-Image Diffusion by Orthogonal Finetuningcited by 207
- 2023LoftQ: LoRA-Fine-Tuning-Aware Quantization for Large Language Modelscited by 195
- 2015Compressing Neural Networks with the Hashing Trickcited by 150
- 2023Parameter-Efficient Orthogonal Finetuning via Butterfly Factorizationcited by 112
- 2024LISA: Layerwise Importance Sampling for Memory-Efficient Large Language Model Fine-Tuningcited by 88
- 2024KV Cache is 1 Bit Per Channel: Efficient Large Language Model Inference with Coupled Quantizationcited by 74
- 2023Memory Efficient Optimizers with 4-bit Statescited by 54
- 2024Accurate LoRA-Finetuning Quantization of LLMs via Information Retentioncited by 40
- 2024BitDelta: Your Fine-Tune May Only Be Worth One Bitcited by 38
- 2024Scaling Sparse Fine-Tuning to Large Language Modelscited by 25
- 2014A Statistical Perspective on Randomized Sketching for Ordinary Least-Squarescited by 21
- 2024LeanQuant: Accurate and Scalable Large Language Model Quantization with Loss-error-aware Gridcited by 20
- 2024NoMAD-Attention: Efficient LLM Inference on CPUs Through Multiply-add-free Attentioncited by 12
- 2019Structured Multi-Hashing for Model Compressioncited by 10
- 2024Sparse Matrix in Large Language Model Fine-tuningcited by 8
- 2023ModuLoRA: Finetuning 2-Bit LLMs on Consumer GPUs by Integrating with Modular Quantizerscited by 6
- 2019Higher-order Count Sketch: Dimensionality Reduction That Retains Efficient Tensor Operationscited by 5
- 2023In defense of parameter sharing for model-compressioncited by 5
50 most cited of 52 All 52 (JSON)
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 202570% Size, 100% Accuracy: Lossless LLM Compression for Efficient GPU Inference via Dynamic-Length Float (DFloat11)cited by 23
- 2026CoSA: Compressed Sensing-Based Adaptation of Large Language Modelscited by 0
- 2026QATFactory: A Versatile, Deployment-Aligned Framework for Quantization-aware Training and Distillation of LLMscited by 0
- 2026QATFactory: A Versatile, Deployment-Aligned Framework for Quantization-aware Training and Distillation of LLMs30 Sep 2026
- 2026CoSA: Compressed Sensing-Based Adaptation of Large Language Models5 Feb 2026
- 202570% Size, 100% Accuracy: Lossless LLM Compression for Efficient GPU Inference via Dynamic-Length Float (DFloat11)15 Apr 2025