Imagen de Portada

A First Runtime Analysis of the NSGA-II on a Multimodal Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Doerr, Benjamin, Qu, Zhongdi
Formato:	Preprint
Publicado:	2022
Materias:	Neural and Evolutionary Computing Artificial Intelligence Data Structures and Algorithms Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems
por: Doerr, Benjamin, et al.
Publicado: (2026)

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

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

Hyper-Heuristics Can Profit From Global Variation Operators
por: Doerr, Benjamin, et al.
Publicado: (2024)

How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs
por: Doerr, Benjamin, et al.
Publicado: (2023)

Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator
por: Bendahi, Abderrahim, et al.
Publicado: (2025)

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

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

Classical Sorting Algorithms as a Model of Morphogenesis: self-sorting arrays reveal unexpected competencies in a minimal model of basal intelligence
por: Zhang, Taining, et al.
Publicado: (2023)

A Crowding Distance That Provably Solves the Difficulties of the NSGA-II in Many-Objective Optimization
por: Zheng, Weijie, et al.
Publicado: (2024)

Predictive Spike Timing Enables Distributed Shortest Path Computation in Spiking Neural Networks
por: Storesund, Simen, et al.
Publicado: (2025)

Which Algorithms Can Graph Neural Networks Learn?
por: Wittig, Solveig, et al.
Publicado: (2026)

A Scalable Trie Building Algorithm for High-Throughput Phyloanalysis of Wafer-Scale Digital Evolution Experiments
por: Singhvi, Vivaan, et al.
Publicado: (2025)

Multi-Neuron Representations of Hierarchical Concepts in Spiking Neural Networks
por: Lynch, Nancy A.
Publicado: (2024)

Convergence and Running Time of Time-dependent Ant Colony Algorithms
por: Manthey, Bodo, et al.
Publicado: (2025)

Biased Pareto Optimization for Subset Selection with Dynamic Cost Constraints
por: Liu, Dan-Xuan, et al.
Publicado: (2024)

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

Halfway Escape Optimization: A Quantum-Inspired Solution for General Optimization Problems
por: Li, Jiawen, et al.
Publicado: (2024)

Addressing Unboundedness in Quadratically-Constrained Mixed-Integer Problems
por: Zepko, Guy, et al.
Publicado: (2024)

Performance Comparison of Surrogate-Assisted Evolutionary Algorithms on Computational Fluid Dynamics Problems
por: Kudela, Jakub, et al.
Publicado: (2024)

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

A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem
por: Xu, Xiaoyang, et al.
Publicado: (2023)

Learning to Approximate Uniform Facility Location via Graph Neural Networks
por: Qian, Chendi, et al.
Publicado: (2026)

Conserving Human Creativity with Evolutionary Generative Algorithms: A Case Study in Music Generation
por: Kilb, Justin, et al.
Publicado: (2024)

An Improved NSGA-II with local search for multi-objective energy-efficient flowshop scheduling problem
por: Pesaru, Vigneshwar, et al.
Publicado: (2025)

Using the Empirical Attainment Function for Analyzing Single-objective Black-box Optimization Algorithms
por: López-Ibáñez, Manuel, et al.
Publicado: (2024)

Dynamic Detection of Relevant Objectives and Adaptation to Preference Drifts in Interactive Evolutionary Multi-Objective Optimization
por: Shavarani, Seyed Mahdi, et al.
Publicado: (2024)

HiFo-Prompt: Prompting with Hindsight and Foresight for LLM-based Automatic Heuristic Design
por: Chen, Chentong, et al.
Publicado: (2025)

Correlated Mutations for Integer Programming
por: Shir, Ofer M., et al.
Publicado: (2025)

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

A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
por: Marino, Raffaele, et al.
Publicado: (2024)

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

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

Abstraction in Neural Networks
por: Lynch, Nancy
Publicado: (2024)

Convergence Analysis for Deep Sparse Coding via Convolutional Neural Networks
por: Li, Jianfei, et al.
Publicado: (2024)

GBO:AMulti-Granularity Optimization Algorithm via Granular-ball for Continuous Problems
por: Xia, Shuyin, et al.
Publicado: (2023)

How Multimodal Integration Boost the Performance of LLM for Optimization: Case Study on Capacitated Vehicle Routing Problems
por: Huang, Yuxiao, et al.
Publicado: (2024)

A Technique Based on Trade-off Maps to Visualise and Analyse Relationships Between Objectives in Optimisation Problems
por: Pinheiro, Rodrigo Lankaites, et al.
Publicado: (2025)

A Survey on Algorithmic Developments in Optimal Transport Problem with Applications
por: Moradi, Sina
Publicado: (2025)