Kolmogorov Complexity and Model Selection

DOI10.1007/978-3-642-03351-3_3MaRDI QIDQ3392938zbMATH OpenOpenAlexFDO

Authors Nikolai K. Vereshchagin

Publication date 18 August 2009

Published in Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03351-3_3

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Stochastic complexity and model selection from incomplete data
• scientific article; zbMATH DE number 1911043
• Kolmogorov's Structure Functions and Model Selection
• Model Selection and the Principle of Minimum Description Length
• Stochastic complexity and the mdl principle
• scientific article; zbMATH DE number 3971958

Cites work

• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 3860059 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• Algorithmic statistics
• Discussion on Kolmogorov Complexity and Statistical Analysis
• Kolmogorov's Structure Functions and Model Selection

Cited in

(2)

• Model Selection and the Principle of Minimum Description Length
• A tight upper bound on Kolmogorov complexity and uniformly optimal prediction

This page was built for publication: Kolmogorov Complexity and Model Selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392938)