v1v2 (latest)

Optimal Parameter Choices via Precise Black-Box Analysis

9 July 2018

Papers citing "Optimal Parameter Choices via Precise Black-Box Analysis"

50 / 52 papers shown

Title
Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces Benjamin Doerr Martin S. Krejca Günter Rudolph 168 1 0 16 Dec 2024
Already Moderate Population Sizes Provably Yield Strong Robustness to Noise Denis Antipov Benjamin Doerr A. Ivanova 156 2 0 02 Apr 2024
Learning to Configure Mathematical Programming Solvers by Mathematical Programming Gabriele Iommazzo C. D’Ambrosio A. Frangioni Leo Liberti 17 4 0 10 Jan 2024
Hardest Monotone Functions for Evolutionary Algorithms Marc Kaufmann Maxime Larcher Johannes Lengler Oliver Sieberling 67 2 0 13 Nov 2023
Representation-agnostic distance-driven perturbation for optimizing ill-conditioned problems Kirill Antonov Anna V. Kononova Thomas Bäck Niki van Stein 64 0 0 05 Jun 2023
How Well Does the Metropolis Algorithm Cope With Local Optima? Benjamin Doerr Taha El Ghazi El Houssaini A. Rajabi Carsten Wit 110 7 0 21 Apr 2023
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions Carola Doerr D. Janett Johannes Lengler 61 2 0 23 Feb 2023
Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation D. Dang Andre Opris Dirk Sudholt 94 17 0 31 Jan 2023
OneMax is not the Easiest Function for Fitness Improvements Marc Kaufmann Maxime Larcher Johannes Lengler Xun Zou LRM 98 6 0 14 Apr 2022
Hard Problems are Easier for Success-based Parameter Control Mario Alejandro Hevia Fajardo Dirk Sudholt 53 6 0 12 Apr 2022
Self-adjusting Population Sizes for the $(1, λ)$ -EA on Monotone Functions Marc Kaufmann Maxime Larcher Johannes Lengler Xun Zou 115 10 0 01 Apr 2022
Theory-inspired Parameter Control Benchmarks for Dynamic Algorithm Configuration André Biedenkapp Nguyen Dang Martin S. Krejca Frank Hutter Carola Doerr 74 8 0 07 Feb 2022
Choosing the Right Algorithm With Hints From Complexity Theory Shouda Wang Weijie Zheng Benjamin Doerr 127 17 0 14 Sep 2021
Self-Adjusting Population Sizes for Non-Elitist Evolutionary Algorithms: Why Success Rates Matter Mario Alejandro Hevia Fajardo Dirk Sudholt 59 18 0 12 Apr 2021
Lower Bounds from Fitness Levels Made Easy Benjamin Doerr Timo Kotzing 65 21 0 07 Apr 2021
Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms Kirill Antonov M. Buzdalov Arina Buzdalova Carola Doerr 61 4 0 23 Feb 2021
Leveraging Benchmarking Data for Informed One-Shot Dynamic Algorithm Selection Furong Ye Carola Doerr Thomas Bäck 57 7 0 12 Feb 2021
Towards Large Scale Automated Algorithm Design by Integrating Modular Benchmarking Frameworks Amine Aziz-Alaoui Carola Doerr Johann Dréo 58 12 0 12 Feb 2021
Optimal Static Mutation Strength Distributions for the $(1+λ)$ Evolutionary Algorithm on OneMax M. Buzdalov Carola Doerr 37 4 0 09 Feb 2021
Fast Perturbative Algorithm Configurators George T. Hall P. S. Oliveto Dirk Sudholt 64 7 0 07 Jul 2020
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization Benjamin Doerr Frank Neumann 67 34 0 30 Jun 2020
First Steps Towards a Runtime Analysis When Starting With a Good Solution Denis Antipov M. Buzdalov Benjamin Doerr 46 20 0 22 Jun 2020
Optimal Mutation Rates for the $(1+λ)$ EA on OneMax M. Buzdalov Carola Doerr 27 19 0 20 Jun 2020
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 25 3 0 19 Jun 2020
Improved Fixed-Budget Results via Drift Analysis Timo Kotzing Carsten Witt 38 4 0 12 Jun 2020
MATE: A Model-based Algorithm Tuning Engine Mohamed El Yafrani M. Martins Inkyung Sung Markus Wagner Carola Doerr Peter Nielsen 60 4 0 27 Apr 2020
Fast Mutation in Crossover-based Algorithms Denis Antipov M. Buzdalov Benjamin Doerr 55 36 0 14 Apr 2020
Self-adaptation in non-Elitist Evolutionary Algorithms on Discrete Problems with Unknown Structure B. Case Per Kristian Lehre 41 31 0 01 Apr 2020
Benchmarking Discrete Optimization Heuristics with IOHprofiler Carola Doerr Furong Ye Naama Horesh Hao Wang O. M. Shir Thomas Bäck 91 73 0 19 Dec 2019
Unlimited Budget Analysis of Randomised Search Heuristics J. He T. Jansen C. Zarges 19 0 0 07 Sep 2019
Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools Hsien-Kuei Hwang Carsten Witt 71 11 0 21 Jun 2019
Offspring Population Size Matters when Comparing Evolutionary Algorithms with Self-Adjusting Mutation Rates A. Rodionova Kirill Antonov Arina Buzdalova Carola Doerr 44 13 0 17 Apr 2019
Maximizing Drift is Not Optimal for Solving OneMax Nathan Buskulic Carola Doerr 53 23 0 16 Apr 2019
On the Impact of the Cutoff Time on the Performance of Algorithm Configurators George T. Hall P. S. Oliveto Dirk Sudholt 60 12 0 12 Apr 2019
Black-Box Complexity of the Binary Value Function Nina Bulanova M. Buzdalov FAtt 66 0 0 09 Apr 2019
Hyper-Parameter Tuning for the (1+(λ,λ)) GA Nguyen Dang Carola Doerr 61 21 0 09 Apr 2019
On the Benefits of Populations on the Exploitation Speed of Standard Steady-State Genetic Algorithms Dogan Corus P. S. Oliveto 47 32 0 26 Mar 2019
Parallel Black-Box Complexity with Tail Bounds Per Kristian Lehre Dirk Sudholt 43 16 0 31 Jan 2019
Interpolating Local and Global Search by Controlling the Variance of Standard Bit Mutation Furong Ye Carola Doerr Thomas Bäck 66 24 0 17 Jan 2019
A Tight Runtime Analysis for the $(μ+ λ)$ EA Denis Antipov Benjamin Doerr 53 27 0 28 Dec 2018
Towards a More Practice-Aware Runtime Analysis of Evolutionary Algorithms E. C. Pinto Carola Doerr 35 36 0 03 Dec 2018
Runtime Analysis for Self-adaptive Mutation Rates Benjamin Doerr Carsten Witt Jing Yang 39 55 0 30 Nov 2018
Towards a Theory-Guided Benchmarking Suite for Discrete Black-Box Optimization Heuristics: Profiling $(1+λ)$ EA Variants on OneMax and LeadingOnes Carola Doerr Furong Ye Sander van Rijn Hao Wang Thomas Bäck 37 22 0 17 Aug 2018
The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates H. Einarsson M. Gauy Johannes Lengler Florian Meier Asier Mujika Angelika Steger Felix Weissenberger 31 14 0 16 Aug 2018
Precise Runtime Analysis for Plateau Functions Denis Antipov Benjamin Doerr 24 9 0 04 Jun 2018
Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices Benjamin Doerr Carola Doerr 56 75 0 16 Apr 2018
Better Fixed-Arity Unbiased Black-Box Algorithms Nina Bulanova M. Buzdalov 23 0 0 15 Apr 2018
On the Effectiveness of Simple Success-Based Parameter Selection Mechanisms for Two Classical Discrete Black-Box Optimization Benchmark Problems Carola Doerr Markus Wagner 35 15 0 04 Mar 2018
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics Benjamin Doerr 87 173 0 20 Jan 2018
Better Runtime Guarantees Via Stochastic Domination Benjamin Doerr 73 60 0 13 Jan 2018