S olving stochastic weak M inty variational inequalities without increasing batch size
Anonymous authors
Paper under double-blind review
A bstract
This paper introduces a family of stochastic extragradient-type algorithms for a class of nonconvex-nonconcave problems characterized by the weak Minty variational inequality (MVI).
Unlike existing results on extragradient methods in the monotone setting, employing diminishing stepsizes is no longer possible in the weak MVI setting.
This has led to approaches such as increasing batch sizes per iteration which can however be prohibitively expensive.
In contrast, our proposed methods involves two stepsizes and only requires one additional oracle evaluation per iteration.
We show that it is possible to keep one fixed stepsize while it is only the second stepsize that is taken to be diminishing, making it interesting even in the monotone setting.
Almost sure convergence is established and we provide a unified analysis for this family of schemes which contains a nonlinear generalization of the celebrated primal dual hybrid gradient algorithm
I ntroduction
Stochastic first-order methods have been at the core of the current success in deep learning applications.
These methods are mostly well-understood for minimization problems at this point.
This is even the case in the nonconvex setting where there exists matching upper and lower bounds on the complexity for finding an approximately stable point (Arjevani et al., 2019).
The picture becomes less clear when moving beyond minimization into nonconvex-nonconcave minimax problems—or more generally nonmonotone variational inequalities.
Even in the deterministic case, finding a stationary point is in general intractable (Daskalakis et al., 2021; Hirsch & Vavasis, 1987; Papadimitriou, 1994).
This is in stark contrast with minimization where only global optimality is NP-hard.
An interesting nonmonotone class for which we do have e ffi cient algorithms is characterized by the so called weak Minty variational inequality (MVI) (Diakonikolas et al., 2021).
This problem class captures nontrivial structures such as attracting limit cycles and is governed by a parameter ρ whose negativity increases the degree of nonmonotonicity.
It turns out that the stepsize γ for the exploration step in extragradient-type schemes lower bounds the problem class through ρ > − γ /
(Pethick et al., 2022).
In other words, it seems that we need to take γ large to guarantee convergence for a large class.
This reliance on a large stepsize is at the core of why the community has struggled to provide a stochastic variants for weak MVIs.
The only known results e ff ectively increase the batch size at every iteration (Diakonikolas et al., 2021, Thm. 4.5)—a strategy that would be prohibitively expensive in most machine learning applications.
Pethick et al.
(2022) proposed (SEG + ) which attempts to tackle the noise by only diminishing the second stepsize.
This su ffi ces in the special case of unconstrained quadratic games but can fail even in the monotone case as illustrated in Figure 1.
This naturally raises the following research question:
Can stochastic weak Minty variational inequalities be solved without increasing the batch size?
We resolve this open problem in the a ffi rmative when the stochastic oracles are Lipschitz in mean, with a modification of stochastic extragradient called bias-corrected stochastic extragradient (BCSEG + ).
The scheme only requires one additional first order oracle call, while crucially maintaining the fixed stepsize.
Specifically, we make the following contributions:
(i)
We show that it is possible to converge for weak MVI without increasing the batch size, by introducing a bias-correction term.
The scheme introduces no additional hyperparameters and recovers the maximal range ρ ∈ ( − γ / 2 , ∞ ) of explicit deterministic schemes.
The rate we establish is interesting already in the star-monotone case where only asymptotic convergence of the norm of the operator was known when refraining from increasing the batch size (Hsieh et al., 2020, Thm. 1).
Our result additionally carries over to another class of problem treated in Appendix G, which we call negative weak MVIs.
(ii)
We generalize the result to a whole family of schemes that can treat constrained and regularized settings.
First and foremost the class includes a generalization of the forward-backwardforward (FBF) algorithm of Tseng (2000) to stochastic weak MVIs.
The class also contains a stochastic nonlinear extension of the celebrated primal dual hybrid gradient (PDHG) algorithm (Chambolle & Pock, 2011).
Both methods are obtained as instantiations of the same template scheme, thus providing a unified analysis and revealing an interesting requirement on the update under weak MVI when only stochastic feedback is available.
(iii)
We prove almost sure convergence under the classical Robbins-Monro stepsize schedule of the second stepsize.
This provides a guarantee on the last iterate, which is especially important in the nonmonotone case, where average guarantees cannot be converted into a single candidate solution.
Almost sure convergence is challenging already in the monotone case where even stochastic extragradient may not converge (Hsieh et al., 2020, Fig. 1).
R elated work
Weak MVI Diakonikolas et al.
(2021) was the first to observe that an extragradient-like scheme called extragradient + (EG + ) converges globally for weak MVIs with ρ ∈ ( − 1 / 8 L F , ∞ ).
This results was later tighten to ρ ∈ ( − 1 / 2 L F , ∞ ) and extended to constrained and regularized settings in (Pethick et al., 2022).
A single-call variant has been analysed in Böhm (2022).
Weak MVI is a star variant of cohypomonotonicity, for which an inexact proximal point method was originally studied in Combettes & Pennanen (2004).
Later, a tight characterization was carried out by Bauschke et al.
(2021) for the exact case.
It was shown that acceleration is achievable for an extragradient-type scheme even for cohypomonotone problems (Lee & Kim, 2021).
Despite this array of positive results the stochastic case is largely untreated for weak MVIs.
The only known result (Diakonikolas et al., 2021, Theorem 4.5) requires the batch size to be increasing.
Similarly, the accelerated method in
Lee & Kim (2021, Thm. 6.1) requires the variance of the stochastic oracle to decrease as O (1 / k ).
Stochastic & monotone When more structure is present the story is di ff erent since diminishing stepsizes becomes permissible.
In the monotone case rates for the gap function was obtained for stochastic Mirror-Prox in Juditsky et al.
(2011) under bounded domain assumption, which was later relaxed for the extragradient method under additional assumptions (Mishchenko et al., 2020).
The norm of the operator was shown to asymptotically converge for unconstrained MVIs in Hsieh et al.
(2020) with a double stepsize policy.
There exists a multitude of extensions for monotone problems: Single-call stochastic methods are covered in detail by Hsieh et al.
(2019), variance reduction was applied to Halpern-type iterations (Cai et al., 2022), cocoercivity was used in Beznosikov et al.
(2022), and bilinear games studied in Li et al.
Beyond monotonicity, a range of structures have been explored such as MVIs (Song et al., 2020), pseudomonotonicity (Kannan & Shanbhag, 2019; Bo¸t et al., 2021), two-sided Polyak-Łojasiewicz condition
(Yang et al., 2020), expected cocoercivity (Loizou et al., 2021), su ffi ciently bilinear (Loizou et al., 2020), and strongly star-monotone (Gorbunov et al., 2022).
Variance reduction The assumptions we make about the stochastic oracle in Section 3 are similar to what is found in the variance reduction literature (see for instance Alacaoglu & Malitsky (2021,
Assumption 1) or Arjevani et al.
However, our use of the assumption are di ff erent in a crucial way.
Whereas the variance reduction literature uses the stepsize γ ∝ 1 / L ˆ F (see e.g. Alacaoglu & Malitsky (2021, Theorem 2.5)), we aim at using the much larger γ ∝ 1 / L F .
For instance, in the special case of a finite sum problem of size N , the mean square smoothness constant L ˆ F from
Assumption III can be √ N times larger than L F (see Appendix I for details).
This would lead to a prohibitively strict requirement on the degree of allowed nonmonotonicity through the relationship ρ > − γ / 2 .
Bias-correction
The idea of adding a correction term has also been exploited in minimization, specifically in the context of compositional optimization Chen et al.
Due to their distinct problem setting it su ffi ces to simply extend stochastic gradient descent (SGD), albeit under additional assumptions such as (Chen et al., 2021, Assumption 3).
In our setting, however, SGD is not possible even when restricting ourselves to monotone problems.
P roblem formulation and preliminaries
We are interesting in finding z ∈ (cid:146) n such that the following inclusion holds,
[Equation]
A wide range of machine learning applications can be cast as an inclusion.
Most noticeable, a structured minimax problem can be reduced to (3.1) as shown in Section 8.1.
We will rely on common notation and concepts from monotone operators (see Appendix B for precise definitions).
Assumption I.
In problem (3.1) ,
(i) The operator F : (cid:146) n → (cid:146) n is L F -Lipschitz with L F ∈ [
[Equation]
) , i
e.
[Equation]
(ii) The operator A : (cid:146) n ⇒ (cid:146) n is a maximally monotone operator
[Equation]
(iii) Weak Minty variational inequality (MVI) holds,
i
e., there exists a nonempty set S ⋆ ⊆
zer T such that for all z ⋆ ∈ S ⋆ and some ρ ∈ ( − 12 L F , ∞ )
[Equation]
Remark 1.
In the unconstrained and smooth case ( A ≡ 0), Assumption I (iii) reduces to ⟨
Fz , z − z ⋆ ⟩ ≥ ρ ∥
Fz ∥ 2 for all z ∈ (cid:146) n .
When ρ = 0 this condition reduces to the MVI (i.e. star-monotonicity), while negative ρ makes the problem increasingly nonmonotone.
Interestingly, the inequality is not symmetric and one may instead consider that the assumption holds for − F .
Through this observation,
Appendix G extends the reach of the extragradient-type algorithms developed for weak MVIs.
Stochastic oracle We assume that we cannot compute Fz easily, but instead we have access to the stochastic oracle ˆ F ( z , ξ ), which we assume is unbiased with bounded variance.
We additionally assume that z (cid:55)→ ˆ F ( z , ξ ) is L ˆ F Lipschitz continuous in mean and that it can be simultaneously queried under the same randomness.
Assumption II.
For the operator ˆ F ( · , ξ ) : (cid:146) n → (cid:146) n the following holds.
(i) Two-point oracle: The stochastic oracle can be queried for any two points z , z ′ ∈ [Equation] n
[Equation]
(ii) Unbiased: E ξ (cid:104)
ˆ F ( z , ξ ) (cid:105) =
Fz ∀ z ∈ (cid:146) n .
(iii) Bounded variance: E ξ (cid:104) ∥
ˆ F ( z , ξ ) − ˆ F ( z ′ , ξ ) ∥ 2 (cid:105) ≤ σ 2 F
[Equation]
z ′
[Equation]
Assumption III.
The operator ˆ F ( · , ξ ) : (cid:146) n → (cid:146) n is Lipschitz continuous in mean with L ˆ F ∈ [0 , ∞ ) :
[Equation]
Remark 2.
Assumptions II (i) and III are also common in the variance reduction literature (Fang et al., 2018; Nguyen et al., 2019; Alacaoglu & Malitsky, 2021), but in contrast with variance reduction we will not necessarily need knowledge of L ˆ F to specify the algorithm, in which case the problem constant will only a ff ect the complexity.
Crucially, this decoupling of the stepsize from L ˆ F will allow the proposed scheme to converge for a larger range of ρ in Assumption I (iii) .
Finally, note that Assumption II (i) commonly holds in machine learning applications, where usually the stochasticity is induced by the sampled mini-batch.
M ethod
To arrive at a stochastic scheme for weak MVI we first need to understand the crucial ingredients in the deterministic setting.
For simplicity we will initially consider the unconstrained and smooth
Algorithm 1 (BC-SEG + ) Stochastic algorithm for problem (3.1) when A ≡
R equire
[Equation]
R epeat for k = 0 , 1 , . . .
until convergence
[Equation]
setting, i.e. A ≡ 0 in (3.1).
The first component is taking the second stepsize α smaller as done in extragradient + (EG + ),
[Equation]
where α ∈ (0 , 1).
Convergence in weak MVI was first shown in Diakonikolas et al.
(2021) and later tightened by Pethick et al.
(2022), who characterized that smaller α allows for a larger range of the problem constant ρ .
Taking α small is unproblematic for a stochastic scheme where usually the stepsize is taken diminishing regardless.
However, Pethick et al.
(2022) also showed that the extrapolation stepsize γ plays a critical role for convergence under weak MVI.
Specifically, they proved that a larger stepsize γ leads to a looser bound on the problem class through ρ > − γ/ 2.
Unfortunately, picking γ large (e.g. as γ = 1 / L F ) causes significant complications in the stochastic case where both stepsizes are usually taken to be diminishing as in the following scheme,
[Equation]
, ξ
[Equation]
with
[Equation]
where α k = β k ∝ 1 / k .
Even with a two-timescale variant (when β k > α k ) it has only been possible to show convergence for MVI (i.e. when ρ = 0)
(Hsieh et al., 2020).
Instead of decreasing both stepsizes, Pethick et al.
(2022) proposes a scheme that keeps the first stepsize constant,
[Equation]
However, (SEG + ) does not necessarily converge even in the monotone case as we illustrate in Figure 1.
The non-convergence stems from the bias term introduced by the randomness of ¯ z k in ˆ F (¯ z k , ¯ ξ k ).
Intuitively, the role of ¯ z k is to approximate the deterministic exploration step ˜¯ z k : =
z k − γ Fz k .
While ¯ z k is an unbiased estimate of ˜¯ z k this does not imply that ˆ F (¯ z k , ¯ ξ k ) is an unbiased estimate of F (˜¯ z k ).
Unbiasedness only holds in special cases, such as when F is linear and
A ≡ 0 for which we show convergence of (SEG + ) in Section 5 under weak MVI.
In the monotone case it su ffi
ce to take the exploration stepsize γ diminishing (Hsieh et al., 2020, Thm. 1), but this runs counter to the fixed stepsize requirement of weak MVI.
Instead we propose bias-corrected stochastic extragradient + (BC-SEG + ) in Algorithm 1.
BC-SEG + adds a bias correction term of the previous operator evaluation using the current randomness ξ k .
This crucially allows us to keep the first stepsize fixed.
We further generalize this scheme to constrained and regularized setting with Algorithm 2 by introducing the use of the resolvent, (id + γ A ) − 1 .
A nalysis of SEG +
In the special case where F is a ffi ne and A ≡ 0 we can show convergence of (SEG + ) under weak MVI up to arbitrarily precision even with a large stepsize γ .
Theorem 5.1.
Suppose that Assumptions I and II hold.
Assume Fz : =
Bz + v and choose α k ∈ (0 , 1) and γ ∈ (0 , 1 / L F ) such that ρ ≥ γ
( α k − 1) / 2 .
Consider the sequence ( z k ) k ∈ (cid:142) generated by (SEG + ) .
Then for all z ⋆ ∈ S ⋆ ,
[Equation]
The underlying reason for this positive results is that ˆ F (¯ z k , ¯ ξ k ) is unbiased when F is linear.
This no longer holds when either linearity of F is dropped or when the resolvent is introduced for A (cid:46) 0, in which case the scheme only converges to a γ -dependent neighborhood as illustrated in Figure 1.
This is problematic in weak MVI where γ cannot be taken arbitrarily small (see Figure 3 of Appendix H).
A nalysis for unconstrained and smooth case
For simplicity we first consider the case where A ≡ 0.
To mitigate the bias introduced in F (¯ z k , ¯ ξ k ) for (SEG + ), we propose Algorithm 1 which modifies the exploration step.
The algorithm can be seen as a particular instance of the more general scheme treated in Section 7.
Theorem 6.1.
Suppose that Assumptions I to III hold.
Suppose in addition that γ ∈ ( ⌊− 2 ρ ⌋ + , 1 / L F ) and ( α k ) k ∈ (cid:142) ⊂ (0 , 1) is a diminishing sequence such that
[Equation]
Then, the following estimate holds for all z ⋆ ∈ S ⋆
[Equation]
where C = 1 + 2 η (cid:0) ( γ 2 L 2ˆ F + 1) + {+
+} α 0 (cid:1) , η = 12 1 + γ 2 L 2 F 1 − γ 2 L 2 F γ 2 L 2 F + 1 γ L ˆ F √ α 0 , µ = γ 2 (1 − γ 2 L 2 F ) / 2 and k ⋆ is chosen from { 0 , 1 , . . .
, K } according to probability P [ k ⋆ = k ] =
[Equation]
Remark 6.2.
As α 0 → 0, the requirement (6.1) reduces to ρ > − γ / 2 as in the deterministic setting of Pethick et al.
Letting α k
= α 0 / √ k + r the rate becomes O ( 1 / √ k ), thus matching the rate for the gap function of stochastic extragradient in the monotone case (see e.g. Juditsky et al.
The above result provides a rate for a random iterate as pioneered by Ghadimi & Lan (2013).
Showing last iterate results even asymptotically is more challenging.
Already in the monotone case, vanilla (SEG) (where β k = α k ) only has convergence guarantees for the average iterate (Juditsky et al., 2011).
In fact, the scheme can cycle even in simple examples (Hsieh et al., 2020, Fig. 1).
Under the classical (but more restrictive) Robbins-Monro stepsize policy, it is possible to show almost sure convergence for the iterates generates by Algorithm 1.
The following theorem demonstrates the result in the particular case of α k = 1 / k + r .
The more general statement is deferred to
Appendix D.
Theorem 6.3 (almost sure convergence) .
Suppose that Assumptions I to III hold.
Suppose γ ∈ ( ⌊− 2 ρ ⌋ + , 1 / L F ) , α k = 1 k + r for any positive natural number r and
[Equation]
Algorithm
R equire
[Equation]
R epeat for k = 0 , 1 , . . .
until convergence
[Table]
R eturn z
[Table]
Then, the sequence ( z k ) k ∈ (cid:142) generated by Algorithm 1 converges almost surely to some z ⋆ ∈ zer T.
Remark 6.4.
As α k → 0 the condition on ρ reduces to ρ > − γ / 2 like in the deterministic case.
To make the results more accessible, both theorems have made particular choices of the free parameters from the proof, that ensures convergence for a given ρ and γ .
However, since the parameters capture inherent tradeo ff s, the choice above might not always provide the tightest rate.
Thus, the more general statements of the theorems have been preserved in the appendix.
A nalysis for constrained case
The result for the unconstrained smooth case can be extended when the resolvent is available.
Algorithm 2 provides a direct generalization of the unconstrained Algorithm 1.
The construction relies on approximating the deterministic algorithm proposed in Pethick et al.
(2022), which iteratively projects onto a half-space which is guaranteed to contain the solutions.
By defining Hz = z − γ Fz , the scheme can concisely be written as,
[Equation]
for a particular adaptive choice of α k ∈ (0 , 1).
With a fair amount of hindsight we choose to replace
Hz k with the bias-corrected estimate h k (as defined in Step 2. 2 in Algorithm 2), such that the estimate is also reused in the second update.
Theorem 7.1.
Suppose that Assumptions I to III hold.
Moreover, suppose that α k ∈ (0 , 1) , γ ∈ ( ⌊− 2 ρ ⌋ + , 1 / L F ) and the following holds,
[Equation]
where η ≥
[Equation]
Consider the sequence ( z k ) k ∈ (cid:142) generated by Algorithm 2.
Then, the following estimate holds for all z ⋆ ∈ S ⋆
[Equation]
where C = 1 + 2 η (1 + γ 2 L 2ˆ F ) + 2 α 0 η and k ⋆ is chosen from { 0 , 1 , . . .
, K } according to probability
P [ k ⋆ = k ] =
[Equation]
Remark 3.
The condition on ρ in (7.1) reduces to ρ > − γ / 2 when α 0 → 0 as in the deterministic case.
As oppose to Theorem 6.3 which tracks ∥ Fz k ∥ 2 , the convergence measure of Theorem 7. reduces to dist (0 , T ¯ z k ) 2 = ∥
F ¯ z k ∥ 2 when A ≡ 0.
Since Algorithm 1 and Algorithm 2 coincide when
A ≡ 0, Theorem 7.1 also applies to Algorithm 1 in the unconstrained case.
Consequently, we obtain rates for both ∥ F ¯ z k ∥ 2 and ∥
Fz k ∥ 2 in the unconstrained smooth case.
A symmetric & nonlinear preconditioning
In this section we show that the family of stochastic algorithms which converges under weak MVI can be expanded beyond Algorithm 2.
This is achieved by extending (CEG + ) through introducing
[Table] [Table]
[Equation]
a nonlinear and asymmetrical preconditioning.
Asymmetrical preconditioning has been used in the literature to unify a large range of algorithm in the monotone setting Latafat & Patrinos (2017).
A subtle but crucial di ff erence, however, is that the preconditioning considered here depends nonlinearly on the current iterate.
As it will be shown in Section 8.1 this nontrivial feature is the key for showing convergence for primal-dual algorithms in the nonmonotone setting.
Consider the following generalization of (CEG + ) by introducing a potentially asymmetric nonlinear preconditioning P z k that depends on the current iterate z k . find ¯ z k such that
[Equation]
where H u ( v ) (cid:66) P u ( v ) − F ( v ) and Γ is some positive definite matrix.
The iteration independent and diagonal choice P z k = γ − 1 I and Γ = γ
I correspond to the basic (CEG + ).
More generally we consider
[Equation]
where Q u ( z ) captures the nonlinear and asymmetric part, which ultimately enables alternating updates and relaxing the Lipschitz conditions (see Remark 8.1 (ii) ).
Notice that the iterates above does not always yield well-defined updates and one must inevitably impose additional structures on the preconditioner (we provide su ffi cient condition in Appendix F.1).
Consistently with (8.2), in the stochastic case we define
[Equation]
The proposed stochastic scheme, which introduces a carefully chosen bias-correction term, is summarized as
[Equation]
with
[Equation] [Equation]
find ¯ z k such that
[Equation]
with ¯ ξ
[Equation]
Remark 4.
The two additional terms in (8.4a) are due to the interesting interplay between weak
MVI and stochastic feedback, which forces a change of variables (see Appendix F.4).
To make a concrete choice of ˆ Q u ( z , ξ ) we will consider a minimax problem as a motivating example (see Appendix F.1 for a more general setup).
8.1 N onlinearly preconditioned primal dual hybrid gradient
We consider the problem of minimize
[Equation]
where φ ( x , y ) :
=
E ξ [ˆ φ ( x , y , ξ )].
The first order optimality conditions may be written as the inclusion 0 ∈ Tz (cid:66) Az + Fz , where
[Equation]
while the algorithm only has access to the stochastic estimates ˆ F ( z , ξ ) (cid:66) ( ∇ x ˆ φ ( z , ξ ) , −∇ y ˆ φ ( z , ξ )).
Assumption IV.
For problem (8.5) , let the following hold with a stepsize matrix Γ = blkdiag ( Γ 1 , Γ 2 ) where Γ 1 ∈ (cid:146) n and Γ 2 ∈ (cid:146) r are symmetric positive definite matrices:
(i) f, g are proper lsc convex (ii) φ : (cid:146) n + r → (cid:146) is continuously di ff erentiable
and for some symmetric positive definite matrices
D xx , D xy , D yx , D yy , the following holds for all z = ( x , y ) , z ′ =
( x ′ ,
y ′ ) ∈
(cid:146) n
+ r
[Equation]
y
[Equation]
(iii) Stepsize condition:
L 2 xx D xx + L 2 yx D yx ≺ Γ
[Equation]
and
[Equation]
2 xy
[Equation]
(iv) Bounded variance: E ξ (cid:104) ∥
ˆ F ( z , ξ ) − ˆ F ( z ′ , ξ ) ∥ 2 Γ (cid:105) ≤ σ
[Equation]
(v) ˆ φ
· , ξ ) : (cid:146) n + r → (cid:146) is continuously di ff erentiable and for some symmetric positive definite matrices D (cid:98) xz , D (cid:98) yz , D (cid:98) yx , D (cid:98)
yy , the following holds for all z = ( x , y ) , z ′ =
( x ′ ,
y ′ ) ∈
(cid:146) n + r and v , v
′ ∈
(cid:146)
n for θ ∈ [0 , ∞ )
: E ξ (cid:104)
∥∇ x
ˆ φ
( z ′
ξ ) − ∇ x ˆ φ
[Equation]
z ,
ξ )
[Table]
[Equation]
≤ L
[Equation]
[Table]
[Equation]
D
[Equation]
if
θ (cid:44) 1 : E ξ (cid:104) ∥∇ y ˆ φ ( z , ξ )
[Equation]
∇ y ˆ φ ( z
[Equation]
, ξ ) ∥
[Equation]
2 (cid:105) ≤ L 2 (cid:98) yz ∥
z
[Equation]
z ∥ 2 D (cid:98) yz if θ (cid:44) 0 : E ξ (cid:104) ∥∇ y ˆ
[Equation]
( v
[Equation]
, y
[Equation]
, ξ )
[Equation]
∇ y
[Equation]
( v , y ,
[Equation]
∥
[Equation]
yx
[Equation]
yy .
Remark 8.1.
In Algorithm 3 the choice of θ ∈ [0 , ∞ ) leads to di ff erent algorithmic oracles and underlying assumptions in terms of Lipschitz continuity in Assumptions IV (ii) and IV (v) .
(i)
If θ = 0 then the first two steps may be computed in parallel and we recover Algorithm 2.
Moreover, to ensure Assumption IV (ii) in this case it su ffi ces to assume for L x , L y ∈ [0 , ∞ ), ∥∇ x φ ( z ′ )
− ∇ x φ ( z ) ∥
[Equation]
(ii) Taking θ = 1 leads to Gauss-Seidel updates and Algorithm 3 captures a nonlinear extension of the celebrated primal dual hybrid gradient (PDHG) (Chambolle & Pock, 2011) with su ffi cient
Lipschitz continuity assumptions for some L x , L y ∈ [0 , ∞ ),
[Equation]
Algorithm 3 is an application of (8.4) applied for solving (8.6).
In order to cast the algorithm as an instance of the template algorithm (8.4), we choose the positive definite stepsize matrix as Γ = blkdiag ( Γ 1 , Γ 2 ) with Γ 1 ≻ 0 , Γ 2 ≻ 0, and the nonlinear part of the preconditioner as
[Equation]
and
[Equation]
where u = ( x , y ) and ¯ z = (¯ x , ¯ y ).
Recall H u ( z ) (cid:66) P u ( z ) − F ( z ) and define S u ( z ; ¯ z ) (cid:66) H u ( z ) − Q u (¯ z ).
The convergence in Theorem 8.2 depends on the distance between the initial estimate Γ − 1 ˆ z − 1 with ˆ z − 1 =
(ˆ x − 1 , ˆ y − 1 ) and the deterministic S z − 1 ( z − 1 ; ¯ z − 1 ).
See Appendix B for additional notation.
Theorem 8.2.
Suppose that Assumption I(iii) to II(ii) and IV hold.
Moreover, suppose that α k ∈ (0 , 1) , θ ∈ [0 , ∞ ) and the following holds,
[Equation]
where ¯ γ denotes the smallest eigenvalue of Γ
[Equation]
η ≥ (1 + 4ˆ c 2 α 20 )(
[Equation]
+
[Equation] [Equation]
4ˆ c 2 α 0 ) and
[Equation]
Consider the sequence ( z k ) k ∈ (cid:142) generated by Algorithm 3.
Then
[Equation]
the following holds for all z ⋆ ∈ S ⋆
[Equation]
where
[Equation]
and k ⋆ is chosen from { 0 , 1 , . . .
, K } according to probability P [ k ⋆ = k ] =
[Figure]
Remark 5.
When α 0 → 0 the conditions in (8.2) reduces to
+
ρ ¯ γ > 0 as in the deterministic case.
Almost sure convergence is provided in Theorem F.6 of the appendix.
For θ =
Algorithm 3 reduces to Algorithm 2.
With this choice Theorem 8.2 simplifies, since the constant ˆ c 2 = 0, and we recover the convergence result of Theorem 7.1.
E xperiments
We compare BC-SEG + and BC-PSEG + against (EG + ) using stochastic feedback (which we refer to as (SF-EG + )) and (SEG) in both an unconstrained setting and a constrained setting introduced in Pethick et al.
See Appendix H.2 for the precise formulation of the projected variants which we denote (SF-PEG + ) and (PSEG) respectively.
In the unconstrained example we control all problem constant and set ρ = − 1 / 10 L F , while the constrained example is a specific minimax problem where ρ > − 1 / 2 L F holds within the constrained set for a Lipschitz constant L F restricted to the same constrained set.
To simulate a stochastic setting in both examples, we consider additive Gaussian noise, i.e. ˆ F ( z , ξ ) =
Fz + ξ where ξ ∼ N (0 , σ 2 I ).
In the experiments we choose σ = 0 .
1 and α k ∝ 1 / √ k .
For experiments with α k ∝ 1 / k see Figure 4.
Further details can be found in Appendix H.
The results are shown in Figure 2.
The sequence generated by (SEG) and (PSEG) diverges for the unconstrained problem and cycles in the constrained problem respectively.
In comparison (SF-EG + ) and (SF-PEG + ) gets within a neighborhood of the solutions but fails to converge due to the nondiminishing stepsize, while BC-SEG + and BC-PSEG + converges in the examples.
C onclusion
This paper shows that nonconvex-nonconcave problems characterize by the weak Minty variational inequality can be solved e ffi ciently even when only stochastic gradients are available.
The approach crucially avoids increasing batch sizes by instead introducing a bias-correction term.
We show that convergence is possible for the same range of problem constant ρ ∈ ( − γ / 2 , ∞ ) as in the deterministic case.
Rates are established for a random iterate , which matches those of stochastic extragradient in the monotone case, and the result is complemented with almost sure convergence, thus providing asymptotic convergence for the last iterate .
We show that the idea extends to a family of extragradient-type methods which includes a nonlinear extension of the celebrated primal dual hybrid gradient (PDHG) algorithm.
For future work it is interesting to see if the rate can be improved by considering accelerated methods such as Halpern iterations.
Appendix T able of C ontents A Prelude
B Preliminaries
C Proof for SEG +
Proof of Theorem 5.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
D Proof
for smooth unconstrained case
Proof of Theorem D.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Proof of Theorem 6.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Proof of Theorem D.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Proof of Theorem 6.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
E Proof for constrained case
Proof of Theorem E.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Proof of Theorem 7.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
F Proof for NP-PDHG through a nonlinear asymmetric preconditioner
F.
Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
F.
Deterministic lemmas . .
F.
Stochastic results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Proof of Theorem F.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Proof of Theorem 8.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Proof of Theorem F.6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
F.
Explanation of bias-correction term . . . . . . . . . . . . . . . . . . . . . . . . .
G Negative weak Minty variational inequality
H Experiments
H.1 Synthetic example . . .
H.2 Additional algorithmic details . . .
I Comparison with variance reduction
Unconstrained & smooth ( A ≡ 0)
Constrained ( A (cid:46) 0)
Random iterate
Last iterate
BC-PSEG +
NP-PDHG
Appendix
Theorem D. Theorem D.
Theorem E.
Theorem F.
⇓ ⇓ ⇓ ⇓
Main paper
Theorem 6. Theorem 6.
Theorem 7.
Theorem 8.
A P relude
For the unconstrained and smooth setting Appendix C treats convergences of (SEG + ) for the restricted case where F is linear.
Appendix D shows both random iterate results and almost sure convergence of Algorithm 1.
Theorems 6.1 and 6.3 in the main body are implied by the more general results in this section, which preserves certain free parameters and more general stepsize requirements.
Appendices E and F moves beyond the unconstrained and smooth case by showing convergence for instances of the template scheme (8.1).
Almost sure convergence is established in Theorem F.6.
The analysis of Algorithm 3 in Appendix F applies to Algorithm 2, but for completeness we establish convergence for general F separately in
Appendix E.
The relationship between the theorems are presented in Table 1.
B P reliminaries
Given a psd matrix V we define the inner product as ⟨· , ·⟩ V (cid:66) ⟨· , V ·⟩ and the corresponding norm ∥ · ∥ (cid:66) √⟨· , ·⟩ V .
The distance from u ∈ (cid:146) n to a set U ⊆ (cid:146) n with respect to a positive definite matrix
V is defined as dist V ( u , U ) (cid:66)
min
u ′ ∈U ∥ u − u ′ ∥
V , which we simply denote dist ( u , U )
when V = I .
The norm ∥ X ∥ refers to spectral norm when X is a matrix.
We summarize essential definitions from operator theory, but otherwise refer to Bauschke & Combettes (2017); Rockafellar (1970) for further details.
An operator A : (cid:146) n ⇒ (cid:146)
d maps each point x ∈ (cid:146) n to a subset Ax ⊆ (cid:146) d , where the notation A ( x ) and Ax will be used interchangably.
We denote the domain of A by dom A (cid:66) { x ∈ (cid:146) n | Ax (cid:44) ∅} , its graph by gph A (cid:66) { ( x , y ) ∈ (cid:146) n × (cid:146) d | y ∈ Ax } .
The inverse of A is defined through its graph, gph A − 1 (cid:66) { ( y , x ) | ( x , y ) ∈ gph A } and the set of its zeros by zer A (cid:66) { x ∈ (cid:146) n | 0 ∈ Ax } .
Definition B.1 ((co)monotonicity Bauschke et al.
An operator A : (cid:146) n ⇒ (cid:146) n is said to be ρ -monotone for some ρ ∈ (cid:146) , if for all ( x , y )
, ( x ′ , y ′ ) ∈ gph A
[Equation]
and it is said to be ρ -comonotone if for all ( x , y ) ,
( x ′ , y ′ ) ∈ gph A
[Equation]
The operator A is said to be maximally (co)monotone if there exists no other (co)monotone operator
B for which gph A ⊂ gph B properly.
If A is 0-monotone we simply say it is monotone.
When ρ < 0, ρ -comonotonicity is also referred to as | ρ | -cohypomonotonicity.
Definition B.2 (Lipschitz continuity and cocoercivity) .
Let D ⊆ (cid:146) n be a nonempty subset of (cid:146) n .
A single-valued operator A : D → (cid:146) n is said to be L-Lipschitz continuous if for any x , x ′ ∈ D
[Equation]
and β -cocoercive if ⟨
[Equation]
Moreover, A is said to be nonexpansive if it is 1 -Lipschitz continuous, and firmly nonexpansive if it is 1 -cocoercive.
A β -cocoercive operator is also β − 1 -Lipschitz continuity by direct implication of Cauchy-Schwarz.
The resolvent operator J A
= (id + A ) − 1 is firmly nonexpansive (with dom J A
= (cid:146) n ) if and only if A is (maximally) monotone.
We will make heavy use of the Fenchel-Young inequality.
For all a , b ∈ (cid:146) n and e > 0 we have,
[Equation]
C P roof for SEG +
Proof of Theorem 5.1 .
Following (Hsieh et al., 2020) closely, define the reference state ˜¯
z k : =
z k − γ Fz k to be the exploration step using the deterministic operator and denote the second stepsize as η k : = α k γ .
We will let ζ denote the additive noise term,
i
[Equation]
e. ˆ F ( z , ξ ) :
= F ( z ) + ζ .
Expanding the distance to solution,
[Equation]
Recall that the operator is assumed to be linear
Fz =
Bz + v in which case we have,
[Equation]
The two latter terms are zero in expectation due to the unbiasedness from Assumption II (ii) , which lets us write the terms on the RHS of (C.1) as,
[Equation]
We can bound (C.3) directly through the weak MVI in Assumption I (iii) which might still be positive,
[Equation]
For the latter two terms of (C.5) we have
[Equation]
where the last inequality follows from Lipschitz in Assumption I (i) and bounded variance in Assumption II (iii) .
Combining everything into (C.1) we are left with
[Equation]
By assuming the stepsize condition, ρ ≥ ( η k − γ ) / 2, we have η 2 k − 2 η k ρ ≤ γη k .
This allows us to complete the square,
[Equation]
where the last inequality follows from Lipschitzness of F and the definition of the update rule.
Plugging into (C.8) we are left with
[Equation]
The result is obtained by total expectation and summing.
D P roof for smooth unconstrained case
Lemma D.1.
Consider the recurrent relation B k + 1 = ξ k B k + d k such that ξ k > 0 for all k ≥ 0 .
Then
[Equation]
Assumption V. γ ∈ ( ⌊− 2 ρ ⌋ + , 1 / L F ) and for positive real valued b,
[Equation]
Theorem D.2.
Suppose that Assumptions I to III hold.
Suppose in addition that Assumption V holds and that ( α k ) k ∈ (cid:142) ⊂ (0 , 1) is a diminishing sequence such that
[Equation]
Consider the sequence ( z k ) k ∈ (cid:142) generated by Algorithm 1.
Then, the following estimate holds
[Equation]
where C = 1 + 2 η (cid:0) ( γ 2 L 2ˆ F + 1)
+
α 0 (cid:1) and η = 12 ( b + 1) γ 2 L 2 F + 1 γ L ˆ F √ α 0 .
Proof of Theorem D.2 .
The proof relies on establishing a (stochastic) descent property on the following potential function
[Equation]
where u k (cid:66) ¯ z k − z k + γ F ( z k ) measures the di ff erence of the bias-corrected step from the deterministic exploration step, and ( A k ) k ∈ (cid:142) , ( B k ) k ∈ (cid:142) are positive scalar parameters to be identified.
We proceed to consider each term individually.
Let us begin by quantifying how well ¯ z k estimates z k − γ F ( z k ).
[Equation]
Therefore,
[Equation]
Conditioned on F k , in the inner product the left term is known and the right term has an expectation that equals zero.
Therefore, we obtain
[Equation]
where in the first inequality we used Young inequality and the fact that the second moment is larger than the variance
[Equation]
and Assumptions II (iii) and III were used in the second inequality
[Equation]
By step 1. 4 , the equality
[Equation]
[Equation]
Conditioning (D.6) with E (cid:2) · | F k (cid:3) = E
[Equation]
E
[Equation]
· |
[Equation] F [Equation] | F k (cid:3) , since F k ⊂ ¯ F k , yields
[Equation]
where µ was defined in (D.1)
[Equation]
The condition expectation of the third term in (D.5) is bounded through Assumption II (iii) by
[Equation]
which in turn implies
[Equation]
Combining (D.7), (D.8)
[Equation]
and (D.5) yields
[Equation]
Further using (D.4) and denoting
[Equation]
leads to
[Equation]
Having established (D.10)
[Equation]
set A k = A , B k
=
A γ 2 L 2ˆ F
[Equation]
and ε k = ε to obtain by the law of total expectation that
[Equation]
To get a recursion we require
X
[Equation]
0 and
[Equation]
By developing the first requirement of (D.12) we have,
[Equation]
Equivalently, A needs to satisfy
[Equation]
for any α k ∈ (0 , 1).
Since (1 − α k ) 2 2 − α k ≤ 12 given α k ∈ (0 , 1) it su ffi
ce to pick
[Equation]
For the second requirement of (D.12) note that we can equivalently require that the following quantity is negative
[Equation]
where we have used that α k ≤ α 0 and the choice of A from (D.15).
Setting the Young parameter ε
= γ L ˆ F √ α
we obtain that X k
+ 2 A γ 4 L 2ˆ F α 2 k ≤ 0 owing to (D.2).
On the other hand, the last term in (D.11) may be upper bounded by
[Equation]
Thus, it follows from (D.11) that
[Equation]
Telescoping the above inequality completes the proof.
Proof of Theorem 6.1 .
The theorem is obtained as a particular instantiation of Theorem D.2.
The condition in (D.1) can be rewritten as b > γ 2 L 2 F 1 − γ 2 L 2 F .
A reasonable choice is b = 2 γ 2 L 2 F 1 − γ 2 L 2 F .
Substituting back into µ we obtain
[Equation]
Similarly, the choice of b is substituted into η and (D.2) of Theorem D.2.
The rate in (D.2) is further simplified by applying Lipschitz continuity of F from Assumption I (i) to ∥ Fz 0 ∥ 2 = ∥
Fz 0 − Fz ⋆ ∥ 2 .
The proof is complete by observing that the guarantee on the weighted sum can be converted into an expectation over a sampled iterate in the style of Ghadimi & Lan (2013).
Assumption VI (almost sure convergence) .
Let d ∈ [0 , 1] , b > 0 .
Suppose that the following holds (i) the diminishing sequence ( α k ) k ∈ (cid:142) ⊂ (0 , 1) satisfies the classical conditions
[Equation]
[Equation]
< ∞ ; (ii) letting c k (cid:66) (1 + b ) γ 2 L 2 F + 1 γ L
[Equation]
F α − dk for all k ≥ η
[Equation]
< ∞ , [Equation] 17) and
[Equation]
Although at first look the above assumptions may appear involved, as shown in Theorem D.3 classical stepsize choice of α 0 k + 1 is su ffi cient to satisfy (D.17), and to ensure almost sure convergence provided that instead (D.20) holds.
Note that with this choice as k goes to infinity, α k ↘ 0 and the deterministic range γ + 2 ρ > 0 is obtained.
Theorem D.3 (almost sure convergence) .
Suppose that Assumptions I to III hold.
Additionally, suppose the stepsize conditions in Assumptions V and VI.
Then, the sequence ( z k ) k ∈ (cid:142) generated by
Algorithm 1 converges almost surely to some z ⋆ ∈ zer
T. Moreover, the following estimate holds
[Equation]
where ¯ C = 2 γ 2 σ 2 F (cid:0) ( γ 2 L 2ˆ F + 1) ν + ¯ α (cid:0)
+ ( b + 1) γ 2 L 2 F + 1 γ L ˆ F (cid:1)(cid:1) is finite.
In particular, if α k = 1 k + r for any positive natural number r, and d = 1 , then Assumption VI(ii) can be replaced by
[Equation]
Proof of Theorem D.3 (almost sure convergence).
Having established (D.10), let B k
=
A k γ 2 L 2ˆ F such that (cid:16)
[Equation]
In what follows we show that it is su ffi cient to ensure
[Equation]
resulting in the inequality
[Equation]
A reasonable choice for the Young parameter ε k is to choose
[Equation]
The rational for this choice will become more clear in what follows.
The first inequality in (D.22) is linear and we can solve it to equality by Lemma D.1.
Let
[Equation]
Furthermore [Equation] let c k and η k be as in Assumption VI (ii) .
Then [Equation] Lemma D.1 yields
[Equation]
which would ensure A k ≥ 0 for all k .
Therefore, assumptions (D.17) and (D.18) (which is a restatement of the conditions in (D.22)) are su ffi cient for ensuring (D.23).
Substituting X k 1 and A k + 1 in (D.23) yields
[Equation]
where ξ k = 2 (cid:16) A k + 1 ( γ 2 L 2ˆ F + 1) + 12 + ( b + 1)
γ 2 L 2 F α k + 1 γ L
ˆ F α 1 − d k (cid:17)
α 2 k γ 2 σ 2 F .
By Assumption VI we have that
[Equation]
where we used the fact that α 3 k ≤ α 2 k and d ≤ 1 in the first inequality, while the second inequality uses (D.25), and Assumption VI (i) .
The claimed convergence result follows by the Robbins-Siegmund supermartingale theorem (Bertsekas, 2011, Prop. 2) and standard arguments as in (Bertsekas, 2011,
Prop. 9).
The claimed rate follows by taking total expectation and summing the above inequality over k and noting that initial iterates were set as ¯ z − 1 =
z − 1 =
z 0 .
To provide an instance of the sequence ( α k ) k ∈ (cid:142) that satisfy the assumptions, let r denote a positive natural number and set
[Equation]
Then,
[Equation]
and for any K ≥
[Equation]
[-1 p + r ) 2 = ( r − 1) 2 ( ℓ + r ) 2 = ( r − 1) 
 α 2-]Plugging the value of c ℓ and ε k from Assumption VI (ii) and (D.24) we obtain that A 0 is finite valued since (cid:80) ∞
ℓ =
[Equation]
d < ∞ owing to the fact that d ≤ 1.
Moreover,
A k
[Equation]
On the other hand [Equation] for e > 1 we have the following bound
[Equation]
Therefore, it follows from (D.29)
that
[Equation]
In turn
[Equation]
this inequality ensures that ν as defined in Assumption VI (ii) is finite.
To see this note that
[Equation]
where in the last two inequalities Assumption VI (i) was used.
It remains to confirm the second inequality in (D.22).
With the choice of α k and ε k as in (D.28) and (D.24) we have
[Equation]
It follows that with d = 1 the assumption (D.20) is su ffi cient to ensure that the second condition in (D.22) holds.
Proof of Theorem 6.3 (almost sure convergence).
The result is a restatement of the special case in
Theorem D.3 where α k = 1 k + r .
We proceed similarly to the proof of Theorem 6.1.
The condition in (D.1) can be rewritten as b > γ 2 L 2 F 1 − γ 2 L 2 F .
A reasonable choice is b = 2 γ 2 L 2 F 1 − γ 2 L 2 F .
The choice of b is substituted into (D.1), (D.20) and ¯ C of Theorem D.3.
This completes the proof.
E P roof for constrained case
We will rely on two well-known and useful properties of the deterministic operator H =
id − γ F from (Pethick et al., 2022, Lm.
A.3) that we restate here for convenience.
Lemma E.1.
Let F : (cid:146) n → (cid:146) n be a L F -Lipschitz operator and H
= id − γ F with γ ∈ (0 , 1 / L F ] .
Then,
(i)
The operator H is 1 / 2 -cocoercive.
(ii)
The operator H is (1 − γ L F ) -monotone, and in particular
[Equation]
Proof.
The first claim follows from direct computation
[Equation]
where the last inequality is due to Lipschitz continuity and γ ≤ 1 / L F .
The strongly monotonicity of
H is a consequence of Cauchy-Schwarz and Lipschitz continuity of F ,
[Equation]
The last claim follows from the Cauchy-Schwarz inequality.
Theorem E.2.
Suppose that Assumptions I to III hold.
Moreover, suppose that α k ∈ (0 , 1) , γ ∈ ( ⌊− 2 ρ ⌋ + , 1 / L F ) and for positive parameters ε and b the following holds,
[Equation]
) where A ≥ ε + 1 b (1 − 1 ε (1 − γ L F ) 2 ) .
Consider the sequence ( z k ) k ∈ (cid:142) generated by Algorithm 2.
Then, the following estimate holds for all z ⋆ ∈ S ⋆ K
[Equation]
[Equation]
where C = 1 + 2 A (1 + γ 2 L 2ˆ F ) + 2 α 0 A.
Proof of Theorem E.2 .
We rely on the following potential function,
[Equation]
where ( A k ) k ∈ (cid:142) and ( B k ) k ∈ (cid:142) are positive scalar parameters to be identified.
We will denote ˆ¯ H k : =
¯ z k − γ ˆ F (¯ z k , ¯ ξ k ), so that z k + 1 =
z k − α k
( h k − ˆ¯ H k ).
Then, expanding one step,
[Equation]
Recall that Hz (cid:66)
z − γ Fz in the deterministic case.
In the Algorithm 2, h k estimates Hz k .
Let us quantify how good this estimation is.
[Equation]
h k [Equation] Hz
[Equation]
In the scalar product, the left term is known when z k is known and the right term has an expectation equal to 0 by Assumption II (ii) when z k is known.
Thus, taking conditional expectation and using the fact that the second moment is larger than the variance, we can go on as
[Equation]
where we have used Assumption II (iii) and Assumption III.
We continue with the conditional expectation of the inner term in (E.5).
[Equation]
where the last inequality uses 1 / 2 -cocoercivity of H from Lemma F.
(i) under Assumption I
(i) and the choice γ ≤ 1 / L F .
By definition of ¯ z k in Step 2. 3 , we have h k ∈ ¯
z k + γ A
(¯ z k ), so that 1 γ ( h k − H ¯ z k ) ∈ F (¯ z k )
+ A (¯ z k ).
Hence, using the weak MVI from Assumption I (iii) ,
[Equation]
Using (E.8) in (E.7) leads to the following inequality [Equation] true for any ε k > 0:
[Equation]
To majorize the term ∥
¯ z k − z k ∥ 2 , we use Lemma F.2 (ii) to get
[Equation]
Hence, as long as γ L F < 1, then
[Equation]
The third term in (E.5) is bounded by
[Equation]
Combined with the update rule [Equation] (E.10) can also be used to bound the di ff erence of iterates
[Equation]
Using (E.5), (E.9), (E.10) and (E.11) we have,
[Equation]
where the last inequality follows from Young’s inequality with positive b and requiring 1 −ε k (1 − γ L F ) 2 ≥ 0 as also stated in (E.3)
[Equation]
By defining
[Equation]
and applying (E.6), we finally obtain
[Equation]
We can pick B k = 2 γ 2 L 2ˆ F A k in which case, to get a recursion, we only require the following.
[Equation]
[Equation]
Set A k
= A [Equation]
ε k = ε .
For the first requirement of (E.15),
[Equation]
where the first inequality follows from (1 − α k ) 2 ≤ 1 and the second inequality follows from (1 − α k ) 2 ≤ (1 − α k ).
Thus [Equation] to satisfy the first inequality of (E.15) it su ffi
ce to pick
[Equation]
The noise term in (E.14) can be made independent of k by using α k ≤ α 0 and (E.17) as follows
[Equation]
Thus it follows from (E.14) and α k ≤ α 0 that
[Equation]
The result is obtained by total expectation and summing the above inequality while noting that the initial iterate were set as z − 1 =
z 0 .
Proof of Theorem 7.1 .
The theorem is a specialization of Theorem E.2 with a particular a choice of b and ε .
The second requirement in (E.3) can be rewritten as,
[Equation]
which is satisfied by ε
=
[Equation]
We substitute in the choice of ε , b
[Equation]
and denotes η (cid:66) A .
The weighted sum in (E.4) can be converted into an expectation over a sampled iterate in the style of Ghadimi & Lan (2013), E [
[Equation]
with k ⋆ chosen from { 0 , 1 , . . .
, K } according to probability P [ k ⋆ = k ] =
[Equation]
α j .
Noticing that h k ⋆ − H ¯ z k ⋆ ∈ γ
( F ¯ z k ⋆ + A ¯ z k ⋆ ) = γ T ¯ z k ⋆ so E [ ∥ h k ⋆ −
[Equation]
where the second inequality follows from concavity of the minimum.
This completes the proof.
F P roof for NP-PDHG through a nonlinear asymmetric preconditioner F.1 P reliminaries
Consider the decomposition z
= ( z 1 , . . .
, z m ), u = ( u 1 , . . . , u m ) with z i , u i ∈ (cid:146) n i and define the shorthand notation u ≤ i (cid:66) ( u 1 , u 2 , . . .
, u i ) and u ≥ i (cid:66) ( u i , . . .
, u m ) for the truncated vectors.
Moreover suppose that A conforms to the decomposition Az =
( A 1 , z 1 , . . .
A m z m ) with A i : (cid:146) n i ⇒ (cid:146) n i maximally monotone.
Consistently with the decomposition define Γ = blkdiag ( Γ 1 , . . .
, Γ m ) where Γ i ∈ (cid:146) n i × n i are positive definite matrices and let
P u ( z ) (cid:66) Γ − 1 z + Q u ( z ) , where Q u ( z ) = (cid:0) 0 , q 1 ( z 1 , u ≥ 2 ) , q 2 ( z 1 , z 2 , u ≥ 3 ) , . . . , q m − 1 ( z ≤ m − 1 , u m ) (cid:1) (F.1)
When P u furnishes such an asymmetric structure the preconditioned resolvent has full domain, thus ensuring that the algorithm is well-defined.
In the following lemma we show that the iterates in (8.1) are well-defined for a particular choice of the preconditioner P u in (F.1).
The proof is similar to that of (Latafat & Patrinos, 2017, Lem. 3.1) and is included for completeness.
Lemma F.1.
Let z
=
( z 1 , . . .
, z m ) , u = ( u 1 , . . . , u m ) be given vectors, suppose that A conforms to the decomposition Az =
( A 1 , z 1 , . . .
A m z m ) with A i : (cid:146) n i ⇒ (cid:146) n i maximally monotone, and let P u be defined as in (F.1) .
Then, the preconditioned resolvent ( P u + A ) − 1 is Lipschitz continuous and has full domain.
Moreover, the update ¯ z
=
( P u + A ) − 1 z reduces to the following update
[Equation]
Proof.
Owing to the asymmetric structure (F.1), the resolvent may equivalently be expressed as
[Equation]
where q 0 ≡ 0.
The Gauss-Seidel-type update in (F.2) is of immediate verification after noting that ( Γ − 1 i + A i ) − 1 is single-valued (in fact Lipschitz continuous) since the sum of Γ i ≻ 0 and A i is (maximally) strongly monotone.
This also implies that Γ − 1 i + A
i =
¯ A i + β I for some β > 0 and some maximally monotone operator ¯
A i .
Thus dom (cid:0) Γ − 1 i + A i ) − 1 (cid:1) =
range [Equation] = range
[Equation] 1 β ¯
A + I) =
(cid:146) n , where we used Minty’s theorem in the last equality.
F.2 D eterministic lemmas
To eventually prove Theorem F.5 we will compare the stochastic algorithm (8.4) with its deterministic counterpart (8.1), so we introduce
[Equation]
We first derive results for the deterministic operator G and then shows that z k + 1 from the stochastic scheme behaves similarly to G ( z k ) when α k is small enough, even if Γ , which also appears inside the preconditioner ˆ P u ( · , ξ ), remains large.
Instead of making assumptions on F directly, we instead consider the following important operator,
[Equation]
such that we can write the update as H u ( z ) =
Γ − 1 z − M
( z ).
Assumption VII.
The operator M as defined in (F.4) is L M -Lipschitz with L M ≤ 1 with respect to a positive definite matrix Γ ∈ (cid:146) n × n , i.e.
[Equation]
Remark 6.
This is satisfied by the choice of Q u in (8.7) and Assumptions IV (ii) and IV (iii) .
With M defined, it is straightforward to establish that H u is 1 / 2 -cocoercive and strongly monotone.
Lemma F.2.
Suppose Assumption VII holds.
Then,
(i)
The mapping H u is 1 / 2 -cocoercive for all u ∈ (cid:146) n , i e.
[Equation]
(ii) Furthermore, H u is (1 − L M ) -monotone for all u ∈ (cid:146) n , and in particular
[Equation]
Proof.
By expanding using (F.4),
[Equation]
Using this we can show cocoercivity,
[Equation]
That H u is strongly monotone follows from Cauchy-Schwarz and Assumption VII,
[Equation]
The last claim follows from Cauchy-Schwarz and dividing by ∥
z ′ − z
∥
Γ − 1 .
We will rely on the resolvent remaining nonexpansive when preconditioned with a variable stepsize matrix.
Lemma F.3.
Let Γ ∈ (cid:146) n × n be positive definite and the operator A : (cid:146) n ⇒ (cid:146) n be maximally monotone.
Then, R = ( Γ − 1 + A ) − 1 is nonexpansive, i.e. ∥ Rx − Ry ∥
Γ − 1 ≤ ∥ x − y ∥
Γ for all x , y ∈ (cid:146) n .
Proof.
Let v ∈ Rx and u ∈
Ry .
By maximal monotonicity of A ,
[Equation]
Therefore, using the Cauchy–Schwarz inequality
[Equation]
The proof is complete by rearranging.
F.3 S tochastic results
The stochastic assumptions on ˆ F in Theorem F.5 propagates to ˆ M and ˆ Q u as captured by the following lemma.
Lemma F.4.
Suppose Assumptions II(ii) and IV(iv) for ˆ F ( z , ξ )
=
( ∇ x ˆ φ ( z , ξ ) , −∇ y ˆ φ ( z , ξ )) as defined in (8.6) .
Let ˆ M and M be as defined in (F.15) and ˆ Q u and Q u as in (8.7) with θ ∈ [0 , ∞ ) .
Then, the following holds for all z , z ′ ∈ R n
[Equation]
z
[Equation]
M
[Equation]
z ) and E ξ [ ˆ Q
[Equation]
( z
[Equation]
ξ )]
= Q z
[Equation]
( z )
[Equation]
E
[Equation]
Proof.
Unbiasedness follows immediately through Assumption II (ii) .
For the second claim we have for all ( x , y ) =
z ∈ (cid:146) n
[Equation]

[Equation]

[Equation] [Equation]

[Equation]
Assumption IV (iv) ) ≤ [Equation] [Equation] θ )
[Equation]
[Equation]
(F.12)
The last claim follows directly through Assumption IV (iv) .
This completes the proof.
Theorem F.5.
Suppose that Assumption I(iii) to II(ii) and IV hold.
Moreover, suppose that α k ∈ (0 , 1) , θ ∈ [0 , ∞ ) and for positive parameter b and ε the following holds,
[Equation]
where ¯ γ denotes the smallest eigenvalue of Γ
[Equation]
A ≥ (1 + 4ˆ c 2 α 20 )( ε + 1 b (1 −
[Equation]
2 )) / (1 − 4ˆ c 2 α 0 ) and
[Equation]
Consider the sequence ( z k ) k ∈ (cid:142) generated by Algorithm 3.
Then, the following holds for all z ⋆ ∈ S ⋆
K (cid:88)
[Equation]
where C (cid:66) 2( A + α 0 ( ε + 1 b
[Equation]
1 −
[Equation]
Proof of Theorem F.5 .
The proof relies on tracking the two following important operators instead of F and ˆ F
[Equation]
We will denote ˆ¯ H k :
= ˆ P k (¯ z k , ¯ ξ k ) − ˆ F (¯ z k , ¯ ξ k ), so that z k +
=
z k − α k Γ ( h k − ˆ¯ H k ).
We will further need the following change of variables to later be able to apply weak MVI (see Appendix F.4):
[Equation]
where Q u ( z ) and H u are as defined in Section 8.
In contrast with the unconstrained smooth case we will rely on a slightly di ff erent potential function, namely,
[Equation]
Γ where ( A k ) k ∈ (cid:142) and ( B k ) k ∈ (cid:142) are positive scalar parameters to be identified.
We start by writing out one step of the update
[Equation]
In the algorithm
[Equation]
s k estimates S z k
( z k ; ¯ z k ).
Let us quantify how good this estimation is.
We will make use of the careful choice of the bias-correction term to shift the noise index by 1 in the second equality.
[Equation]
Using the shorthand notation
[Equation]
it follows that
[Equation]
In the scalar product
[Equation]
the left term is known when z k is known.
Moreover, since E (cid:2) · | F k (cid:3) = E (cid:2) E (cid:2) · |
F ′ k (cid:3) | F k (cid:3) , owing to F k ⊂ F ′ k , we have
[Equation]
where we use Assumption II (ii) through Lemma F.
(i)
[Equation]
Since the second moment is larger than the variance we have
[Equation]
Using the Young inequality it follows from (F.19)
[Equation]
(F.20)
that
[Equation]
To bound the second last term of (F.21) we use unbiasedness due to Assumption II (ii) through
Lemma F.4 (i) and that E (cid:2) · | F k (cid:3) =
E (cid:2) E (cid:2) · | F ′ k (cid:3)
| F k (cid:3) , owing to F k ⊂ F ′ k
[Equation]
with Θ = (1 − θ ) [-
-]2 + 2 θ 2 .
where the last inequality follows from Assumptions II (ii) and IV (iv) through
Lemma F.4 (ii)
[Equation]
To bound the last term of (F.21) we use the particular choice of Q u ,
[Equation]
So Assumption IV (v) applies after application of Young’s inequality and the tower rule
[Equation]
leading to the following bound
[Equation]
Assumption IV (v) ≤ L
[Equation]
where ˆ c 1 (cid:66) L 2 (cid:98) xz
∥
Γ D (cid:98) xz ∥
+ 2(1 − θ ) 2 L 2 (cid:98) yz ∥ Γ D
[Equation] ∥ + 2 θ 2 L 2 (cid:98) yy ∥
Γ 2 D (cid:98) yy ∥ and ˆ c 2 (cid:66)
θ 2 L 2 (cid:98) yx ∥ Γ 1 D (cid:98) yx ∥ .
Using (F.24) and (F.22) in (F.21) yields,
[Equation]
(F.25) To majorize ∥ ¯ x k − ¯ x k − 1 ∥ Γ − 11 in (F.25) let s kx be the primal components of s k in what follows.
Recall that
A decomposes as specified in Section 8, such that we can write s kx ∈ Γ − 11 ¯ x k + A 1 (¯ x k ).
By monotonicity of A 1 we have through Lemma F.3 that
[Equation]
We can go on as
[Equation]
where the last equality uses ∥ a − b ∥ 2 = ∥ a ∥ 2 + ∥
b ∥ 2 − 2 ⟨ a , b ⟩ and unbiasedness from Assumption II (ii) to conclude that the inner product is zero.
Hence, by subtracting α k ∥ s kx − s k − 1 x ∥ Γ − 11 and diving by 1 − α k , we get
[Equation]
Assumptions II (ii [Equation] and IV
[Equation]
where ˆ c 3 (cid:66) L 2 (cid:98) xz
∥
Γ D (cid:98) xz ∥ and the last inequality reintroduces the y -components.
We finally obtain
[Equation]
Introducing (F.27) into (F.25) yields
[Equation]
We continue with the inner term in (F.18) under conditional expectation.
[Equation]
where the last equality uses that S z k
( z k
[Equation]
¯ z k ) − S z k (¯ z [Equation] = H
z k
[Equation]
z k
[Equation]
− H z k (¯ z k ).
By definition of ¯ z k in (8.4b), we have s k
= h k − ˆ Q z k (¯ z k , ξ ′ k ) ∈
Γ − 1 ¯ z k + A
(¯ z k ), so that s k − S z k (¯ z k ) ∈
F (¯ z k ) + A (¯ z k ).
Hence, using the weak MVI from Assumption I (iii) , ⟨
[Equation]
Using also cocoercivity of H u from Lemma F.
(i) , this leads to the following inequality, true for any ε k > 0:
[Equation]
To majorize the term ∥
¯ z k − z k ∥ 2 Γ − 1 , we may use Lemma F.2 (ii) for which we need to determind L M .
For the particular choice of Q u , we have through Assumption IV (ii) that
[Equation]
F.
[Equation] with L [Equation] M (cid:66) max
[Equation]
L
[Equation]
xx
[Equation]
D xx Γ
[Equation]
+ L
[Equation]
yx ∥ D yx
[Equation]
1 ∥ ,
[Equation]
L [Equation] xy
[Equation] D xy [Equation] [Equation]
+ L [Equation] yy ∥
D yy Γ 2 ∥ (cid:9) .
By the stepsize choice Assumption IV (iii) , L M < 1, which will be important promptly.
From Lemma F.2 (ii) it then follows that
[Equation]
Hence, given L M < 1,
[Equation]
The conditional expectation of the third term in (F.18) is bounded by
[Equation]
where we have used Assumption IV (iv) .
Combined with the update rule, (F.32) can also be used to bound the conditional expectation of the di ff erence of iterates
[Equation]
Using (F.18)
[Equation]
(F.31) [Equation] (F.32)
[Equation]
(F.33) and that − ρ ∥
s k − S z k
(¯ z k ) ∥ 2 ≤ − ρ ¯ γ ∥ s k − S z k (¯ z k ) ∥ 2 Γ with ¯ γ denoting the smallest eigenvalue of Γ we have,
[Equation]
where the last inequality follows from Young’s inequality with positive b as long as 1 −
[Equation]
By defining
[Equation]
and applying (F.28), we finally obtain
[Equation]
If A k ≥ X 1 k (1 − α k ) 2 (1 + 4ˆ c 2 α 2 k ) [Equation] then it su ffi ce to pick B k as
[Equation]
To get a recursion [Equation] we then only require the following conditions
[Equation]
and
[Equation]
Set
A k
= A , ε k
= ε .
For the first inequality of (F.38), since (1 − α k ) 2 ≤ (1 − α k ), the terms involving
A are bounded as
[Equation]
[Equation]
where the last inequality follows from (1 − α k ) ≤ 1 and α k ≤ α 0 .
Thus to satisfy the first inequality of (F.38) it su ffi
ce to pick
[Equation]
F
[Equation]
where 1 − 4ˆ c 2 α 0 > 0 is required.
The second equality of (F.38) is satisfied owing to (F.13).
The noise term in (F.36) can be made independent of k by using α k ≤ α 0 ,
[Equation]
Thus, it follows from (F.36) that
[Equation]
The result is obtained by total expectation and summing the above inequality while noting that the initial iterate were set as z − 1 =
z 0 .
Proof of Theorem 8.2 .
The theorem is a specialization of Theorem F.5 for a particular a choice of b and ε .
The third requirement of (F.13) can be rewritten as,
[Equation]
which is satisfied by ε = 1 √
[Equation]
[Equation] L M ) 2 .
We substitute in the choice of ε , b = √ α 0 and denotes η (cid:66) A .
The weighted sum in (F.14) is equivalent to an expectation over a sampled iterate in the style of
Ghadimi & Lan (2013),
[Equation]
with k ⋆ chosen from { 0 , 1 , . . .
, K } according to probability P [ k ⋆ = k ] =
[Equation]
Noticing that Γ − 1 ˆ z k ⋆ − S z k ⋆ (¯ z k ⋆ ;
¯ z k ⋆ ) ∈
F ¯ z k ⋆
+
A
¯ z k
⋆ =
T ¯ z k ⋆ so
[Equation]
where the second inequality follows from concavity of the minimum.
This completes the proof.
Theorem F.6 (almost sure convergence) .
Suppose that Assumption I(iii) to II(ii) and IV hold.
Moreover, suppose that α k ∈ (0 , 1) , θ ∈ [0 , ∞ ) and the following holds for positive parameter b,
[Equation]
where ¯ γ denotes the smallest eigenvalue of Γ
[Equation]
d ∈ [
[Equation]
1] and
[Equation]
Then, the sequence ( z k ) k ∈ (cid:142) generated by Algorithm 3 converges almost surely to some z ⋆ ∈ zer T.
Furthermore, if α k = 1 k + r for some positive natural number r, then (F.44) is satisfied and it su ffi ce to assume
[Equation]
Proof of Theorem F.6 (almost sure convergence).
We continue from the conditions in (F.38) which we restate here for convenience:
[Equation]
and
[Equation]
where
[Equation]
Under (F.47) the descent inequality (F.36) reduces to
[Equation]
where
[Equation]
To show almost sure convergence through the Robbins-Siegmund supermartingale theorem (Bertsekas, 2011, Prop. 2), we need 0 ≤ A k < ∞ (inside U k ), X 2 k and ζ k to be nonnegative and furthermore (cid:80) ∞
k =
α 2 k ζ k < ∞ .
To make a concrete choice of A k we solve the first (linear) inequality of (F.47) to equality with Lemma D.1.
Letting τ k (cid:66) 1 + 4ˆ c 2 α 2 k
and c k (cid:66)
ε k + 1 b (1 − 1 ε k (1 − L M ) 2 ) we have
[Equation]
where the last equality follows from picking
A
[Equation]
This choice ensures A k ≥ 0 for all k and consequently ζ k ≥ 0 and X 2 k ≥ 0 as long as (1 − 1 ε k [Equation] 1 − L M ) 2 ) > 0.
It remains to show boundedness of the cumulative noise terms.
[Equation]
51) where the last inequality follows from (1 − α k ) 2 ≤ 1 and picking ε k = [-
-]1 α dk
[Equation]
[Equation]
L M ) 2 with d ∈ [0 , 1] to ensure 1 − 1 ε k (1 − L M ) 2 > 0.
Assuming ν (cid:66) (cid:80) ∞ k =
α 2 k
A k
+ 1 < ∞ as in (F.44) is su ffi cient to show that (F.51) is bounded.
This finishes the proof for the first claim of Theorem F.6.
To provide an instance of the sequence ( α k ) k ∈ (cid:142) that satisfy the assumptions, let r denote a positive natural number and set
[Equation]
Then,
[Equation]
with ω ℓ =
(1 + r 2(1 − ℓ ) 4ˆ c 2 ) ∈
[1 , 1 + 4ˆ c 2 ] owing to the fact that Π ℓ p = 0 1 p + r = r 1 − ℓ .
It follows that, for any K ≥
[Equation]
Plugging the value of c ℓ and ε k from (F.50) and (F.51)
we obtain that A 0 is finite valued since b > 0,
L M < 1 and (cid:80) ∞ ℓ = 0 ε ℓ ( ℓ + r ) 3 = (cid:80) ∞
ℓ =1 ( ℓ + r ) 3 − d (1 − L M ) 2 < ∞ owing to the fact that d ≤ 1.
Moreover,
A
[Equation]
where the last inequality follows from ω i [Equation] j ≤
[Equation] 1 for any i , j [Equation] (cid:142)
[Equation] On the other hand, for e > 1 we have the following bound ∞ (cid:88) [Equation] F
[Equation]
Therefore, recalling c k = α − dk
[Equation]
[Equation]
), it follows from (F.53) that
[Equation]
In turn
[Equation]
this inequality ensures that ν as defined in eq.
(F.44) is finite.
To see this note that
[Equation]
+
[Equation]
It remains to simplify the remaining condition (F.45).
Using (F.55)
[Equation]
where the equality follows from choosing d = 1.
This completes the proof.
F.4 E xplanation of bias - correction term
Consider the naive analysis which would track h k .
By the definition of ¯ z k in (8.4b) and H k (¯ z k ) we would have h k − H k (¯ z k ) + P k
(¯ z k ) − ˆ P k
(¯ z k , ¯ ξ k ) ∈ F (¯ z k )
+ A (¯ z k ).
Hence, assuming zero mean and using the weak MVI from Assumption I (iii) ,
[Equation]
To proceed we could apply Young’s inequality, but this would produce a noise term, which would propagate to the descent inequality in (F.36) with a α k factor in front.
To show convergence we would instead need a smaller factor of α 2 k .
To avoid this error term entirely we instead do a change of variables with s k (cid:66) h k − ˆ
P z k
(¯ z k , ξ ′ k ) such that,
[Equation]
This make application of Assumption I (iii) unproblematic, but a ff ects the choice of the biascorrection term, since the analysis will now apply to s k .
If we instead of the careful choice of h k in (8.4a) had made the choice
[Equation]
then
[Equation]
Notice how the latter term is evaluated under ξ ′ k − 1 instead of ξ ′ k .
The choice in (8.4a) resolves this issue.
G N egative weak M inty variational inequality
In this section we consider the problem of finding a zero of the single-valued operator F (with the set-valued operator A ≡ 0).
Observe that the weak MVI in Assumption I (iii) , ⟨ Fz , z − z ⋆ ⟩ ≥ ρ ∥ Fz ∥ 2 , for all z ∈ (cid:146) n , is not symmetric and one may instead consider that the assumption holds for − F .
As we will see below this simple observation leads to nontrivial problem classes extending the reach of extragradient-type methods both in the deterministic and stochastic settings.
Assumption VIII (negative weak MVI) .
There exists a nonempty set S ⋆ ⊆
zer T such that for all z ⋆ ∈ S ⋆ and some ¯
ρ ∈ ( −∞ , 1 / 2 L ) ⟨ Fz , z − z ⋆ ⟩ ≤ ¯ ρ ∥ Fz ∥ 2 , for all z ∈ (cid:146) n .
(G.1)
Under this assumption the algorithm of Pethick et al.
(2022) leads to the following modified iterates:
[Equation]
where
H k (cid:66) id + γ
[Equation]
(G.3) We next consider the lower bound example of (Pethick et al., 2022, Ex. 5) to show that despite the condition for weak MVI being violated for b smaller than a certain threshold, the negative weak
MVI in Assumption VIII holds for any negative b and thus the extragradient method applied to − F is guaranteed to converge.
Example 1.
Consider (Pethick et al., 2022, Ex. 5)
[Equation]
where b < 0 and a > 0.
The associated F is a linear mapping.
For a linear mapping M, Assumption VIII holds if
[Equation]
While Assumption I (iii) holds if
[Equation]
For this example L = √ a 2 + b 2 and
[Equation]
(cid:123)
[Equation] Since M is a bisymmetric linear mapping, M ⊤ M = ( a 2 + b 2 )I which according to the above characterizations implies
[Equation]
The range for ρ is nonempty if b > − a √ 3 while this is not an issue for ¯ ρ which allows any negative b .
We complete this section with a corollary to Theorem 6.3 when replacing weak MVI assumption with Assumption VIII.
Corollary G.1.
Suppose that Assumptions I(i) and I(ii), Assumptions II, III and VIII hold.
Let ( z k ) k ∈
(cid:142) denote the sequence generated by Algorithm 1 applied to −
F. Then, the claims of Theorem 6.3 hold true.
H E xperiments H.1 S ynthetic example
Example 2 (Unconstrained quadratic game (Pethick et al., 2022, Ex. 5)) .
Consider, minimize x ∈ R maximize
[Equation]
where a ∈ R + and b ∈ R .
The problem constants in Example 2 can easily be computed as ρ = b a 2 + b 2 and L = √ a 2 + b 2 .
We can rewrite Example 2 in terms of L and ρ by choosing a = (cid:112)
L 2 − L 4 ρ 2 and b =
L 2 ρ .
Example 3 (Constrained minimax (Pethick et al., 2022, Ex. 4)) .
Consider minimize | x |≤ 4 /maximize | y |≤ 4 /ϕ ( x
[Equation]
[Equation] [Equation] − ψ ( y ) , (GlobalForsaken) where ψ ( z ) =
z 6 21 − z 4 3 + z 2 3 .
In both Example 2 and Example 3 the operator F is defined as Fz = ( ∇ x ϕ ( x , y ) , −∇ y ϕ ( x , y )).
To simulate a stochastic setting in all examples, we consider additive Gaussian noise, i.e. ˆ F ( z , ξ ) =
Fz + ξ where ξ ∼ N (0 , σ 2 I ).
We choose σ = 0 . 1 and initialize with z [-
-]0 = 1 if not specified otherwise.
The default configuration is γ = 1 / 2 L F with α k = 1 / 18 ·√ k / 100 + 1 , β k
= α k for diminishing stepsize schemes and α = 1 / 18 for fixed stepsize schemes.
When linear stepsize decay is used then α k =/ 18 · ( k / 100 + 1) .
H.2 A dditional algorithmic details
For the constrained setting in Figure 1, we consider two extensions of (SEG + ).
One variant uses a single application of the resolvent as suggested by Pethick et al.
[Equation]
with ξ k ∼ P
[Equation]
with ¯ ξ
[Equation]
( P
[Equation]
The other variant applies the resolvent twice as in stochastic Mirror-Prox
(Juditsky et al., 2011),
[Equation]
with ξ k ∼ P
[Equation] with ¯ [Equation] When applying (SEG) to constrained settings we similarly use the following projected variants:
[Equation]
with ξ k ∼ P
[Equation] with ¯ ξ [Equation] P (PSEG) and (EG + ) (using stochastic feedback denoted SF)
[Equation]
which we in the unconstrained case ( A ≡ 0) refer to as (SF-EG + ) as defined below.
[Equation]
I C omparison with variance reduction
Consider the case where the expectation comes in the form a finite sum,
[Equation]
In the worst case the averaged Lipschitz constant F ˆ F scales proportionally to the number of elements
N squared, i.e. L ˆ F = Ω ( √ NL F ).
It is easy to construct such an example by taking one elements to have Lipschitz constant NL while letting the remaining elements have Lipschitz constant L .
Recalling the definition in Assumption III, L 2ˆ F = N 2 L 2 N + N − 1 N L 2 ≥ NL 2 while the average becomes
L F = NLN + N − 1 N L ≤ 2 L so
L ˆ F ≥ √ N / 2 L F .
Thus, L ˆ F can be √ N times larger than L F , leading to a potentially strict requirement on the weak MVI parameter ρ > − L ˆ F / 2 for variance reduction methods.