Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper.
Query: Infinitely Many-Armed Bandits with Budget Constraints
Algorithms for Infinitely Many-Armed Bandits
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
Provable Optimal Algorithms for Generalized Linear Contextual Bandits
Context-Aware Bandits
Linear Contextual Bandits with Global Constraints and Objective
Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations
Fairness in Learning: Classic and Contextual Bandits
Contextual Bandits with Linear Payoff Functions
A Survey of Preference-Based Online Learning with Bandit Algorithms
Efficient Optimal Learning for Contextual Bandits
Piecewise-stationary bandit problems with side observations
Stochastic Optimization with Bandit Sampling
An Efficient Bandit Algorithm for Realtime Multivariate Optimization
Coordinated Versus Decentralized Exploration In Multi-Agent Multi-Armed Bandits
Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
Estimation Considerations in Contextual Bandits
Stochastic Contextual Bandits with Known Reward Functions
Multi-Armed Bandits for Intelligent Tutoring Systems
On upper-confidence bound policies for switching bandit problems
Generalized Thompson Sampling for Contextual Bandits
Cloud forensics: Technical challenges, solutions and comparative analysis
Representation Learning over Dynamic Graphs
Computing the everyday: social media as data platforms
Multi-armed bandits in metric spaces
On formalizing social commitments in dialogue and argumentation models using temporal defeasible logic