Kolmogorov structure function

In 1973, Andrey Kolmogorov proposed a non-probabilistic approach to statistics and model selection. Let each datum be a finite binary string and a model be a finite set of binary strings. Consider model classes consisting of models of given maximal Kolmogorov complexity. The Kolmogorov structure function of an individual data string expresses the relation between the complexity level constraint on a model class and the least log-cardinality of a model in the class containing the data. The structure function determines all stochastic properties of the individual data string: for every constrained model class it determines the individual best-fitting model in the class irrespective of whether the true model is in the model class considered or not. In the classical case we talk about a set of data with a probability distribution, and the properties are those of the expectations. In contrast, here we deal with individual data strings and the properties of the individual string focused on. In this setting, a property holds with certainty rather than with high probability as in the classical case. The Kolmogorov structure function precisely quantifies the goodness-of-fit of an individual model with respect to individual data.

The Kolmogorov structure function is used in the algorithmic information theory, also known as the theory of Kolmogorov complexity, for describing the structure of a string by use of models of increasing complexity.

The structure function was originally proposed by Kolmogorov in 1973 at a Soviet Information Theory symposium in Tallinn, but these results were not published^[1] p. 182. But the results were announced in^[2] in 1974, the only written record by Kolmogorov himself. One of his last scientific statements is (translated from the original Russian by L.A. Levin):

To each constructive object corresponds a function ${\displaystyle \Phi _{x}(k)}$ of a natural number k—the log of minimal cardinality of x-containing sets that allow definitions of complexity at most k. If the element x itself allows a simple definition, then the function ${\displaystyle \Phi }$ drops to 0 even for small k. Lacking such definition, the element is "random" in a negative sense. But it is positively "probabilistically random" only when function ${\displaystyle \Phi }$ having taken the value ${\displaystyle \Phi _{0}}$ at a relatively small ${\displaystyle k=k_{0}}$, then changes approximately as ${\displaystyle \Phi (k)=\Phi _{0}-(k-k_{0})}$.

— Kolmogorov, announcement cited above

It is discussed in Cover and Thomas.^[1] It is extensively studied in Vereshchagin and Vitányi^[3] where also the main properties are resolved. The Kolmogorov structure function can be written as

${\displaystyle h_{x}(\alpha )=\min _{S}\{\log |S|:x\in S,K(S)\leq \alpha \}}$

where ${\displaystyle x}$ is a binary string of length ${\displaystyle n}$ with ${\displaystyle x\in S}$ where ${\displaystyle S}$ is a contemplated model (set of n-length strings) for ${\displaystyle x}$, ${\displaystyle K(S)}$ is the Kolmogorov complexity of ${\displaystyle S}$ and ${\displaystyle \alpha }$ is a nonnegative integer value bounding the complexity of the contemplated ${\displaystyle S}$'s. Clearly, this function is nonincreasing and reaches ${\displaystyle \log |\{x\}|=0}$ for ${\displaystyle \alpha =K(x)+c}$ where ${\displaystyle c}$ is the required number of bits to change ${\displaystyle x}$ into ${\displaystyle \{x\}}$ and ${\displaystyle K(x)}$ is the Kolmogorov complexity of ${\displaystyle x}$.

We define a set ${\displaystyle S}$ containing ${\displaystyle x}$ such that

${\displaystyle K(S)+K(x|S)=K(x)+O(1)}$.

The function ${\displaystyle h_{x}(\alpha )}$ never decreases more than a fixed independent constant below the diagonal called sufficiency line L defined by

${\displaystyle L(\alpha )+\alpha =K(x)}$.

It is approached to within a constant distance by the graph of ${\displaystyle h_{x}}$ for certain arguments (for instance, for ${\displaystyle \alpha =K(x)+c}$). For these ${\displaystyle \alpha }$'s we have ${\displaystyle \alpha +h_{x}(\alpha )=K(x)+O(1)}$ and the associated model ${\displaystyle S}$ (witness for ${\displaystyle h_{x}(\alpha )}$) is called an optimal set for ${\displaystyle x}$, and its description of ${\displaystyle K(S)\leq \alpha }$ bits is therefore an algorithmic sufficient statistic. We write `algorithmic' for `Kolmogorov complexity' by convention. The main properties of an algorithmic sufficient statistic are the following: If ${\displaystyle S}$ is an algorithmic sufficient statistic for ${\displaystyle x}$, then

${\displaystyle K(S)+\log |S|=K(x)+O(1)}$.

That is, the two-part description of ${\displaystyle x}$ using the model ${\displaystyle S}$ and as data-to-model code the index of ${\displaystyle x}$ in the enumeration of ${\displaystyle S}$ in ${\displaystyle \log |S|}$ bits, is as concise as the shortest one-part code of ${\displaystyle x}$ in ${\displaystyle K(x)}$ bits. This can be easily seen as follows:

${\displaystyle K(x)\leq K(x,S)+O(1)\leq K(S)+K(x|S)+O(1)\leq K(S)+\log |S|+O(1)\leq K(x)+O(1)}$,

using straightforward inequalities and the sufficiency property, we find that ${\displaystyle K(x|S)=\log |S|+O(1)}$. (For example, given ${\displaystyle S\ni x}$, we can describe ${\displaystyle x}$ self-delimitingly (you can determine its end) in ${\displaystyle \log |S|+O(1)}$ bits.) Therefore, the randomness deficiency ${\displaystyle \log |S|-K(x|S)}$ of ${\displaystyle x}$ in ${\displaystyle S}$ is a constant, which means that ${\displaystyle x}$ is a typical (random) element of S. However, there can be models ${\displaystyle S}$ containing ${\displaystyle x}$ that are not sufficient statistics. An algorithmic sufficient statistic ${\displaystyle S}$ for ${\displaystyle x}$ has the additional property, apart from being a model of best fit, that ${\displaystyle K(x,S)=K(x)+O(1)}$ and therefore by the Kolmogorov complexity symmetry of information (the information about ${\displaystyle x}$ in ${\displaystyle S}$ is about the same as the information about ${\displaystyle S}$ in x) we have ${\displaystyle K(S|x^{*})=O(1)}$: the algorithmic sufficient statistic ${\displaystyle S}$ is a model of best fit that is almost completely determined by ${\displaystyle x}$. (${\displaystyle x^{*}}$ is a shortest program for ${\displaystyle x}$.) The algorithmic sufficient statistic associated with the least such ${\displaystyle \alpha }$ is called the algorithmic minimal sufficient statistic.

With respect to the picture: The MDL structure function ${\displaystyle \lambda _{x}(\alpha )}$ is explained below. The Goodness-of-fit structure function ${\displaystyle \beta _{x}(\alpha )}$ is the least randomness deficiency (see above) of any model ${\displaystyle S\ni x}$ for ${\displaystyle x}$ such that ${\displaystyle K(S)\leq \alpha }$. This structure function gives the goodness-of-fit of a model ${\displaystyle S}$ (containing x) for the string x. When it is low the model fits well, and when it is high the model doesn't fit well. If ${\displaystyle \beta _{x}(\alpha )=0}$ for some ${\displaystyle \alpha }$ then there is a typical model ${\displaystyle S\ni x}$ for ${\displaystyle x}$ such that ${\displaystyle K(S)\leq \alpha }$ and ${\displaystyle x}$ is typical (random) for S. That is, ${\displaystyle S}$ is the best-fitting model for x. For more details see^[1] and especially^[3] and.^[4]

Within the constraints that the graph goes down at an angle of at least 45 degrees, that it starts at n and ends approximately at ${\displaystyle K(x)}$, every graph (up to a ${\displaystyle O(\log n)}$ additive term in argument and value) is realized by the structure function of some data x and vice versa. Where the graph hits the diagonal first the argument (complexity) is that of the minimum sufficient statistic. It is incomputable to determine this place. See.^[3]

It is proved that at each level ${\displaystyle \alpha }$ of complexity the structure function allows us to select the best model ${\displaystyle S}$ for the individual string x within a strip of ${\displaystyle O(\log n)}$ with certainty, not with great probability.^[3]

The Minimum description length (MDL) function: The length of the minimal two-part code for x consisting of the model cost K(S) and the length of the index of x in S, in the model class of sets of given maximal Kolmogorov complexity ${\displaystyle \alpha }$, the complexity of S upper bounded by ${\displaystyle \alpha }$, is given by the MDL function or constrained MDL estimator:

${\displaystyle \lambda _{x}(\alpha )=\min _{S}\{\Lambda (S):S\ni x,\;K(S)\leq \alpha \},}$

where ${\displaystyle \Lambda (S)=\log |S|+K(S)\geq K(x)-O(1)}$ is the total length of two-part code of x with help of model S.

It is proved that at each level ${\displaystyle \alpha }$ of complexity the structure function allows us to select the best model S for the individual string x within a strip of ${\displaystyle O(\log n)}$ with certainty, not with great probability.^[3]

The mathematics developed above were taken as the foundation of MDL by its inventor Jorma Rissanen.^[5]

For every computable probability distribution ${\displaystyle P}$ it can be proved^[6] that

${\displaystyle -\log P(x)=\log |S|+O(\log n)}$.

For example, if ${\displaystyle P}$ is some computable distribution on the set ${\displaystyle S}$ of strings of length ${\displaystyle n}$, then each ${\displaystyle x\in S}$ has probability ${\displaystyle P(x)=\exp(O(\log n))/|S|=n^{O(1)}/|S|}$. Kolmogorov's structure function becomes

${\displaystyle h'_{x}(\alpha )=\min _{P}\{-\log P(x):P(x)>0,K(P)\leq \alpha \}}$

where x is a binary string of length n with ${\displaystyle -\log P(x)>0}$ where ${\displaystyle P}$ is a contemplated model (computable probability of ${\displaystyle n}$-length strings) for ${\displaystyle x}$, ${\displaystyle K(P)}$ is the Kolmogorov complexity of ${\displaystyle P}$ and ${\displaystyle \alpha }$ is an integer value bounding the complexity of the contemplated ${\displaystyle P}$'s. Clearly, this function is non-increasing and reaches ${\displaystyle \log |\{x\}|=0}$ for ${\displaystyle \alpha =K(x)+c}$ where c is the required number of bits to change ${\displaystyle x}$ into ${\displaystyle \{x\}}$ and ${\displaystyle K(x)}$ is the Kolmogorov complexity of ${\displaystyle x}$. Then ${\displaystyle h'_{x}(\alpha )=h_{x}(\alpha )+O(\log n)}$. For every complexity level ${\displaystyle \alpha }$ the function ${\displaystyle h'_{x}(\alpha )}$ is the Kolmogorov complexity version of the maximum likelihood (ML).

It is proved that at each level ${\displaystyle \alpha }$ of complexity the structure function allows us to select the best model ${\displaystyle S}$ for the individual string ${\displaystyle x}$ within a strip of ${\displaystyle O(\log n)}$ with certainty, not with great probability.^[3]

The MDL function: The length of the minimal two-part code for x consisting of the model cost K(P) and the length of ${\displaystyle -\log P(x)}$, in the model class of computable probability mass functions of given maximal Kolmogorov complexity ${\displaystyle \alpha }$, the complexity of P upper bounded by ${\displaystyle \alpha }$, is given by the MDL function or constrained MDL estimator:

${\displaystyle \lambda '_{x}(\alpha )=\min _{P}\{\Lambda (P):P(x)>0,\;K(P)\leq \alpha \},}$

where ${\displaystyle \Lambda (P)=-\log P(x)+K(P)\geq K(x)-O(1)}$ is the total length of two-part code of x with help of model P.

It is proved that at each level ${\displaystyle \alpha }$ of complexity the MDL function allows us to select the best model P for the individual string x within a strip of ${\displaystyle O(\log n)}$ with certainty, not with great probability.^[3]

It turns out that the approach can be extended to a theory of rate distortion of individual finite sequences and denoising of individual finite sequences^[7] using Kolmogorov complexity. Experiments using real compressor programs have been carried out with success.^[8] Here the assumption is that for natural data the Kolmogorov complexity is not far from the length of a compressed version using a good compressor.

• Cover, T.M.; P. Gacs; R.M. Gray (1989). "Kolmogorov's contributions to Information Theory and Algorithmic Complexity". Annals of Probability. 17 (3): 840–865. doi:10.1214/aop/1176991250. JSTOR 2244387.
• Kolmogorov, A. N.; Uspenskii, V. A. (1 January 1987). "Algorithms and Randomness". Theory of Probability and Its Applications. 32 (3): 389–412. doi:10.1137/1132060.
• Li, M., Vitányi, P.M.B. (2008). An introduction to Kolmogorov complexity and its applications (3rd ed.). New York: Springer. ISBN 978-0387339986.{{cite book}}: CS1 maint: multiple names: authors list (link), Especially pp. 401–431 about the Kolmogorov structure function, and pp. 613–629 about rate distortion and denoising of individual sequences.
• Shen, A. (1 April 1999). "Discussion on Kolmogorov Complexity and Statistical Analysis". The Computer Journal. 42 (4): 340–342. doi:10.1093/comjnl/42.4.340.
• V'yugin, V.V. (1987). "On Randomness Defect of a Finite Object Relative to Measures with Given Complexity Bounds". Theory of Probability and Its Applications. 32 (3): 508–512. doi:10.1137/1132071.
• V'yugin, V. V. (1 April 1999). "Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences". The Computer Journal. 42 (4): 294–317. doi:10.1093/comjnl/42.4.294.