Kolmogorov's Structure Functions and Model Selection

DOI10.1109/TIT.2004.838346zbMath1318.62011MaRDI QIDQ3547751

Paul M. B. Vitányi, Nikolai K. Vereshchagin

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (24)

Algorithmic minimal sufficient statistics: a new approach ⋮ Occam bound on lowest complexity of elements ⋮ Individual communication complexity ⋮ Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics ⋮ Some properties of antistochastic strings ⋮ Effective complexity of stationary process realizations ⋮ Similarity and denoising ⋮ Kolmogorov structure functions for automatic complexity ⋮ The Kolmogorov birthday paradox ⋮ Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics) ⋮ Summarizing categorical data by clustering attributes ⋮ Algorithmic Statistics: Forty Years Later ⋮ Predictive information in a nonequilibrium critical model ⋮ An extended coding theorem with application to quantum complexities ⋮ Sophistication vs logical depth ⋮ Algorithmic Minimal Sufficient Statistic Revisited ⋮ Algorithmic Statistics: Normal Objects and Universal Models ⋮ Few Paths, Fewer Words: Model Selection With Automatic Structure Functions ⋮ Between order and chaos: The quest for meaningful information ⋮ Unsupervised interaction-preserving discretization of multivariate data ⋮ Algorithmic Statistics Revisited ⋮ On algorithmic statistics for space-bounded algorithms ⋮ Kolmogorov Complexity and Model Selection ⋮ Two Problems for Sophistication

This page was built for publication: Kolmogorov's Structure Functions and Model Selection