No Free Lunch Theorems for Optimization
GPTKB entity
Statements (17)
Predicate | Object |
---|---|
gptkbp:instanceOf |
gptkb:mathematical_concept
|
gptkbp:appliesTo |
search algorithms
optimization algorithms |
gptkbp:author |
gptkb:William_G._Macready
gptkb:David_H._Wolpert |
gptkbp:citation |
evolutionary computation literature
machine learning literature |
gptkbp:field |
gptkb:machine_learning
optimization theory |
https://www.w3.org/2000/01/rdf-schema#label |
No Free Lunch Theorems for Optimization
|
gptkbp:influenced |
gptkb:algorithm_selection_theory
metaheuristics research |
gptkbp:publicationYear |
1997
|
gptkbp:publishedIn |
gptkb:IEEE_Transactions_on_Evolutionary_Computation
|
gptkbp:sentence |
No optimization algorithm is superior to others when performance is averaged across all possible problems.
|
gptkbp:bfsParent |
gptkb:no_free_lunch_theorem
|
gptkbp:bfsLayer |
5
|