Research map / Bandits and online learning / Multi-armed bandits
Constrained Best Arm Identification
Tyron Darnell Lardy, Christina Katsimerou, Wouter M Koolen
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Studies constrained best-arm identification in bandits where each arm yields dependent reward and cost, aiming to find the highest-reward arm satisfying a cost constraint.
Problem
Identifying the best arm (highest reward) among bandit arms whose reward and cost are jointly distributed and dependent, subject to an economic cost constraint.
Approach
Treats every arm as a joint reward-cost distribution with possible dependence between reward and cost, rather than assuming independence, and studies identification of the best feasible arm under this general case.
Closest papers by meaning
- Balancing Performance and Costs in Best Arm Identification (NeurIPS 2025 · similarity 0.93)
- Optimal Multi-Fidelity Best-Arm Identification (NeurIPS 2024 · similarity 0.92)
- Near Optimal Best Arm Identification for Clustered Bandits (ICML 2025 · similarity 0.91)
- Fixed-Budget Differentially Private Best Arm Identification (ICLR 2024 · similarity 0.91)
- Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits (NeurIPS 2024 · similarity 0.90)
- Best Arm Identification in Generalized Linear Bandits via Hybrid Feedback (NeurIPS 2026 · similarity 0.90)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
