Skip navigation
Skip navigation

Free lunch for optimisation under the universal distribution

Everitt, Tom; Lattimore, Tor; Hutter, Marcus


Function optimisation is a major challenge in computer science. The No Free Lunch theorems state that if all functions with the same histogram are assumed to be equally probable then no algorithm outperforms any other in expectation. We argue against the uniform assumption and suggest a universal prior exists for which there is a free lunch, but where no particular class of functions is favoured over another. We also prove upper and lower bounds on the size of the free lunch.

CollectionsANU Research Publications
Date published: 2014-07
Type: Conference paper
DOI: 10.1109/CEC.2014.6900546


There are no files associated with this item.

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator