mlsanityData to 7 Oct 2026

WoodFisher: Efficient Second-Order Approximation for Neural Network Compression

arXiv 2004.14340 ↗First posted 29 Apr 2020cs.LG stat.MLcited by 21

Not on the map. Why?

Abstract (arXiv)

Second-order information, in the form of Hessian- or Inverse-Hessian-vector products, is a fundamental tool for solving optimization problems. Recently, there has been significant interest in utilizing this information in the context of deep neural networks; however, relatively little is known about the quality of existing approximations in this context. Our work examines this question, identifies issues with existing approaches, and proposes a method called WoodFisher to compute a faithful and efficient estimate of the inverse Hessian. Our main application is to neural network compression, where we build on the classic Optimal Brain Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms popular state-of-the-art methods for one-shot pruning. Further, even when iterative, gradual pruning is considered, our method results in a gain in test accuracy over the state-of-the-art approaches, for pruning popular neural networks (like ResNet-50, MobileNetV1) trained on standard image classification datasets such as ImageNet ILSVRC. We examine how our method can be extended to take into account first-order information, as well as illustrate its ability to automatically set layer-wise pruning thresholds and perform compression in the limited-data regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). First posted on arXiv 29 Apr 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 8; 2022: 5; 2023: 2; 2024: 2; 2025: 2; 2026: 2.

21 papers.

Sort:

By area:

  1. 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,199
  2. 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
  3. 2021SAND-mask: An Enhanced Gradient Masking Strategy for the Discovery of Invariances in Domain Generalizationcited by 50
  4. 2021Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decompositioncited by 33
  5. 2021SSSE: Efficiently Erasing Samples from Trained Machine Learning Modelscited by 28
  6. 2022Dual Lottery Ticket Hypothesiscited by 27
  7. 2022Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptionscited by 20
  8. 2023ECoFLaP: Efficient Coarse-to-Fine Layer-Wise Pruning for Vision-Language Modelscited by 19
  9. 2022Trainability Preserving Neural Pruningcited by 16
  10. 2023Why is the State of Neural Network Pruning so Confusing? On the Fairness, Comparison Setup, and Trainability in Network Pruningcited by 16
  11. 2021Neural Network Compression for Noisy Storage Devicescited by 8
  12. 2024Is Oracle Pruning the True Oracle?cited by 7
9 more
  1. 2022Cyclical Pruning for Sparse Neural Networkscited by 6
  2. 2025SparseSSM: Efficient Selective Structured State Space Models Can Be Pruned in One-Shotcited by 5
  3. 2021Deep Neural Compression Via Concurrent Pruning and Self-Distillationcited by 3
  4. 2021Dynamical Isometry: The Missing Ingredient for Neural Network Pruningcited by 2
  5. 2025HEART-VIT: Hessian-Guided Efficient Dynamic Attention and Token Pruning in Vision Transformercited by 2
  6. 2024A Granger-Causal Perspective on Gradient Descent with Application to Pruningcited by 1
  7. 2022UWC: Unit-wise Calibration Towards Rapid Network Compressioncited by 0
  8. 2026Takeuchi's Information Criteria as Generalization Measures for DNNs Close to NTK Regimecited by 0
  9. 2026SparseForge: Efficient Semi-Structured LLM Sparsification via Annealing of Hessian-Guided Soft-Maskcited by 0