Imagen de Portada

Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Doerr, Benjamin, Krejca, Martin S., Weeks, Noé
Formato:	Preprint
Publicado:	2024
Materias:	Neural and Evolutionary Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
por: Doerr, Benjamin, et al.
Publicado: (2025)

Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II
por: Alghouass, Yasser, et al.
Publicado: (2025)

Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark
por: Chwiałkowski, Marcel, et al.
Publicado: (2025)

Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces
por: Doerr, Benjamin, et al.
Publicado: (2024)

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
por: Wietheger, Simon, et al.
Publicado: (2024)

Speeding Up the NSGA-II With a Simple Tie-Breaking Rule
por: Doerr, Benjamin, et al.
Publicado: (2024)

Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem
por: Doerr, Benjamin, et al.
Publicado: (2024)

Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics
por: Doerr, Benjamin, et al.
Publicado: (2024)

Speeding Up the NSGA-II via Dynamic Population Sizes
por: Doerr, Benjamin, et al.
Publicado: (2025)

Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables
por: Jedidia, Firas Ben, et al.
Publicado: (2023)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
por: Doerr, Benjamin, et al.
Publicado: (2025)

Runtime Analysis of a Compact Genetic Algorithm on a Truly Multi-valued OneMax Function
por: Krejca, Martin S., et al.
Publicado: (2026)

Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
por: Zheng, Weijie, et al.
Publicado: (2023)

First Steps Towards a Runtime Analysis When Starting With a Good Solution
por: Antipov, Denis, et al.
Publicado: (2020)

Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives
por: Zheng, Weijie, et al.
Publicado: (2022)

The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
por: Deng, Renzhong, et al.
Publicado: (2025)

First Mathematical Runtime Analyses of Multi-Objective Evolutionary Algorithms for Multi-Valued Decision Variables
por: Li, Mingfeng, et al.
Publicado: (2026)

Runtime Analysis for Permutation-based Evolutionary Algorithms
por: Doerr, Benjamin, et al.
Publicado: (2022)

A Flexible Evolutionary Algorithm With Dynamic Mutation Rate Archive
por: Krejca, Martin S., et al.
Publicado: (2024)

Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover
por: Doerr, Benjamin, et al.
Publicado: (2022)

Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
por: Zheng, Weijie, et al.
Publicado: (2022)

Mapping Literature Landscapes with Data-Driven Discovery: A Case Study on MOEA/D
por: Huang, Mingyu, et al.
Publicado: (2024)

Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
por: Doerr, Benjamin, et al.
Publicado: (2023)

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
por: Doerr, Carola, et al.
Publicado: (2023)

Optimal Distribution of Solutions for Crowding Distance on Linear Pareto Fronts of Two-Objective Optimization Problems
por: Ishibuchi, Hisao, et al.
Publicado: (2025)

Improving MSA Estimation through Adaptive Weight Vectors in MOEA/D
por: Hasan, Saem, et al.
Publicado: (2025)

Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It
por: Antipov, Denis, et al.
Publicado: (2024)

The Runtime of Random Local Search on the Generalized Needle Problem
por: Doerr, Benjamin, et al.
Publicado: (2024)

A GP-MOEA/D Approach for Modelling Total Electron Content over Cyprus
por: Konstantinidis, Andreas, et al.
Publicado: (2011)

Finding Low Star Discrepancy 3D Kronecker Point Sets Using Algorithm Configuration Techniques
por: Abderrahim, Imène Ait, et al.
Publicado: (2026)

How Sequential Algorithm Portfolios can benefit Black Box Optimization
por: Dinu, Catalin-Viorel, et al.
Publicado: (2026)

A First Runtime Analysis of the NSGA-II on a Multimodal Problem
por: Doerr, Benjamin, et al.
Publicado: (2022)

A Newton Method for Hausdorff Approximations of the Pareto Front within Multi-objective Evolutionary Algorithms
por: Wang, Hao, et al.
Publicado: (2024)

Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution
por: Antipov, Denis, et al.
Publicado: (2021)

Cascading CMA-ES Instances for Generating Input-diverse Solution Batches
por: Santoni, Maria Laura, et al.
Publicado: (2025)

A Compute and Communication Runtime Model for Loihi 2
por: Timcheck, Jonathan, et al.
Publicado: (2026)

Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives
por: Zheng, Weijie, et al.
Publicado: (2020)

Lower Bounds from Fitness Levels Made Easy
por: Doerr, Benjamin, et al.
Publicado: (2021)

Pareto-NRPA: A Novel Monte-Carlo Search Algorithm for Multi-Objective Optimization
por: Lallouet, Noé, et al.
Publicado: (2025)

Enhancing Parameter Control Policies with State Information
por: Covini, Gianluca, et al.
Publicado: (2025)