ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1801.06733
  4. Cited By
Probabilistic Tools for the Analysis of Randomized Optimization
  Heuristics
v1v2v3v4v5v6 (latest)

Probabilistic Tools for the Analysis of Randomized Optimization Heuristics

20 January 2018
Benjamin Doerr
ArXiv (abs)PDFHTML

Papers citing "Probabilistic Tools for the Analysis of Randomized Optimization Heuristics"

50 / 96 papers shown
Title
Runtime Analysis for Multi-Objective Evolutionary Algorithms in
  Unbounded Integer Spaces
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
Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
Simon Wietheger
Benjamin Doerr
83
8
0
19 Apr 2024
Faster Optimization Through Genetic Drift
Faster Optimization Through Genetic Drift
Cella Florescu
Marc Kaufmann
Johannes Lengler
Ulysse Schaller
36
0
0
18 Apr 2024
A Flexible Evolutionary Algorithm With Dynamic Mutation Rate Archive
A Flexible Evolutionary Algorithm With Dynamic Mutation Rate Archive
Martin S. Krejca
Carsten Witt
122
1
0
05 Apr 2024
A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical
  Analysis
A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis
Benjamin Doerr
Joshua Knowles
Aneta Neumann
Frank Neumann
110
0
0
04 Apr 2024
The Runtime of Random Local Search on the Generalized Needle Problem
The Runtime of Random Local Search on the Generalized Needle Problem
Benjamin Doerr
A. J. Kelley
24
1
0
13 Mar 2024
Polynomially Over-Parameterized Convolutional Neural Networks Contain
  Structured Strong Winning Lottery Tickets
Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets
A. D. Cunha
Francesco d’Amore
Emanuele Natale
MLT
61
1
0
16 Nov 2023
Hardest Monotone Functions for Evolutionary Algorithms
Hardest Monotone Functions for Evolutionary Algorithms
Marc Kaufmann
Maxime Larcher
Johannes Lengler
Oliver Sieberling
57
2
0
13 Nov 2023
Bivariate Estimation-of-Distribution Algorithms Can Find an Exponential
  Number of Optima
Bivariate Estimation-of-Distribution Algorithms Can Find an Exponential Number of Optima
Benjamin Doerr
Martin S. Krejca
37
12
0
06 Oct 2023
Fast Coloring Despite Congested Relays
Fast Coloring Despite Congested Relays
Maxime Flin
Magnús M. Halldórsson
Alexandre Nolin
65
3
0
02 Aug 2023
Analysing the Robustness of NSGA-II under Noise
Analysing the Robustness of NSGA-II under Noise
D. Dang
Andre Opris
B. Salehi
Dirk Sudholt
94
24
0
07 Jun 2023
Runtime Analyses of Multi-Objective Evolutionary Algorithms in the
  Presence of Noise
Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise
Matthieu Dinot
Benjamin Doerr
Ulysse Hennebelle
S. Will
126
13
0
17 May 2023
Convergence and scaling of Boolean-weight optimization for hardware
  reservoirs
Convergence and scaling of Boolean-weight optimization for hardware reservoirs
Louis Andréoli
Stéphane Chrétien
X. Porte
Daniel Brunner
98
1
0
13 May 2023
Theoretical Analyses of Evolutionary Algorithms on Time-Linkage OneMax
  with General Weights
Theoretical Analyses of Evolutionary Algorithms on Time-Linkage OneMax with General Weights
Weijie Zheng
Xin Yao
44
1
0
11 May 2023
How Well Does the Metropolis Algorithm Cope With Local Optima?
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
Coloring Fast with Broadcasts
Coloring Fast with Broadcasts
Maxime Flin
M. Ghaffari
Magnús M. Halldórsson
Fabian Kuhn
Alexandre Nolin
91
7
0
19 Apr 2023
Comma Selection Outperforms Plus Selection on OneMax with Randomly
  Planted Optima
Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima
J. Jorritsma
Johannes Lengler
Dirk Sudholt
53
15
0
19 Apr 2023
3-Objective Pareto Optimization for Problems with Chance Constraints
3-Objective Pareto Optimization for Problems with Chance Constraints
Frank Neumann
Carsten Witt
26
5
0
18 Apr 2023
(1+1) Genetic Programming With Functionally Complete Instruction Sets
  Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error
(1+1) Genetic Programming With Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error
Benjamin Doerr
Andrei Lissovoi
P. S. Oliveto
19
1
0
13 Mar 2023
Evolutionary Multi-Objective Algorithms for the Knapsack Problems with
  Stochastic Profits
Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits
Kokila K. Perera
Aneta Neumann
Frank Neumann
110
0
0
03 Mar 2023
Estimation-of-Distribution Algorithms for Multi-Valued Decision
  Variables
Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables
Firas Ben Jedidia
Benjamin Doerr
Martin S. Krejca
36
8
0
28 Feb 2023
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms
  on Linear Functions
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
Carola Doerr
D. Janett
Johannes Lengler
61
2
0
23 Feb 2023
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
Benjamin Doerr
A. J. Kelley
86
5
0
16 Feb 2023
A Distributed Palette Sparsification Theorem
A Distributed Palette Sparsification Theorem
Maxime Flin
M. Ghaffari
Magnús M. Halldórsson
Fabian Kuhn
Alexandre Nolin
MoE
67
7
0
16 Jan 2023
Theoretical Study of Optimizing Rugged Landscapes with the cGA
Theoretical Study of Optimizing Rugged Landscapes with the cGA
Tobias Friedrich
Timo Kotzing
Frank Neumann
Aishwarya Radhakrishnan
38
8
0
24 Nov 2022
Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining
  the Inefficiency For Many Objectives
Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives
Weijie Zheng
Benjamin Doerr
98
28
0
23 Nov 2022
A Theory of Unsupervised Translation Motivated by Understanding Animal
  Communication
A Theory of Unsupervised Translation Motivated by Understanding Animal Communication
S. Goldwasser
David F. Gruber
Adam Tauman Kalai
Orr Paradise
76
3
0
20 Nov 2022
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic
  Algorithm III (NSGA-III)
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III)
Simon Wietheger
Benjamin Doerr
109
37
0
15 Nov 2022
Expected Worst Case Regret via Stochastic Sequential Covering
Expected Worst Case Regret via Stochastic Sequential Covering
Changlong Wu
Mohsen Heidari
A. Grama
Wojtek Szpankowski
71
12
0
09 Sep 2022
Smoothed Analysis of Information Spreading in Dynamic Networks
Smoothed Analysis of Information Spreading in Dynamic Networks
M. Dinitz
Jeremy T. Fineman
Seth Gilbert
Calvin C. Newport
63
4
0
11 Aug 2022
Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear
  Functions
Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions
Frank Neumann
Carsten Witt
122
2
0
11 Aug 2022
Runtime Analysis of Competitive co-Evolutionary Algorithms for Maximin
  Optimisation of a Bilinear Function
Runtime Analysis of Competitive co-Evolutionary Algorithms for Maximin Optimisation of a Bilinear Function
Per Kristian Lehre
117
14
0
30 Jun 2022
Overcoming Congestion in Distributed Coloring
Overcoming Congestion in Distributed Coloring
Magnús M. Halldórsson
Alexandre Nolin
Tigran Tonoyan
48
16
0
28 May 2022
The spatial computer: A model for energy-efficient parallel computation
The spatial computer: A model for energy-efficient parallel computation
Lukas Gianinazzi
Tal Ben-Nun
Maciej Besta
Saleh Ashkboos
Yves Baumann
Piotr Luczynski
Torsten Hoefler
79
5
0
10 May 2022
Run Time Analysis for Random Local Search on Generalized Majority
  Functions
Run Time Analysis for Random Local Search on Generalized Majority Functions
Carola Doerr
Martin S. Krejca
28
6
0
27 Apr 2022
OneMax is not the Easiest Function for Fitness Improvements
OneMax is not the Easiest Function for Fitness Improvements
Marc Kaufmann
Maxime Larcher
Johannes Lengler
Xun Zou
LRM
91
6
0
14 Apr 2022
Hard Problems are Easier for Success-based Parameter Control
Hard Problems are Easier for Success-based Parameter Control
Mario Alejandro Hevia Fajardo
Dirk Sudholt
51
6
0
12 Apr 2022
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the
  Knapsack Problem with Stochastic Profits
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits
Aneta Neumann
Yue Xie
Frank Neumann
65
15
0
12 Apr 2022
The Compact Genetic Algorithm Struggles on Cliff Functions
The Compact Genetic Algorithm Struggles on Cliff Functions
Frank Neumann
Dirk Sudholt
Carsten Witt
35
7
0
11 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 Functions
Marc Kaufmann
Maxime Larcher
Johannes Lengler
Xun Zou
105
10
0
01 Apr 2022
Two-Dimensional Drift Analysis: Optimizing Two Functions Simultaneously
  Can Be Hard
Two-Dimensional Drift Analysis: Optimizing Two Functions Simultaneously Can Be Hard
D. Janett
Johannes Lengler
47
3
0
28 Mar 2022
Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm
  II (NSGA-II)
Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
Weijie Zheng
Benjamin Doerr
88
10
0
05 Mar 2022
Simple Genetic Operators are Universal Approximators of Probability
  Distributions (and other Advantages of Expressive Encodings)
Simple Genetic Operators are Universal Approximators of Probability Distributions (and other Advantages of Expressive Encodings)
Elliot Meyerson
Xin Qiu
Risto Miikkulainen
74
5
0
19 Feb 2022
Runtime Analysis of Restricted Tournament Selection for Bimodal
  Optimisation
Runtime Analysis of Restricted Tournament Selection for Bimodal Optimisation
Edgar Covantes Osuna
Dirk Sudholt
21
6
0
17 Jan 2022
Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic
  Algorithm II (NSGA-II)
Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
Weijie Zheng
Benjamin Doerr
120
43
0
16 Dec 2021
Near-Optimal Distributed Degree+1 Coloring
Near-Optimal Distributed Degree+1 Coloring
Magnús M. Halldórsson
Fabian Kuhn
Alexandre Nolin
Tigran Tonoyan
55
39
0
01 Dec 2021
Mixability made efficient: Fast online multiclass logistic regression
Mixability made efficient: Fast online multiclass logistic regression
Rémi Jézéquel
Pierre Gaillard
Alessandro Rudi
76
11
0
08 Oct 2021
Choosing the Right Algorithm With Hints From Complexity Theory
Choosing the Right Algorithm With Hints From Complexity Theory
Shouda Wang
Weijie Zheng
Benjamin Doerr
117
17
0
14 Sep 2021
Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms
  for Chance Constrained Optimization Problems with Normally Distributed Random
  Variables
Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables
Frank Neumann
Carsten Witt
69
0
0
13 Sep 2021
Ultrafast Distributed Coloring of High Degree Graphs
Ultrafast Distributed Coloring of High Degree Graphs
Magnús M. Halldórsson
Alexandre Nolin
Tigran Tonoyan
35
7
0
10 May 2021
12
Next