Algorithmic minimal sufficient statistic revisited

DOI10.1007/978-3-642-03073-4_49MaRDI QIDQ3576086zbMATH OpenOpenAlexFDO

Authors Nikolai K. Vereshchagin

Publication date 28 July 2010

Published in Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03073-4_49

Mathematics Subject Classification ID

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

Recommendations

• Algorithmic minimal sufficient statistics: a new approach
• Algorithmic statistics
• On algorithmic strong sufficient statistics
• scientific article; zbMATH DE number 2080439
• Meaningful Information

Cites work

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

Cited in

(10)

• Algorithmic minimal sufficient statistics: a new approach
• Algorithmic statistics revisited
• On approximate decidability of minimal programs
• Effective algorithms for solving trace minimization problem in multivariate statistics
• Computational implications of reducing data to sufficient statistics
• On algorithmic strong sufficient statistics
• Correction to "Algorithmic statistics"
• Winograd's algorithm statistically revisited: it pays to weigh than to count!
• Algorithmic statistics: forty years later
• Sophistication vs logical depth

This page was built for publication: Algorithmic minimal sufficient statistic revisited

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