online convex optimization

Efficient Projection-Free Online Methods with Stochastic Recursive Gradient AAAI 2020 Faster Projection-free Online Learning COLT 2020 Leveraging Predictions in Smoothed Online Convex Optimization via Gradient-based Algorithms NeurIPS 2020 Lipschitz and Comparator-Norm Adaptivity in Online Learning COLT 2020 Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition NeurIPS 2020 Online Agnostic Boosting via Regret Minimization NeurIPS 2020 Online Convex Optimization in the Random Order Model ICML 2020 Online Convex Optimization Over Erdos-Renyi Random Networks NeurIPS 2020 Online Convex Optimization with Perturbed Constraints: Optimal Rates against Stronger Benchmarks AISTATS 2020 Online mirror descent and dual averaging: keeping pace in the dynamic case ICML 2020 Projection-free Distributed Online Convex Optimization with O(√T) Communication Complexity ICML 2020 Projective Quadratic Regression for Online Learning AAAI 2020 Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses NeurIPS 2020 Adaptive Gradient-Based Meta-Learning Methods NeurIPS 2019 Adaptive Regret of Convex and Smooth Functions ICML 2019 Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization UAI 2019 An Online Algorithm for Smoothed Regression and LQR Control AISTATS 2019 Artificial Constraints and Hints for Unbounded Online Learning COLT 2019 Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization NeurIPS 2019 Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints ICML 2019 Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NeurIPS 2019 Lipschitz Adaptivity with Multiple Learning Rates in Online Learning COLT 2019 Matrix-Free Preconditioning in Online Learning ICML 2019 Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games AAAI 2019 Online Convex Optimization in Adversarial Markov Decision Processes ICML 2019