Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: PAC Subset Selection in Stochastic Multi-armed Bandits
Multi-armed bandit problems with dependent arms
Contextual Gaussian Process Bandit Optimization
Distributed Learning in Multi-Armed Bandit with Multiple Players
Provable Optimal Algorithms for Generalized Linear Contextual Bandits
Approximation algorithms for restless bandit problems
Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem
PAC-Bayesian Stochastic Model Selection
Fairness in Learning: Classic and Contextual Bandits
Adaptive Machine Learning Winter 2018 Lecture 9 : Linear Bandits and Thompson Sampling
Random Shuffling and Resets for the Non-stationary Stochastic Bandit Problem
The Combinatorial Multi-armed Bandit problem and its application to real-time strategy games
Multi-Armed Bandits for Intelligent Tutoring Systems
Thompson Sampling is Asymptotically Optimal in General Environments
Context Attentive Bandits: Contextual Bandit with Restricted Context
Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations
Structured Prediction via Learning to Search under Bandit Feedback.
A Near-Optimal Exploration-Exploitation Approach for Assortment Selection
On bayesian upper confidence bounds for bandit problems
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits
Can a school-wide bullying prevention program improve the plight of victims? Evidence for risk × intervention effects
Building Natural-Language Generation Systems
Low Complexity Damped Gauss-Newton Algorithms for CANDECOMP/PARAFAC
The orbitofrontal – amygdala circuit and self-regulation of social – emotional behavior in autism
Finite-time Analysis of the Multiarmed Bandit Problem