Towards an Algorithmic StatisticsAuthors: Peter Gács, John Tromp and Paul Vitányi . Source: Lecture Notes in Artificial Intelligence Vol. 1968, 2000, 41 - 55. Abstract. While Kolmogoroff complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between an individual data sample and an individual model summarizing the information in the data, for example, a finite set where the data sample typically came from. The statistical theory based on such relations between individual objects can be called algorithmic statistics, in contrast to ordinary statistical theory that deals with relations between probabilistic ensembles. We develop a new algorithmic theory of typical statistic, sufficient statistic, and minimal sufficient statistic. ©Copyright 2000 Springer |