The Functional Structure of Post-Compression Recovery in Low-Rank LLMs
cs.AI, cs.IT, math.IT
Submitted: 2026-10-04
Updated: 2026-10-04
License: http://creativecommons.org/licenses/by/4.0/
The gist: Different low-rank compression methods can produce compressed LLMs that respond differently to the same post-compression recovery procedure, and relative advantages observed between methods at the
Abstract
Different low-rank compression methods can produce compressed LLMs that respond differently to the same post-compression recovery procedure, and relative advantages observed between methods at the compression endpoint may shrink, grow, or even reverse after recovery. We ask whether this recovery heterogeneity reflects functional structure beyond scalar loss evolution, and how that structure evolves throughout recovery. Our results establish that this heterogeneity reflects a reproducible compression-induced functional structure, which we formalize as recovery pressure. To characterize this structure consistently throughout recovery, we develop a standardized functional characterization within each backbone that is applicable across heterogeneous low-rank methods. The primary backward characterization reveals reproducible module-wise structure across independent probes, while a complementary forward-only characterization recovers related structure without loss or backpropagation. We further find that recovery pressure measured at the endpoint is associated with subsequent recovery response; during recovery, its module-wise structure is reorganized non-uniformly, and localized updates induce distributed responses beyond directly updated modules. Further evidence indicates that tracking this evolving structure provides a complementary functional view of recovery progress alongside scalar loss.
Sources
- Zero Sum SVD: Balancing Loss Sensitivity for Low Rank LLM Compression
- Generalized Fisher-Weighted SVD: Scalable Kronecker-Factored Fisher Approximation for Compressing Large Language Models
- LoRAShear: Efficient Large Language Model Structured Pruning and Knowledge Recovery
- Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge
- DipSVD: Dual-importance Protected SVD for Efficient LLM Compression
- The Llama 3 Herd of Models
- AdaSVD: Adaptive Singular Value Decomposition for Large Language Models
- TraceNAS: Zero-shot LLM Pruning via Gradient Trace Correlation
- Layer-wise dynamic rank for compressing large language models
- Low-Rank Prehab: Preparing Neural Networks for SVD Compression
- WinoGrande: An Adversarial Winograd Schema Challenge at Scale
- AA-SVD : Anchored and Adaptive SVD for Large Language Model Compression
- Qwen3 Technical Report
- ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models
- Relative Repairability: A Calibration-Based Diagnostic for High-Sparsity Post-Pruning Allocation
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Agents' Last Exam
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems