Image de couverture de livre

Finding Low Star Discrepancy 3D Kronecker Point Sets Using Algorithm Configuration Techniques

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Abderrahim, Imène Ait, Doerr, Carola, Durand, Martin
Format:	Preprint
Publié:	2026
Sujets:	Neural and Evolutionary Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

When Switching Algorithms Helps: A Theoretical Study of Online Algorithm Selection
par: Antipov, Denis, et autres
Publié: (2026)

How Sequential Algorithm Portfolios can benefit Black Box Optimization
par: Dinu, Catalin-Viorel, et autres
Publié: (2026)

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
par: Doerr, Carola, et autres
Publié: (2023)

Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics
par: Doerr, Benjamin, et autres
Publié: (2024)

Impact of Training Instance Selection on Automated Algorithm Selection Models for Numerical Black-box Optimization
par: Dietrich, Konstantin, et autres
Publié: (2024)

Hybridizing Target- and SHAP-encoded Features for Algorithm Selection in Mixed-variable Black-box Optimization
par: Dietrich, Konstantin, et autres
Publié: (2024)

On the Importance of Reward Design in Reinforcement Learning-based Dynamic Algorithm Configuration: A Case Study on OneMax with (1+($λ$,$λ$))-GA
par: Nguyen, Tai, et autres
Publié: (2025)

Sampling in CMA-ES: Low Numbers of Low Discrepancy Points
par: de Nobel, Jacob, et autres
Publié: (2024)

Enhancing Parameter Control Policies with State Information
par: Covini, Gianluca, et autres
Publié: (2025)

Using the Empirical Attainment Function for Analyzing Single-objective Black-box Optimization Algorithms
par: López-Ibáñez, Manuel, et autres
Publié: (2024)

Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark
par: Chwiałkowski, Marcel, et autres
Publié: (2025)

Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces
par: Doerr, Benjamin, et autres
Publié: (2024)

Similarity-based Portfolio Construction for Black-box Optimization
par: Dinu, Catalin-Viorel, et autres
Publié: (2026)

Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables
par: Jedidia, Firas Ben, et autres
Publié: (2023)

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
par: Wietheger, Simon, et autres
Publié: (2024)

Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It
par: Antipov, Denis, et autres
Publié: (2024)

Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances
par: Nikolikj, Ana, et autres
Publié: (2023)

Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions
par: Doerr, Benjamin, et autres
Publié: (2024)

The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
par: Deng, Renzhong, et autres
Publié: (2025)

Quantifying Individual and Joint Module Impact in Modular Optimization Frameworks
par: Nikolikj, Ana, et autres
Publié: (2024)

Empirical Analysis of the Dynamic Binary Value Problem with IOHprofiler
par: Vermetten, Diederick, et autres
Publié: (2024)

MO-IOHinspector: Anytime Benchmarking of Multi-Objective Algorithms using IOHprofiler
par: Vermetten, Diederick, et autres
Publié: (2024)

On the Structural (Dis)Agreement of Landscape Representations in Black-Box Optimization
par: Gjorgjieva, Sara, et autres
Publié: (2026)

Large-scale Benchmarking of Metaphor-based Optimization Heuristics
par: Vermetten, Diederick, et autres
Publié: (2024)

Cascading CMA-ES Instances for Generating Input-diverse Solution Batches
par: Santoni, Maria Laura, et autres
Publié: (2025)

Speeding Up the NSGA-II With a Simple Tie-Breaking Rule
par: Doerr, Benjamin, et autres
Publié: (2024)

Speeding Up the NSGA-II via Dynamic Population Sizes
par: Doerr, Benjamin, et autres
Publié: (2025)

Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem
par: Doerr, Benjamin, et autres
Publié: (2024)

Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
par: Doerr, Benjamin, et autres
Publié: (2025)

First Mathematical Runtime Analyses of Multi-Objective Evolutionary Algorithms for Multi-Valued Decision Variables
par: Li, Mingfeng, et autres
Publié: (2026)

Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives
par: Zheng, Weijie, et autres
Publié: (2020)

Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
par: Zheng, Weijie, et autres
Publié: (2022)

Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
par: Zheng, Weijie, et autres
Publié: (2023)

Multi-parameter Control for the $(1+(λ,λ))$-GA on OneMax via Deep Reinforcement Learning
par: Nguyen, Tai, et autres
Publié: (2025)

Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II
par: Alghouass, Yasser, et autres
Publié: (2025)

Runtime Analysis for Permutation-based Evolutionary Algorithms
par: Doerr, Benjamin, et autres
Publié: (2022)

Finding Sets of Pareto Sets in Real-World Scenarios -- A Multitask Multiobjective Perspective
par: Liu, Jiao, et autres
Publié: (2026)

Generalization Ability of Feature-based Performance Prediction Models: A Statistical Analysis across Benchmarks
par: Nikolikj, Ana, et autres
Publié: (2024)

Neuromorphic Control for 3D Navigation in Minecraft Using Genetic Algorithms
par: Zipor, Eric
Publié: (2026)

Finding Strong Lottery Ticket Networks with Genetic Algorithms
par: Altmann, Philipp, et autres
Publié: (2024)