A New Solution to the Puzzle of Simplicity.
Explaining the connection, if any, between simplicity and truth is among the deepest problems facing the philosophy of science, statistics, and machine learning. Say that an efficient truth-finding method minimizes worst-case costs en route to converging to the true answer to a theory choice problem. Let the costs considered include the number of times a false answer is selected, the number of times opinion is reversed, and the times at which the reversals occur. It is demonstrated that (1)always choosing the simplest theory compatible with experience and (2) hanging onto it while it remains simplest is both necessary and sufficient for efficiency.
Conference or Workshop Item
||induction, ockham, simplicity, goodman, truth, convergence, akaike, formal learning theory, model selection, theory choice
||General Issues > Confirmation/Induction
||15 Oct 2006
||07 Oct 2010 15:14
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Actions (login required)