No Free Lunch Theorem, Inductive Skepticism, and the Optimality of Meta-Induction

Publication Year:
Usage 204
Downloads 204
Social Media 1
Tweets 1
Repository URL:
Schurz, Gerhard
Most Recent Tweet View All Tweets
conference paper description
The no free lunch theorem (Wolpert 1996) is a radicalized version of Hume's induction skepticism. It asserts that relative to a uniform probability distribution over all possible worlds, all computable prediction algorithms - whether 'clever' inductive or 'stupid' guessing methods (etc.) - have the same expected predictive success. This theorem seems to be in conflict with results about meta-induction (Schurz 2008). According to these results, certain meta-inductive prediction strategies may dominate other (non-meta-inductive) methods in their predictive success (in the long run). In this paper this conflict is analyzed and dissolved, by means of probabilistic analysis and computer simulation.