An Efficient Algorithm For Generalized Linear Bandit: Online Stochastic Gradient Descent and Thompson Sampling

7 June 2020

Papers citing "An Efficient Algorithm For Generalized Linear Bandit: Online Stochastic Gradient Descent and Thompson Sampling"

9 / 9 papers shown

Title
Does Sparsity Help in Learning Misspecified Linear Bandits? Jialin Dong Lin F. Yang 19 1 0 29 Mar 2023
Risk-aware linear bandits with convex loss Patrick Saux Odalric-Ambrym Maillard 19 2 0 15 Sep 2022
Truncated LinUCB for Stochastic Linear Bandits Yanglei Song Meng zhou 42 0 0 23 Feb 2022
Communication Efficient Federated Learning for Generalized Linear Bandits Chuanhao Li Hongning Wang FedML 22 13 0 02 Feb 2022
Learning to Identify Top Elo Ratings: A Dueling Bandits Approach Xueqiang Yan Yali Du Binxin Ru Jun Wang Haifeng Zhang Xu Chen 33 7 0 12 Jan 2022
Jointly Efficient and Optimal Algorithms for Logistic Bandits Louis Faury Marc Abeille Kwang-Sung Jun Clément Calauzènes 24 19 0 06 Jan 2022
Anti-Concentrated Confidence Bonuses for Scalable Exploration Jordan T. Ash Cyril Zhang Surbhi Goel A. Krishnamurthy Sham Kakade 35 6 0 21 Oct 2021
Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks Qin Ding Cho-Jui Hsieh James Sharpnack AAML 16 31 0 05 Jun 2021
Stochastic Linear Contextual Bandits with Diverse Contexts Weiqiang Wu Jing Yang Cong Shen 45 13 0 05 Mar 2020