Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper.
Query: On bayesian upper confidence bounds for bandit problems
Finite-time Analysis of the Multiarmed Bandit Problem
An Information-Theoretic Analysis of Thompson Sampling
Two-Target Algorithms for Infinite-Armed Bandits with Bernoulli Rewards
Provable Optimal Algorithms for Generalized Linear Contextual Bandits
Thompson Sampling: An Asymptotically Optimal Finite Time Analysis
Stochastic Optimization with Bandit Sampling
Adaptive Monte Carlo via Bandit Allocation
Multi-armed bandit problems with dependent arms
Variational Bayesian Reinforcement Learning with Regret Bounds
Counterfactual Risk Minimization: Learning from Logged Bandit Feedback
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
Combinatorial Pure Exploration of Multi-Armed Bandits
Competing in the dark: an efficient algorithm for bandit linear optimization
Stochastic Dual Coordinate Descent with Bandit Sampling.
The Epoch-Greedy Algorithm for Contextual Multi-armed Bandits
Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Sampling
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits
Stochastic Contextual Bandits with Known Reward Functions
Minimax Regret Bounds for Reinforcement Learning
Algorithms for adversarial bandit problems with multiple plays
Bone metastases and lung cancer recurrence on (99m)Tc-depreotide imaging.
Advanced Persistent threats and how to monitor and deter them
computing with the collective intelligence of honey bees - a survey .
A 0.35 /spl mu/m CMOS comparator circuit for high-speed ADC applications
adaptation in natural and artificial systems .