Structured vs. Unstructured Pruning: An Exponential Gap
Davide Ferre' (CNRS, COATI, UniCA, I3S), Fr\'ed\'eric Giroire (I3S, COATI, UniCA), Frederik Mallmann-Trenn, Emanuele Natale (CNRS, COATI, I3S, UniCA)

TL;DR
This paper demonstrates an exponential gap between structured and unstructured pruning methods in neural networks, showing unstructured pruning can approximate target neurons with significantly fewer parameters than structured pruning.
Contribution
The paper provides the first theoretical comparison between structured and unstructured pruning, revealing an exponential separation in their approximation capabilities.
Findings
Unstructured pruning achieves $ ext{O}(d ext{log}(1/ ext{varepsilon}))$ approximation with fewer neurons.
Neuron pruning requires $ ext{Omega}(d/ ext{varepsilon})$ neurons for similar approximation.
There is an exponential separation in the efficiency of the two pruning paradigms.
Abstract
The Strong Lottery Ticket Hypothesis (SLTH) posits that large, randomly initialized neural networks contain sparse subnetworks capable of approximating a target function at initialization without training, suggesting that pruning alone is sufficient. Pruning methods are typically classified as unstructured, where individual weights can be removed from the network, and structured, where parameters are removed according to specific patterns, as in neuron pruning. Existing theoretical results supporting the SLTH rely almost exclusively on unstructured pruning, showing that logarithmic overparameterization suffices to approximate simple target networks. In contrast, neuron pruning has received limited theoretical attention. In this work, we consider the problem of approximating a single bias-free ReLU neuron using a randomly initialized bias-free two-layer ReLU network, thereby isolating…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Neural Network Applications · Stochastic Gradient Optimization Techniques · Machine Learning and ELM
