Instruct: Given a paper title, retrieve paper titles that are cited by the given paper
Query: Algorithms for multi-armed bandit problems
Finite-time Analysis of the Multiarmed Bandit Problem
Stochastic Optimization with Bandit Sampling
The Combinatorial Multi-armed Bandit problem and its application to real-time strategy games
Simple regret for infinitely many armed bandits
Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations
ucb revisited : improved regret bounds for the stochastic multi - armed bandit problem .
action elimination and stopping conditions for the multi - armed bandit and reinforcement learning problems .
Distributed Learning in Multi-Armed Bandit with Multiple Players
Generalized Thompson Sampling for Contextual Bandits
Context-Aware Bandits
Top Arm Identification in Multi-Armed Bandits with Batch Arm Pulls
Budgeted Bandit Problems with Continuous Random Costs
Stochastic Dual Coordinate Descent with Bandit Sampling.
Adaptive Monte Carlo via Bandit Allocation
Near-Optimal Regret Bounds for Thompson Sampling
Thompson Sampling for Contextual Bandits with Linear Payoffs
PAC Subset Selection in Stochastic Multi-armed Bandits
Bayesian modeling of human sequential decision-making on the multi-armed bandit problem
Fairness in Learning: Classic and Contextual Bandits
Estimation Considerations in Contextual Bandits
path planning for nonholonomic mobile robot based on bezier curve .
adaptation in natural and artificial systems .
A Deep Learning Based Fast Image Saliency Detection Algorithm
3D Segmentation with Exponential Logarithmic Loss for Highly Unbalanced Object Sizes
Towards Unifying Hamiltonian Monte Carlo and Slice Sampling