arXiv Machine Learning July 21, 2026 By Gjorgjina Cenikj, Ana Nikolikj, Ga\v{s}per Petelin, Niki van Stein, Carola Doerr, Tome Eftimov

A Survey of Features Used for Representing Black-box Single-objective Continuous Optimization

Read the original on arXiv Machine Learning →

arXiv:2406. 06629v2 Announce Type: replace Abstract: This survey examines key advancements in designing features to represent optimization problem instances, algorithm instances, and their interactions within the context of single-objective continuous black-box optimization.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

benchmarks

arXiv Machine Learning

Jun 2

Evaluating Real-World Generalizability of Algorithm Selection Models

arXiv:2606. 02016v1 Announce Type: new Abstract: Algorithm Selection (AS) aims to automatically identify the most suitable optimization algorithm for a given problem instance by leveraging measurable problem characteristics and historical performance data.

By Gjorgjina Cenikj, Jakub Kudela, Eva Tuba, Tome Eftimov

robotics benchmarks

arXiv Machine Learning

Sep 16

Meta-Learning-Assisted Constraint Relaxation for Constrained Black-Box Optimization

arXiv:2602.00532v2 Announce Type: replace-cross Abstract: Constraint handling is central to constrained black-box optimization (BBO), where objective improvement and feasibility restoration often pro...

By Sijie Ma, Zeyuan Ma, Yue-Jiao Gong, Ran Cheng

benchmarks

arXiv Machine Learning

Jun 15

On the Influence of the Feature Computation Budget on Per-Instance Algorithm Selection for Black-Box Optimization

arXiv:2605. 04954v2 Announce Type: replace-cross Abstract: Per-instance algorithm selection (PIAS) takes advantage of complementarity between a set of algorithms by deciding which algorithm to run on a given instance.

By Koen van der Blom, Diederick Vermetten

arXiv Machine Learning

Jul 31

FunL2O: LLM-Guided Feature Function Design for Learning to Optimize

arXiv:2607. 27389v1 Announce Type: new Abstract: Learning-to-optimize (L2O) methods accelerate repeated optimization by training models to predict solutions, warm starts, branching decisions, or other forms of solver guidance.

By Bingheng Li, Junyang Cai, Yupeng Zhang, Bistra Dilkina, Jayant Kalagnanam, Dzung T. Phan

llms

Hugging Face Trending Papers

Sep 15

Continuous-Time Machine Learning: A Unified Mathematical Perspective

Continuous-time (CT) machine learning has emerged as a principled framework for modeling temporal dynamics as a continuous process, particularly when observations are sampled at arbitrary time points...

benchmarks

arXiv AI

Sep 2

Rethinking Learnability in Offline Data-driven Optimization

arXiv:2609.01493v1 Announce Type: cross Abstract: Black-Box Optimization (BBO) has found broad applications, but evolutionary algorithms and Bayesian optimization face efficiency challenges as real-w...

By Chao Qian, Chen-Guang Wang, Rong-Xi Tan, Ke Xue

diffusion

One email a morning, machine-written

Related stories

Evaluating Real-World Generalizability of Algorithm Selection Models

Meta-Learning-Assisted Constraint Relaxation for Constrained Black-Box Optimization

On the Influence of the Feature Computation Budget on Per-Instance Algorithm Selection for Black-Box Optimization

FunL2O: LLM-Guided Feature Function Design for Learning to Optimize

Continuous-Time Machine Learning: A Unified Mathematical Perspective

Rethinking Learnability in Offline Data-driven Optimization