No Free Lunch versus Occam's Razor in Supervised Learning

Details No Free Lunch versus Occam's Razor in Supervised Learning No Free Lunch versus Occam's Razor in Supervised Learning

2011-11-16

arxiv.org/abs/1111.3846v1

Computer Science

Learning

16 LaTeX pages, 1 figure

Scientific paper

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 problems under reasonable assumptions. This includes a proof of the efficacy of the well-known heuristic of randomly selecting training data in the hope of reducing misclassification rates.

Affiliated with

Also associated with

No associations

Rating

No Free Lunch versus Occam's Razor in Supervised Learning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with No Free Lunch versus Occam's Razor in Supervised Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and No Free Lunch versus Occam's Razor in Supervised Learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-68768