Skip to main content

Kolmogorov Complexity and Model Selection

  • Conference paper
Computer Science - Theory and Applications (CSR 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5675))

Included in the following conference series:

  • 499 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gács, P., Tromp, J., Vitányi, P.M.B.: Algorithmic statistics. IEEE Trans. Inform. Th. 47(6), 2443–2463 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problems Inform. Transmission 1(1), 1–7 (1965)

    MathSciNet  MATH  Google Scholar 

  3. Kolmogorov, A.N.: Talk at the Information Theory Symposium in Tallinn, Estonia (1974)

    Google Scholar 

  4. Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications , 2nd edn. Springer, New York (1997)

    Book  MATH  Google Scholar 

  5. Shen, A.K.: The concept of (α, β)-stochasticity in the Kolmogorov sense, and its properties. Soviet Math. Dokl. 28(1), 295–299 (1983)

    Google Scholar 

  6. Shen, A.K.: Discussion on Kolmogorov complexity and statistical analysis. The Computer Journal 42(4), 340–342 (1999)

    Article  MATH  Google Scholar 

  7. Vereshchagin, N.K., Vitányi, P.M.B.: Kolmogorov’s structure functions and model selection. IEEE Trans. Information Theory 50(12), 3265–3290 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics