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

CollectionsANU Research Publications
Date published: 2013
Type: Conference paper
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI: 10.1007/978-3-642-44958-1-17


File Description SizeFormat Image
01_Lattimore_No_free_lunch_versus_Occam's_2013.pdf227.7 kBAdobe PDF    Request a copy

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