Imagen de Portada

The Runtime of Random Local Search on the Generalized Needle Problem

Fuente: arXiv

Guardado en:

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

Ejemplares similares

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

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

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

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

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

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

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

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)

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)

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

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

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

A Scalable Trie Building Algorithm for High-Throughput Phyloanalysis of Wafer-Scale Digital Evolution Experiments
por: Singhvi, Vivaan, 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)

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

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

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

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

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

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

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

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

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

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

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

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

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)

Already Moderate Population Sizes Provably Yield Strong Robustness to Noise
por: Antipov, Denis, et al.
Publicado: (2024)

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

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

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

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

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

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

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

Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
por: Doerr, Benjamin, 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)