EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasis
Not on the map. Why?
Abstract (arXiv)
Reducing the test time resource requirements of a neural network while preserving test accuracy is crucial for running inference on resource-constrained devices. To achieve this goal, we introduce a novel network reparameterization based on the Kronecker-factored eigenbasis (KFE), and then apply Hessian-based structured pruning methods in this basis. As opposed to existing Hessian-based pruning algorithms which do pruning in parameter coordinates, our method works in the KFE where different weights are approximately independent, enabling accurate pruning and fast computation. We demonstrate empirically the effectiveness of the proposed method through extensive experiments. In particular, we highlight that the improvements are especially significant for more challenging datasets and networks. With negligible loss of accuracy, an iterative-pruning version gives a 10× reduction in model size and a 8× reduction in FLOPs on wide ResNet32.
Key facts. Cited by 98 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 14; 2022: 15; 2023: 16; 2024: 21; 2025: 24; 2026: 8.
98 papers.
Sort:
By area:
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
- 2021Knowledge distillation: A good teacher is patient and consistentcited by 255
- 2023DepGraph: Towards Any Structural Pruningcited by 202
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2021Convolutional Neural Network Pruning with Structural Redundancy Reductioncited by 73
- 2021Initialization and Regularization of Factorized Neural Layerscited by 58
- 2021M-FAC: Efficient Matrix-Free Approximations of Second-Order Informationcited by 54
- 2024Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costscited by 51
- 2021How Well Do Sparse Imagenet Models Transfer?cited by 50
- 2024MoDeGPT: Modular Decomposition for Large Language Model Compressioncited by 45
38 more
- 2021Hessian-Aware Pruning and Optimal Neural Implantcited by 43
- 2021Recent Advances on Neural Network Pruning at Initializationcited by 41
- 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networkscited by 41
- 2023The LLM Surgeoncited by 36
- 2022Prospect Pruning: Finding Trainable Weights at Initialization using Meta-Gradientscited by 34
- 2021Applications and Techniques for Fast Machine Learning in Sciencecited by 32
- 2022Pruning's Effect on Generalization Through the Lens of Training and Regularizationcited by 31
- 2021SOSP: Efficiently Capturing Global Correlations by Second-Order Structured Pruningcited by 30
- 2025GuidedQuant: Large Language Model Quantization via Exploiting End Loss Guidancecited by 28
- 2022Dual Lottery Ticket Hypothesiscited by 27
- 2023Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!cited by 27
- 2023Federated Domain Generalization: A Surveycited by 25
- 2022Masking Adversarial Damage: Finding Adversarial Saliency for Robust and Sparse Networkcited by 21
- 2022Winning the Lottery Ahead of Time: Efficient Early Network Pruningcited by 21
- 2022CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Modelscited by 20
- 2021Scaling Up Exact Neural Network Compression by ReLU Stabilitycited by 19
- 2023Why is the State of Neural Network Pruning so Confusing? On the Fairness, Comparison Setup, and Trainability in Network Pruningcited by 16
- 2024Using Degeneracy in the Loss Landscape for Mechanistic Interpretabilitycited by 12
- 2023Automatic Attention Pruning: Improving and Automating Model Pruning using Attentionscited by 11
- 2024Finding Lottery Tickets in Vision Models via Data-driven Spectral Foresight Pruningcited by 10
- 2024Preserving Deep Representations In One-Shot Pruning: A Hessian-Free Second-Order Optimization Frameworkcited by 10
- 2021Manipulating Identical Filter Redundancy for Efficient Pruning on Deep and Complicated CNNcited by 9
- 2022Recall Distortion in Neural Network Pruning and the Undecayed Pruning Algorithmcited by 9
- 2023Masked Bayesian Neural Networks : Theoretical Guarantee and its Posterior Inferencecited by 9
- 2023Structured Inverse-Free Natural Gradient: Memory-Efficient & Numerically-Stable KFACcited by 9
- 2025TeleSparse: Practical Privacy-Preserving Verification of Deep Neural Networkscited by 9
- 2023Getting Away with More Network Pruning: From Sparsity to Geometry and Linear Regionscited by 8
- 2023Large Multimodal Model Compression via Efficient Pruning and Distillation at AntGroupcited by 8
- 2024Towards Meta-Pruning via Optimal Transportcited by 8
- 2025MergeMoE: Efficient Compression of MoE Models via Expert Output Mergingcited by 8
- 2024Dynamic Sparse Learning: A Novel Paradigm for Efficient Recommendationcited by 7
- 2024Is Oracle Pruning the True Oracle?cited by 7
- 2025QuartDepth: Post-Training Quantization for Real-Time Depth Estimation on the Edgecited by 7
- 2025GradMetaNet: An Equivariant Architecture for Learning on Gradientscited by 7
- 2023Error Feedback Can Accurately Compress Preconditionerscited by 6
- 2025Masking Teacher and Reinforcing Student for Distilling Vision-Language Modelscited by 6
- 2026On State Reduction in Linear Attentioncited by 6
- 2024Mutual Information Preserving Neural Network Pruningcited by 5
50 most cited of 98 All 98 (JSON)
- 2026A Light Bilevel Refinement Aligns Self-Supervised Representations for Stronger Task-Specific Learning27 Sep 2026
- 2026Layers Matter: Why Continual Learning Regularization Should Be Layer-Adaptive16 Aug 2026
- 2026Characterizing Optimizer-Dependent Training Dynamics Through Hessian Eigenvector Displacement and Localization29 Jun 2026
- 2026LASER: Loss-Aware Singular-value Decomposition and Rank Allocation for Efficient Low-Precision Vision-Language Models30 May 2026
- 2026Exploiting weight-space symmetries for approximating curvature30 May 2026
- 2026Efficient Bilevel Optimization with KFAC-Based Hypergradients31 Mar 2026
- 2026Dataless Weight Disentanglement in Task Arithmetic via Kronecker-Factored Approximate Curvature19 Feb 2026
- 2026On State Reduction in Linear Attention4 Feb 2026
- 2025Masking Teacher and Reinforcing Student for Distilling Vision-Language Models23 Dec 2025
- 2025Metanetworks as Regulatory Operators: Learning to Edit for Requirement Compliance17 Dec 2025
- 2025ZK-APEX: Zero-Knowledge Approximate Personalized Unlearning with Executable Proofs9 Dec 2025
- 2025CAMP-HiVe: Cyclic Pair Merging based Efficient DNN Pruning with Hessian-Vector Approximation for Resource-Constrained Systems9 Nov 2025
38 more
- 2025Elastic ViTs from Pretrained Models without Retraining20 Oct 2025
- 2025MergeMoE: Efficient Compression of MoE Models via Expert Output Merging16 Oct 2025
- 2025Entropy Meets Importance: A Unified Head Importance-Entropy Score for Stable and Efficient Transformer Pruning10 Oct 2025
- 2025SQS: Bayesian DNN Compression through Sparse Quantized Sub-distributions10 Oct 2025
- 2025Unraveling the cognitive patterns of Large Language Models through module communities25 Aug 2025
- 2025FAIR-Pruner: A Flexible Framework for Automatic Layer-Wise Pruning via Tolerance of Difference4 Aug 2025
- 2025Systematic Evaluation of Optimization Techniques for Long-Context Language Models1 Aug 2025
- 2025IPPRO: Importance-based Pruning with PRojective Offset for Magnitude-indifferent Structural Pruning10 Jul 2025
- 2025Catalyst: a Novel Regularizer for Structured Pruning with Auxiliary Extension of Parameter Space10 Jul 2025
- 2025GradMetaNet: An Equivariant Architecture for Learning on Gradients2 Jul 2025
- 2025Towards Universal & Efficient Model Compression via Exponential Torque Pruning27 Jun 2025
- 2025FLoE: Fisher-Based Layer Selection for Efficient Sparse Adaptation of Low-Rank Experts31 May 2025
- 2025Meta Pruning via Graph Metanetworks : A Universal Meta Learning Framework for Network Pruning24 May 2025
- 2025How Many Parameters Does Your Task Really Need? Task Specific Pruning with LLM-Sieve23 May 2025
- 2025GuidedQuant: Large Language Model Quantization via Exploiting End Loss Guidance11 May 2025
- 2025Efficient LLMs with AMP: Attention Heads and MLP Pruning29 Apr 2025
- 2025TeleSparse: Practical Privacy-Preserving Verification of Deep Neural Networks27 Apr 2025
- 2025QuartDepth: Post-Training Quantization for Real-Time Depth Estimation on the Edge20 Mar 2025
- 2025Optimal Brain Apoptosis25 Feb 2025
- 2025One-Cycle Structured Pruning via Stability-Driven Subnetwork Search23 Jan 2025
- 2024AutoSculpt: A Pattern-based Model Auto-pruning Framework Using Reinforcement Learning and Graph Learning24 Dec 2024
- 2024Efficient Model Compression Techniques with FishLeg3 Dec 2024
- 2024Is Oracle Pruning the True Oracle?28 Nov 2024
- 2024Preserving Deep Representations In One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework27 Nov 2024
- 2024Deep Convolutional Neural Networks Structured Pruning via Gravity Regularization25 Nov 2024
- 2024Electrostatic Force Regularization for Neural Structured Pruning17 Nov 2024
- 2024Mutual Information Preserving Neural Network Pruning31 Oct 2024
- 2024Tailored-LLaMA: Optimizing Few-Shot Learning in Pruned LLaMA Models with Task-Specific Prompts24 Oct 2024
- 2024Are Sparse Neural Networks Better Hard Sample Learners?13 Sep 2024
- 2024Learning effective pruning at initialization from iterative pruning27 Aug 2024
- 2024A Greedy Hierarchical Approach to Whole-Network Filter-Pruning in CNNs22 Aug 2024
- 2024MoDeGPT: Modular Decomposition for Large Language Model Compression19 Aug 2024
- 2024Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costs1 Jul 2024
- 2024A Comprehensive Study of Structural Pruning for Vision Models18 Jun 2024
- 2024Evaluating Zero-Shot Long-Context LLM Compression10 Jun 2024
- 2024Decay Pruning Method: Smooth Pruning With a Self-Rectifying Procedure6 Jun 2024
- 2024Finding Lottery Tickets in Vision Models via Data-driven Spectral Foresight Pruning3 Jun 2024
- 2024Using Degeneracy in the Loss Landscape for Mechanistic Interpretability17 May 2024
50 newest of 98 All 98 (JSON)
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
- 2021Knowledge distillation: A good teacher is patient and consistentcited by 255
- 2023DepGraph: Towards Any Structural Pruningcited by 202
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2021Convolutional Neural Network Pruning with Structural Redundancy Reductioncited by 73
- 2021Initialization and Regularization of Factorized Neural Layerscited by 58
- 2021M-FAC: Efficient Matrix-Free Approximations of Second-Order Informationcited by 54
- 2021How Well Do Sparse Imagenet Models Transfer?cited by 50
- 2024MoDeGPT: Modular Decomposition for Large Language Model Compressioncited by 45
- 2021Hessian-Aware Pruning and Optimal Neural Implantcited by 43
12 most cited of 92 All 92 (JSON)
- 2026A Light Bilevel Refinement Aligns Self-Supervised Representations for Stronger Task-Specific Learning27 Sep 2026
- 2026Layers Matter: Why Continual Learning Regularization Should Be Layer-Adaptive16 Aug 2026
- 2026Characterizing Optimizer-Dependent Training Dynamics Through Hessian Eigenvector Displacement and Localization29 Jun 2026
- 2026Exploiting weight-space symmetries for approximating curvature30 May 2026
- 2026Efficient Bilevel Optimization with KFAC-Based Hypergradients31 Mar 2026
- 2026Dataless Weight Disentanglement in Task Arithmetic via Kronecker-Factored Approximate Curvature19 Feb 2026
- 2026On State Reduction in Linear Attention4 Feb 2026
- 2025Metanetworks as Regulatory Operators: Learning to Edit for Requirement Compliance17 Dec 2025
- 2025CAMP-HiVe: Cyclic Pair Merging based Efficient DNN Pruning with Hessian-Vector Approximation for Resource-Constrained Systems9 Nov 2025
- 2025Elastic ViTs from Pretrained Models without Retraining20 Oct 2025
- 2025Entropy Meets Importance: A Unified Head Importance-Entropy Score for Stable and Efficient Transformer Pruning10 Oct 2025
- 2025SQS: Bayesian DNN Compression through Sparse Quantized Sub-distributions10 Oct 2025
12 newest of 92 All 92 (JSON)