Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization

by   Sijia Chen, et al.

Stochastically Extended Adversarial (SEA) model is introduced by Sachs et al. [2022] as an interpolation between stochastic and adversarial online convex optimization. Under the smoothness condition, they demonstrate that the expected regret of optimistic follow-the-regularized-leader (FTRL) depends on the cumulative stochastic variance σ_1:T^2 and the cumulative adversarial variation Σ_1:T^2 for convex functions. They also provide a slightly weaker bound based on the maximal stochastic variance σ_max^2 and the maximal adversarial variation Σ_max^2 for strongly convex functions. Inspired by their work, we investigate the theoretical guarantees of optimistic online mirror descent (OMD) for the SEA model. For convex and smooth functions, we obtain the same 𝒪(√(σ_1:T^2)+√(Σ_1:T^2)) regret bound, without the convexity requirement of individual functions. For strongly convex and smooth functions, we establish an 𝒪(min{log (σ_1:T^2+Σ_1:T^2), (σ_max^2 + Σ_max^2) log T}) bound, better than their 𝒪((σ_max^2 + Σ_max^2) log T) bound. For and smooth functions, we achieve a new 𝒪(dlog(σ_1:T^2+Σ_1:T^2)) bound. Owing to the OMD framework, we can further extend our result to obtain dynamic regret guarantees, which are more favorable in non-stationary online scenarios. The attained results allow us to recover excess risk bounds of the stochastic setting and regret bounds of the adversarial setting, and derive new guarantees for many intermediate scenarios.


page 1

page 2

page 3

page 4


Improved Dynamic Regret for Online Frank-Wolfe

To deal with non-stationary online problems with complex constraints, we...

Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness

Stochastic and adversarial data are two widely studied settings in onlin...

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition

This paper considers distributed online convex optimization with adversa...

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization

Stochastic and adversarial data are two widely studied settings in onlin...

Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses

In online convex optimization (OCO), Lipschitz continuity of the functio...

Non-stationary Stochastic Optimization with Local Spatial and Temporal Changes

We consider a non-stationary sequential stochastic optimization problem,...

Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions

In this paper, we present an improved analysis for dynamic regret of str...

Please sign up or login with your details

Forgot password? Click here to reset