{"title":"MDL model selection using the ML plug-in code","authors":"S. D. Rooij, P. Grünwald","doi":"10.1109/ISIT.2005.1523439","DOIUrl":null,"url":null,"abstract":"We analyse the behaviour of the ML plug-in code, also known as the Rissanen-Dawid prequential ML code, relative to single parameter exponential families M. If the data are i.i.d. according to an (essentially) arbitrary P, then the redundancy grows at 1/2c log n. We find that, in contrast to other important universal codes such as the 2-part MDL, Shtarkov and Bayesian codes where c = 1, here c equals the ratio between the variance of P and the variance of the element of M that is closest to P in KL-divergence. We show how this behaviour can impair model selection performance in a simple setting in which we select between the Poisson and geometric models","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2005-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523439","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We analyse the behaviour of the ML plug-in code, also known as the Rissanen-Dawid prequential ML code, relative to single parameter exponential families M. If the data are i.i.d. according to an (essentially) arbitrary P, then the redundancy grows at 1/2c log n. We find that, in contrast to other important universal codes such as the 2-part MDL, Shtarkov and Bayesian codes where c = 1, here c equals the ratio between the variance of P and the variance of the element of M that is closest to P in KL-divergence. We show how this behaviour can impair model selection performance in a simple setting in which we select between the Poisson and geometric models