online convex optimization

An online semi-definite programming with a generalised log-determinant regularizer and its applications ACML 2021 Asynchronous Decentralized Online Learning NeurIPS 2021 Bandit Convex Optimization in Non-stationary Environments JMLR 2021 Best-case lower bounds in online learning NeurIPS 2021 Boosting for Online Convex Optimization ICML 2021 Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions NeurIPS 2021 Dueling Convex Optimization ICML 2021 Expert advice problem with noisy low rank loss ACML 2021 Faster Algorithms and Constant Lower Bounds for the Worst-Case Expected Error NeurIPS 2021 Lazy OCO: Online Convex Optimization on a Switching Budget COLT 2021 MetaGrad: Adaptation using Multiple Learning Rates in Online Learning JMLR 2021 Model-Targeted Poisoning Attacks with Provable Convergence ICML 2021 Online Boosting with Bandit Feedback ALT 2021 Online Convex Optimization with Continuous Switching Constraint NeurIPS 2021 Optimal Rates for Random Order Online Optimization NeurIPS 2021 Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints ICML 2021 Regret Bounds for Adaptive Nonlinear Control L4DC 2021 Revisiting Smoothed Online Learning NeurIPS 2021 Robust Online Convex Optimization in the Presence of Outliers COLT 2021 Adapting to Smoothness: A More Universal Algorithm for Online Convex Optimization AAAI 2020 A Low Complexity Algorithm with O(√T) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints JMLR 2020 A new regret analysis for Adam-type algorithms ICML 2020 Better Full-Matrix Regret via Parameter-Free Online Learning NeurIPS 2020 Combinatorial Multi-Armed Bandits with Concave Rewards and Fairness Constraints IJCAI 2020 Dynamic Regret of Convex and Smooth Functions NeurIPS 2020