Scaling Up Exact Neural Network Compression by ReLU Stability
Thiago Serra, Xin Yu, Abhinav Kumar, Srikumar Ramalingam
Abstract
We can compress a rectifier network while exactly preserving its underlying functionality with respect to a given input domain if some of its neurons are stable. However, current approaches to determine the stability of neurons with Rectified Linear Unit (ReLU) activations require solving or finding a good approximation to multiple discrete optimization problems. In this work, we introduce an algorithm based on solving a single optimization problem to identify all stable neurons. Our approach is on median 183 times faster than the state-of-art method on CIFAR-10, which allows us to explore exact compression on deeper (5 x 100) and wider (2 x 800) networks within minutes. For classifiers trained under an amount of L1 regularization that does not worsen accuracy, we can remove up to 56% of the connections on the CIFAR-10 dataset. The code is available at the following link, https://github.com/yuxwind/ExactCompression.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 05ebd2b5-68d4-4295-99cd-b781f438f0e2Cited by top-tier papers6
- The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural NetworksXin Yu, Thiago Serra, Srikumar Ramalingam, Shandian ZheICML 2022 · 60 citations
- Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature ConnectivityZhanpeng Zhou, Yongyi Yang, Xiaojiang Yang, Junchi Yan et al.NeurIPS 2023 · 56 citations
- Pruning's Effect on Generalization Through the Lens of Training and RegularizationTian Jin, Michael Carbin, Daniel M. Roy, Jonathan Frankle et al.NeurIPS 2022 · 40 citations
- Constrained Discrete Black-Box Optimization using Mixed-Integer ProgrammingTheodore P. Papalexopoulos, Christian Tjandraatmadja, Ross Anderson, Juan Pablo Vielma et al.ICML 2022 · 22 citations
- Recall Distortion in Neural Network Pruning and the Undecayed Pruning AlgorithmAidan Good, Jiaqi Lin, Xin Yu, Hannah Sieg et al.NeurIPS 2022 · 15 citations
Builds on14
- Pruning neural networks without any data by iteratively conserving synaptic flowHidenori Tanaka, Daniel Kunin, Daniel L. K. Yamins, Surya GanguliNeurIPS 2020 · 884 citations
- Picking Winning Tickets Before Training by Preserving Gradient FlowChaoqi Wang, Guodong Zhang, Roger B. GrosseICLR 2020 · 743 citations
- Comparing Rewinding and Fine-tuning in Neural Network PruningAlex Renda, Jonathan Frankle, Michael CarbinICLR 2020 · 437 citations
- Pruning Neural Networks at Initialization: Why Are We Missing the Mark?Jonathan Frankle, Gintare Karolina Dziugaite, Daniel M. Roy, Michael CarbinICLR 2021 · 261 citations
- WoodFisher: Efficient Second-Order Approximation for Neural Network CompressionSidak Pal Singh, Dan AlistarhNeurIPS 2020 · 217 citations
Related papers
- Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural NetworksMark Kurtz, Justin Kopinsky, Rati Gelashvili, Alexander Matveev et al.ICML 2020 · 163 citations
- Operation-Aware Soft Channel Pruning using Differentiable MasksMinsoo Kang, Bohyung HanICML 2020 · 165 citations
- Global Minimizers of ℓp-Regularized Objectives Yield the Sparsest ReLU Neural NetworksJulia B. Nakhleh, Robert D. NowakNeurIPS 2025
- Does a sparse ReLU network training problem always admit an optimum ?Quoc-Tung Le, Rémi Gribonval, Elisa RicciettiNeurIPS 2023 · 5 citations
- DECORE: Deep Compression with Reinforcement LearningManoj Alwani, Yang Wang, Vashisht MadhavanCVPR 2022 · 42 citations
