No_free_lunch_in_search_and_optimization?useskin=vector
en.wikipedia.org · 3,224 words · saved by 1 readers
Couldn't find lead section for No_free_lunch_in_search_and_optimization?useskin=vector
This article is about mathematical analysis of computing. For associated folklore and broad implications of the theorem, see No free lunch theorem. The problem is to rapidly find a solution among candidates a, b, and c that is as good as any other, where goodness is either 0 or 1. There are eight instances ("lunch plates") fxyz of the problem, where x, y, and z indicate the goodness of a, b, and c, respectively. Procedure ("restaurant") A evaluates candidates in the order a, b, c, and B evaluates candidates in reverse that order, but each "charges" 1 evaluation in 5 cases, 2 evaluations in…
saved by
related reading
- No free lunch theorem - Wikipediaen.wikipedia.org
- No Free Lunch Theorems For Optimization - Evolutionary Computation, IEEE Transactions oncs.ubc.ca
- What the No-Free-Lunch Theorems Really Meansfi-edu.s3.amazonaws.com
- Mathematical optimization - Wikipediaen.wikipedia.org
- Amdahl's law - Wikipediaen.wikipedia.org
- Evolution as Backstop for Reinforcement Learning · Gwern.netgwern.net
- [2304.05366] The No Free Lunch Theorem, Kolmogorov Complexity, and the Role of Inductive Biases in Machine Learningarxiv.org
- Folk theorem (game theory) - Wikipediaen.wikipedia.org
- Pareto front - Wikipediaen.wikipedia.org
- P versus NP problem - Wikipediaen.wikipedia.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Six Rules for Dining Out - The Atlantictheatlantic.com