arXiv Machine Learning
Geometric Probing for Algorithm Selection in Continuous Black-Box Optimization
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 21
A Survey of Features Used for Representing Black-box Single-objective Continuous Optimization
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.
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.
arXiv Machine Learning
Jul 23
NeuroPareto: Calibrated Acquisition for Costly Many-Goal Search in Vast Parameter Spaces
arXiv:2602. 03901v5 Announce Type: replace Abstract: The pursuit of optimal trade-offs in high-dimensional search spaces under stringent computational constraints poses a fundamental challenge for contemporary multi-objective optimization.
arXiv Machine Learning
Oct 15
In-Context Batch Black-box Optimization via Flow Matching
In-Context Batch Black-box Optimization via Flow Matching introduces FMTR, an amortized method that learns a continuous, history-conditioned proposal distribution for variable-size batch sampling in expensive black-box optimization settings. FMTR is trained offline using conditional flow matching on Thompson-sampling argmaxes refined through a horizon-dependent Langevin pushforward map, enabling adaptive exploration-exploitation over the optimization horizon. At test time, FMTR generates batches without task-specific surrogate refitting or numerical acquisition optimization, achieving strong performance on synthetic and real-world benchmarks while significantly reducing batch selection computational cost.
arXiv AI
Jul 28
DecoupleMix: Decoupled Ratio Search and Convex Allocation for Scalable VLM Data Recipes
arXiv:2607. 24516v1 Announce Type: cross Abstract: While data curation for Vision Language Models (VLMs) is increasingly active, public practice for constructing pretraining mixtures remains largely heuristic: practitioners stack datasets that pass quality filters, set cross-domain ratios by intuition, and lack a principled, attributable criterion for admitting new data, while frontier recipes remain undisclosed.
arXiv Machine Learning
Jun 2
Meta-Black-Box Optimization with Ensemble Surrogate Modeling for Robustness-Accuracy Trade-off within SAEA
arXiv:2606. 00862v1 Announce Type: cross Abstract: Surrogate-assisted evolutionary algorithms (SAEAs) have been widely used for expensive black-box optimization problems.