mlsanityData to 7 Oct 2026

Learning with a Budget: Identifying the Best Arm with Resource Constraints

arXiv 2602.24146 ↗First posted 27 Feb 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

In many applications, evaluating the effectiveness of different alternatives comes with varying costs or resource usage. Motivated by such heterogeneity, we study the Best Arm Identification with Resource Constraints (BAIwRC) problem, where an agent seeks to identify the best alternative (aka arm) in the presence of resource constraints. Each arm pull consumes one or more types of limited resources. We make two key contributions. First, we propose the Successive Halving with Resource Rationing (SH-RR) algorithm, which integrates resource-aware allocation into the classical successive halving framework on best arm identification. The SH-RR algorithm unifies the theoretical analysis for both the stochastic and deterministic consumption settings, with a new textiteffective consumption measure

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 45 references that are in the map. First posted on arXiv 27 Feb 2026.

Builds on

23 of 45 references.

References · 23

  1. 2018A Tutorial on Bayesian Optimizationcited by 734
  2. 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Modelscited by 280
  3. 2015Non-stochastic Best Arm Identification and Hyperparameter Optimizationcited by 219
  4. 2018A System for Massively Parallel Hyperparameter Tuningcited by 201
  5. 2013Bandits with Knapsackscited by 163
  6. 2013lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Banditscited by 148
  7. 2017Multi-fidelity Bayesian Optimisation with Continuous Approximationscited by 120
  8. 2014Bandits with concave rewards and convex knapsackscited by 83
  9. 2016Multi-Information Source Optimizationcited by 83
  10. 2015Linear Contextual Bandits with Knapsackscited by 82
  11. 2016Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problemcited by 79
  12. 2018Stagewise Safe Bayesian Optimization with Gaussian Processescited by 79
11 more
  1. 2020Cost-aware Bayesian Optimizationcited by 41
  2. 2017Combinatorial Semi-Bandits with Knapsackscited by 23
  3. 2022Multi-Fidelity Cost-Aware Bayesian Optimizationcited by 20
  4. 2022Almost Optimal Variance-Constrained Best Arm Identificationcited by 16
  5. 2019Cost-aware Multi-objective Bayesian optimisationcited by 8
  6. 2022Bayesian Optimization Over Iterative Learners with Structured Responses: A Budget-aware Planning Approachcited by 8
  7. 2023Dual-Directed Algorithm Design for Efficient Pure Explorationcited by 6
  8. 2015Efficient Ranking and Selection in Parallel Computing Environmentscited by 5
  9. 2020Pareto-efficient Acquisition Functions for Cost-Aware Bayesian Optimizationcited by 5
  10. 2021A resource-efficient method for repeated HPO and NAS problemscited by 5
  11. 2023A Budget-Adaptive Allocation Rule for Optimal Computing Budget Allocationcited by 2

Built on by

Not cited yet.