Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits SimultaneouslyDownload PDFOpen Website

Published: 01 Jan 2021, Last Modified: 12 May 2023ICML 2021Readers: Everyone
Abstract: In this work, we develop linear bandit algorithms that automatically adapt to different environments. By plugging a novel loss estimator into the optimization problem that characterizes the instanc...
0 Replies

Loading