Parameter-free Algorithms for the Stochastically Extended Adversarial Model

We develop the first parameter-free algorithms for the Stochastically Extended Adversarial (SEA) model, a framework that bridges adversarial and stochastic online convex optimization. Existing approaches for the SEA model require prior knowledge of problem-specific parameters, such as the diameter of the domain $D$ and the Lipschitz constant of the loss functions $G$, which limits their practical applicability. Addressing this, we develop parameter-free methods by leveraging the Optimistic Online Newton Step (OONS) algorithm to eliminate the need for these parameters. We first establish a comparator-adaptive algorithm for the scenario with unknown domain diameter but known Lipschitz constant, achieving an expected regret bound of $\tilde{O}\big(\Vert u\Vert_2^2 + \Vert u\Vert_2(\sqrt{\sigma^2_{1: T}} + \sqrt{\Sigma^2_{1: T}})\big)$, where $u$ is the comparator vector and $\sigma^2_{1: T}$ and $\Sigma^2_{1: T}$ represent the cumulative stochastic variance and cumulative adversarial variation, respectively. We then extend this to the more general setting where both $D$ and $G$ are unknown, attaining the comparator- and Lipschitz-adaptive algorithm. Notably, the regret bound exhibits the same dependence on $\sigma^2_{1: T}$ and $\Sigma^2_{1: T}$, demonstrating the efficacy of our proposed methods even when both parameters are unknown in the SEA model.

Authors

• Shuche Wang
• Adarsh Barik National University of Singapore
• Peng Zhao Nanjing University
• Vincent Tan

Keywords

No keywords are indexed for this paper.