Stochastic complexity and the mdl principle
- 1 January 1987
- journal article
- research article
- Published by Taylor & Francis in Econometric Reviews
- Vol. 6 (1) , 85-102
- https://doi.org/10.1080/07474938708800126
Abstract
A Search for the stochastic complexity of the observed data, as the greates lower bound with which the data can be encoded, represents a global maximum likelihood principle, which permits comparison of models regardless of the number of parameters in them. For important special classes, such as the guassian and the multinomial models, formulas for the stochastic complexity give new and powerful model selection criteria,while in the general case approximations can be computed with the MDL principle. Once a model is found with which the stochastic complexity is reached, there is nothing further to learn from the data with the proposed models. The basic notions are reviewed and numerical examples are given.Keywords
This publication has 14 references indexed in Scilit:
- Stochastic Complexity and ModelingThe Annals of Statistics, 1986
- A Predictive Least-Squares PrincipleIMA Journal of Mathematical Control and Information, 1986
- Universal coding, information, prediction, and estimationIEEE Transactions on Information Theory, 1984
- Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential ApproachJournal of the Royal Statistical Society. Series A (General), 1984
- A Universal Prior for Integers and Estimation by Minimum Description LengthThe Annals of Statistics, 1983
- A Predictive Approach to Model SelectionJournal of the American Statistical Association, 1979
- Modeling by shortest data descriptionAutomatica, 1978
- Goodness of prediction fitBiometrika, 1975
- The Average Estimated Variance Criterion for the Selection-of-Variables Problem in General Linear ModelsTechnometrics, 1974
- Mean Square Error of Prediction as a Criterion for Selecting VariablesTechnometrics, 1971