6 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.LG2021★ 6 cited
A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms
Anand Kalvit, Assaf Zeevi
One of the key drivers of complexity in the classical (stochastic) multi-armed bandit (MAB) problem is the difference between mean rewards in the top two arms, also known as the in…
cs.LG2021★ 2 cited
From Finite to Countable-Armed Bandits
Anand Kalvit, Assaf Zeevi
We consider a stochastic bandit problem with countably many arms that belong to a finite set of types, each characterized by a unique mean reward. In addition, there is a fixed dis…