Conditional NML Universal Models

作者: Jorma Rissanen , Teemu Roos

DOI: 10.1109/ITA.2007.4357600

关键词:

摘要: The NML (normalized maximum likelihood) universal model has certain minmax optimal properties but it two shortcomings: the normalizing coefficient can be evaluated in a closed form only for special classes, and does not define random process so that cannot used prediction. We present conditional model, which similar to those of regular model. However, unlike NML, defines It also admits recursive evaluation data compression. is much easier evaluate, instance, tree machines than integral square root Fisher information For Bernoulli distributions, gives predictive probability, behaves like Krichevsky-Trofimov actually slightly better extremely skewed strings. some agrees with probability found earlier by Takimoto Warmuth, as solution different more restrictive problem. calculate CNML models generalized Gaussian regression models, particular cases where loss function quadratic, show achieves asymptotic optimality terms mean ideal code length. Moreover, quadratic loss, represents fitting errors noise rather prediction errors, shown smaller what achieved well so-called plug-in or MDL

参考文章(10)
Michael H. A. Davis, E. Michael Hemerly, Order determination and adaptive control of ARX models using the PLS criterion Lecture Notes in Control and Information Sciences. ,vol. 126, pp. 91- 101 ,(1989) , 10.1007/BFB0043776
Eiji Takimoto, Manfred K. Warmuth, The Last-Step Minimax Algorithm Lecture Notes in Computer Science. pp. 279- 290 ,(2000) , 10.1007/3-540-40992-0_21
C. Z. Wei, On Predictive Least Squares Principles Annals of Statistics. ,vol. 20, pp. 1- 42 ,(1992) , 10.1214/AOS/1176348511
R. Krichevsky, V. Trofimov, The performance of universal encoding IEEE Transactions on Information Theory. ,vol. 27, pp. 199- 207 ,(1981) , 10.1109/TIT.1981.1056331
JORMA RISSANEN, A Predictive Least-Squares Principle Ima Journal of Mathematical Control and Information. ,vol. 3, pp. 211- 222 ,(1986) , 10.1093/IMAMCI/3.2-3.211
J.J. Rissanen, Fisher information and stochastic complexity IEEE Transactions on Information Theory. ,vol. 42, pp. 40- 47 ,(1996) , 10.1109/18.481776
A. Barron, J. Rissanen, Bin Yu, The minimum description length principle in coding and modeling IEEE Transactions on Information Theory. ,vol. 44, pp. 2743- 2760 ,(1998) , 10.1109/18.720554
Universal coding, information, prediction, and estimation IEEE Transactions on Information Theory. ,vol. 30, pp. 629- 636 ,(1984) , 10.1109/TIT.1984.1056936