Regret Lower Bound and Optimal Algorithm for High-Dimensional Contextual Linear Bandit

23 September 2021

Papers citing "Regret Lower Bound and Optimal Algorithm for High-Dimensional Contextual Linear Bandit"

7 / 7 papers shown

Title
Sparse Nonparametric Contextual Bandits Hamish Flynn Julia Olkhovskaya Paul Rognon-Vael 51 0 0 20 Mar 2025
Sparsity-Agnostic Linear Bandits with Adaptive Adversaries Tianyuan Jin Kyoungseok Jang Nicolò Cesa-Bianchi 28 1 0 03 Jun 2024
FLIPHAT: Joint Differential Privacy for High Dimensional Sparse Linear Bandits Sunrit Chakraborty Saptarshi Roy Debabrota Basu FedML 31 1 0 22 May 2024
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits Masahiro Kato Shinji Ito 34 0 0 05 Mar 2024
Best-of-Both-Worlds Linear Contextual Bandits Masahiro Kato Shinji Ito 43 0 0 27 Dec 2023
Thompson Sampling for High-Dimensional Sparse Linear Contextual Bandits Sunrit Chakraborty Saptarshi Roy Ambuj Tewari 15 9 0 11 Nov 2022
Dynamic Batch Learning in High-Dimensional Sparse Linear Contextual Bandits Zhimei Ren Zhengyuan Zhou 22 31 0 27 Aug 2020