No Free Lunch versus Occam's Razor in Supervised Learning

@inproceedings{Lattimore2011NoFL,
  title={No Free Lunch versus Occam's Razor in Supervised Learning},
  author={Tor Lattimore and Marcus Hutter},
  booktitle={Algorithmic Probability and Friends},
  year={2011}
}
The No Free Lunch theorems are often used to argue that domain specific knowledge is required to design successful algorithms. We use algorithmic information theory to argue the case for a universal bias allowing an algorithm to succeed in all interesting problem domains. Additionally, we give a new algorithm for off-line classification, inspired by Solomonoff induction, with good performance on all structured (compressible) problems under reasonable assumptions. This includes a proof of the… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 7 times. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations