Abstract
Novel results are obtained by investigating the search algorithms predicated in “no free lunch” (NFL) theorems rather than NFL itself. Finite functions are represented as strings of values. The set of functions is partitioned into maximal blocks of functions that are permutations of one another. A search algorithm effectively maps each test function to a permutation of the function. This mapping is partitioned into one-to-one correspondences on blocks. A distribution on the functions is referred to as block uniform if each function has the same probability as all its permutations. For any search algorithm, the distributions of test functions and permuted test functions have identical Kullback-Leibler distance to the nearest block uniform distribution. That is, divergence from block uniformity is conserved by search. There is NFL in the special case of no divergence, i.e., the distributions are block uniform.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Wolpert, D., Macready, W.: No Free Lunch Theorems for Search. Santa Fe Institute, SFITR- 02-010 (1995)
Wolpert, D., Macready, W.: No Free Lunch Theorems for Optimization. IEEE Trans. Evolutionary Computation 1, 67–82 (1997)
Schumacher, C., Vose, M.D., Whitley, L.D.: The No Free Lunch and Problem Description Length. In: Spector, L., Goodman, E.D., Wu, A., Langdon, W., Voight, H.M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M.H., Burke, E. (eds.) Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 565–570. Morgan Kaufmann, San Francisco (2001)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley & Sons, New York (1991)
Park, K.: Genetic Algorithms Digest 9 (1995), http://www.aic.nrl.navy.mil/galist/digests/v9n10
Hartley, R.: Genetic Algorithms Digest 15 (2001), http://www.aic.nrl.navy.mil/galist/digests/v5n17
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, New York (1997)
English, T.M.: Evaluation of Evolutionary and Genetic Optimizers: No Free Lunch. In: Fogel, L.J., Angeline, P.J., Bäck, T. (eds.) Evolutionary Programming V: Proc. 5th Ann. Conf. on Evolutionary Programming, pp. 163–169. MIT Press, Cambridge (1996)
Neil, J., Woodward, J.: The Universal Distribution and a Free Lunch for Program Induction (unpublished) (manuscript)
Droste, S., Jansen, T., Wegener, I.: Optimization with Randomized Search Heuristics: The (A)NFL Theorem, Realistic Scenarios, and Difficult Functions. Theoretical Computer Science 287, 131–144 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
English, T. (2004). On the Structure of Sequential Search: Beyond “No Free Lunch”. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-24652-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21367-3
Online ISBN: 978-3-540-24652-7
eBook Packages: Springer Book Archive