:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Yan, Wenjing, Cao, Xuanyu
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Optimization and Control
Online Access:	https://arxiv.org/abs/2401.02011
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning-Augmented Decentralized Online Convex Optimization in Networks
by: Li, Pengfei, et al.
Published: (2023)

Problem-Parameter-Free Decentralized Bilevel Optimization
by: Zhai, Zhiwei, et al.
Published: (2025)

Optimal Decentralized Smoothed Online Convex Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2024)

Safe Online Convex Optimization with Multi-Point Feedback
by: Hutchinson, Spencer, et al.
Published: (2024)

Online Convex Optimization with Unbounded Memory
by: Kumar, Raunak, et al.
Published: (2022)

Unconstrained Robust Online Convex Optimization
by: Zhang, Jiujia, et al.
Published: (2025)

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2025)

Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
by: Bao, Lingchan, et al.
Published: (2025)

Online Convex Optimization with Memory and Limited Predictions
by: Wang, Zhengmiao, et al.
Published: (2024)

Online Convex Optimization with a Separation Oracle
by: Mhammedi, Zakaria
Published: (2024)

Online Non-Stationary Stochastic Quasar-Convex Optimization
by: Pun, Yuen-Man, et al.
Published: (2024)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2024)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
by: Lekeufack, Jordan, et al.
Published: (2024)

Constrained Online Convex Optimization with Polyak Feasibility Steps
by: Hutchinson, Spencer, et al.
Published: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2023)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

Distributed Online Convex Optimization with Nonseparable Costs and Constraints
by: Pan, Zhaoye, et al.
Published: (2026)

Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs
by: Liang, Yifei, et al.
Published: (2026)

Stochastic Weakly Convex Optimization Under Heavy-Tailed Noises
by: Zhu, Tianxi, et al.
Published: (2025)

Projection-Free Online Convex Optimization with Time-Varying Constraints
by: Garber, Dan, et al.
Published: (2024)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
by: Hutchinson, Spencer, et al.
Published: (2024)

Universal Online Convex Optimization with $1$ Projection per Round
by: Yang, Wenhao, et al.
Published: (2024)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
by: Sachs, Sarah, et al.
Published: (2023)

Universal Online Convex Optimization Meets Second-order Bounds
by: Zhang, Lijun, et al.
Published: (2021)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
by: Hihat, Massil, et al.
Published: (2023)

A Proximal Gradient Method With Probabilistic Multi-Gossip Communications for Decentralized Composite Optimization
by: Guo, Luyao, et al.
Published: (2023)

Online Submodular Maximization via Online Convex Optimization
by: Salem, Tareq Si, et al.
Published: (2023)

A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization
by: Pedramfar, Mohammad, et al.
Published: (2024)

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
by: Meng, Qing-xin, et al.
Published: (2025)

DCatalyst: A Unified Accelerated Framework for Decentralized Optimization
by: Cao, Tianyu, et al.
Published: (2025)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
by: Kovalev, Dmitry, et al.
Published: (2024)

Are Convex Optimization Curves Convex?
by: Barzilai, Guy, et al.
Published: (2025)

Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization
by: Sahinoglu, Emre, et al.
Published: (2024)

Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis
by: Jakob, Fabian, et al.
Published: (2025)

Optimized Gradient Tracking for Decentralized Online Learning
by: Sharma, Shivangi Dubey, et al.
Published: (2023)

Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback
by: Liu, Shanqi, et al.
Published: (2024)

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
by: Liu, Zijian
Published: (2025)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2025)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
by: Sahinoglu, Emre, et al.
Published: (2025)