Discrete MDL predicts in total variation
| dc.contributor.author | Hutter, Marcus | |
| dc.coverage.spatial | Vancouver Canada | |
| dc.date.accessioned | 2015-12-10T22:38:46Z | |
| dc.date.created | December 7-12 2009 | |
| dc.date.issued | 2009 | |
| dc.date.updated | 2016-02-24T11:44:32Z | |
| dc.description.abstract | The Minimum Description Length (MDL) principle selects the model that has the shortest code for data plus model. We show that for a countable class of models, MDL predictions are close to the true distribution in a strong sense. The result is completely general. No independence, ergodicity, stationarity, identifiability, or other assumption on the model class need to be made. More formally, we show that for any countable class of models, the distributions selected by MDL (or MAP) asymptotically predict (merge with) the true measure in the class in total variation distance. Implications for non-i.i.d. domains like time-series forecasting, discriminative learning, and reinforcement learning are discussed. | |
| dc.identifier.uri | http://hdl.handle.net/1885/56874 | |
| dc.publisher | MIT Press | |
| dc.relation.ispartofseries | Conference on Advances in Neural Information Processing Systems (NIPS 2009) | |
| dc.rights | Copyright Information: © The Author(s) | |
| dc.source | Proceedings of The 23rd Annual Conference on Neural Information Processing Systems (NIPS 23) | |
| dc.source.uri | http://books.nips.cc/nips22.html | |
| dc.subject | Keywords: Discriminative learning; Ergodicity; Identifiability; Minimum description length principle; Stationarity; Time series forecasting; Total variation; Reinforcement learning | |
| dc.title | Discrete MDL predicts in total variation | |
| dc.type | Conference paper | |
| local.bibliographicCitation.lastpage | 825 | |
| local.bibliographicCitation.startpage | 817 | |
| local.contributor.affiliation | Hutter, Marcus, College of Engineering and Computer Science, ANU | |
| local.contributor.authoruid | Hutter, Marcus, u4350841 | |
| local.description.embargo | 2037-12-31 | |
| local.description.notes | Imported from ARIES | |
| local.description.refereed | Yes | |
| local.identifier.absfor | 080401 - Coding and Information Theory | |
| local.identifier.absfor | 080101 - Adaptive Agents and Intelligent Robotics | |
| local.identifier.absfor | 010405 - Statistical Theory | |
| local.identifier.ariespublication | u8803936xPUB378 | |
| local.identifier.scopusID | 2-s2.0-84858716044 | |
| local.type.status | Published Version |