A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones-Reference-Cited by-同舟云学术

A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms - FOGA '19
language:
Short-container-title:

Author:

Antipov Denis¹,Doerr Benjamin²,Karavaev Vitalii¹

Affiliation:

1. ITMO University, Russia

2. École Polytechnique, Palaiseau, France

Funder

Russian Science Foundation

Gaspard Monge Program for optimization, operations research and their interactions with data sciences

Paris Ile-de-France Region

Publisher

ACM Press

Reference30 articles.

1. Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, and Kurt Mehlhorn. 2019. The query complexity of a permutation-based variant of Mastermind. Discrete Applied Mathematics 260 (2019), 28--50.

2. Süntje Böttcher, Benjamin Doerr, and Frank Neumann. 2010. Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In Parallel Problem Solving from Nature, PPSN 2010. Springer, 1--10.

3. Maxim Buzdalov and Benjamin Doerr. 2017. Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas. In Genetic and Evolutionary Computation Conference, GECCO 2017. ACM, 1343--1350. Full version available online at http://arxiv.org/abs/1704.04366.

4. Benjamin Doerr. 2019. Analyzing randomized search heuristics via stochastic domination. Theoretical Computer Science 773 (2019), 115--137.

5. Benjamin Doerr and Carola Doerr. 2015. Optimal parameter choices through self-adjustment: applying the 1/5-th rule in discrete settings. In Genetic and Evolutionary Computation Conference, GECCO 2015. ACM, 1335--1342.

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Choosing the right algorithm with hints from complexity theory;Information and Computation;2024-01

2. Using Automated Algorithm Configuration for Parameter Control;Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms;2023-08-30

3. Curing ill-Conditionality via Representation-Agnostic Distance-Driven Perturbations;Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms;2023-08-30

4. Larger Offspring Populations Help the (1 + (λ, λ)) Genetic Algorithm to Overcome the Noise;Proceedings of the Genetic and Evolutionary Computation Conference;2023-07-12

5. Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution;Algorithmica;2023-02-22