Cover Image

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhao, Peng, Zhang, Yu-Jie, Zhang, Lijun, Zhou, Zhi-Hua
Format:	Preprint
Published:	2021
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Dynamic Regret via Discounted-to-Dynamic Reduction with Applications to Curved Losses and Adam Optimizer
by: Xie, Yan-Feng, et al.
Published: (2026)

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

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

Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability
by: Zhang, Yu-Jie, et al.
Published: (2025)

Efficient Methods for Non-stationary Online Learning
by: Zhao, Peng, et al.
Published: (2023)

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

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

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

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

Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
by: Li, Long-Fei, et al.
Published: (2024)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
by: Supantha, Subhamon, et al.
Published: (2025)

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

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

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

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

Stochastic Approximation Approaches to Group Distributionally Robust Optimization and Beyond
by: Zhang, Lijun, et al.
Published: (2023)

Distributed Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower bounds
by: Yang, Sifan, et al.
Published: (2026)

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

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

Optimal High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback
by: Ye, Haishan
Published: (2026)

A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization
by: Wang, Yi-Han, et al.
Published: (2025)

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

Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach
by: Yan, Yu-Hu, et al.
Published: (2023)

Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints
by: Liu, Xiufeng, et al.
Published: (2026)

Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
by: Zhang, Yu-Jie, et al.
Published: (2025)

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

Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality
by: Yan, Yu-Hu, et al.
Published: (2025)

Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously
by: Pasteris, Stephen, et al.
Published: (2024)

Revisiting Matrix Sketching in Linear Bandits: Achieving Sublinear Regret via Dyadic Block Sketching
by: Wen, Dongxie, et al.
Published: (2024)

Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
by: Wang, Jing, et al.
Published: (2025)

Gradient-Variation Regret Bounds for Unconstrained Online Learning
by: Zhao, Yuheng, et al.
Published: (2026)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
by: Hua, Youqing, et al.
Published: (2024)

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

Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs
by: Wang, Jing, et al.
Published: (2026)

Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
by: Li, Long-Fei, et al.
Published: (2024)

Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost
by: Vaze, Rahul, et al.
Published: (2024)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
by: Vaze, Rahul, et al.
Published: (2025)