Beyond Variance: Knowledge-Aware LLM Compression via Fisher-Aligned Subspace Diagnostics
Not on the map. Why?
Abstract (arXiv)
Post-training activation compression is essential for deploying Large Language Models (LLMs) on resource-constrained hardware. However, standard methods like Singular Value Decomposition (SVD) are gradient-blind: they preserve high-variance dimensions regardless of their impact on factual knowledge preservation. We introduce Fisher-Aligned Subspace Compression (FASC), a knowledge-aware compression framework that selects subspaces by directly modeling activation-gradient coupling, minimizing a second-order surrogate of the loss function. FASC leverages the Fisher Information Matrix to identify dimensions critical for factual knowledge, which often reside in low-variance but high-gradient-sensitivity subspaces. We propose the Dependence Violation Score (rho) as a general-purpose diagnostic metric that quantifies activation-gradient coupling, revealing where factual knowledge is stored within transformer architectures. Extensive experiments on Mistral-7B and Llama-3-8B demonstrate that FASC preserves 6-8% more accuracy on knowledge-intensive benchmarks (MMLU, LAMA) compared to variance-based methods at 50% rank reduction, effectively enabling a 7B model to match the factual recall of a 13B uncompressed model. Our analysis reveals that rho serves as a fundamental signal of stored knowledge, with high-rho layers emerging only when models internalize factual associations during training.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 37 of its 71 references that are in the map. First posted on arXiv 12 Jan 2026.
Builds on
37 of 71 references.
References · 37
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,893
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
- 2016Pointer Sentinel Mixture Modelscited by 3,096
25 more
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
- 2019Language Models as Knowledge Bases?cited by 1,936
- 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,868
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,165
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,059
- 2020A Primer in BERTology: What we know about how BERT workscited by 815
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 815
- 2020How Much Knowledge Can You Pack Into the Parameters of a Language Model?cited by 719
- 2020KILT: a Benchmark for Knowledge Intensive Language Taskscited by 573
- 2021Carbon Emissions and Large Neural Network Trainingcited by 567
- 2017Convolutional Sequence to Sequence Learningcited by 552
- 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 526
- 2014New insights and perspectives on the natural gradient methodcited by 443
- 2021Measuring and Improving Consistency in Pretrained Language Modelscited by 364
- 2014Sketching as a Tool for Numerical Linear Algebracited by 288
- 2017Regularizing and Optimizing LSTM Language Modelscited by 205
- 2015Actor-Mimic: Deep Multitask and Transfer Reinforcement Learningcited by 178
- 2013Revisiting Natural Gradient for Deep Networkscited by 159
- 2021Multilingual LAMA: Investigating Knowledge in Multilingual Pretrained Language Modelscited by 132
- 2025Differentiable Entropy Regularization: A Complexity-Aware Approach for Neural Optimizationcited by 4
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Grassmannian Mixture-of-Experts: Concentration-Controlled Routing on Subspace Manifoldscited by 2
- 2026Certificate-Guided Pruning for Stochastic Lipschitz Optimizationcited by 0
- 2026Calibrated Adaptation: Bayesian Stiefel Manifold Priors for Reliable Parameter-Efficient Fine-Tuningcited by 0
- 2026Coverage-Based Calibration for Post-Training Quantization via Weighted Set Cover over Outlier Channelscited by 0
- 2026Coverage-Based Calibration for Post-Training Quantization via Weighted Set Cover over Outlier Channels27 Apr 2026
- 2026Calibrated Adaptation: Bayesian Stiefel Manifold Priors for Reliable Parameter-Efficient Fine-Tuning19 Feb 2026
- 2026Grassmannian Mixture-of-Experts: Concentration-Controlled Routing on Subspace Manifolds19 Feb 2026
- 2026Certificate-Guided Pruning for Stochastic Lipschitz Optimization28 Jan 2026
Similar, not cited
Close in wording, no citation either way
- 2026Swift-SVD: Theoretical Optimality Meets Practical Efficiency in Low-Rank LLM Compression
- 2026Capability-Guided Compression: Toward Interpretability-Aware Budget Allocation for Large Language Models
- 2026FASQ: Flexible Accelerated Subspace Quantization for Calibration-Free LLM Compression
- 2026LLM Compression with Jointly Optimizing Architectural and Quantization choices
- 2023The Cost of Compression: Investigating the Impact of Compression on Parametric Knowledge in Language Models
- 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models
- 2025Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM
- 2026Does Compression Preserve Uncertainty? A Unified Benchmark for Quantized and Sparse LLMs via Conformal Prediction