11 citations · 24 across the 20 of their papers we have counts for
Showing stat.MLShow all
3 papers · 1 filter
stat.ML2020
Minimax Policy for Heavy-tailed Bandits
Lai Wei, Vaibhav Srivastava
We study the stochastic Multi-Armed Bandit (MAB) problem under worst-case regret and heavy-tailed reward distribution. We modify the minimax policy MOSS for the sub-Gaussian reward…
stat.ML2018
On Distributed Multi-player Multiarmed Bandit Problems in Abruptly Changing Environment
Lai Wei, Vaibhav Srivastava
We study the multi-player stochastic multiarmed bandit (MAB) problem in an abruptly changing environment. We consider a collision model in which a player receives reward at an arm…
stat.ML2018
On Abruptly-Changing and Slowly-Varying Multiarmed Bandit Problems
Lai Wei, Vaibhav Srivastava
We study the non-stationary stochastic multiarmed bandit (MAB) problem and propose two generic algorithms, namely, the limited memory deterministic sequencing of exploration and ex…