conftrace_

upper confidence bound

197 papers

Explore in graph

Also known as

UCB

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) contextual bandit (381) bayesian optimization (624) gaussian process (1200) thompson sampling (237) reinforcement learning (4352) stochastic optimization (1060) ucb algorithm (44)

Papers

Cornering Stationary and Restless Mixing Bandits with Remix-UCB NIPS 2015
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms ICML 2014
Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem ICML 2014
lil’ UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits COLT 2014
Parallelizing Exploration-Exploitation Tradeoffs in Gaussian Process Bandit Optimization JMLR 2014
On Multilabel Classification and Ranking with Bandit Feedback JMLR 2014
Pseudo-reward Algorithms for Contextual Bandits with Linear Payoff Functions ACML 2014
Stochastic Simultaneous Optimistic Optimization ICML 2013
Lower Bounds and Selectivity of Weak-Consistent Policies in Stochastic Multi-Armed Bandit Problem JMLR 2013
Eluder Dimension and the Sample Complexity of Optimistic Exploration NIPS 2013
High-Dimensional Gaussian Process Bandits NIPS 2013
On Bayesian Upper Confidence Bounds for Bandit Problems AISTATS 2012
Online allocation and homogeneous partitioning for piecewise constant mean-approximation NIPS 2012
A Stochastic Bandit Algorithm for Scratch Games ACML 2012
On Multilabel Classification and Ranking with Partial Feedback NIPS 2012
Online Regret Bounds for Undiscounted Continuous Reinforcement Learning NIPS 2012
Contextual Gaussian Process Bandit Optimization NIPS 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011
Improved Algorithms for Linear Stochastic Bandits NIPS 2011
Contextual Bandits with Linear Payoff Functions AISTATS 2011
Algorithms for Infinitely Many-Armed Bandits NIPS 2008
Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning NIPS 2006