Algorithmic Minimal Sufficient Statistic Revisited

Authors:
Nikolay Vereshchagin
Affiliations:
Moscow State University, Moscow, Russia 119991
Venue:
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Year:
2009

Citing 4
Cited 0

Elements of information theory

Elements of information theory
Sophistication revisited

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Algorithmic statistics

IEEE Transactions on Information Theory
Kolmogorov's structure functions and model selection

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another definition, which might have better properties.