regret bound

Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator NeurIPS 2018 Reward Maximization Under Uncertainty: Leveraging Side-Observations on Networks JMLR 2018 Semiparametric Contextual Bandits ICML 2018 Sequential prediction with coded side information under logarithmic loss ALT 2018 Small-loss bounds for online learning with partial information COLT 2018 Sparsity, variance and curvature in multi-armed bandits ALT 2018 Stochastic Multi-armed Bandits in Constant Space AISTATS 2018 The K-Nearest Neighbour UCB Algorithm for Multi-Armed Bandits with Covariates ALT 2018 The Many Faces of Exponential Weights in Online Learning COLT 2018 The Promise and Perils of Myopia in Dynamic Pricing With Censored Information IJCAI 2018 Thompson Sampling for Combinatorial Semi-Bandits ICML 2018 Tight Regret Bounds for Bayesian Optimization in One Dimension ICML 2018 TopRank: A practical algorithm for online stochastic ranking NeurIPS 2018 UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits IJCAI 2018 Variance-Aware Regret Bounds for Undiscounted Reinforcement Learning in MDPs ALT 2018 Weakly Consistent Optimal Pricing Algorithms in Repeated Posted-Price Auctions with Strategic Buyer ICML 2018 Active Learning for Accurate Estimation of Linear Models ICML 2017 Adaptive Multiple-Arm Identification ICML 2017 Affine-Invariant Online Optimization and the Low-rank Experts Problem NeurIPS 2017 An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits COLT 2017 A survey of Algorithms and Analysis for Adaptive Online Learning JMLR 2017 Bandits Dueling on Partially Ordered Sets NeurIPS 2017 Bandits with Movement Costs and Adaptive Pricing COLT 2017 Bernoulli Rank-1 Bandits for Click Feedback IJCAI 2017 Boltzmann Exploration Done Right NeurIPS 2017