:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Yang, Sifan, Yang, Wenhao, Jiang, Wei, Zhang, Lijun
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2601.04907
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval
by: Yang, Wenhao, et al.
Published: (2025)

Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
by: Yang, Sifan, et al.
Published: (2026)

Efficient Sign-Based Optimization: Accelerating Convergence via Variance Reduction
by: Jiang, Wei, et al.
Published: (2024)

Improved Analysis for Sign-based Methods with Momentum Updates
by: Jiang, Wei, et al.
Published: (2025)

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
by: Wan, Yuanyu, et al.
Published: (2024)

Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
by: Yang, Sifan, et al.
Published: (2025)

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

Dual Adaptivity: Universal Algorithms for Minimizing the Adaptive Regret of Convex Functions
by: Zhang, Lijun, et al.
Published: (2025)

Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization
by: Jiang, Wei, et al.
Published: (2024)

Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptions
by: Jiang, Wei, et al.
Published: (2024)

Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond
by: Yu, Dingzhi, et al.
Published: (2024)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
by: Chen, Sijia, et al.
Published: (2023)

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

Improved Regret for Bandit Convex Optimization with Delayed Feedback
by: Wan, Yuanyu, et al.
Published: (2024)

Convergence Analysis of the Lion Optimizer in Centralized and Distributed Settings
by: Jiang, Wei, et al.
Published: (2025)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2021)

Projection-free Online Learning over Strongly Convex Sets
by: Wan, Yuanyu, et al.
Published: (2020)

Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting
by: Wan, Yuanyu, et al.
Published: (2023)

Federated Distributionally Robust Optimization with Non-Convex Objectives: Algorithm and Analysis
by: Jiao, Yang, et al.
Published: (2023)

Bilevel Optimization with Lower-Level Uniform Convexity: Theory and Algorithm
by: Wu, Yuman, et al.
Published: (2026)

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

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

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

BSO: Binary Spiking Online Optimization Algorithm
by: Liang, Yu, et al.
Published: (2025)

Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound
by: Sakaue, Shinsaku, et al.
Published: (2025)

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

Distributed Associative Memory via Online Convex Optimization
by: Wang, Bowen, et al.
Published: (2025)

Alternating Regret for Online Convex Optimization
by: Hait, Soumita, et al.
Published: (2025)

Improved Dynamic Regret for Online Frank-Wolfe
by: Wan, Yuanyu, et al.
Published: (2023)

Efficient Stochastic Approximation of Minimax Excess Risk Optimization
by: Zhang, Lijun, et al.
Published: (2023)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)

Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction
by: Sarkar, Dhruv, et al.
Published: (2026)

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

Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression
by: He, Yutong, et al.
Published: (2023)

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

Distributed Dynamic Associative Memory via Online Convex Optimization
by: Wang, Bowen, et al.
Published: (2025)

Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints
by: Yang, Ming, et al.
Published: (2025)

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

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