No free lunch versus Occam's Razor in supervised learning
Date
2013
Authors
Lattimore, Tor
Hutter, Marcus
Journal Title
Journal ISSN
Volume Title
Publisher
Conference Organising Committee
Abstract
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
Description
Keywords
Citation
Collections
Source
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Type
Conference paper
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31