A Closer Look at the Worst-case Behavior of Multi-armed Bandit
Algorithms

v1v2v3 (latest)

A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms

3 June 2021

ArXiv (abs)PDF HTML

Papers citing "A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms"

8 / 8 papers shown

Title
A characterization of sample adaptivity in UCB data Yilun Chen Jiaqi Lu 65 0 0 06 Mar 2025
Zero-Inflated Bandits Haoyu Wei Runzhe Wan Lei Shi Rui Song 104 0 0 25 Dec 2023
Generalized Regret Analysis of Thompson Sampling using Fractional Posteriors Prateek Jaiswal D. Pati A. Bhattacharya Bani Mallick 23 0 0 12 Sep 2023
Complexity Analysis of a Countable-armed Bandit Problem Anand Kalvit A. Zeevi 49 3 0 18 Jan 2023
The Typical Behavior of Bandit Algorithms Lin Fan Peter Glynn 47 3 0 11 Oct 2022
Some performance considerations when using multi-armed bandit algorithms in the presence of missing data Xijin Chen K. M. Lee S. Villar D. Robertson 94 1 0 08 May 2022
The Fragility of Optimized Bandit Algorithms Lin Fan Peter Glynn 77 13 0 28 Sep 2021
Online Multi-Armed Bandits with Adaptive Inference Maria Dimakopoulou Zhimei Ren Zhengyuan Zhou 83 36 0 25 Feb 2021