Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
A Blum, K Ravichandran - arXiv preprint arXiv:2404.01198, 2024 - arxiv.org
We give nearly-tight upper and lower bounds for the improving multi-armed bandits problem.
An instance of this problem has $ k $ arms, each of whose reward function is a concave and …
An instance of this problem has $ k $ arms, each of whose reward function is a concave and …