Model Preserving Compression for Neural Networks
Not on the map. Why?
Abstract (arXiv)
After training complex deep learning models, a common task is to compress the model to reduce compute and storage demands. When compressing, it is desirable to preserve the original model's per-example decisions (e.g., to go beyond top-1 accuracy or preserve robustness), maintain the network's structure, automatically determine per-layer compression levels, and eliminate the need for fine tuning. No existing compression methods simultaneously satisfy these criteria unicodex2014 we introduce a principled approach that does by leveraging interpolative decompositions. Our approach simultaneously selects and eliminates channels (analogously, neurons), then constructs an interpolation matrix that propagates a correction into the next layer, preserving the network's structure. Consequently, our method achieves good performance even without fine tuning and admits theoretical analysis. Our theoretical generalization bound for a one layer network lends itself naturally to a heuristic that allows our method to automatically choose per-layer sizes for deep networks. We demonstrate the efficacy of our approach with strong empirical performance on a variety of tasks, models, and datasets unicodex2014 from simple one-hidden-layer networks to deep networks on ImageNet.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 42 of its 80 references that are in the map. First posted on arXiv 30 Jul 2021.
Builds on
42 of 80 references.
References · 42
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,845
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2019A Survey on Bias and Fairness in Machine Learningcited by 1,917
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
30 more
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2018Rethinking the Value of Network Pruningcited by 599
- 2020What is the State of Neural Network Pruning?cited by 583
- 2019The State of Sparsity in Deep Neural Networkscited by 476
- 2019On Evaluating Adversarial Robustnesscited by 447
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
- 2019Unlabeled Data Improves Adversarial Robustnesscited by 416
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 378
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 306
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
- 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 284
- 2018A comparative study of fairness-enhancing interventions in machine learningcited by 208
- 2014Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decompositioncited by 203
- 2021Does Knowledge Distillation Really Work?cited by 190
- 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 182
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
- 2015Accelerating Very Deep Convolutional Networks for Classification and Detectioncited by 109
- 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
- 2020ATOM3D: Tasks On Molecules in Three Dimensionscited by 74
- 2020Opportunities and Challenges in Deep Learning Adversarial Robustness: A Surveycited by 72
- 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
- 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
- 2019Data-Independent Neural Pruning via Coresetscited by 35
- 2021Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decompositioncited by 33
- 2019SiPPing Neural Networks: Sensitivity-informed Provable Pruning of Neural Networkscited by 17
- 2018Extreme Network Compression via Filter Group Approximationcited by 12
- 2020Deep Learning Meets Projective Clusteringcited by 10
Built on by
Citing papers per year: 2024: 2; 2025: 5; 2026: 2.
9 papers.
- 2024QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebookscited by 378
- 2025Model-Preserving Adaptive Roundingcited by 23
- 2024STAT: Shrinking Transformers After Trainingcited by 2
- 2025CURing Large Models: Compression via CUR Decompositioncited by 1
- 2025Neural Weight Compression for Language Modelscited by 1
- 2025Pruning AMR: Efficient Visualization of Implicit Neural Representations via Weight Matrix Analysiscited by 1
- 2025Accelerating Attention with Basis Decompositioncited by 0
- 2026Optimizing Tensor Train Decomposition in DNNs for RISC-V Architectures Using Design Space Exploration and Compiler Optimizationscited by 0
- 2026Lottery Tickets Are Not Deployment Ticketscited by 0
- 2026Lottery Tickets Are Not Deployment Tickets29 Jul 2026
- 2026Optimizing Tensor Train Decomposition in DNNs for RISC-V Architectures Using Design Space Exploration and Compiler Optimizations2 Feb 2026
- 2025Pruning AMR: Efficient Visualization of Implicit Neural Representations via Weight Matrix Analysis2 Dec 2025
- 2025Neural Weight Compression for Language Models13 Oct 2025
- 2025Accelerating Attention with Basis Decomposition2 Oct 2025
- 2025Model-Preserving Adaptive Rounding29 May 2025
- 2025CURing Large Models: Compression via CUR Decomposition8 Jan 2025
- 2024STAT: Shrinking Transformers After Training29 May 2024
- 2024QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebooks6 Feb 2024