Co-occurring keywords · papers mentioning both
Papers
Linear Thompson Sampling Revisited
AISTATS 2017
On Thompson Sampling and Asymptotic Optimality
IJCAI 2017
Optimistic posterior sampling for reinforcement learning: worst-case regret bounds
NeurIPS 2017
Parallel and Distributed Thompson Sampling for Large-scale Accelerated Exploration of Chemical Space
ICML 2017
Scalable Generalized Linear Bandits: Online Computation and Hashing
NeurIPS 2017
The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits
AISTATS 2017
Thompson Sampling for Linear-Quadratic Control Problems
AISTATS 2017
Thompson Sampling for the MNL-Bandit
COLT 2017
An Information-Theoretic Analysis of Thompson Sampling
JMLR 2016
Double Thompson Sampling for Dueling Bandits
NeurIPS 2016
Optimistic Gittins Indices
NeurIPS 2016
Simple Bayesian Algorithms for Best Arm Identification
COLT 2016
Bandit Convex Optimization: \sqrtT Regret in One Dimension
COLT 2015
Efficient Learning in Large-Scale Combinatorial Semi-Bandits
ICML 2015
Efficient Thompson Sampling for Online Matrix-Factorization Recommendation
NeurIPS 2015
Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays
ICML 2015
Reactive bandits with attitude
AISTATS 2015
Sensor Selection for Crowdsensing Dynamical Systems
AISTATS 2015
Thompson Sampling for Learning Parameterized Markov Decision Processes
COLT 2015
Cover Tree Bayesian Reinforcement Learning
JMLR 2014
Learning to Optimize via Information-Directed Sampling
NeurIPS 2014
Optimality of Thompson Sampling for Gaussian Bandits Depends on Priors
AISTATS 2014
Stochastic Regret Minimization via Thompson Sampling
COLT 2014
Thompson Sampling for Complex Online Problems
ICML 2014
Bayesian Mixture Modelling and Inference based Thompson Sampling in Monte-Carlo Tree Search
NeurIPS 2013