Algorithmic minimal sufficient statistics: a new approach

DOI10.1007/s00224-014-9605-1zbMath1339.68128OpenAlexW2021631302MaRDI QIDQ285518

Nikolai K. Vereshchagin

Publication date: 19 May 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-014-9605-1

zbMATH Keywords

denoisingminimum description lengthsufficient statisticalgorithmic statisticsrandomness deficiency

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Sufficient statistics and fields (62B05)

Related Items (2)

Algorithmic Statistics: Forty Years Later ⋮ Short lists with short programs in short time

Cites Work

• Unnamed Item
• Short lists with short programs in short time
• Game Arguments in Computability Theory and Algorithmic Information Theory
• Kolmogorov's Structure Functions and Model Selection
• Algorithmic Minimal Sufficient Statistic Revisited
• Algorithmic statistics
• Discussion on Kolmogorov Complexity and Statistical Analysis
• On Algorithmic Strong Sufficient Statistics

This page was built for publication: Algorithmic minimal sufficient statistics: a new approach