Proper noun
no free lunch theorem
(artificial intelligence, computing) A theorem that implies that no single machine learning algorithm is universally the best-performing algorithm for all problems.
There is no single learning algorithm that works best on all supervised learning problems (see the No free lunch theorem ). Source: Internet