Information-Theoretic Understanding of Population Risk Improvement with Model Compression
Not on the map. Why?
Abstract (arXiv)
We show that model compression can improve the population risk of a pre-trained model, by studying the tradeoff between the decrease in the generalization error and the increase in the empirical risk with model compression. We first prove that model compression reduces an information-theoretic bound on the generalization error; this allows for an interpretation of model compression as a regularization technique to avoid overfitting. We then characterize the increase in empirical risk with model compression using rate distortion theory. These results imply that the population risk could be improved by model compression if the decrease in generalization error exceeds the increase in empirical risk. We show through a linear regression example that such a decrease in population risk due to model compression is indeed possible. Our theoretical results further suggest that the Hessian-weighted K-means clustering compression approach can be improved by regularizing the distance between the clustering centers. We provide experiments with neural networks to support our theoretical assertions.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Jan 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 2; 2023: 1; 2024: 1; 2025: 2.
11 papers.
- 2021Tighter expected generalization error bounds via Wasserstein distancecited by 43
- 2021Knowledge Distillation as Semiparametric Inferencecited by 29
- 2022An Information-theoretical Approach to Semi-supervised Learning under Covariate-shiftcited by 18
- 2021Characterizing and Understanding the Generalization Error of Transfer Learning with Gibbs Algorithmcited by 14
- 2022Tighter Expected Generalization Error Bounds via Convexity of Information Measurescited by 11
- 2021Rate-Distortion Analysis of Minimum Excess Risk in Bayesian Learningcited by 10
- 2023Towards the Fundamental Limits of Knowledge Transfer over Finite Domainscited by 4
- 2021Characterizing the Generalization Error of Gibbs Algorithm with Symmetrized KL informationcited by 3
- 2024Effect of Weight Quantization on Learning Models by Typical Case Analysiscited by 3
- 2025MEL: Multi-level Ensemble Learning for Resource-Constrained Environmentscited by 1
- 2025Identifying Speaker Information in Feed-Forward Layers of Self-Supervised Speech Transformerscited by 1
- 2025Identifying Speaker Information in Feed-Forward Layers of Self-Supervised Speech Transformers26 Jun 2025
- 2025MEL: Multi-level Ensemble Learning for Resource-Constrained Environments25 Jun 2025
- 2024Effect of Weight Quantization on Learning Models by Typical Case Analysis30 Jan 2024
- 2023Towards the Fundamental Limits of Knowledge Transfer over Finite Domains11 Oct 2023
- 2022Tighter Expected Generalization Error Bounds via Convexity of Information Measures24 Feb 2022
- 2022An Information-theoretical Approach to Semi-supervised Learning under Covariate-shift24 Feb 2022
- 2021Characterizing and Understanding the Generalization Error of Transfer Learning with Gibbs Algorithm2 Nov 2021
- 2021Characterizing the Generalization Error of Gibbs Algorithm with Symmetrized KL information28 Jul 2021
- 2021Rate-Distortion Analysis of Minimum Excess Risk in Bayesian Learning10 May 2021
- 2021Knowledge Distillation as Semiparametric Inference20 Apr 2021
- 2021Tighter expected generalization error bounds via Wasserstein distance22 Jan 2021