Cover Image

Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bendahi, Abderrahim, Doerr, Benjamin, Fradin, Adrien, Lutzeyer, Johannes F.
Format:	Preprint
Published:	2025
Subjects:	Neural and Evolutionary Computing Artificial Intelligence Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

On Constrained and k Shortest Paths
by: Bendahi, Abderrahim, et al.
Published: (2024)

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

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

Unlearning Works Better Than You Think: Local Reinforcement-Based Selection of Auxiliary Objectives
by: Bendahi, Abderrahim, et al.
Published: (2025)

The Runtime of Random Local Search on the Generalized Needle Problem
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)

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

Stability and Discretization Error of State Space Model Neural Operators
by: Bendahi, Abderrahim, et al.
Published: (2026)

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)

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

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

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

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

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

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)

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

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

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

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

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

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

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

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

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

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

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

Succinct Planar Encoding with Minor Operations
by: Kammer, Frank, et al.
Published: (2023)

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

Large-scale Benchmarking of Metaphor-based Optimization Heuristics
by: Vermetten, Diederick, et al.
Published: (2024)

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

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

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

Markov Chains with Rewinding
by: Azarmehr, Amir, et al.
Published: (2026)

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

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

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