Approximation of the Two-Part MDL Code
<|reference_start|>Approximation of the Two-Part MDL Code: Approximation of the optimal two-part MDL code for given data, through successive monotonically length-decreasing two-part MDL codes, has the following properties: (i) computation of each step may take arbitrarily long; (ii) we may not know when we reach the optimum, or whether we will reach the optimum at all; (iii) the sequence of models generated may not monotonically improve the goodness of fit; but (iv) the model associated with the optimum has (almost) the best goodness of fit. To express the practically interesting goodness of fit of individual models for individual data sets we have to rely on Kolmogorov complexity.<|reference_end|>
@article{adriaans2006approximation,
    title={Approximation of the Two-Part MDL Code},
    author={Pieter Adriaans (University of Amsterdam), Paul Vitanyi (CWI and
  University of Amsterdam)},
    journal={arXiv preprint arXiv:cs/0612095},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0612095},
    primaryClass={cs.LG cs.AI cs.IT math.IT}
}