regret bound

Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning ICML 2013 Prediction by random-walk perturbation COLT 2013 Prior-free and prior-dependent regret bounds for Thompson Sampling NeurIPS 2013 Reinforcement Learning in Robust Markov Decision Processes NeurIPS 2013 Selective sampling algorithms for cost-sensitive multiclass prediction ICML 2013 Sequential Bayesian Search ICML 2013 Sequential Transfer in Multi-armed Bandit with Finite Set of Models NeurIPS 2013 Sparsity Regret Bounds for Individual Sequences in Online Linear Regression JMLR 2013 Stable Coactive Learning via Perturbation ICML 2013 Surrogate Regret Bounds for the Area Under the ROC Curve via Strongly Proper Losses COLT 2013 The Pareto Regret Frontier NeurIPS 2013 The price of bandit information in multiclass online classification COLT 2013 Thompson Sampling for Contextual Bandits with Linear Payoffs ICML 2013 Two-Target Algorithms for Infinite-Armed Bandits with Bernoulli Rewards NeurIPS 2013 An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity JMLR 2012 Analysis of Thompson Sampling for the Multi-armed Bandit Problem COLT 2012 Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit AISTATS 2012 Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence NeurIPS 2012 Beyond Logarithmic Bounds in Online Learning AISTATS 2012 Contextual Bandit Learning with Predictable Rewards AISTATS 2012 Differentially Private Online Learning COLT 2012 Distributed Non-Stochastic Experts NeurIPS 2012 Efficient Reinforcement Learning for High Dimensional Linear Quadratic Systems NeurIPS 2012 Hierarchical Optimistic Region Selection driven by Curiosity NeurIPS 2012 Imitation Learning by Coaching NeurIPS 2012