The Role of Occam’s Razor in Knowledge Discovery
Pedro Domingos, Data Mining and Knowledge Discovery 3, 409–425 (1999)
There are two interpretations of Occam's razor according to Domingos. They are that models should be:
1) Comprehensible
2) Accurate
In this paper, Domingos draws on a range of research to argue that applying Occam's razor on a choice of models can result in selecting a comprehensible model, but not necessarily an accurate one.
Observing that simplicity has "no satisfactory computable definition", Domingos states that a heuristic definition of Occam's razor (for example, reducing the number of parameters) leads to two formulations:
1st Razor: From two models with equal predictive error, choose the simpler one for simplicities' sake.
2nd Razor: From two models with equal calibration error, choose the simpler one for lower predictive error.
The 1st is generally true, whilst the 2nd is generally theoretically and empirically false.
Starting with some theoretical arguments for the 2nd razor, Domingos looks at the case for the Bayesian information criterion (amongst others). The BIC assumes that model parameters are distributed normally across candidate models. This gives the logarithmic probability of a certain model structure as equal to the likelihood of the structure given some calibration procedure, reduced by a complexity term dependent on the number of parameters. The weaknesses of this approach range from the long chain of assumptions required to use the BIC to the calculated probability being that of the structure, not the model. An example of a quadratic candidate is presented. As it has more model space than a linear model, the linear structure has a higher probability since the larger number of inaccurate quadratic candidates dilute the quadratic structure probability, even for cases where a quadratic structure is the more accurate.
Another theoretical argument for the 2nd razor comes from the idea of the minimum description length (MDL). The argument states that the best model uses the smallest number of bits to code for it and the data, given the model. Domingos argues that the belief that a trade-off between error and complexity results from Bayes' theorem is circular reasoning. This is because it is equivalent to stating that models with higher priors have shorter codes, but also that shorter coded models have higher priors. Sometimes, a complex model with the highest prior can be coded with shorter code compared to a simpler, lower prior model. In other words, after giving each model a prior, the models can be recoded such that those with the highest priors have the shortest code. A short code length does not imply better predictions or a more comprehensible model.
Moving on to theoretical arguments against the 2nd razor, the "No free lunch" mathematical theorem is briefly mentioned. It results from the underdeterminancy in model selection (arising from the fact that model fitting is an open system, with several candidate models always able to match calibration data - see the Oreskes post). The generalization of a model is discussed as resulting from it's Vapnik–Chervonenkis dimension, not the number of parameters. It is possible to have a model with an infinite VC dimension yet just one parameter.
Overfitting is often erroneously thought to be due to complex models. However, it is actually due to multiple comparisons. The probability of a model fitting the calibration data purely through chance rises if more candidates are selected from. Models with many parameters tightly constrained may thus be less susceptible to overfitting than broader, simpler models.
A final set of problems discussed by Domingos involve projections of systematic and random error. Heuristics that minimise complexity often assume rising complexity produces a faster increase in systematic than random error. This is demonstrably not the case for some systems.
Turning his attention to empirical tests of the 2nd razor, Domingos notes that corrections for multiple testing often produce better models than those based on MDL. Further, although the accuracy gain of complex versus simple models may be small it is not necessarily negligible. After providing examples of complex decision-tree models, with the right constraints, with more accuracy than simple ones, some physics examples are presented. For example, both the Copernican and Ptolemaic orbital theories had the same predictive error, so preferring the former was selection using the 1st, not the 2nd, razor (something which was of special interest to me given my background! A theme alluded to was the idea of simplicity resulting from the use of the model, not the final result. A Kuhnian paradigm shift could occur if an unwieldy model with too many patches was replaced by a leaner one. Perhaps the 1st razor is more central to scientific understanding than otherwise recognised?).
Geocentric model. Ptolemaic systems introduced epicycles to solar system bodies, reconciling it with observations. Image from redorbit.
Outright tests of simplicity versus accuracy in e.g. decision-tree modelling generally show that complex models are more accurate than the simple. Complex MDL systems with redundancy, or multi-model ensembles, are more accurate. Domingos states, from this evidence, that the 2nd razor is "typically false". The issue of errors in computation is unmentioned. Domingos does mention cognitive research having implications for comprehension.
Returning to the 1st razor, it is noted that since simplicity is not the same as comprehensibility, it can be rephrased in terms of domain-dependent comprehensibility.
The 2nd razor is then finally discussed as being trivially true after model coding, but of no help in calibration or selection. It is better to prevent overfitting by using domain knowledge, with the added bonus of increased comprehensibility to those with such knowledge. Domingos mentions ecosystem modelling using LAGRAMGE, a 'declerative bias' equation discovery program. The authors of the relevant paper found a model for phytoplankton growth in Lake Glumsoe with appropriate terms and accurate predictions. Pre-existing knowledge of algal growth was used in its construction. See Todorovski and Dzeroski, Declarative bias in equation discovery. Proceedings of the Fourteenth International Conference on Machine Learning, Nashville, TN: Morgan Kaufmann, pp. 376–384 (1997).
Complex ensemble models can be made comprehensible by choosing representative models, with lower, but better, accuracy than similarly structured single models. Explaining a model's results after calculation is also often more comprehensible than coding a fully comprehensible model.
In conclusion, it is recommended to use domain knowledge and the 1st razor when modelling, and to treat model accuracy separately from comprehensibility.
*My musings in italics
