GRAIL: Post-hoc Compensation by Linear Reconstruction for Compressed Networks
Not on the map. Why?
Abstract (arXiv)
Structured deep model compression methods are hardware-friendly and substantially reduce memory and inference costs. However, under aggressive compression, the resulting accuracy degradation often necessitates post-compression finetuning, which can be impractical due to missing labeled data or high training cost. We propose post-hoc blockwise compensation, called GRAIL, a simple zero-finetuning step applied after model compression that restores each block's input-output behavior using a small calibration set. The method summarizes hidden activations via a Gram matrix and applies ridge regression to linearly reconstruct the original hidden representation from the reduced one. The resulting reconstruction map is absorbed into the downstream projection weights, while the upstream layer is compressed. The approach is selector-agnostic (Magnitude, Wanda, Gram-based selection, or folding), data-aware (requiring only a few forward passes without gradients or labels), and recovers classic pruning or folding when the Gram matrix is near identity, indicating weak inter-channel correlations. Across ResNets, ViTs, and decoder-only LLMs, GRAIL consistently improves accuracy or perplexity over data-free and data-aware pruning or folding baselines in practical compression regimes, with manageable overhead and no backpropagation. The code is available at https://github.com/TWWinde/GRAIL_Compensation.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 35 references that are in the map. First posted on arXiv 27 Feb 2026.
Builds on
24 of 35 references.
References · 24
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
12 more
- 2020Up or Down? Adaptive Rounding for Post-Training Quantizationcited by 600
- 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 119
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 110
- 2023A Modern Look at the Relationship between Sharpness and Generalizationcited by 91
- 2024SlimGPT: Layer-wise Structured Pruning for Large Language Modelscited by 43
- 2025Wanda++: Pruning Large Language Models via Regional Gradientscited by 26
- 2024Numerical Pruning for Efficient Autoregressive Modelscited by 24
- 2023Going Beyond Neural Network Feature Similarity: The Network Feature Complexity and Its Interpretation Using Category Theorycited by 12
- 2022HRel: Filter Pruning based on High Relevance between Activation Maps and Class Labelscited by 7
- 2025Forget the Data and Fine-Tuning! Just Fold the Network to Compresscited by 7
- 2026Cut Less, Fold More: Model Compression through the Lens of Projection Geometrycited by 4
- 2025Restoring Pruned Large Language Models via Lost Component Compensationcited by 2
Built on by
Not cited yet.