aiqbench analysis
This research quantifies the optimal allocation of computational budgets for feature extraction in per-instance algorithm selection within black-box optimization frameworks. The study demonstrates that while investing up to 25% of the total budget on feature computation remains viable, the specific tradeoff varies significantly across different problem scenarios and portfolio sizes. For practitioners deploying adaptive solver strategies, these findings provide critical guidance on balancing the overhead of instance analysis against the gains from algorithmic diversity.
On the Influence of the Feature Computation Budget on Per-Instance Algorithm Selection for Black-Box Optimization
arXiv:2605.04954v3 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. This decision is based on features of the instances, which, in the context of black-box optimization (BBO), require a part of the optimization budget to be computed. This raises two questions: (a) from which fraction of the budget spent on feature computation does PIAS become worth it for BBO, and (b) which fraction of the budget optimizes the tradeoff between feature accuracy and PIAS performance. To this end, we perform a broad study where PIAS with varying sampling budgets for feature computation is compared to the single best algorithm on a broad range of algorithm selection scenarios. These scenarios consist of two portfolio sizes, three problem sets, 4 dimensionalities, and 10 target budgets. We find that PIAS is viable for the majority of tested scenarios, even when as much as a quarter of the total budget is spent on feature computation. The tradeoff for the fraction of the budget spent on feature computation to maximize the benefit of PIAS is highly dependent on the specific AS scenario. Further, on average 20 percent of PIAS loss to the virtual best solver is explained by the budget spent on feature computation, highlighting the importance of properly accounting for the feature budget.
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. This decision is based on features of the instances, which, in the context of black-box optimization (BBO), require a part of the optimization budget to be computed. This raises two questions: (a) from which fraction of the budget spent on feature computation does PIAS become worth it for BBO, and (b) which fraction of the budget optimizes the tradeoff between feature accuracy and PIAS performance. To this end, we perform a broad study where PIAS with varying sampling budgets for feature computation is compared to the single best algorithm on a broad range of algorithm selection scenarios. These scenarios consist of two portfolio sizes, three problem sets, 4 dimensionalities, and 10 target budgets. We find that PIAS is viable for the majority of tested scenarios, even when as much as a quarter of the total budget is spent on feature computation. The tradeoff for the fraction of the budget spent on feature computation to maximize the benefit of PIAS is highly dependent on the specific AS scenario. Further, on average 20 percent of PIAS loss to the virtual best solver is explained by the budget spent on feature computation, highlighting the importance of properly accounting for the feature budget.
Neural and Evolutionary Computing (cs.NE); Machine Learning (cs.LG)
arXiv:2605.04954 [cs.NE]
(or arXiv:2605.04954v3 [cs.NE] for this version)
https://doi.org/10.48550/arXiv.2605.04954 Focus to learn more arXiv-issued DOI via DataCite
https://doi.org/10.1007/978-3-032-36217-9_7 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 329 words
Related coverage
On the Influence of the Feature Computation Budget on Per-Instance Algorithm Selection for Black-Box Optimization
arXiv · Jun 15, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026

[AINews] not much happened today
Latent Space · Sep 18, 2026
Untrusted advice for AI control: Short, strong advice significantly uplifts weak LLMs
LessWrong · Jul 27, 2026