upper confidence bound

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