Free Lunch for Optimisation under the Universal Distribution
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
|Collections||ANU Research Publications|
|Source:||Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014|
|01_Everitt_Free_Lunch_for_Optimisation_2014.pdf||341.39 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.