conftrace_

multi-armed bandit

1098 papers

Explore in graph

Also known as

MAB

Co-occurring keywords

regret bound (1926) online learning (1777) stochastic optimization (1060) thompson sampling (237) upper confidence bound (197) regret minimization (315) online algorithm (445) sample complexity (1169) contextual bandit (381) best arm identification (85)

Papers

Stochastic Regret Minimization via Thompson Sampling COLT 2014
Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing ICML 2014
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms ICML 2014
Spectral Bandits for Smooth Graph Functions ICML 2014
Multiarmed Bandits With Limited Expert Advice COLT 2014
One Practical Algorithm for Both Stochastic and Adversarial Bandits ICML 2014
Best-Arm Identification in Linear Bandits NIPS 2014
Learning to Optimize via Information-Directed Sampling NIPS 2014
Most Correlated Arms Identification COLT 2014
Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014
A Latent Source Model for Online Collaborative Filtering NIPS 2014
Learning Multiple Tasks in Parallel with a Shared Annotator NIPS 2014
Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards NIPS 2014
A UCB-Like Strategy of Collaborative Filtering ACML 2014
A Gang of Bandits NIPS 2013
Multi-armed Bandit Problem with Lock-up Periods ACML 2013
Generic Exploration and K-armed Voting Bandits ICML 2013
Online Learning under Delayed Feedback ICML 2013
Eluder Dimension and the Sample Complexity of Optimistic Exploration NIPS 2013
A near-optimal algorithm for finite partial-monitoring games against adversarial opponents COLT 2013
Almost Optimal Exploration in Multi-Armed Bandits ICML 2013
Sequential Transfer in Multi-armed Bandit with Finite Set of Models NIPS 2013
Exploration vs Exploitation vs Safety: Risk-Aware Multi-Armed Bandits ACML 2013
Large-Scale Bandit Problems and KWIK Learning ICML 2013
Lower Bounds and Selectivity of Weak-Consistent Policies in Stochastic Multi-Armed Bandit Problem JMLR 2013