comments

Minimum message length

Minimum message length (MML) is a formal information theory restatement of Occam's Razor: even when models are not equal in goodness of fit accuracy to the observed data, the one generating the shortest overall message is more likely to be correct (where the message consists of a statement of the model, followed by a statement of data encoded concisely using that model). MML was invented by Chris Wallace, first appearing in the seminal (Wallace and Boulton, 1968).

Minimum message length (MML) is a formal information theory restatement of Occam's Razor: even when models are not equal in goodness of fit accuracy to the observed data, the one generating the shortest overall message is more likely to be correct (where the message consists of a statement of the model, followed by a statement of data encoded concisely using that model). MML was invented by Chris Wallace, first appearing in the seminal (Wallace and Boulton, 1968).

MML is intended not just as a theoretical construct, but as a technique that may be deployed in practice. It differs from the related concept of Kolmogorov complexity in that it does not require use of a Turing-complete language to model data. The relation between Strict MML (SMML) and Kolmogorov complexity is outlined in Wallace and Dowe (1999a). Further, a variety of mathematical approximations to "Strict" MML can be used — see, e.g., Chapters 4 and 5 of Wallace (posthumous) 2005.

Contents

  [hide] 
  • 1 Definition
  • 2 Continuous-valued parameters
  • 3 Key features of MML
  • 4 See also
  • 5 External links

Definition[edit]

Shannon's A Mathematical Theory of Communication (1949) states that in an optimal code, the message length (in binary) of an event E, \operatorname{length}(E), where E has probability P(E), is given by \operatorname{length}(E) = -\log_2(P(E)).

Bayes's theorem states that the probability of a (variable) hypothesis H given fixed evidence E is proportional to P(E|H) P(H), which, by the definition of conditional probability, is equal to P(H \and E). We want the model (hypothesis) with the highest such posterior probability. Suppose we encode a message which represents (describes) both model and data jointly. Since \operatorname{length}(H \and E) = -\log_2(P(H \and E)), the most probable model will have the shortest such message. The message breaks into two parts: -\log_2(P(H \and E)) = -\log_2(P(H)) + -\log_2(P(E|H)). The first part encodes the model itself. The second part contains information (e.g., values of parameters, or initial conditions, etc.) that, when processed by the model, outputs the observed data.

MML naturally and precisely trades model complexity for goodness of fit. A more complicated model takes longer to state (longer first part) but probably fits the data better (shorter second part). So, an MML metric won't choose a complicated model unless that model pays for itself.

Continuous-valued parameters[edit]

One reason why a model might be longer would be simply because its various parameters are stated to greater precision, thus requiring transmission of more digits. Much of the power of MML derives from its handling of how accurately to state parameters in a model, and a variety of approximations that make this feasible in practice. This allows it to usefully compare, say, a model with many parameters imprecisely stated against a model with fewer parameters more accurately stated.

Key features of MML[edit]

  • MML can be used to compare models of different structure. For example, its earliest application was in finding mixture models with the optimal number of classes. Adding extra classes to a mixture model will always allow the data to be fitted to greater accuracy, but according to MML this must be weighed against the extra bits required to encode the parameters defining those classes.
  • MML is a method of Bayesian model comparison. It gives every model a score.
  • MML is scale-invariant and statistically invariant. Unlike many Bayesian selection methods, MML doesn't care if you change from measuring length to volume or from Cartesian co-ordinates to polar co-ordinates.
  • MML is statistically consistent. For problems like the Neyman-Scott (1948) problem or factor analysis where the amount of data per parameter is bounded above, MML can estimate all parameters with statistical consistency.
  • MML accounts for the precision of measurement. It uses the Fisher information (in the Wallace-Freeman 1987 approximation, or other hyper-volumes in other approximations) to optimally discretize continuous parameters. Therefore the posterior is always a probability, not a probability density.
  • MML has been in use since 1968. MML coding schemes have been developed for several distributions, and many kinds of machine learners including unsupervised classification, decision trees and graphs, DNA sequences, Bayesian networks, neural networks (one-layer only so far), image compression, image and function segmentation, etc.

See also[edit]

External links[edit]

Models for machine learning and data mining in functional programming, J. Functional Programming, 15(1), pp15-32, Jan. 2005 (MML, FP, and Haskell code).

[See also Comley and Dowe (2003), .pdf. Comley & Dowe (2003, 2005) are the first two papers on MML Bayesian nets using both discrete and continuous valued parameters.]

RELATED ARTICLESExplain
⌅
Machine Learning Methods & Algorithms
⌃
Supervised learning
■
Minimum message length
□
AODE - Averaged one-dependence estimators
□
Artificial neural network
□
Bayesian statistics
□
Case-based reasoning
□
Conditional Random Field
□
Decision tree learning
□
Ensemble learning
□
Gaussian process regression (Kriging)
□
Gene expression programming
□
Group method of data handling
□
Inductive logic programming
□
Information Fuzzy Networks (IFN)
□
Instance-based learning
□
Large-Scale Supervised Sparse Principal Component Analysis
□
Lazy learning
□
Learning automata
□
Learning Vector Quantization
□
Logistic Model Tree
□
Minimum redundancy feature selection
□
Ordinal classification
□
Probably approximately correct learning
□
Random Forests
□
Regression analysis
□
Ripple-down rules
□
Statistical classification
□
Subsymbolic machine learning
□
Support vector machines
□
Symbolic machine learning
□
Graph of this discussion
Enter the title of your article


Enter a short (max 500 characters) summation of your article
Enter the main body of your article
Lock
+Comments (0)
+Citations (1)
+About
Enter comment

Select article text to quote
welcome text

First name   Last name 

Email

Skip