Applying MDL to Learning Best Model Granularity (1994)
| Citations: | 17 - 6 self |
BibTeX
@MISC{Gao94applyingmdl,
author = {Qiong Gao and Ming Li and Paul Vitányi},
title = {Applying MDL to Learning Best Model Granularity},
year = {1994}
}
OpenURL
Abstract
The Minimum Description Length (MDL) principle is solidly based on a provably ideal method of inference using Kolmogorov complexity. We test how the theory behaves in practice on a general problem in model selection: that of learning the best model granularity. The performance of a model depends critically on the granularity, for example the choice of precision of the parameters. Too high precision generally involves modeling of accidental noise and too low precision may lead to confusion of models that should be distinguished. This precision is often determined ad hoc. In MDL the best model is the one that most compresses a two-part code of the data set: this embodies "Occam's Razor." In two quite different experimental settings the theoretical value determined using MDL coincides with the best value found experimentally. In the first experiment the task is to recognize isolated handwritten characters in one subject's handwriting, irrespective of size and orientation. Base...







