On Classes of Functions for which No Free Lunch Results Hold

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In 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.
8 pages, 1 figure, see http://www.neuroinformatik.ruhr-uni-bochum.de/

Keywords

Neural and Evolutionary Computing, Optimization and Control, Adaptation and Self-Organizing Systems, G.1.6

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30716

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0108011
 http://arxiv.org/abs/cs/0108011

Collections

arXiv