regret bound

Consistent Online Optimization: Convex and Submodular AISTATS 2019 Contextual bandits with continuous actions: Smoothing, zooming, and adapting COLT 2019 Contextual Bandits with Cross-Learning NeurIPS 2019 Contextual Multi-armed Bandit Algorithm for Semiparametric Reward Model ICML 2019 Data Poisoning Attacks on Stochastic Bandits ICML 2019 Deep Exploration via Randomized Value Functions JMLR 2019 Delay and Cooperation in Nonstochastic Bandits JMLR 2019 Differentially Private Online Submodular Minimization AISTATS 2019 Dueling Bandits with Qualitative Feedback AAAI 2019 Dying Experts: Efficient Algorithms with Optimal Regret Bounds NeurIPS 2019 Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions NeurIPS 2019 Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatigue AAAI 2019 Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problem ICML 2019 Dynamic Local Regret for Non-convex Online Forecasting NeurIPS 2019 Efficient Linear Bandits through Matrix Sketching AISTATS 2019 Efficient online learning with kernels for adversarial large scale problems NeurIPS 2019 Equipping Experts/Bandits with Long-term Memory NeurIPS 2019 Exploiting structure of uncertainty for efficient matroid semi-bandits ICML 2019 Exponential Weights on the Hypercube in Polynomial Time AISTATS 2019 Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes NeurIPS 2019 Flattening a Hierarchical Clustering through Active Learning NeurIPS 2019 Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret COLT 2019 General parallel optimization a without metric ALT 2019 High Dimensional Bayesian Optimization via Supervised Dimension Reduction IJCAI 2019 Improved Algorithm on Online Clustering of Bandits IJCAI 2019