Dynamic Saddle Point Regret in Online Optimization

• Dynamic saddle point regret is a framework evaluating performance in time-varying convex-concave games by comparing online iterates to per-round saddle points.
• It incorporates various metrics such as SP-Regret, duality gap, and dynamic Nash equilibrium regret to measure deviations from ideal min-max equilibria.
• Recent methods using mirror descent, extragradient, and proximal updates achieve sublinear bounds, ensuring robust performance in nonstationary and stochastic settings.

Searching arXiv for recent and foundational papers on dynamic saddle point regret and related online saddle-point optimization. Dynamic saddle point regret denotes a family of online performance criteria for sequences of two-player time-varying convex-concave games. In the canonical setting, a minimizer chooses $x_t \in X$, a maximizer chooses $y_t \in Y$, the environment reveals a payoff $f_t : X \times Y \to \mathbb{R}$ that is convex in $x$ and concave in $y$, and performance is judged against either a cumulative saddle point, a per-round saddle-point sequence, or a primal-dual gap benchmark. In recent work this viewpoint is formalized by the Online Saddle Point problem and the Online Convex-Concave Optimization (OCCO) framework, which treats saddle-point tracking as the min-max analogue of dynamic regret in Online Convex Optimization (OCO) (Meng et al., 2023, Roy et al., 2019, Vyas et al., 11 Feb 2026).

1. Problem setting and basic objects

In OCCO and closely related online saddle-point models, the decision sets $X \subset \mathbb{R}^{d_x}$ and $Y \subset \mathbb{R}^{d_y}$ are convex and compact, and each round $t=1,\dots,T$ presents a convex-concave stage game $f_t$. A per-round saddle point $(x_t^*,y_t^*)$ satisfies

$y_t \in Y$0

together with the saddle inequalities

$y_t \in Y$1

The online objective is not merely to perform well against one player while treating the other player’s sequence as fixed; it is to generate a joint trajectory $y_t \in Y$2 that remains close to a suitable equilibrium notion for the changing game sequence (Meng et al., 2023, Meng et al., 2024).

A foundational earlier formulation defined the Online Saddle Point problem through a benchmark based on the saddle point of the aggregate payoff $y_t \in Y$3. Later work broadened the perspective in two directions. One direction emphasized nonstationary stochastic saddle-point optimization, where the benchmark is the moving stage-wise saddle-point path $y_t \in Y$4. The other direction emphasized cumulative saddle points and duality-gap constructions that make the analogy with OCO explicit (Rivera et al., 2018, Roy et al., 2019, Vyas et al., 11 Feb 2026).

2. Metric families

The literature does not use a single universal definition. Instead, “dynamic saddle point regret” refers to several related criteria that differ mainly in the comparator and in whether the metric is payoff-based, distance-based, or variational.

Metric	Benchmark	Representative expression
SP-Regret	Saddle point of $y_t \in Y$5	$y_t \in Y$6
Duality gap	Per-round best responses to actual play	$y_t \in Y$7
Dynamic Nash equilibrium regret	Sum of per-round minimax values	$y_t \in Y$8, $y_t \in Y$9
Dynamic saddle-point path regret	Per-round saddle-point sequence	$f_t : X \times Y \to \mathbb{R}$0
DSP-Reg$f_t : X \times Y \to \mathbb{R}$1	Per-round minimizers of $f_t : X \times Y \to \mathbb{R}$2	$f_t : X \times Y \to \mathbb{R}$3

For DSP-Reg$f_t : X \times Y \to \mathbb{R}$4, the gap functions are

$f_t : X \times Y \to \mathbb{R}$5

where $f_t : X \times Y \to \mathbb{R}$6 is the cumulative saddle point of $f_t : X \times Y \to \mathbb{R}$7. This construction turns a min-max problem into a dynamic-regret problem on the convex sequence $f_t : X \times Y \to \mathbb{R}$8 (Vyas et al., 11 Feb 2026).

These definitions differ in what they regard as the correct online analogue of equilibrium. SP-Regret uses an aggregate-game comparator. Dual-gap measures primal-dual inconsistency directly. Dynamic Nash equilibrium regret compares realized cumulative payoff to the sum of stage values. DSPP tracks the moving saddle-point path in distance. DSP-Reg$f_t : X \times Y \to \mathbb{R}$9 imports the dynamic-regret template of OCO into cumulative saddle-point optimization (Rivera et al., 2018, Meng et al., 2024, Roy et al., 2019, Vyas et al., 11 Feb 2026).

3. Relation to dynamic regret in OCO

A central theme of the modern literature is that OCCO is a natural extension of OCO. If $x$0 is a singleton and $x$1, the saddle-point game collapses to standard online convex optimization. In that reduction, saddle-point comparators reduce to the usual minimizers of $x$2, and the corresponding saddle-point metric reduces to regret (Meng et al., 2023).

This parallel is most explicit for duality-gap formulations. In the proximal-point treatment of the online saddle-point problem,

$x$3

so the cumulative duality gap is exactly the sum of the two players’ individual regrets. The same work also records the inequality

$x$4

which makes dual-gap control sufficient for dynamic Nash equilibrium regret control (Meng et al., 2024).

Variation measures play the same role here that path length and functional variation play in OCO. Representative examples include

$x$5

the path length of best responses, and

$x$6

where $x$7. In distributed stochastic convex-concave optimization, the path variation is refined further through predictive mappings: $x$8 with $x$9 (Meng et al., 2024, Zhang et al., 13 Aug 2025).

4. Algorithms and guarantees

The algorithmic literature largely follows the same template as OCO: mirror descent, optimistic updates, proximal regularization, extragradient schemes, and expert/meta-algorithm reductions.

Within OCCO, the 2023 formulation develops implicit online mirror descent-ascent and an optimistic variant, and shows that their duality gaps have expression forms similar to the corresponding dynamic regrets arising from implicit updates in OCO. This work is primarily conceptual: it places the generalized Dual-Gap at the center of the theory and frames OCCO as the min-max continuation of OCO (Meng et al., 2023).

The proximal-point line sharpens this with explicit dynamic guarantees. The Online Proximal Point Method (OPPM), Optimistic OPPM (OptOPPM), and OptOPPM with multiple predictors all control both duality gap and dynamic Nash equilibrium regret. A lower bound shows that for any algorithm there exists a sequence with

$y$0

and the proposed methods attain matching worst-case scaling up to logarithmic factors. In particular, OPPM yields

$y$1

while OptOPPM replaces $y$2 by the predictor error $y$3. In stationary environments, these bounds collapse to $y$4, giving near-constant dynamic saddle-point error (Meng et al., 2024).

For nonstationary stochastic saddle-point optimization, extragradient and Frank-Wolfe provide the main first-order and constrained tools. In the smooth, strongly-convex and strongly-concave setting, extragradient controls the Dynamic Saddle-Point Path regret $y$5, and with the choice $y$6 the bounds specialize to the familiar dynamic-regret form

$y$7

The same paper also develops multi-point bandit variants through Gaussian smoothing and establishes sub-linear regret in both the online and bandit settings (Roy et al., 2019).

Distributed and predictive variants have recently appeared. A distributed online stochastic mirror descent convex-concave optimization algorithm with time-varying predictive mappings attains

$y$8

expected dynamic saddle point regret, and multiple consensus steps can tighten the bound. The guarantee is sublinear whenever $y$9 is sublinear (Zhang et al., 13 Aug 2025).

A distinct recent line starts from cumulative saddle points. It introduces SDual-Gap$X \subset \mathbb{R}^{d_x}$0 and DSP-Reg$X \subset \mathbb{R}^{d_x}$1, then applies reductions to classic OCO problems. Under strong convexity-strong concavity, MMFLH with OGDA gives

$X \subset \mathbb{R}^{d_x}$2

and under min-max exponential concavity the corresponding bound becomes

$X \subset \mathbb{R}^{d_x}$3

The same work also derives a dynamic notion compatible with individual regrets under a two-sided Polyak-Łojasiewicz condition (Vyas et al., 11 Feb 2026).

5. Compatibility issues and metric controversies

A major controversy concerns which equilibrium-based metric is actually aligned with online min-max optimization. Several papers argue that not every plausible comparator is reliable.

The OCCO paper explicitly states that dynamic Nash equilibrium regret “has inherent defects,” and the proximal-point paper reiterates “potential reliability concerns” about using dynamic Nash equilibrium regret as a performance metric. The main concern is that equilibrium-value comparisons can mask poor per-round saddle behavior, whereas duality-gap metrics are tied directly to the saddle inequalities and to the players’ one-sided regrets (Meng et al., 2023, Meng et al., 2024).

A related criticism now targets static Nash-equilibrium-style metrics more broadly. The cumulative-saddle-point formulation of 2026 first observes the incompatibility of static Nash equilibrium regret with individual regrets “even for strongly convex-strongly concave functions,” and then introduces SDual-Gap$X \subset \mathbb{R}^{d_x}$4 and DSP-Reg$X \subset \mathbb{R}^{d_x}$5 as alternatives. In this view, a satisfactory dynamic metric should be compatible with individual regrets and should reduce cleanly to an OCO-style dynamic regret after an appropriate gap-function transformation (Vyas et al., 11 Feb 2026).

The literature therefore separates two ideas that were often conflated in earlier work: equilibrium-value tracking and variational saddle-point tracking. Dual-gap, DSPP, and DSP-Reg$X \subset \mathbb{R}^{d_x}$6 belong to the second family. SP-Regret and dynamic Nash equilibrium regret belong to the first. The current trend favors the variational family when the goal is to certify that online iterates are close to satisfying the saddle-point conditions themselves (Rivera et al., 2018, Meng et al., 2023).

6. Extensions and broader scope

Dynamic saddle point regret now spans centralized, distributed, stochastic, and bandit settings. A foundational online saddle-point result established SP-Regret bounds of order $X \subset \mathbb{R}^{d_x}$7 in the general convex-concave case, $X \subset \mathbb{R}^{d_x}$8 in the strongly convex-concave case, and sublinear SP-Regret under bandit feedback; it also connected online convex optimization with knapsacks to online saddle-point methods through a primal-dual reduction (Rivera et al., 2018).

The nonstationary stochastic line adds per-round saddle-point tracking through DSPP and DSPM, while the distributed line adds network disagreement, consensus error, and predictive mappings to the regret analysis. This suggests that dynamic saddle point regret is not restricted to a single centralized zero-sum protocol, but is now used as a common performance language across online games, stochastic optimization, and multiagent convex-concave optimization (Roy et al., 2019, Zhang et al., 13 Aug 2025).

Recent theory also extends beyond classical convex-concave regularity. The cumulative-saddle-point framework derives DSP-Reg$X \subset \mathbb{R}^{d_x}$9 bounds under strong convexity-strong concavity and min-max exponential concavity, establishes a class of functions satisfying min-max EC that captures a two-player variant of the classic portfolio selection problem, and gives a separate dynamic criterion under a two-sided PL condition. A plausible implication is that the term “dynamic saddle point regret” is increasingly functioning as an umbrella concept for several min-max analogues of dynamic regret, rather than as the name of one fixed formula (Vyas et al., 11 Feb 2026).