Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback GraphsDownload PDFOpen Website

2023 (modified: 16 Apr 2023)ALT 2023Readers: Everyone
Abstract: We study high-probability regret bounds for adversarial $K$-armed bandits with time-varying feedback graphs over $T$ rounds. For general strongly observable graphs, we develop an algorithm that ach...
0 Replies

Loading