Matches in DBpedia 2014 for { <http://dbpedia.org/resource/No_free_lunch_in_search_and_optimization> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- No_free_lunch_in_search_and_optimization abstract "In computational complexity and optimization the no free lunch theorem is a result that states that for certain types of mathematical problems, the computational cost of finding a solution, averaged over all problems in the class, is the same for any solution method. No solution therefore offers a 'short cut'. In computing, there are circumstances in which the outputs of all procedures solving a particular type of problem are statistically identical. A colorful way of describing such a circumstance, introduced by David Wolpert and William G. Macready in connection with the problems of searchand optimization,is to say that there is no free lunch. Wolpert had previously derived no free lunch theorems for machine learning (statistical inference). Before Wolpert's article was published, Cullen Schaffer had summarized a preprint version of this work of Wolpert's, but used different terminology.In the "no free lunch" metaphor, each "restaurant" (problem-solving procedure) has a "menu" associating each "lunch plate" (problem) with a "price" (the performance of the procedure in solving the problem). The menus of restaurants are identical except in one regard – the prices are shuffled from one restaurant to the next. For an omnivore who is as likely to order each plate as any other, the average cost of lunch does not depend on the choice of restaurant. But a vegan who goes to lunch regularly with a carnivore who seeks economy pays a high average cost for lunch. To methodically reduce the average cost, one must use advance knowledge of a) what one will order and b) what the order will cost at various restaurants. That is, improvement of performance in problem-solving hinges on using prior information to match procedures to problems.In formal terms, there is no free lunch when the probability distribution on problem instances is such that all problem solvers have identically distributed results. In the case of search, a problem instance is an objective function, and a result is a sequence of values obtained in evaluation of candidate solutions in the domain of the function. For typical interpretations of results, search is an optimization process. There is no free lunch in search if and only if the distribution on objective functions is invariant under permutation of the space of candidate solutions. This condition does not hold precisely in practice, but an "(almost) no free lunch" theorem suggests that it holds approximately.".
- No_free_lunch_in_search_and_optimization thumbnail No_free_lunch_theorems_figure.png?width=300.
- No_free_lunch_in_search_and_optimization wikiPageExternalLink Publications.php.
- No_free_lunch_in_search_and_optimization wikiPageExternalLink radcliffe95fundamental.html.
- No_free_lunch_in_search_and_optimization wikiPageExternalLink optimization.
- No_free_lunch_in_search_and_optimization wikiPageExternalLink Pubs.html.
- No_free_lunch_in_search_and_optimization wikiPageExternalLink yin-yang.html.
- No_free_lunch_in_search_and_optimization wikiPageExternalLink publications.html.
- No_free_lunch_in_search_and_optimization wikiPageExternalLink www.no-free-lunch.org.
- No_free_lunch_in_search_and_optimization wikiPageID "1297402".
- No_free_lunch_in_search_and_optimization wikiPageRevisionID "605288722".
- No_free_lunch_in_search_and_optimization hasPhotoCollection No_free_lunch_in_search_and_optimization.
- No_free_lunch_in_search_and_optimization subject Category:Mathematical_optimization.
- No_free_lunch_in_search_and_optimization subject Category:Theorems_in_computational_complexity_theory.
- No_free_lunch_in_search_and_optimization comment "In computational complexity and optimization the no free lunch theorem is a result that states that for certain types of mathematical problems, the computational cost of finding a solution, averaged over all problems in the class, is the same for any solution method. No solution therefore offers a 'short cut'. In computing, there are circumstances in which the outputs of all procedures solving a particular type of problem are statistically identical.".
- No_free_lunch_in_search_and_optimization label "No free lunch in search and optimization".
- No_free_lunch_in_search_and_optimization label "No-free-Lunch-Theoreme".
- No_free_lunch_in_search_and_optimization label "ノーフリーランチ定理".
- No_free_lunch_in_search_and_optimization sameAs No-free-Lunch-Theoreme.
- No_free_lunch_in_search_and_optimization sameAs ノーフリーランチ定理.
- No_free_lunch_in_search_and_optimization sameAs m.04qvwh.
- No_free_lunch_in_search_and_optimization sameAs Q255847.
- No_free_lunch_in_search_and_optimization sameAs Q255847.
- No_free_lunch_in_search_and_optimization wasDerivedFrom No_free_lunch_in_search_and_optimization?oldid=605288722.
- No_free_lunch_in_search_and_optimization depiction No_free_lunch_theorems_figure.png.
- No_free_lunch_in_search_and_optimization isPrimaryTopicOf No_free_lunch_in_search_and_optimization.
