The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Strong optimality of the normalized ML models as universal codes and information in data
Abstract
We show that the normalized maximum-likelihood (NML) distribution as a universal code for a parametric class of models is closest to the negative logarithm of the maximized likelihood in the mean code length distance, where the mean is taken with respect to the worst case model inside or outside the parametric class. We strengthen this result by showing that, when the data generating models are restricted to be the most "benevolent" ones in that they incorporate all the constraints in the data and no more, the bound cannot be beaten in essence by any code except when the mean is taken with respect to the data generating models in a set of vanishing size. These results allow us to decompose the code of the data into two parts, the first having all the useful information in the data that can be extracted with the family in question and the rest which has none, and we obtain a measure for the (useful) information in data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Minimum Description Length Principle
Grünwald, P. D. (2007) · doi:10.7551/mitpress/4643.001.0001 · Cited by 1,644
Cited by
A practical solution to the pervasive problems ofp values
Wagenmakers, E.-J. (2007) · Psychonomic Bulletin & Review · doi:10.3758/bf03194105 · Cited by 2,490
Krueger, R. F., Markon, K. E., Patrick, C. J., & Iacono, W. G. (2005) · Journal of Abnormal Psychology · doi:10.1037/0021-843x.114.4.537 · Cited by 566
The Oxford Handbook of Computational and Mathematical Psychology
(2015) · Oxford Handbooks Online · doi:10.1093/oxfordhb/9780199957996.001.0001 · Cited by 396
A Survey of Model Evaluation Approaches With a Tutorial on Hierarchical Bayesian Methods
Shiffrin, R. M., Lee, M. D., Kim, W., & Wagenmakers, E. (2008) · Cognitive Science · doi:10.1080/03640210802414826 · Cited by 348
A tutorial introduction to the minimum description length principle
Grunwald, P. (2004) · arXiv · doi:10.48550/arxiv.math/0406077 · Cited by 293
Metadata
- Authors
- Rissanen, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2001-07
- Volume
- 47
- Issue
- 5
- Pages
- 1712-1717
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2138200515
- Cited by
- 166
- References
- 1
- FWCI
- 8.23
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Strong optimality of the normalized ML models as universal codes and information in data. https://app.cochat.ai/papers/10.1109/18.930912
- The paper
- Rissanen, J. (2001). Strong optimality of the normalized ML models as universal codes and information in data. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.930912
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.