Abstract
We extend Kolmogorov’s structure function in the algorithmic theory of complexity to statistical models in order to avoid the problem of noncomputability. For this we have to construct the analog of Kolmogorov complexity and to generalize Kolmogorov’s model as a finite set to a statistical model. The Kolmogorov complexity K(xn) will be replaced by the stochastic complexity for the model class \( \mathcal{M}_\gamma \) γ (5.40) and the other analogs required will be discussed next. In this section the structure index γ will be held constant, and to simplify the notations we drop it from the models written now as f(xn;ϑ), and the class as \( \mathcal{M}_k \) k. The parameters θ range over a bounded subset ω of Rk.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2007). Structure Function. In: Information and Complexity in Statistical Modeling. Information Science and Statistics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68812-1_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-68812-1_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-36610-4
Online ISBN: 978-0-387-68812-1
eBook Packages: Computer ScienceComputer Science (R0)