Abstract
We investigate the quadratization of LeadingOnes in the context of the landscape for local search. We prove that a standard quadratization (i.e., its expression as a degree-2 multilinear polynomial) of LeadingOnes transforms the search space for local search in such a way that faster progress can be made. In particular, we prove there is a \(\varOmega (n/\log n)\) speed-up for constant-factor approximations by RLS when using the quadratized version of the function. This suggests that well-known transformations for classical pseudo-Boolean optimization might have an interesting impact on search heuristics. We derive and present numerical results that investigate the difference in correlation structure between the untransformed landscape and its quadratization. Finally, we report experiments that provide a detailed glimpse into the convergence properties on the quadratized function.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Boros, E., Gruber, A.: On quadratization of pseudo-Boolean functions. In: International Symposium on Artificial Intelligence and Mathematics (2012)
Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Appl. Math. 123(1–3), 155–225 (2002)
Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. Theory of Evolutionary Computation. NCS, pp. 1–87. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-29414-4_1
Droste, S., Jansen, T., Wegener, I.: On the optimization of unimodal functions with the (1+1) evolutionary algorithm. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 13–22. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0056845
Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1–2), 51–81 (2002)
Freedman, D., Drineas, P.: Energy minimization via graph cuts: settling what is possible. In: Computer Society Conference on Computer Vision and Pattern Recognition, pp. 939–946. IEEE Computer Society (2005)
Rana, S., Heckendorn, R.B., Whitley, D.: A tractable Walsh analysis of SAT and its implications for genetic algorithms. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI 98), pp. 392–397 (1998)
Rudolph, G.: Convergence properties of evolutionary algorithms. Kovac (1997)
Stadler, P.F.: Landscapes and their correlation functions. J. Math. Chem. 20(1), 1–45 (1996). https://doi.org/10.1007/BF01165154
Stadler, P.F., Schnabl, W.: The landscape of the traveling salesman problem. Phys. Lett. A 161(4), 337–344 (1992)
Sutton, A.M., Darrell Whitley, L., Howe, A.E.: A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2009), pp. 365–372. ACM (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Sutton, A.M., Whitley, D. (2020). Approximation Speed-Up by Quadratization on LeadingOnes. In: Bäck, T., et al. Parallel Problem Solving from Nature – PPSN XVI. PPSN 2020. Lecture Notes in Computer Science(), vol 12270. Springer, Cham. https://doi.org/10.1007/978-3-030-58115-2_48
Download citation
DOI: https://doi.org/10.1007/978-3-030-58115-2_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-58114-5
Online ISBN: 978-3-030-58115-2
eBook Packages: Computer ScienceComputer Science (R0)