Convergence of Discrete MDL for Sequential Prediction
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models. This applies in particular to the important case of universal sequence prediction, where the model class corresponds to all algorithms for some fixed universal Turing machine (this correspondence is by enumerable semimeasures, hence the resulting models are stochastic). We prove convergence theorems similar to...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the 17th Annual Conference on Learning Theory (COLT 2004)|
|01_Poland_Convergence_of_Discrete_MDL_2004.pdf||209.88 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.