:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Doerr, Benjamin, Kelley, Andrew James
Format:	Preprint
Published:	2023
Subjects:	Neural and Evolutionary Computing Artificial Intelligence Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2302.08021
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Runtime Analysis of Evolutionary Algorithms for Multi-party Multi-objective Optimization
by: Sun, Yuetong, et al.
Published: (2025)

Abstraction in Neural Networks
by: Lynch, Nancy
Published: (2024)

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

Training Neural Networks is NP-Hard in Fixed Dimension
by: Froese, Vincent, et al.
Published: (2023)

ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
by: Hertrich, Christoph, et al.
Published: (2021)

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

Covered Forest: Fine-grained generalization analysis of graph neural networks
by: Vasileiou, Antonis, et al.
Published: (2024)

Local search for valued constraint satisfaction parameterized by treedepth
by: Kaznatcheev, Artem
Published: (2024)

Stringology-Based Motif Discovery from EEG Signals: an ADHD Case Study
by: Dahan, Anat, et al.
Published: (2026)

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

Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions
by: Doerr, Benjamin, et al.
Published: (2024)

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

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)

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

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

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