Parallelizing Thompson Sampling

2 June 2021

Vahab Mirrokni

Papers citing "Parallelizing Thompson Sampling"

28 / 28 papers shown

Title
Batched Thompson Sampling Cem Kalkanli Ayfer Özgür OffRL 72 19 0 01 Oct 2021
Improved Confidence Bounds for the Linear Logistic Model and Applications to Linear Bandits Kwang-Sung Jun Lalit P. Jain Blake Mason Houssam Nassif 46 20 0 23 Nov 2020
Linear Bandits with Limited Adaptivity and Learning Distributional Optimal Design Yufei Ruan Jiaqi Yang Yuanshuo Zhou OffRL 118 52 0 04 Jul 2020
Almost Optimal Model-Free Reinforcement Learning via Reference-Advantage Decomposition Zihan Zhang Yuanshuo Zhou Xiangyang Ji OffRL 48 155 0 21 Apr 2020
MOTS: Minimax Optimal Thompson Sampling Tianyuan Jin Pan Xu Jieming Shi Xiaokui Xiao Quanquan Gu 44 31 0 03 Mar 2020
Adaptivity in Adaptive Submodularity Hossein Esfandiari Amin Karbasi Vahab Mirrokni 70 34 0 09 Nov 2019
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition Lin Chen Qian-long Yu Hannah Lawrence Amin Karbasi 44 20 0 24 Oct 2019
Regret Bounds for Batched Bandits Hossein Esfandiari Amin Karbasi Abbas Mehrabian Vahab Mirrokni 56 61 0 11 Oct 2019
Sequential Experimental Design for Transductive Linear Bandits Tanner Fiez Lalit P. Jain Kevin Jamieson Lillian J. Ratliff 38 105 0 20 Jun 2019
Introduction to Multi-Armed Bandits Aleksandrs Slivkins 218 999 0 15 Apr 2019
Batched Multi-armed Bandits Problem Zijun Gao Yanjun Han Zhimei Ren Zhengqing Zhou 87 140 0 03 Apr 2019
Unconstrained Submodular Maximization with Constant Adaptive Complexity Lin Chen Moran Feldman Amin Karbasi 42 35 0 15 Nov 2018
Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization Eric Balkanski Yaron Singer 37 31 0 12 Aug 2018
High-Dimensional Bayesian Optimization via Additive Models with Overlapping Groups Paul Rolland Jonathan Scarlett Ilija Bogunovic Volkan Cevher 52 115 0 20 Feb 2018
Batched Large-scale Bayesian Optimization in High-dimensional Spaces Zi Wang Clement Gehring Pushmeet Kohli Stefanie Jegelka UQCV 31 211 0 05 Jun 2017
Batched Gaussian Process Bandit Optimization via Determinantal Point Processes Tarun Kathuria Amit Deshpande Pushmeet Kohli GP 39 103 0 13 Nov 2016
Batched bandit problems Vianney Perchet Philippe Rigollet Sylvain Chassang E. Snowberg OffRL 93 200 0 02 May 2015
Prior-free and prior-dependent regret bounds for Thompson Sampling Sébastien Bubeck Che-Yu Liu 62 94 0 21 Apr 2013
Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration E. Contal David Buffoni Alexandre Robicquet Nicolas Vayatis 44 213 0 19 Apr 2013
Learning to Optimize Via Posterior Sampling Daniel Russo Benjamin Van Roy 124 697 0 11 Jan 2013
Further Optimal Regret Bounds for Thompson Sampling Shipra Agrawal Navin Goyal 68 443 0 15 Sep 2012
Thompson Sampling for Contextual Bandits with Linear Payoffs Shipra Agrawal Navin Goyal 118 993 0 15 Sep 2012
Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization Thomas Desautels Andreas Krause J. W. Burdick 80 471 0 27 Jun 2012
Thompson Sampling: An Asymptotically Optimal Finite Time Analysis E. Kaufmann N. Korda Rémi Munos 84 585 0 18 May 2012
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences Odalric-Ambrym Maillard Rémi Munos Gilles Stoltz 60 146 0 29 May 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond Aurélien Garivier Olivier Cappé 95 613 0 12 Feb 2011
Contextual Bandit Algorithms with Supervised Learning Guarantees A. Beygelzimer John Langford Lihong Li L. Reyzin Robert Schapire OffRL 113 324 0 22 Feb 2010
Linearly Parameterized Bandits Paat Rusmevichientong J. Tsitsiklis 169 558 0 18 Dec 2008