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. Constrained Online Convex Optimization with Memory and Predictions

    Mar 22, 2026Mohammed Abdullah, George Iosifidis, Salah Eddine Elayoubi +1Online Convex OptimizationOnline Learning

  2. Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints

    Mar 15, 2026Xiufeng Liu, Qian Chen, Zhijin Wang +1Online Convex OptimizationPrimal-Dual Optimization

  3. Block-Norm Geometries for Online Mirror Descent with Sparse Losses

    Feb 13, 2026Swati Gupta, Jai Moondra, Mohit SinghOnline Convex OptimizationOnline Mirror Descent

  4. Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations

    Feb 4, 2026Hang Yu, Yu-Hu Yan, Peng ZhaoOnline Convex OptimizationDynamic Regret Minimization

  5. A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees

    Feb 2, 2026Alexander Ryabchenko, Idan Attias, Daniel M. RoyOnline Convex OptimizationBandits with Delayed Feedback

  6. Small Gradient Norm Regret for Online Convex Optimization

    Jan 20, 2026Wenzhi Gao, Chang He, Madeleine UdellOnline Convex OptimizationSequential Decision Making

  7. Distributed Dynamic Associative Memory via Online Convex Optimization

    Nov 28, 2025Bowen Wang, Matteo Zecchin, Osvaldo SimeoneOnline Convex OptimizationAssociative Memory

  8. Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation

    Jul 13, 2025Yan Dai, Negin Golrezaei, Patrick JailletGame TheoryOnline Convex Optimization

  9. Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization

    Jan 30, 2025Yiyang Lu, Mohammad Pedramfar, Vaneet AggarwalSubmodular OptimizationOnline Convex Optimization