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

CollectionsANU Research Publications
Date published: 2014
Type: Conference paper
Source: Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
DOI: 10.1109/CEC.2014.6900546


File Description SizeFormat Image
01_Everitt_Free_Lunch_for_Optimisation_2014.pdf341.39 kBAdobe PDF    Request a copy

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

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator