online convex optimization

Online Learning via the Differential Privacy Lens NeurIPS 2019 Parameter-Free Online Convex Optimization with Sub-Exponential Noise COLT 2019 Provable Guarantees for Gradient-Based Meta-Learning ICML 2019 Risk-Averse Stochastic Convex Bandit AISTATS 2019 Surrogate Losses for Online Learning of Stepsizes in Stochastic Non-Convex Optimization ICML 2019 User-Specified Local Differential Privacy in Unconstrained Adaptive Online Learning NeurIPS 2019 Adaptive Online Learning in Dynamic Environments NeurIPS 2018 Efficient Adaptive Online Learning via Frequent Directions IJCAI 2018 Efficient online algorithms for fast-rate regret bounds under sparsity NeurIPS 2018 Nearly second-order optimality of online joint detection and estimation via one-sample update schemes AISTATS 2018 Online convex optimization for cumulative constraints NeurIPS 2018 Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent COLT 2018 Online Convex Optimization with Stochastic Constraints NeurIPS 2017 Variants of RMSProp and Adagrad with Logarithmic Regret Bounds ICML 2017 Accelerating Online Convex Optimization via Adaptive Prediction AISTATS 2016 Adaptive Algorithms for Online Convex Optimization with Long-term Constraints ICML 2016 An Online Convex Optimization Approach to Blackwell's Approachability JMLR 2016 Designing smoothing functions for improved worst-case competitive ratio in online optimization NeurIPS 2016 MetaGrad: Multiple Learning Rates in Online Learning NeurIPS 2016 Online Convex Optimization with Unconstrained Domains and Losses NeurIPS 2016 Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient ICML 2016 Online Density Estimation of Bradley-Terry Models COLT 2015 Online Learning for Adversaries with Memory: Price of Past Mistakes NeurIPS 2015 A Drifting-Games Analysis for Online Learning and Applications to Boosting NeurIPS 2014 Towards Minimax Online Learning with Unknown Time Horizon ICML 2014