No Free Lunch and Benchmarks | Zendy

Edgar A. DuéñezGuzmán | Zendy; Michael D. Vose | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

No Free Lunch and Benchmarks

Author(s) -

Edgar A. DuéñezGuzmán,

Michael D. Vose

Publication year - 2012

Publication title -

evolutionary computation

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.732

H-Index - 82

eISSN - 1530-9304

pISSN - 1063-6560

DOI - 10.1162/evco_a_00077

Subject(s) - minimax , benchmark (surveying) , permutation (music) , measure (data warehouse) , computer science , matching (statistics) , perspective (graphical) , mathematical optimization , mathematics , algorithm , theoretical computer science , artificial intelligence , data mining , statistics , physics , geodesy , acoustics , geography

We extend previous results concerning black box search algorithms, presenting new theoretical tools related to no free lunch (NFL) where functions are restricted to some benchmark (that need not be permutation closed), algorithms are restricted to some collection (that need not be permutation closed) or limited to some number of steps, or the performance measure is given. Minimax distinctions are considered from a geometric perspective, and basic results on performance matching are also presented.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research