Skip navigation
Skip navigation

No Free Lunch versus Occam’s Razor in supervised learning

Lattimore, Tor; Hutter, Marcus


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...[Show more]

CollectionsANU Research Publications
Date published: 2011-11
Type: Conference paper
DOI: 10.1007/978-3-642-44958-1_17


File Description SizeFormat Image
Lattimore and Hutter No Free Lunch versus 2011.pdf130.81 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator