GA-SVD: Generation-aware Singular Value Decomposition for LLM Compression
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) demonstrate strong generalization across a broad range of reasoning and generation tasks, but their large parameter counts impose substantial memory and computation costs, hindering deployment in practical resource-constrained settings. One-shot low-rank compression is a promising solution since it reduces model size and inference cost effectively. However, existing SVD-based methods primarily target multiple-choice benchmarks and often fail to preserve performance on generation tasks. Moreover, their rank allocation strategies are typically heuristic. We propose GA-SVD, a generation-aware low-rank compression framework for LLMs. First, we introduce Generation-Aware Weight Whitening (GAWW), which leverages gradients from on-policy knowledge distillation to construct whitening transformations aligned with generative behavior. Second, we develop an evolutionary global rank allocation method that searches for effective layer-wise rank allocation under a given global compression ratio. Across extensive experiments on Mistral-7B, Qwen3 series, and Llama-3.3 models, evaluated on both multiple-choice and generative benchmarks, GA-SVD consistently outperforms existing SVD-based baselines and achieves state-of-the-art (SoTA) results. We further demonstrate scalability by applying our method to models with up to 70B parameters.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 31 of its 37 references that are in the map. First posted on arXiv 11 Oct 2026.
Builds on
31 of 37 references.
References · 31
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2025Qwen3 Technical Reportcited by 8,820
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2021Program Synthesis with Large Language Modelscited by 3,637
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,391
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2024Tulu 3: Pushing Frontiers in Open Language Model Post-Trainingcited by 1,053
19 more
- 2023On-Policy Distillation of Language Models: Learning from Self-Generated Mistakescited by 939
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
- 2024Extreme Compression of Large Language Models via Additive Quantizationcited by 232
- 2022Language model compression with weighted low-rank factorizationcited by 195
- 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 169
- 2024Evaluating Language Models for Efficient Code Generationcited by 73
- 2025SVD-LLM V2: Optimizing Singular Value Truncation for Large Language Model Compressioncited by 67
- 2023ZipLM: Inference-Aware Structured Pruning of Language Modelscited by 49
- 2025Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectivescited by 48
- 2025DarwinLM: Evolutionary Structured Pruning of Large Language Modelscited by 18
- 2025AdaSVD: Adaptive Singular Value Decomposition for Large Language Modelscited by 15
- 2024Bi-Mamba: Towards Accurate 1-Bit State Space Modelscited by 12
- 2026SAES-SVD: Self-Adaptive Suppression of Accumulated and Local Errors for SVD-based LLM Compressioncited by 12
- 2024Adaptive Feature-based Low-Rank Compression of Large Language Models via Bayesian Optimizationcited by 10
- 2026EvoESAP: Non-Uniform Expert Pruning for Sparse MoEcited by 9
- 2025Layer-wise dynamic rank for compressing large language modelscited by 8
- 2026AA-SVD : Anchored and Adaptive SVD for Large Language Model Compressioncited by 7
- 2026SlimQwen: Exploring the Pruning and Distillation in Large MoE Model Pre-trainingcited by 7
- 2025Low-Rank Compression of Language Models via Differentiable Rank Selectioncited by 4
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026IO-SVD: Input-Output Whitened SVD for Adaptive-Rank LLM Compression
- 2026Swift-SVD: Theoretical Optimality Meets Practical Efficiency in Low-Rank LLM Compression
- 2025Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM
- 2024Basis Selection: Low-Rank Decomposition of Pretrained Large Language Models for Target Applications
- 2024EvoPress: Accurate Dynamic Model Compression via Evolutionary Search
- 2025Optimal Singular Damage: Efficient LLM Inference in Low Storage Regimes
- 2025FLRC: Fine-grained Low-Rank Compressor for Efficient LLM Inference
- 2025DipSVD: Dual-importance Protected SVD for Efficient LLM Compression