Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
Global Multi-armed Bandits with Holder Continuity
Variational inference for the multi-armed contextual bandit
On Kernelized Multi-armed Bandits
Context-Aware Bandits
Stochastic Optimization with Bandit Sampling
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem
Optimistic Bayesian sampling in contextual-bandit problems
Approximation algorithms for restless bandit problems
On bayesian upper confidence bounds for bandit problems
A Survey of Preference-Based Online Learning with Bandit Algorithms
Algorithms for adversarial bandit problems with multiple plays
An Information-Theoretic Analysis of Thompson Sampling
Beating the adaptive bandit with high probability
Multi-armed bandits in metric spaces
Network of Bandits
Simulation studies in optimistic bayesian sampling in contextual-bandit problems
Stochastic Regret Minimization via Thompson Sampling
PAC bounds for multi-armed bandit and Markov decision processes
Stochastic Dual Coordinate Descent with Bandit Sampling.
Redundancy-Reduced MobileNet Acceleration on Reconfigurable Logic for ImageNet Classification
Burden of Diabetic Foot Ulcers for Medicare and Private Insurers
SEED DORMANCY AND THE CONTROL OF GERMINATION
A functional specification of effects
ucb revisited : improved regret bounds for the stochastic multi - armed bandit problem .