Entropic Strict Minimum Message Length and Its Connections to PAC-Bayes and NML
Enes Makalic, Daniel F. Schmidt

TL;DR
This paper introduces entropic SMML, a risk-sensitive coding criterion that generalizes SMML and connects Bayesian, minimax, and PAC-Bayes principles through an information-theoretic framework.
Contribution
It develops a novel entropic SMML criterion, establishes its theoretical properties, and links it to existing coding and learning paradigms, providing a unified perspective.
Findings
Entropic SMML interpolates between Bayesian and minimax coding regimes.
It admits a variational characterization as a KL-regularized worst-case codelength.
In exponential families, codepoints are tilted Bregman centroids.
Abstract
We introduce entropic strict minimum message length (SMML), a risk-sensitive generalization of strict minimum message length coding. The proposed criterion replaces expected two-part codelength under the prior predictive distribution with an exponential certainty equivalent, thereby defining a one-parameter family of coding rules that interpolates between Bayesian average-case coding and worst-case minimax coding. We show that ordinary SMML is recovered in the risk-neutral limit, while the extreme risk-sensitive limit yields a minimax codelength criterion; when centered by the oracle maximum likelihood codelength, this criterion coincides with the normalized maximum likelihood (NML) minimax-regret principle. We further prove that entropic SMML admits a variational characterization as a Kullback--Leibler-regularized worst-case expected codelength, giving it a PAC--Bayes-type…
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.
