Preserving Deep Representations In One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework
Not on the map. Why?
Abstract (arXiv)
We present SNOWS, a one-shot post-training pruning framework aimed at reducing the cost of vision network inference without retraining. Current leading one-shot pruning methods minimize layer-wise least squares reconstruction error which does not take into account deeper network representations. We propose to optimize a more global reconstruction objective. This objective accounts for nonlinear activations deep in the network to obtain a better proxy for the network loss. This nonlinear objective leads to a more challenging optimization problem -- we demonstrate it can be solved efficiently using a specialized second-order optimization framework. A key innovation of our framework is the use of Hessian-free optimization to compute exact Newton descent steps without needing to compute or store the full Hessian matrix. A distinct advantage of SNOWS is that it can be readily applied on top of any sparse mask derived from prior methods, readjusting their weights to exploit nonlinearities in deep feature representations. SNOWS obtains state-of-the-art results on various one-shot pruning benchmarks including residual networks and Vision Transformers (ViT/B-16 and ViT/L-16, 86m and 304m parameters respectively).
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 34 of its 51 references that are in the map. First posted on arXiv 27 Nov 2024.
Builds on
34 of 51 references.
References · 34
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2023Scaling Vision Transformers to 22 Billion Parameterscited by 690
- 2018Rethinking the Value of Network Pruningcited by 595
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 413
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
22 more
- 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
- 2021Accelerating Sparse Deep Neural Networkscited by 213
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
- 2018Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networkscited by 140
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
- 2014A Stochastic Quasi-Newton Method for Large-Scale Optimizationcited by 68
- 2019The Difficulty of Training Sparse Neural Networkscited by 62
- 2021M-FAC: Efficient Matrix-Free Approximations of Second-Order Informationcited by 54
- 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networkscited by 41
- 2021A Unified Pruning Framework for Vision Transformerscited by 40
- 2020A Survey of Methods for Low-Power Deep Learning and Computer Visioncited by 37
- 2022Learning Best Combination for Efficient N:M Sparsitycited by 32
- 2022CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Modelscited by 20
- 2024ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Modelscited by 18
- 2022Dynamic N:M Fine-grained Structured Sparse Attention Mechanismcited by 14
- 2022Is Complexity Required for Neural Network Pruning? A Case Study on Global Magnitude Pruningcited by 13
- 2024FALCON: FLOP-Aware Combinatorial Optimization for Neural Network Pruningcited by 11
- 2022Training Recipe for N:M Structured Sparsity with Decaying Pruning Maskcited by 10
- 2016Sub-Sampled Newton Methods I: Globally Convergent Algorithmscited by 8
- 2024Data-independent Module-aware Pruning for Hierarchical Vision Transformerscited by 6
- 2023Spatial Re-parameterization for N:M Sparsitycited by 1
Built on by
Citing papers per year: 2025: 5; 2026: 5.
10 papers.
- 2025HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMscited by 3
- 2025HEART-VIT: Hessian-Guided Efficient Dynamic Attention and Token Pruning in Vision Transformercited by 2
- 2026Cut-ViT: Task-Specific Model Pruning via Gram Anchoring Subspace Consistencycited by 1
- 2025Scaling Down, Serving Fast: Compressing and Deploying Efficient LLMs for Recommendation Systemscited by 0
- 2025TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Maskscited by 0
- 2025Winning the Lottery by Preserving Network Training Dynamics with Concrete Ticket Searchcited by 0
- 2026CORP: Closed-Form One-shot Representation-Preserving Structured Pruning for Transformerscited by 0
- 2026STARFISH: faST Accuracy Recovery in pruned networks From Internal State Healingcited by 0
- 2026Pruning Deep Neural Networks via the Marchenko--Pastur Distributioncited by 0
- 2026Artificial Structure Function Search: Preserving Artificial Functional Connectivity for Structured Pruningcited by 0
- 2026Artificial Structure Function Search: Preserving Artificial Functional Connectivity for Structured Pruning21 Sep 2026
- 2026Cut-ViT: Task-Specific Model Pruning via Gram Anchoring Subspace Consistency28 Aug 2026
- 2026STARFISH: faST Accuracy Recovery in pruned networks From Internal State Healing31 May 2026
- 2026Pruning Deep Neural Networks via the Marchenko--Pastur Distribution23 May 2026
- 2026CORP: Closed-Form One-shot Representation-Preserving Structured Pruning for Transformers5 Feb 2026
- 2025HEART-VIT: Hessian-Guided Efficient Dynamic Attention and Token Pruning in Vision Transformer23 Dec 2025
- 2025Winning the Lottery by Preserving Network Training Dynamics with Concrete Ticket Search8 Dec 2025
- 2025TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks29 May 2025
- 2025Scaling Down, Serving Fast: Compressing and Deploying Efficient LLMs for Recommendation Systems20 Feb 2025
- 2025HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMs2 Feb 2025