mlsanityData to 7 Oct 2026

AA-SVD : Anchored and Adaptive SVD for Large Language Model Compression

arXiv 2604.02119 ↗First posted 2 Apr 2026cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

We introduce a fast low-rank factorization-based framework for compressing large language models that enables rapid compression of billion-parameter models without retraining. Unlike existing factorization-based approaches that optimize only on the original inputs, ignoring distribution shifts from upstream compression and thus propagating errors forward, or those that rely only on shifted inputs and risk drifting away from the original outputs, our approach accounts for both. Beyond individual layer compression, we further refine each transformer block end-to-end, minimizing block-level output distortion and allowing compressed layers to jointly compensate for accumulated errors. By anchoring each compressed layer to the original outputs while explicitly modeling input distribution shifts, our method finds a low-rank approximation that maintains functional equivalence with the original model. Experiments on large language models show that our method consistently outperforms existing SVD-based baselines across compression ratios, with the advantage becoming increasingly pronounced at aggressive compression budgets, where competing methods degrade substantially or collapse entirely, offering a practical solution for efficient, large-scale model deployment.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 50 of its 60 references that are in the map. First posted on arXiv 2 Apr 2026.

Builds on

50 of 60 references.

References · 50

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2023GPT-4 Technical Reportcited by 18,132
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  5. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  6. 2020Scaling Laws for Neural Language Modelscited by 6,411
  7. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  8. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  9. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  10. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  11. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  12. 2023Qwen Technical Reportcited by 3,273
38 more
  1. 2016Pointer Sentinel Mixture Modelscited by 2,992
  2. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  4. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  5. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  6. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
  7. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
  8. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  9. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  10. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
  11. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  12. 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 653
  13. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
  14. 2021Carbon Emissions and Large Neural Network Trainingcited by 561
  15. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
  16. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
  17. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
  18. 2017A Survey of Model Compression and Acceleration for Deep Neural Networkscited by 298
  19. 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 283
  20. 2024A Survey on Knowledge Distillation of Large Language Modelscited by 276
  21. 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 231
  22. 2013Predicting Parameters in Deep Learningcited by 223
  23. 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 156
  24. 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 110
  25. 2015Convolutional neural networks with low-rank regularizationcited by 102
  26. 2025SVD-LLM V2: Optimizing Singular Value Truncation for Large Language Model Compressioncited by 63
  27. 2025Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectivescited by 45
  28. 2024Everybody Prune Now: Structured Pruning of LLMs with only Forward Passescited by 42
  29. 2024BlockPruner: Fine-grained Pruning for Large Language Modelscited by 35
  30. 2020Neural Anisotropy Directionscited by 17
  31. 2025AdaSVD: Adaptive Singular Value Decomposition for Large Language Modelscited by 13
  32. 2026SAES-SVD: Self-Adaptive Suppression of Accumulated and Local Errors for SVD-based LLM Compressioncited by 9
  33. 2025DipSVD: Dual-importance Protected SVD for Efficient LLM Compressioncited by 7
  34. 2026Zero Sum SVD: Balancing Loss Sensitivity for Low Rank LLM Compressioncited by 6
  35. 2025Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLMcited by 3
  36. 2025ARA: Adaptive Rank Allocation for Efficient Large Language Model SVD Compressioncited by 3
  37. 2025Globally optimized SVD compression of LLMs via Fermi-function-based rank selection and gauge fixingcited by 3
  38. 2025Low-Rank Compression of Language Models via Differentiable Rank Selectioncited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 5.

5 papers.