Quantization vs Pruning: Insights from the Strong Lottery Ticket Hypothesis
Aakash Kumar, Emanuele Natale

TL;DR
This paper extends the Strong Lottery Ticket Hypothesis to quantized neural networks, providing theoretical insights into how pruning can exactly represent discrete, low-precision models with optimal overparameterization bounds.
Contribution
It develops new theoretical results for the Random Subset Sum Problem in a quantized setting and extends SLTH to finite-precision networks, showing exact representation of target discrete networks.
Findings
Quantized networks can be exactly represented via pruning.
Provides optimal bounds on overparameterization for quantized models.
Extends SLTH framework to finite-precision neural networks.
Abstract
Quantization is an essential technique for making neural networks more efficient, yet our theoretical understanding of it remains limited. Previous works demonstrated that extremely low-precision networks, such as binary networks, can be constructed by pruning large, randomly-initialized networks, and showed that the ratio between the size of the original and the pruned networks is at most polylogarithmic. The specific pruning method they employed inspired a line of theoretical work known as the Strong Lottery Ticket Hypothesis (SLTH), which leverages insights from the Random Subset Sum Problem. However, these results primarily address the continuous setting and cannot be applied to extend SLTH results to the quantized setting. In this work, we build on foundational results by Borgs et al. on the Number Partitioning Problem to derive new theoretical results for the Random Subset Sum…
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.
