Online Convex Optimization

Overview

Online convex optimization studies how to choose actions sequentially as convex losses arrive, measuring performance against the best fixed or changing comparator in hindsight. Common methods include Online Mirror Descent, projected gradient descent, Follow-the-Regularized-Leader, and adaptive or optimistic variants; feedback may be full-information, bandit, delayed, or distributed. Constraints and changing feasible sets add costs such as cumulative violation, movement, communication, and computation, so algorithms often balance these against regret. Current work sharpens guarantees for dynamic comparators and problem-dependent conditions, while a central challenge is achieving optimal regret and feasibility with partial feedback and limited resources.

Latest papers

CardsList

73 papers16 papers in the last four weeks, up 78% on the four weeks before. 0.1% of all new papers.

  1. Nested Convex-Body Chasing for Online Optimization with Evolving Feasible Sets

    Aug 29, 2026Dhruv Sarkar, Aprameyo ChakrabarttyOnline Convex Optimization

  2. Optimal Alternating Regret for Online Learning and Games

    Aug 25, 2026Yixin Tao, Weiqiang ZhengOnline LPOnline Convex Optimization

  3. Online Convex Optimization with Dueling Feedback

    Aug 15, 2026Yiyang Lu, Hareshkumar Jadav, Mohammad Pedramfar +2Online Convex OptimizationFollow-the-Regularized-Leader

  4. Distributed Optimization with Streaming Data: A Temporal Weighting Perspective

    Aug 10, 2026Muhammad Faraz Ul Abrar, Nicolò Michelusi, Erik G. LarssonOnline Convex OptimizationDecentralized Optimization

  5. Sharp Root Anti-Concentration via Projective Incidence and Ordered Root Laws

    Aug 3, 2026Zijun Wang, Yuchen Miao, Yifan Hu +1Online Convex OptimizationStatistical Learning Theory

  6. Real-Time Hard Peak Age-of-Information Safety with No-Regret Learning

    Jul 30, 2026Wentao Zhang, Wentao MoOnline Convex OptimizationReal-Time Scheduling

  7. Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization

    Jul 28, 2026Wentao ZhangOnline Convex OptimizationConstrained Optimization

  8. Decentralized Online Riemannian Optimization for Strongly Geodesically Convex Functions

    Jul 22, 2026Zhanyuan Cai, Emre Sahinoglu, Shahin ShahrampourOnline Convex OptimizationRiemannian Optimization

  9. On the Convergence of Adam, Revisited

    Jul 3, 2026Steven Heilman, Sampad MohantyOnline Convex OptimizationStochastic Optimization Convergence

  10. Revisiting Decentralized Online Convex Optimization with Compressed Communication

    Jul 2, 2026Hao Zhou, Xiaoyu Wang, Chang Yao +2Online Convex OptimizationFollow-the-Regularized-Leader

  11. Constrained Online Convex Optimization without Slater's Condition

    Jun 30, 2026Kihyun Yu, Junehee Lee, Dabeen LeePrimal-Dual OptimizationOnline Convex Optimization

  12. Adversarial Bandit Optimization with Globally Bounded Perturbations to Convex Losses

    Jun 18, 2026Zhuoyu Cheng, Kohei Hatano, Eiji TakimotoOnline Convex OptimizationBandit Convex Optimization

  13. Online Convex Optimization with Sublinear Noisy Probes

    Jun 12, 2026Simone Di Gregorio, Anupam Gupta, Stefano Leonardi +1Online Convex OptimizationOnline Learning

  14. Capacity-Constrained Online Convex Optimization with Delayed Feedback

    Jun 10, 2026Alexander Ryabchenko, Idan Attias, Daniel M. RoyOnline Convex OptimizationBandit Convex Optimization

  15. Noise-Adaptive High-Probability Regret Bounds for Online Convex Optimization

    Jun 6, 2026Wentao Zhang, Yutong Zhang, Wentao MoOnline Convex OptimizationBandit Convex Optimization

  16. From Non-Convex to Strongly Convex: Curvature-Adaptive FTPL for Online Optimization

    Jun 1, 2026Moses Charikar, Chirag Pabbaraju, Ambuj TewariOnline Convex OptimizationFollow-the-Perturbed-Leader

  17. Decentralized Parameter-Free Online Learning with Compressed Gossip

    May 27, 2026Tomas Ortega, Hamid JafarkhaniOnline Convex OptimizationDecentralized Learning

  18. Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback

    May 25, 2026Anas Barakat, Andreas Kontogiannis, Vasilis Pollatos +2Online Convex OptimizationGradient Descent

  19. Bandit Convex Optimization with Gradient Prediction Adaptivity

    May 21, 2026Shuche Wang, Adarsh Barik, Vincent Y. F. TanOnline Convex OptimizationDynamic Regret Minimization

  20. A Geometric Approach to Constrained Online Learning

    May 20, 2026Dhruv Sarkar, Abhishek SinhaOnline Convex OptimizationOnline Learning

  21. Polyhedral Instability Governs Regret in Online Learning

    May 13, 2026Yuetai Li, Fengqing Jiang, Yichen Feng +6Online Convex OptimizationCombinatorial Optimization

  22. FedSEA: Achieving Benefit of Parallelization in Federated Online Learning

    Apr 21, 2026Harekrushna Sahu, Pratik Jawanpuria, Pranay SharmaOnline Convex OptimizationNon-IID Federated Learning

  23. Gradient-Variation Regret Bounds for Unconstrained Online Learning

    Apr 13, 2026Yuheng Zhao, Andrew Jacobsen, Nicolò Cesa-Bianchi +1Parameter-Free Online LearningOnline Convex Optimization

  24. Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications

    Apr 10, 2026Sifan Yang, Dan-Yue Li, Lijun ZhangError FeedbackOnline Convex Optimization