Globally optimized SVD compression of LLMs via Fermi-function-based rank selection and gauge fixing
Not on the map. Why?
Abstract (arXiv)
Large Language Models (LLMs) are very demanding in terms of their computational resources. Low-rank decompositions of LLM weights, e.g. via Singular Value Decomposition (SVD), is a promising approach for LLM compression, but presents several practical hurdles, e.g. selecting appropriate layer-wise ranks and getting rid of its parameter redundancy. In this work, we present two physics-inspired improvements to SVD LLM compression: (1) FermiGrad, a gradient-descent algorithm that determines globally optimal layer-wise ranks by relaxing the discrete singular-value truncation into a continuous optimization using the Fermi function; (2) PivGa, an additional textitlossless compression of the low-rank factors that exploits the intrinsic gauge freedom in their parametrization.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 8 of its 10 references that are in the map. First posted on arXiv 26 Nov 2025.
Builds on
8 of 10 references.
References · 8
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 231
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 219
- 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 156
- 2025Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectivescited by 45
- 2025LatentLLM: Attention-Aware Joint Tensor Compressioncited by 6
- 2025COALA: Numerically Stable and Efficient Framework for Context-Aware Low-Rank Approximationcited by 5
- 2025Pivoting Factorization: A Compact Meta Low-Rank Representation of Sparsity for Efficient Inference in Large Language Modelscited by 4
Built on by
Citing papers per year: 2026: 3.
3 papers.