Copertina

Hyper-Heuristics Can Profit From Global Variation Operators

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Doerr, Benjamin, Lutzeyer, Johannes F.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Neural and Evolutionary Computing Artificial Intelligence Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Abstraction in Neural Networks
di: Lynch, Nancy
Pubblicazione: (2024)

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

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

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

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

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

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

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

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

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

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

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

In-the-loop Hyper-Parameter Optimization for LLM-Based Automated Design of Heuristics
di: van Stein, Niki, et al.
Pubblicazione: (2024)

ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution
di: Ye, Haoran, et al.
Pubblicazione: (2024)

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

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

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

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

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

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

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

Explainable Benchmarking for Iterative Optimization Heuristics
di: van Stein, Niki, et al.
Pubblicazione: (2024)

On the Complexity of Neural Computation in Superposition
di: Adler, Micah, et al.
Pubblicazione: (2024)

AHD Agent: Agentic Reinforcement Learning for Automatic Heuristic Design
di: Lv, Haoze, et al.
Pubblicazione: (2026)