A No-Free-Lunch theorem for non-uniform distributions of target functions

Journal of Mathematical Modelling and Algorithms

Volumn 3, Issue 4, 2004, Pages 313-322

  Igel, Christian ^a   Toussaint, Marc ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Evolutionary computation; No Free Lunch theorem

Indexed keywords

EID: 20944431820     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1023/B:JMMA.0000049381.24625.f7     Document Type: Article

References (15)

1. Droste, S., Jansen, T. and Wegener, I.: Optimization with randomized search heuristics - The (A)NFL theorem, realistic scenarios, and difficult functions, Theoret. Comput. Sci. 287(1) (2002), 131-144.
2. English, T. M.: Evaluation of evolutionary and genetic optimizers: No free lunch, in L. J. Fogel, P. J. Angeline and T. Bäck (eds), Proceedings of the Fifth Annual Conference on Evolutionary Programming (EP V), 1996, pp. 163-169.
3. English, T. M.: Optimization is easy and learning is hard in the typical function, in A. Zalzala, C. Fonseca, J.-H. Kim and A. Smith (eds), Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), 2000, pp. 924-931.
4. Igel, C. and Stagge, P.: Graph isomorphisms effect structure optimization of neural networks, in International Joint Conference on Neural Networks (IJCNN 2002), 2002, pp. 142-147.
5. Igel, C. and Toussaint, M.: Neutrality and self-adaptation, Natural Computing 2(2) (2003), 117-132.
6. Igel, C. and Toussaint, M.: On classes of functions for which no free lunch results hold, Inform. Process. Lett. 86(6) (2003), 317-321.
7. Igel, C. and Toussaint, M.: Recent results on no-free-lunch theorems for optimization, arXiv preprint cs.NE/0303032, http://arxiv.org/abs/cs.NE/0303032, 2003.
8. Köppen, M., Wolpert, D. H. and Macready, W. G.: Remarks on a recent paper on the "No Free Lunch" theorems, IEEE Trans. Evolut. Comput. 5(3) (1995), 295-296.
9. Radcliffe, N. J. and Surry, P. D.: Fundamental limitations on search algorithms: Evolutionary computing in perspective, in J. van Leeuwen (ed.), Computer Science Today: Recent Trends and Development, Lecture Notes in Comput. Sci. 1000, 1995, pp. 275-291.
10. Schumacher, C.: Fundamental limitations of search, Ph.D. thesis, University of Tennessee, 2000.
11. Schumacher, C., Vose, M. D. and Whitley, L. D.: The no free lunch and description length, in L. Spector, E. Goodman, A. Wu, W. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon and E. Burke (eds), Genetic and Evolutionary Computation Conference (GECCO 2001), 2001, pp. 565-570.
12. Streeter, M. J.: Two broad classes of functions for which a no free lunch result does not hold, in E. Cantú-Paz, J. A. Foster, K. Deb, D. Davis, R. Roy, U.-M. O'Reilly, H.-G. Beyer, R. Standish, G. Kendall, S. Wilson, M. Harman, J. Wegener, D. Dasgupta, M. A. Potter, A. C. Schultz, K. Dowsland, N. Jonoska and J. Miller (eds), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2003), 2003, pp. 1418-1430.
13. Whitley, D.: A free lunch proof for gray versus binary encodings, in W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela and R. E. Smith (eds), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), Vol. 1, 1999, pp. 726-733.
14. Wolpert, D. H. and Macready, W. G.: No free lunch theorems for search, Technical Report SFI-TR-05-010, Santa Fe Institute, Santa Fe, NM, USA, 1995.
15. Wolpert, D. H. and Macready, W. G.: No free lunch theorems for optimization, IEEE Trans. Evolut. Comput. 1(1) (1997), 67-82.