On Classes of Functions for which No Free Lunch Results Hold

Simple item page
dc.creatorIgel, Christian
dc.creatorToussaint, Marc
dc.date2001-08-21
dc.date.accessioned2026-07-07T03:17:25Z
dc.date.available2026-07-07T03:17:25Z
dc.descriptionIn a recent paper it was shown that No Free Lunch results hold for any subset F of the set of all possible functions from a finite set X to a finite set Y iff F is closed under permutation of X. In this article, we prove that the number of those subsets can be neglected compared to the overall number of possible subsets. Further, we present some arguments why problem classes relevant in practice are not likely to be closed under permutation.
dc.description8 pages, 1 figure, see http://www.neuroinformatik.ruhr-uni-bochum.de/
dc.identifierhttps://arxiv.org/abs/cs/0108011
dc.identifierhttp://arxiv.org/abs/cs/0108011
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30716
dc.subjectNeural and Evolutionary Computing
dc.subjectOptimization and Control
dc.subjectAdaptation and Self-Organizing Systems
dc.subjectG.1.6
dc.titleOn Classes of Functions for which No Free Lunch Results Hold
dc.typetext

Files

Collections

arXiv