No free lunch in search and optimization
id:
no-free-lunch-in-search-and-optimization-264-2978947
title:
No free lunch in search and optimization
text:
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. The name alludes to the saying "no such thing as a free lunch", that is, no method offers a "short cut". This is under the assumption that the search space is a probability density function. It does not apply to the case where the s
brand slug:
wiki
category slug:
encyclopedia
description:
Average solution cost is the same with any method
original url:
https://en.wikipedia.org/wiki/No_free_lunch_in_search_and_optimization
date created:
date modified:
2024-02-08T18:07:10Z
main entity:
{"identifier":"Q255847","url":"https://www.wikidata.org/entity/Q255847"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/b0/No_free_lunch_theorems_figure.png","width":457,"height":317}
fields total:
13
integrity:
15