regret bound

Spectral bandits JMLR 2020 Stage-wise Conservative Linear Bandits NeurIPS 2020 Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits NeurIPS 2020 Statistical Guarantees of Distributed Nearest Neighbor Classification NeurIPS 2020 Stochastic bandits with arm-dependent delays ICML 2020 Stochastic Bandits with Delay-Dependent Payoffs AISTATS 2020 Stochastic Coordinate Minimization with Progressive Precision for Stochastic Convex Optimization ICML 2020 Stochastic Linear Contextual Bandits with Diverse Contexts AISTATS 2020 Stochastic Online Learning with Probabilistic Graph Feedback AAAI 2020 Structure Adaptive Algorithms for Stochastic Bandits ICML 2020 Structured Linear Contextual Bandits: A Sharp and Geometric Smoothed Analysis ICML 2020 Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces NeurIPS 2020 Submodular Bandit Problem Under Multiple Constraints UAI 2020 Sub-sampling for Efficient Non-Parametric Bandit Exploration NeurIPS 2020 Taking a hint: How to leverage loss predictors in contextual bandits? COLT 2020 Temporal Variability in Implicit Online Learning NeurIPS 2020 The Intrinsic Robustness of Stochastic Bandits to Strategic Manipulation ICML 2020 The Nonstochastic Control Problem ALT 2020 Thompson Sampling Algorithms for Mean-Variance Bandits ICML 2020 Thompson Sampling for Adversarial Bit Prediction ALT 2020 Thompson Sampling for Linearly Constrained Bandits AISTATS 2020 Thompson Sampling for Unsupervised Sequential Selection ACML 2020 Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits NeurIPS 2020 Tight Lower Bounds for Combinatorial Multi-Armed Bandits COLT 2020 Top-k Combinatorial Bandits with Full-Bandit Feedback ALT 2020