sublinear regret

Online Regression with Partial Information: Generalization and Linear Projection AISTATS 2018 Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator NeurIPS 2018 Streaming Principal Component Analysis in Noisy Setting ICML 2018 Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP ICML 2017 Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation NeurIPS 2017 Online Optimization of Smoothed Piecewise Constant Functions AISTATS 2017 On Thompson Sampling and Asymptotic Optimality IJCAI 2017 Playing Repeated Network Interdiction Games with Semi-Bandit Feedback IJCAI 2017 Adaptive Smoothed Online Multi-Task Learning NeurIPS 2016 Efficient Algorithms for Adversarial Contextual Learning ICML 2016 No-Regret Algorithms for Heavy-Tailed Linear Bandits ICML 2016 Safe Policy Search for Lifelong Reinforcement Learning with Sublinear Regret ICML 2015 Exploiting easy data in online optimization NeurIPS 2014 Online and Stochastic Gradient Methods for Non-decomposable Loss Functions NeurIPS 2014 Open Problem: Efficient Online Sparse Regression COLT 2014 Repeated Contextual Auctions with Strategic Buyers NeurIPS 2014 Sequential Bayesian Search ICML 2013 No-Regret Algorithms for Unconstrained Online Convex Optimization NeurIPS 2012