1 citations · 1 across the 3 of their papers we have counts for
Showing stat.MLShow all
2 papers · 1 filter
stat.ML2025
Identifying All ε-Best Arms in (Misspecified) Linear Bandits
Zhekai Li, Tianyi Ma, Cheng Hua +1
Motivated by the need to efficiently identify multiple candidates in high trial-and-error cost tasks such as drug discovery, we propose a near-optimal algorithm to identify all ε-b…
stat.ML2024★ 1 cited
Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution
Qing Feng, Tianyi Ma, Ruihao Zhu
Motivated by the concept of satisficing in decision-making, we consider the problem of satisficing regret minimization in bandit optimization. In this setting, the learner aims at…