regret bound

Open Problem: First-Order Regret Bounds for Contextual Bandits COLT 2017 Optimal Posted-Price Mechanism in Microtask Crowdsourcing IJCAI 2017 Optimistic posterior sampling for reinforcement learning: worst-case regret bounds NeurIPS 2017 Perishability of Data: Dynamic Pricing under Varying-Coefficient Models JMLR 2017 Playing Repeated Network Interdiction Games with Semi-Bandit Feedback IJCAI 2017 Position-based Multiple-play Bandit Problem with Unknown Position Bias NeurIPS 2017 Process-constrained batch Bayesian optimisation NeurIPS 2017 Projection-free Distributed Online Learning in Networks ICML 2017 Provably Optimal Algorithms for Generalized Linear Contextual Bandits ICML 2017 Random Permutation Online Isotonic Regression NeurIPS 2017 Real-Time Bidding with Side Information NeurIPS 2017 Regret Analysis for Continuous Dueling Bandit NeurIPS 2017 Regret Bounds for Lifelong Learning AISTATS 2017 Regret Bounds for Transfer Learning in Bayesian Optimisation AISTATS 2017 Regret for Expected Improvement over the Best-Observed Value and Stopping Condition ACML 2017 Rotting Bandits NeurIPS 2017 Safety-Aware Algorithms for Adversarial Contextual Bandit ICML 2017 Scalable Generalized Linear Bandits: Online Computation and Hashing NeurIPS 2017 Second-Order Kernel Online Convex Optimization with Adaptive Sketching ICML 2017 Sparse Stochastic Bandits COLT 2017 Stochastic and Adversarial Online Learning without Hyperparameters NeurIPS 2017 Stochastic Rank-1 Bandits AISTATS 2017 The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits AISTATS 2017 The Price of Differential Privacy for Online Learning ICML 2017 Thompson Sampling for Linear-Quadratic Control Problems AISTATS 2017