Free Lunch for Optimisation under the Universal Distribution

Date

2014

Authors

Everitt, Tom
Lattimore, Tor
Hutter, Marcus

Journal Title

Journal ISSN

Volume Title

Publisher

IEEE

Abstract

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

Description

Keywords

Citation

Source

Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

10.1109/CEC.2014.6900546

Restricted until

2037-12-31