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

v1v2v3 (latest)

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

7 June 2020

James Sharpnack

ArXiv (abs)PDF HTML

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

9 / 9 papers shown

Title
Truncated LinUCB for Stochastic Linear Bandits Yanglei Song Meng zhou 203 0 0 23 Feb 2022
Stochastic Linear Contextual Bandits with Diverse Contexts Weiqiang Wu Jing Yang Cong Shen 84 13 0 05 Mar 2020
Neural Contextual Bandits with UCB-based Exploration Dongruo Zhou Lihong Li Quanquan Gu 92 15 0 11 Nov 2019
Introduction to Online Convex Optimization Elad Hazan OffRL 175 1,932 0 07 Sep 2019
Perturbed-History Exploration in Stochastic Linear Bandits Branislav Kveton Csaba Szepesvári Mohammad Ghavamzadeh Craig Boutilier 36 43 0 21 Mar 2019
PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits Bianca Dumitrascu Karen Feng Barbara E. Engelhardt 42 41 0 18 May 2018
Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Sampling C. Riquelme George Tucker Jasper Snoek BDL 74 366 0 26 Feb 2018
On Kernelized Multi-armed Bandits Sayak Ray Chowdhury Aditya Gopalan 116 460 0 03 Apr 2017
Thompson Sampling for Contextual Bandits with Linear Payoffs Shipra Agrawal Navin Goyal 195 1,004 0 15 Sep 2012