When Nearer is Better

Abstract : We define a numerical "nearer is better" truth value that can be computed or estimated for all functions on a given definition space. The set of all these functions can be then partitioned into three subsets: the ones for which this truth value is positive, the ones for which it is negative, and the ones for which is is null. We show that most of classical functions belong to the first subset, as the second one is useful to design problems that are deceptive for most of optimisation algorithms. Also on these subset the No Free Lunch Theorem does not hold. Therefore it may exist a best algorithm, and we suggest a way to design it for the first one.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00137320
Contributor : Maurice Clerc <>
Submitted on : Wednesday, June 6, 2007 - 9:16:23 AM
Last modification on : Friday, March 8, 2019 - 9:44:02 AM
Document(s) archivé(s) le : Friday, November 25, 2016 - 4:24:19 PM

File

NisBetter2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00137320, version 2

Collections

Citation

Maurice Clerc. When Nearer is Better. 19 pages. 2007. 〈hal-00137320v2〉

Share

Metrics

Record views

412

Files downloads

197