Efficient Model Compression Techniques with FishLeg
Not on the map. Why?
Abstract (arXiv)
In many domains, the most successful AI models tend to be the largest, indeed often too large to be handled by AI players with limited computational resources. To mitigate this, a number of compression methods have been developed, including methods that prune the network down to high sparsity whilst retaining performance. The best-performing pruning techniques are often those that use second-order curvature information (such as an estimate of the Fisher information matrix) to score the importance of each weight and to predict the optimal compensation for weight deletion. However, these methods are difficult to scale to high-dimensional parameter spaces without making heavy approximations. Here, we propose the FishLeg surgeon (FLS), a new second-order pruning method based on the Fisher-Legendre (FishLeg) optimizer. At the heart of FishLeg is a meta-learning approach to amortising the action of the inverse FIM, which brings a number of advantages. Firstly, the parameterisation enables the use of flexible tensor factorisation techniques to improve computational and memory efficiency without sacrificing much accuracy, alleviating challenges associated with scalability of most second-order pruning methods. Secondly, directly estimating the inverse FIM leads to less sensitivity to the amplification of stochasticity during inversion, thereby resulting in more precise estimates. Thirdly, our approach also allows for progressive assimilation of the curvature into the parameterisation. In the gradual pruning regime, this results in a more efficient estimate refinement as opposed to re-estimation. We find that FishLeg achieves higher or comparable performance against two common baselines in the area, most notably in the high sparsity regime when considering a ResNet18 model on CIFAR-10 (84% accuracy at 95% sparsity vs 60% for OBS) and TinyIM (53% accuracy at 80% sparsity vs 48% for OBS).
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 12 of its 22 references that are in the map. First posted on arXiv 3 Dec 2024.
Builds on
12 of 22 references.
References · 12
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2019The State of Sparsity in Deep Neural Networkscited by 476
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
- 2018Fast Approximate Natural Gradient Descent in a Kronecker-factored Eigenbasiscited by 146
- 2016A Kronecker-factored approximate Fisher matrix for convolution layerscited by 141
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
- 2018Faster gaze prediction with dense networks and Fisher pruningcited by 94
- 2021M-FAC: Efficient Matrix-Free Approximations of Second-Order Informationcited by 54
- 2023Seeing is Believing: Brain-Inspired Modular Training for Mechanistic Interpretabilitycited by 38
- 2023Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!cited by 27
- 2023Ten Lessons We Have Learned in the New "Sparseland": A Short Handbook for Sparse Neural Network Researcherscited by 25
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025Optimal Brain Connection: Towards Efficient Structural Pruningcited by 3
- 2025On Information Geometry and Iterative Optimization in Model Compression: Operator Factorizationcited by 1
- 2026Exploiting weight-space symmetries for approximating curvaturecited by 0
- 2026Quantization-Aware Healing: A Practical Recipe for Recovering Compressed, 4-Bit LLMscited by 0
- 2026Quantization-Aware Healing: A Practical Recipe for Recovering Compressed, 4-Bit LLMs21 Aug 2026
- 2026Exploiting weight-space symmetries for approximating curvature30 May 2026
- 2025Optimal Brain Connection: Towards Efficient Structural Pruning7 Aug 2025
- 2025On Information Geometry and Iterative Optimization in Model Compression: Operator Factorization12 Jul 2025