The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Minimum description length induction, Bayesianism, and Kolmogorov complexity
Open accessAbstract
The relationship between the Bayesian approach and the minimum description length approach is established. We sharpen and clarify the general modeling principles minimum description length (MDL) and minimum message length (MML), abstracted as the ideal MDL principle and defined from Bayes's rule by means of Kolmogorov complexity. The basic condition under which the ideal principle should be applied is encapsulated as the fundamental inequality, which in broad terms states that the principle is valid when the data are random, relative to every contemplated hypothesis and also these hypotheses are random relative to the (universal) prior. The ideal principle states that the prior probability associated with the hypothesis should be given by the algorithmic universal probability, and the sum of the log universal probability of the model plus the log of the probability of the data given the model should be minimized. If we restrict the model class to finite sets then application of the ideal principle turns into Kolmogorov's minimal sufficient statistic. In general, we show that data compression is almost always the best strategy, both in model selection and prediction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
A formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758
A formal theory of inductive inference. Part I
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90223-2 · Cited by 1,192
Cited by
Interestingness measures for data mining: A survey
Geng, L., & Hamilton, H. J. (2006) · ACM Computing Surveys · doi:10.1145/1132960.1132963 · Cited by 1,141
Toward a method of selecting among computational models of cognition.
Pitt, M. A., Myung, I. J., & Zhang, S. (2002) · Psychological Review · doi:10.1037//0033-295x.109.3.472 · Cited by 506
Predictability, Complexity, and Learning
Bialek, W., Nemenman, I., & Tishby, N. (2001) · Neural Computation · doi:10.1162/089976601753195969 · Cited by 504
Simplicity: a unifying principle in cognitive science?
Chater, N., & Vitányi, P. (2003) · Trends in Cognitive Sciences · doi:10.1016/s1364-6613(02)00005-0 · Cited by 494
Computational Mechanics: Pattern and Prediction, Structure and Simplicity
Shalizi, C. R., & Crutchfield, J. P. (2001) · Journal of Statistical Physics · doi:10.1023/a:1010388907793 · Cited by 471
Metadata
- Authors
- Vitanyi, P. M. B., & Li, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2000-03
- Volume
- 46
- Issue
- 2
- Pages
- 446-464
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2113832384
- Cited by
- 251
- References
- 3
- FWCI
- 21.60
- Type
- journal article
- Language
- en
- Open access
- green
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: Minimum description length induction, Bayesianism, and Kolmogorov complexity. https://app.cochat.ai/papers/10.1109/18.825807
- The paper
- Vitanyi, P. M. B., & Li, M. (2000). Minimum description length induction, Bayesianism, and Kolmogorov complexity. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.825807
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.