Cover Image

Already Moderate Population Sizes Provably Yield Strong Robustness to Noise

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Antipov, Denis, Doerr, Benjamin, Ivanova, Alexandra
Format:	Preprint
Published:	2024
Subjects:	Neural and Evolutionary Computing Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

When Switching Algorithms Helps: A Theoretical Study of Online Algorithm Selection
by: Antipov, Denis, et al.
Published: (2026)

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

Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential
by: Antipov, Denis, et al.
Published: (2024)

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

Parent Selection Mechanisms in Elitist Crossover-Based Algorithms
by: Opris, Andre, et al.
Published: (2026)

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

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

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

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

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

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

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

Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem
by: Antipov, Denis, et al.
Published: (2024)

Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem
by: Pathiranage, Ishara Hewa, et al.
Published: (2024)

Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy
by: Li, Mingfeng, et al.
Published: (2025)

An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics
by: Bambury, Henry, et al.
Published: (2021)

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

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

A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis
by: Doerr, Benjamin, et al.
Published: (2024)

Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms
by: Bian, Chao, et al.
Published: (2023)

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

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

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

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

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

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

Spiffy: Efficient Implementation of CoLaNET for Raspberry Pi
by: Derzhavin, Andrey, et al.
Published: (2025)

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

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

Continual Learning with Columnar Spiking Neural Networks
by: Larionov, Denis, et al.
Published: (2025)

Enabling Population-Level Parallelism in Tree-Based Genetic Programming for GPU Acceleration
by: Wu, Zhihong, et al.
Published: (2025)

Decentralised Emergence of Robust and Adaptive Linguistic Conventions in Populations of Autonomous Agents Grounded in Continuous Worlds
by: Ekila, Jérôme Botoko, et al.
Published: (2024)

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

Multi-compartment Neuron and Population Encoding Powered Spiking Neural Network for Deep Distributional Reinforcement Learning
by: Sun, Yinqian, et al.
Published: (2023)

Provable Benefits of Complex Parameterizations for Structured State Space Models
by: Ran-Milo, Yuval, et al.
Published: (2024)

Bridging Models to Defend: A Population-Based Strategy for Robust Adversarial Defense
by: Wang, Ren, et al.
Published: (2023)

Multi-Texture Synthesis through Signal Responsive Neural Cellular Automata
by: Catrina, Mirela-Magdalena, et al.
Published: (2024)

Modular Growth of Hierarchical Networks: Efficient, General, and Robust Curriculum Learning
by: Hamidi, Mani, et al.
Published: (2024)

TurboEvolve: Towards Fast and Robust LLM-Driven Program Evolution
by: Yang, Yang, et al.
Published: (2026)