Abstract
The goal of statistics is to provide explanations (models) of observed data.We are given some data and have to infer a plausible probabilistic hypothesis explaining it. Consider, for example, the following scenario.We are given a “black box”We have turned the box on (only once) and it has produced a sequence x of million bits. Given x, we have to infer a hypothesis about the black box.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gács, P., Tromp, J., Vitányi, P.M.B.: Algorithmic statistics. IEEE Trans. Inform. Th. 47(6), 2443–2463 (2001)
Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problems Inform. Transmission 1(1), 1–7 (1965)
Kolmogorov, A.N.: Talk at the Information Theory Symposium in Tallinn, Estonia (1974)
Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications , 2nd edn. Springer, New York (1997)
Shen, A.K.: The concept of (α, β)-stochasticity in the Kolmogorov sense, and its properties. Soviet Math. Dokl. 28(1), 295–299 (1983)
Shen, A.K.: Discussion on Kolmogorov complexity and statistical analysis. The Computer Journal 42(4), 340–342 (1999)
Vereshchagin, N.K., Vitányi, P.M.B.: Kolmogorov’s structure functions and model selection. IEEE Trans. Information Theory 50(12), 3265–3290 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vereshchagin, N. (2009). Kolmogorov Complexity and Model Selection. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds) Computer Science - Theory and Applications. CSR 2009. Lecture Notes in Computer Science, vol 5675. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03351-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-03351-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03350-6
Online ISBN: 978-3-642-03351-3
eBook Packages: Computer ScienceComputer Science (R0)