Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper
Query: Near-Optimal Regret Bounds for Thompson Sampling
Analysis of Thompson Sampling for the multi-armed bandit problem
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
Finite-time Analysis of the Multiarmed Bandit Problem
Minimax Regret Bounds for Reinforcement Learning
Approximation Algorithms for Bayesian Multi-Armed Bandit Problems
A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem
Adaptive Machine Learning Winter 2018 Lecture 9 : Linear Bandits and Thompson Sampling
Generalized Thompson Sampling for Sequential Decision-Making and Causal Inference
Algorithms for the multi-armed bandit problem
A modern Bayesian look at the multi-armed bandit
Combinatorial Pure Exploration of Multi-Armed Bandits
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
Infinitely Many-Armed Bandits with Budget Constraints
Optimistic Bayesian sampling in contextual-bandit problems
Pure exploration in multi-armed bandits problems
Stochastic Optimization with Bandit Sampling
Thompson Sampling for Dynamic Pricing
Algorithms for Infinitely Many-Armed Bandits
Multi-armed bandit algorithms and empirical evaluation
Bootstrapped Thompson Sampling and Deep Exploration
A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming
network theory of organization : a multilevel approach * .
Multiple View Geometry
An Empirical Evaluation of Thompson Sampling
Humanoid robosoccer goal detection using hough transform