upper confidence bound

Refining the Confidence Level for Optimistic Bandit Strategies JMLR 2018 Regional Multi-Armed Bandits AISTATS 2018 Reward Maximization Under Uncertainty: Leveraging Side-Observations on Networks JMLR 2018 The K-Nearest Neighbour UCB Algorithm for Multi-Armed Bandits with Covariates ALT 2018 UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits IJCAI 2018 Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe NeurIPS 2017 Learning Cost-Effective and Interpretable Treatment Regimes AISTATS 2017 Multi-Task Learning for Contextual Bandits NeurIPS 2017 Provably Optimal Algorithms for Generalized Linear Contextual Bandits ICML 2017 Thresholding Bandits with Augmented UCB IJCAI 2017 A Bandit Framework for Strategic Regression NeurIPS 2016 Anytime Exploration for Multi-armed Bandits using Confidence Information ICML 2016 Dueling Bandits: Beyond Condorcet Winners to General Tournament Solutions NeurIPS 2016 Gaussian Process Bandit Optimisation with Multi-fidelity Evaluations NeurIPS 2016 On the Analysis of Complex Backup Strategies in Monte Carlo Tree Search ICML 2016 The Multi-fidelity Multi-armed Bandit NeurIPS 2016 Threshold Bandits, With and Without Censored Feedback NeurIPS 2016 Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits NeurIPS 2015 Cornering Stationary and Restless Mixing Bandits with Remix-UCB NeurIPS 2015 lil’ UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits COLT 2014 Near-optimal Reinforcement Learning in Factored MDPs NeurIPS 2014 On Multilabel Classification and Ranking with Bandit Feedback JMLR 2014 Parallelizing Exploration-Exploitation Tradeoffs in Gaussian Process Bandit Optimization JMLR 2014 Pseudo-reward Algorithms for Contextual Bandits with Linear Payoff Functions ACML 2014 Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem ICML 2014