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

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 ε-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 ε small duality gap solution with high probability via only O( 1p·poly( )) calls of this oracle, where p∈(0,1) is the confidence level and 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(), since the high-probability argument enables us to circumvent some key difficulties of the uniform stability analysis of SAA.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…