12 citations · 18 across the 9 of their papers we have counts for
3 papers · 1 filter
Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors
Kapilan Balagopalan, Yinan Li, Yao Zhao +4
The best-arm identification (BAI) problem is one of the most fundamental problems in interactive machine learning, which has two flavors: the fixed-budget setting (FB) and the fixe…
Instance-optimal PAC Algorithms for Contextual Bandits
Zhaoqi Li, Lillian Ratliff, Houssam Nassif +2
In the stochastic contextual bandit setting, regret-minimizing algorithms have been extensively researched, but their instance-minimizing best-arm identification counterparts remai…
Improved Confidence Bounds for the Linear Logistic Model and Applications to Linear Bandits
Kwang-Sung Jun, Lalit Jain, Blake Mason +1
We propose improved fixed-design confidence bounds for the linear logistic model. Our bounds significantly improve upon the state-of-the-art bound by Li et al. (2017) via recent de…