Co-occurring keywords · papers mentioning both
Papers
Regret of Queueing Bandits
NeurIPS 2016
Scalable Discrete Sampling as a Multi-Armed Bandit Problem
ICML 2016
The Multi-fidelity Multi-armed Bandit
NeurIPS 2016
Threshold Bandits, With and Without Censored Feedback
NeurIPS 2016
Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem
COLT 2016
Time-Varying Gaussian Process Bandit Optimization
AISTATS 2016
Tracking the Best Expert in Non-stationary Stochastic Environments
NeurIPS 2016
Verification Based Solution for Structured MAB Problems
NeurIPS 2016
Adaptive Strategy for Stratified Monte Carlo Sampling
JMLR 2015
Bandits with Unobserved Confounders: A Causal Approach
NeurIPS 2015
Batched Bandit Problems
COLT 2015
Budgeted Bandit Problems with Continuous Random Costs
ACML 2015
Cascading Bandits: Learning to Rank in the Cascade Model
ICML 2015
Cheap Bandits
ICML 2015
Combinatorial Bandits Revisited
NeurIPS 2015
Combinatorial Cascading Bandits
NeurIPS 2015
Copeland Dueling Bandits
NeurIPS 2015
Cornering Stationary and Restless Mixing Bandits with Remix-UCB
NeurIPS 2015
Efficient Learning in Large-Scale Combinatorial Semi-Bandits
ICML 2015
Efficient Thompson Sampling for Online Matrix-Factorization Recommendation
NeurIPS 2015
Explore no more: Improved high-probability regret bounds for non-stochastic bandits
NeurIPS 2015
Fighting Bandits with a New Kind of Smoothness
NeurIPS 2015
Global Multi-armed Bandits with Hölder Continuity
AISTATS 2015
High Dimensional Bayesian Optimisation and Bandits via Additive Models
ICML 2015
Linear Multi-Resource Allocation with Semi-Bandit Feedback
NeurIPS 2015