English

General Procedure to Provide High-Probability Guarantees for Stochastic Saddle Point Problems

Optimization and Control 2024-07-01 v3

Abstract

This paper considers smooth strongly convex and strongly concave (SC-SC) stochastic saddle point (SSP) problems. Suppose there is an arbitrary oracle that in expectation returns an ϵ\epsilon-solution in the sense of certain gaps, which can be the duality gap or its weaker variants. We propose a general PB-SSP framework to guarantee an ϵ\epsilon small duality gap solution with high probability via only O(log1ppoly(logκ))\mathcal{O}\big(\log \frac{1}{p}\cdot\text{poly}(\log \kappa)\big) calls of this oracle, where p(0,1)p\in(0,1) is the confidence level and κ\kappa is the condition number. When applied to the sample average approximation (SAA) oracle, in addition to equipping the solution with high probability, our approach even improves the sample complexity by a factor of poly(κ)\text{poly}(\kappa), since the high-probability argument enables us to circumvent some key difficulties of the uniform stability analysis of SAA.

Keywords

Cite

@article{arxiv.2405.03219,
  title  = {General Procedure to Provide High-Probability Guarantees for Stochastic Saddle Point Problems},
  author = {Dongyang Li and Haobin Li and Junyu Zhang},
  journal= {arXiv preprint arXiv:2405.03219},
  year   = {2024}
}
R2 v1 2026-06-28T16:17:39.100Z