ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1704.02191
  4. Cited By
The (1+$λ$) Evolutionary Algorithm with Self-Adjusting Mutation
  Rate
v1v2v3 (latest)

The (1+λλλ) Evolutionary Algorithm with Self-Adjusting Mutation Rate

7 April 2017
Benjamin Doerr
C. Gießen
Carsten Witt
Jing Yang
ArXiv (abs)PDFHTML

Papers citing "The (1+$λ$) Evolutionary Algorithm with Self-Adjusting Mutation Rate"

39 / 39 papers shown
Log-normal Mutations and their Use in Detecting Surreptitious Fake
  Images
Log-normal Mutations and their Use in Detecting Surreptitious Fake Images
Ismail Labiad
Thomas Bäck
Pierre Fernandez
Laurent Najman
Tom Sander
Furong Ye
M. Zameshina
Olivier Teytaud
AAML
338
1
0
23 Sep 2024
Illustrating the Efficiency of Popular Evolutionary Multi-Objective
  Algorithms Using Runtime Analysis
Illustrating the Efficiency of Popular Evolutionary Multi-Objective Algorithms Using Runtime Analysis
D. Dang
Andre Opris
Dirk Sudholt
239
7
0
22 May 2024
Hardest Monotone Functions for Evolutionary Algorithms
Hardest Monotone Functions for Evolutionary AlgorithmsEvoStar Conferences (EvoStar), 2023
Marc Kaufmann
Maxime Larcher
Johannes Lengler
Oliver Sieberling
278
3
0
13 Nov 2023
Analysing the Robustness of NSGA-II under Noise
Analysing the Robustness of NSGA-II under NoiseAnnual Conference on Genetic and Evolutionary Computation (GECCO), 2023
D. Dang
Andre Opris
B. Salehi
Dirk Sudholt
289
35
0
07 Jun 2023
An information-theoretic evolutionary algorithm
An information-theoretic evolutionary algorithm
A. Berny
120
1
0
12 Apr 2023
Towards Self-adaptive Mutation in Evolutionary Multi-Objective
  Algorithms
Towards Self-adaptive Mutation in Evolutionary Multi-Objective Algorithms
Furong Ye
Frank Neumann
Jacob De Nobel
Aneta Neumann
Thomas Bäck
285
0
0
08 Mar 2023
Benchmarking Algorithms for Submodular Optimization Problems Using
  IOHProfiler
Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfilerIEEE Congress on Evolutionary Computation (CEC), 2023
Frank Neumann
Aneta Neumann
Chao Qian
Viet Anh Do
Jacob De Nobel
Diederick Vermetten
Saba Sadeghi Ahouei
Furong Ye
Hongya Wang
Thomas Bäck
248
7
0
02 Feb 2023
Crossover Can Guarantee Exponential Speed-Ups in Evolutionary
  Multi-Objective Optimisation
Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective OptimisationArtificial Intelligence (AIJ), 2023
D. Dang
Andre Opris
Dirk Sudholt
376
22
0
31 Jan 2023
Hard Problems are Easier for Success-based Parameter Control
Hard Problems are Easier for Success-based Parameter ControlAnnual Conference on Genetic and Evolutionary Computation (GECCO), 2022
Mario Alejandro Hevia Fajardo
Dirk Sudholt
262
6
0
12 Apr 2022
Self-adjusting Population Sizes for the $(1, λ)$-EA on Monotone
  Functions
Self-adjusting Population Sizes for the (1,λ)(1, λ)(1,λ)-EA on Monotone FunctionsParallel Problem Solving from Nature (PPSN), 2022
Marc Kaufmann
Maxime Larcher
Johannes Lengler
Xun Zou
339
11
0
01 Apr 2022
Choosing the Right Algorithm With Hints From Complexity Theory
Choosing the Right Algorithm With Hints From Complexity Theory
Shouda Wang
Weijie Zheng
Benjamin Doerr
501
20
0
14 Sep 2021
Self-Adjusting Population Sizes for Non-Elitist Evolutionary Algorithms:
  Why Success Rates Matter
Self-Adjusting Population Sizes for Non-Elitist Evolutionary Algorithms: Why Success Rates MatterAnnual Conference on Genetic and Evolutionary Computation (GECCO), 2021
Mario Alejandro Hevia Fajardo
Dirk Sudholt
332
23
0
12 Apr 2021
Blending Dynamic Programming with Monte Carlo Simulation for Bounding
  the Running Time of Evolutionary Algorithms
Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary AlgorithmsIEEE Congress on Evolutionary Computation (CEC), 2021
Kirill Antonov
M. Buzdalov
Arina Buzdalova
Carola Doerr
187
4
0
23 Feb 2021
Leveraging Benchmarking Data for Informed One-Shot Dynamic Algorithm
  Selection
Leveraging Benchmarking Data for Informed One-Shot Dynamic Algorithm Selection
Furong Ye
Carola Doerr
Thomas Bäck
170
8
0
12 Feb 2021
Stagnation Detection with Randomized Local Search
Stagnation Detection with Randomized Local SearchEvolutionary Computation (Evol. Comput.), 2021
A. Rajabi
Carsten Witt
250
37
0
28 Jan 2021
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for
  Discrete Optimization
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization
Benjamin Doerr
Frank Neumann
392
41
0
30 Jun 2020
Optimal Mutation Rates for the $(1+λ)$ EA on OneMax
Optimal Mutation Rates for the (1+λ)(1+λ)(1+λ) EA on OneMax
M. Buzdalov
Carola Doerr
192
19
0
20 Jun 2020
Hybridizing the 1/5-th Success Rule with Q-Learning for Controlling the
  Mutation Rate of an Evolutionary Algorithm
Hybridizing the 1/5-th Success Rule with Q-Learning for Controlling the Mutation Rate of an Evolutionary Algorithm
Arina Buzdalova
Carola Doerr
A. Rodionova
231
3
0
19 Jun 2020
Evolutionary Algorithms with Self-adjusting Asymmetric Mutation
Evolutionary Algorithms with Self-adjusting Asymmetric Mutation
A. Rajabi
Carsten Witt
312
8
0
16 Jun 2020
Runtime Analysis of a Heavy-Tailed $(1+(λ,λ))$ Genetic
  Algorithm on Jump Functions
Runtime Analysis of a Heavy-Tailed (1+(λ,λ))(1+(λ,λ))(1+(λ,λ)) Genetic Algorithm on Jump Functions
Denis Antipov
Benjamin Doerr
179
36
0
05 Jun 2020
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization
A. Rajabi
Carsten Witt
381
68
0
07 Apr 2020
Self-adaptation in non-Elitist Evolutionary Algorithms on Discrete
  Problems with Unknown Structure
Self-adaptation in non-Elitist Evolutionary Algorithms on Discrete Problems with Unknown StructureIEEE Transactions on Evolutionary Computation (TEVC), 2020
B. Case
Per Kristian Lehre
204
36
0
01 Apr 2020
Benchmarking Discrete Optimization Heuristics with IOHprofiler
Benchmarking Discrete Optimization Heuristics with IOHprofilerAnnual Conference on Genetic and Evolutionary Computation (GECCO), 2019
Carola Doerr
Furong Ye
Naama Horesh
Hao Wang
O. M. Shir
Thomas Bäck
290
86
0
19 Dec 2019
Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and
  Analytic Combinatorial Tools
Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial ToolsFoundations of Genetic Algorithms (FOGA), 2019
Hsien-Kuei Hwang
Carsten Witt
231
11
0
21 Jun 2019
Offspring Population Size Matters when Comparing Evolutionary Algorithms
  with Self-Adjusting Mutation Rates
Offspring Population Size Matters when Comparing Evolutionary Algorithms with Self-Adjusting Mutation Rates
A. Rodionova
Kirill Antonov
Arina Buzdalova
Carola Doerr
218
13
0
17 Apr 2019
Maximizing Drift is Not Optimal for Solving OneMax
Maximizing Drift is Not Optimal for Solving OneMax
Nathan Buskulic
Carola Doerr
262
24
0
16 Apr 2019
Parallel Black-Box Complexity with Tail Bounds
Parallel Black-Box Complexity with Tail BoundsIEEE Transactions on Evolutionary Computation (TEVC), 2019
Per Kristian Lehre
Dirk Sudholt
225
17
0
31 Jan 2019
Interpolating Local and Global Search by Controlling the Variance of
  Standard Bit Mutation
Interpolating Local and Global Search by Controlling the Variance of Standard Bit Mutation
Furong Ye
Carola Doerr
Thomas Bäck
176
25
0
17 Jan 2019
A Tight Runtime Analysis for the $(μ+ λ)$ EA
A Tight Runtime Analysis for the (μ+λ)(μ+ λ)(μ+λ) EA
Denis Antipov
Benjamin Doerr
175
29
0
28 Dec 2018
Runtime Analysis for Self-adaptive Mutation Rates
Runtime Analysis for Self-adaptive Mutation Rates
Benjamin Doerr
Carsten Witt
Jing Yang
136
60
0
30 Nov 2018
Towards a Theory-Guided Benchmarking Suite for Discrete Black-Box
  Optimization Heuristics: Profiling $(1+λ)$ EA Variants on OneMax and
  LeadingOnes
Towards a Theory-Guided Benchmarking Suite for Discrete Black-Box Optimization Heuristics: Profiling (1+λ)(1+λ)(1+λ) EA Variants on OneMax and LeadingOnes
Carola Doerr
Furong Ye
Sander van Rijn
Hao Wang
Thomas Bäck
168
23
0
17 Aug 2018
Significance-based Estimation-of-Distribution Algorithms
Significance-based Estimation-of-Distribution Algorithms
Benjamin Doerr
Martin S. Krejca
268
52
0
10 Jul 2018
Optimal Parameter Choices via Precise Black-Box Analysis
Optimal Parameter Choices via Precise Black-Box Analysis
Benjamin Doerr
Carola Doerr
Jing Yang
246
109
0
09 Jul 2018
Theory of Parameter Control for Discrete Black-Box Optimization:
  Provable Performance Gains Through Dynamic Parameter Choices
Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices
Benjamin Doerr
Carola Doerr
352
79
0
16 Apr 2018
On the Effectiveness of Simple Success-Based Parameter Selection
  Mechanisms for Two Classical Discrete Black-Box Optimization Benchmark
  Problems
On the Effectiveness of Simple Success-Based Parameter Selection Mechanisms for Two Classical Discrete Black-Box Optimization Benchmark Problems
Carola Doerr
Markus Wagner
163
16
0
04 Mar 2018
Probabilistic Tools for the Analysis of Randomized Optimization
  Heuristics
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics
Benjamin Doerr
455
194
0
20 Jan 2018
Better Runtime Guarantees Via Stochastic Domination
Better Runtime Guarantees Via Stochastic Domination
Benjamin Doerr
335
65
0
13 Jan 2018
An Elementary Analysis of the Probability That a Binomial Random
  Variable Exceeds Its Expectation
An Elementary Analysis of the Probability That a Binomial Random Variable Exceeds Its Expectation
Benjamin Doerr
LRM
257
36
0
01 Dec 2017
Fast Genetic Algorithms
Fast Genetic Algorithms
Benjamin Doerr
H. P. Le
Régis Makhmara
Ta Duy Nguyen
217
225
0
09 Mar 2017
1
Page 1 of 1