Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: Efficient Optimal Learning for Contextual Bandits
The Epoch-Greedy Algorithm for Contextual Multi-armed Bandits
Network of Bandits
Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret
Competing in the dark: an efficient algorithm for bandit linear optimization
A simple multi-armed bandit algorithm with optimal variation-bounded regret
Multi-armed bandit algorithms and empirical evaluation
Contextual Bandits in a Collaborative Environment
Pure exploration in multi-armed bandits problems
Two-Target Algorithms for Infinite-Armed Bandits with Bernoulli Rewards
Private Stochastic Multi-arm Bandits: From Theory to Practice
On Kernelized Multi-armed Bandits
Model-Based Reinforcement Learning in Contextual Decision Processes
On upper-confidence bound policies for switching bandit problems
Global Multi-armed Bandits with Holder Continuity
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem
Best arm identification in multi-armed bandits with delayed feedback
Exploration-exploitation trade-off using variance estimates in multi-armed bandits
The budgeted multi-armed bandit problem
Algorithms for adversarial bandit problems with multiple plays
Adaptive Machine Learning Winter 2018 Lecture 9 : Linear Bandits and Thompson Sampling
tisagenlecleucel in children and young adults with b - cell lymphoblastic leukemia .
Strategic facility location: A review
Automated hedcut illustration using isophotes
Pl@ntNet mobile app
Approximate Planning in Large POMDPs via Reusable Trajectories