Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2306.02611
Cited By
Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms
5 June 2023
Chao Bian
Yawen Zhou
M. Li
Chao Qian
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms"
22 / 22 papers shown
Title
Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy
Mingfeng Li
Weijie Zheng
Benjamin Doerr
22
0
0
03 May 2025
Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
Benjamin Doerr
Martin S. Krejca
Andre Opris
24
0
0
02 May 2025
A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update
Andre Opris
26
0
0
02 May 2025
Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II
Yasser Alghouass
Benjamin Doerr
Martin S. Krejca
Mohammed Lagmah
35
0
0
02 May 2025
The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
Renzhong Deng
Weijie Zheng
Benjamin Doerr
28
0
0
30 Apr 2025
Multi-objective Pseudo Boolean Functions in Runtime Analysis: A Review
Zimin Liang
M. Li
34
0
0
24 Mar 2025
Offline Multi-Objective Optimization
Ke Xue
Rong-Xi Tan
Xiaobin Huang
Chao Qian
OffRL
51
5
0
06 Jun 2024
Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization
Shengjie Ren
Zhijia Qiu
Chao Bian
Miqing Li
Chao Qian
36
5
0
04 Jun 2024
An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms
Chao Bian
Shengjie Ren
Miqing Li
Chao Qian
35
4
0
04 Jun 2024
Illustrating the Efficiency of Popular Evolutionary Multi-Objective Algorithms Using Runtime Analysis
D. Dang
Andre Opris
Dirk Sudholt
25
2
0
22 May 2024
Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
Simon Wietheger
Benjamin Doerr
24
6
0
19 Apr 2024
A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis
Benjamin Doerr
Joshua Knowles
Aneta Neumann
Frank Neumann
24
0
0
04 Apr 2024
Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
Weijie Zheng
Benjamin Doerr
22
18
0
16 Dec 2023
Towards Running Time Analysis of Interactive Multi-objective Evolutionary Algorithms
Tianhao Lu
Chao Bian
Chao Qian
26
4
0
12 Oct 2023
The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem
Sacha Cerf
Benjamin Doerr
Benjamin Hebras
Yakob Kahane
Simon Wietheger
34
32
0
22 May 2023
How Well Does the Metropolis Algorithm Cope With Local Optima?
Benjamin Doerr
Taha El Ghazi El Houssaini
A. Rajabi
Carsten Wit
19
6
0
21 Apr 2023
How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs
Benjamin Doerr
Arthur Dremaux
J. Lutzeyer
Aurélien Stumpf
18
5
0
20 Apr 2023
Multi-Objective Archiving
M. Li
Manuel López-Ibánez
Xin Yao
33
10
0
16 Mar 2023
Can Evolutionary Clustering Have Theoretical Guarantees?
Chao Qian
24
3
0
04 Dec 2022
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III)
Simon Wietheger
Benjamin Doerr
20
35
0
15 Nov 2022
Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
Weijie Zheng
Benjamin Doerr
16
8
0
05 Mar 2022
Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
Weijie Zheng
Benjamin Doerr
19
39
0
16 Dec 2021
1
