P ROVABLY CONVERGENT QUASISTATIC DYNAMICS FOR MEAN - FIELD TWO - PLAYER ZERO - SUM GAMES
Anonymous authors
Paper under double-blind review
A BSTRACT
In this paper, we study the minimax problem arising from ﬁnding the mixed Nash equilibrium for mean-ﬁeld two-player zero-sum games
Solving this problem requires optimizing over two probability distributions.
We consider a quasistatic
Wasserstein gradient ﬂow dynamics in which one probability distribution follows the
Wasserstein gradient ﬂow, while the other one is always at the equilibrium.
Theoretical analysis are conducted on this dynamics showing its convergence to the mixed
Nash equilibrium under mild conditions.
Inspired by the continuous dynamics of probability distributions, we derive a quasistatic Langevin gradient descent method with inner-outer iterations, and test the method on different problems, including training mixture of GANs.
I NTRODUCTION
Finding Nash equilibrium has seen many important applications in machine learning, such as generative adversarial networks (GANs) (Goodfellow et al., 2014a), reinforcement learning (Busoniu et al., 2008), and adversarial training (Goodfellow et al., 2014b).
In these problems, pure Nash equilibria are searched by solving a minimax optimization problem min x max y f
( x, y ) .
Yet, the problems arising from machine learning are usually nonconvex in x and nonconcave in y , in which case pure Nash equilibrium may not exist.
And even if it exists, there is no guarantee for any optimization algorithm to ﬁnd it efﬁciently.
This difﬁculty is reﬂected in practice, that compared with simple minimization, machine learning applications involving minimax optimization usually have more complicated behaviors and more subtle dependence on hyper-parameters.
For example, stable and efﬁcient training of GANs requires a number of carefully designed tricks (Gao et al., 2018).
On the other hand, the mixed Nash equilibrium (MNE) is known to exist in much more general settings, e.g. when the strategy spaces are compact and the payoff function is continuous (Glicksberg, 1952).
In the mixed Nash equilibrium problem, instead of taking “pure strategies” x and y , two ”mixed strategies” for x and y , in the form of probability distributions, are considered, resulting in the minimax problem,
[Equation]
where p and q are density functions of probability distributions of x and y , respectively.
Efforts are invested to develop theoretically endorsed algorithms that can efﬁciently ﬁnd MNE for high dimensional problems, with applications on the training of mixture of GANs.
In Hsieh et al.
(2019), a mirror-descent algorithm is proposed and its convergence is proven.
In Domingo-Enrich et al.
(2020), theoretical analysis and empirical experiments are conducted for a gradient descent-ascent ﬂow under a Wasserstein-Fisher-Rao metric and its particle discretization.
In this paper, we also consider the mixed Nash equilibrium problem, and propose a simple QuasiStatic Wasserstein Gradient Flow (QSWGF) for solving the problem.
In our dynamics, we treat q as a component with much faster speed than p , hence is always at equilibrium as p moves.
With entropy regularization for both p and q (without requirement on the strength of the regularizations), we prove that the QSWGF converges to the unique mixed Nash equilibrium from any initialization (under mild conditions).
Furthermore, we show there is a simple way to discretize the QSWGF, regardless of the complexity of the Wasserstein gradient ﬂow of p induced by the fact that q is always at equilibrium.
Concretely, a partition function related with p appears in the QSWGF dynamics, while we ﬁnd an efﬁcient way to approximate the partition function.
By discretizing the QSWGF, we derive a particle dynamics with an inner-outer structure, named the QuasiStatic Langevin Gradient Descent algorithm (QSLGD).
In QSLGD, after each iteration of the outer problem (for the x particles), the inner loop conducts sufﬁcient iterations to bring the y particles to equilibrium.
Numerical experiments show the effectiveness of QSLGD on synthetic examples and training mixture of GANs.
Our method outperforms the vanilla Langevin gradient descent-ascent method when the entropy regularization is weak.
As a summary, our two major contributions are:
We propose the quasistatic Wasserstein gradient ﬂow dynamics for mixed Nash equilibrium problems, and show its convergence to the unique Nash equilibrium under weak assumptions.
Our result neither requires the entropy regularization to be sufﬁciently strong, nor assumes the dynamics to converge a priori. 2.
We derive a simple while practical quasistatic Langevin gradient descent algorithm by discretizing the quasistatic Wasserstein gradient ﬂow, by ﬁnding an efﬁcient way to approximate the partition function appearing in the dynamics of p .
The proposed algorithm is applied on several problems including training mixtures of GANs.
R ELATED WORK
The mixed Nash equilibrium problem has a long history, with the proof of its existence dates back to Morgenstern & Von Neumann (1953).
It draws new attention in recent years, especially in the machine learning community, due to the development of GANs (Goodfellow et al., 2014a) and adversarial training (Goodfellow et al., 2014b).
Training mixture of GANs is already discussed in paper (Goodfellow et al., 2014a).
Some numerical experiments were conducted in (Arora et al., 2017).
In Grnarova et al.
, the authors proposed an online learning approach for training mixture of GANs, and proved its effectiveness for semi-shallow GANs (GANs whose discriminator is a shallow neural network).
Yet, rigorous theoretical treatment to an algorithm started from (Hsieh et al., 2019), in which a mirror descent method was studied and proven to converge.
The implementation of the mirror descent method involves big computational cost that asks for heuristics to alleviate.
Later, (Domingo-Enrich et al., 2020) studied more efﬁcient algorithms under a mixture of Wasserstein and Fisher-Rao metrics.
Theoretically, the time average of the dynamics’ trajectories is shown to converge to the mixed Nash equilibrium. As a comparison, in this work we show the global convergence of the quasistatic Wasserstein gradient ﬂow without the need of taking time average. Meanwhile, the Wasserstein nature of our dynamics makes it easy to implement as well. The Wasserstein gradient ﬂow in the density space has been explored in previous works.
For example, (Wang & Li, 2019) studied the Nesterov’s accelerated gradient ﬂows for probability distributions under the Wasserstein metric, and (Arbel et al., 2019) studied practical implementations of the natural gradient method for the Wasserstein metric.
Both works focus on minimization problems instead of min-max problems considered in this work. A more related work is Lin et al. (2021b), where a natural gradient based algorithm is proposed for training GANs. Yet, the method still optimizes one generator and one discriminator, searching for pure Nash equilibrium.
Another work that derives algorithms for GANs from a Wasserstein perspective is (Lin et al., 2021a).
Another volume of works that studies the Wasserstein gradient ﬂow in the machine learning context is the mean-ﬁeld analysis of neural networks.
This line of works started from two-layer neural networks (Mei et al., 2018; Rotskoff & Vanden-Eijnden, 2018; Chizat & Bach, 2018; Sirignano & Spiliopoulos, 2020), to deep fully-connected networks (Ara ´ ujo et al., 2019; Sirignano & Spiliopoulos, 2021; Nguyen, 2019; Wojtowytsch et al., 2020), and residual networks (Lu et al., 2020; E et al., 2020).
The mean-ﬁeld formulations treat parameters as probability distributions, and the training dynamics are usually the gradient ﬂow under Wasserstein metric.
Attempts to prove convergence of the dynamics
T HE QUASISTATIC DYNAMICS
We consider the following entropy regularized mixed Nash equilibrium problem:
[Equation]
In (1), Ω is a compact Riemannian manifold without boundary, and P (Ω) is the set of probability distributions on Ω .
Since Ω is compact, any probability distribution in P (Ω) naturally has ﬁnite moments.
Let E ( p, q ) =
(cid:82) Ω × Ω K ( x, y ) p ( dx ) q ( dy ) , and S ( p ) =
(cid:82) Ω p log pdx and S ( q )
= (cid:82) Ω q log qdy be the (negative) entropy of p and q , respectively.
Then, the minimax problem (1) can be written in short as
[Equation]
Remark 1.
Strictly speaking, in (1) we should distinguish probability distributions and their density function (if exist), and the entropy should also be deﬁned using the Radon-Nikodym derivative with canonical measure.
In this paper, since p and q indeed have density functions because of the entropy regularization, we shall abuse the notation by using p and q to represent both probability distributions and their density functions.
The entropy regularizations in (1) and (2) make the problem strongly convex in p and strongly concave in q .
Hence, there exists a unique Nash equilibrium for the problem. Such results are shown for example by the following theorem from (Domingo-Enrich et al., 2020).
Theorem 1.
(Theorem 4 of (Domingo-Enrich et al., 2020))
Assume Ω is a compact Polish metric space equipped with canonical Borel measure, and that K is a continuous function on Ω × Ω .
Then, problem (2) has a unique Nash equilibrium given by the solution of the following ﬁxed-point problem:
[Equation]
where Z p and Z q are normalization constants to make sure p and q are probability distributions, and U and V are deﬁned as
[Equation]
Considering the efﬁciency in high-dimensional cases, a natural dynamics of interest to ﬁnd the Nash equilibrium for (2) is the gradient descent-ascent ﬂow under the Wasserstein metric, [Equation]
[Equation]
because it can be easily discretized into a Langevin gradient descent-ascent method by treating the
PDEs as Fokker-Planck equations of SDEs.
When β − 1 is sufﬁciently large, (4) can be proven to converge linearly to the unique MNE of (2) (Eberle et al., 2019).
However, when β − 1 is small, whether (4) converges remains open.
This hinders the application of (4) because in practice the entropy terms are usually used as regularization and are kept small.
In (4), the dynamics of p and q have the same speed.
In this work, instead, we study a quasistatic
Wasserstein gradient descent dynamics, which can be understood as a limiting dynamics when the speed of q becomes faster and faster compared with that of p .
In this case, at any time t , we assume q t reaches at the equilibrium of the maximizing problem instantaneously by ﬁxing p = p t in (2).
That is to say, at any time t , q t is determined by
[Equation]
On the other hand, p t follows the Wasserstein gradient descent ﬂow with q t = q [ p t ] at the equilibrium:
[Equation]
The following theorem shows q t =
q [ p t ] can be explicitly written as a Gibbs distribution depending on p t , and thus the free energy in (6) can be simpliﬁed to depend on a partition function related with p t .
Theorem 2.
Assume K is continuous on the compact set Ω and β > 0 .
Then, for ﬁxed p t the maximization problem (5) has a unique solution
[Equation]
where Z q ( p ) is a normalization factor, Z q ( p ) :
= (cid:82) exp( βV ( y, p )) dy .
Moreover, the dynamics (6) for p t can be written as
[Equation]
Let F p,β ( p ) :
= β − 1 log Z q ( p ) + β − 1 S ( p ) .
By Theorem 2, the dynamics (8) of p t is the Wasserstein gradient descent ﬂow for minimizing F p,β ( p ) .
By the Proposition 3 below, F p,β is strongly convex with respect to p .
Therefore, it is possible to prove global convergence for the dynamics (8), and thus the convergence for the quasistatic Wasserstein gradient ﬂow for the minimax problem (2).
Proposition 3.
For any probability distributions p 1 , p 2 in P (Ω) , and any λ ∈ [0 , 1] , we have [Equation]
Remark 2.
F p,β is also geodesic convex under the Wasserstein metric.
To show this, just note that
[Equation]
and that E ( p, q ) − β − 1 S ( q ) is linear with respect to p for any ﬁxed q .
In practice the partition function log Z q ( p t ) in (8) seems hard to approximate, especially when Ω is in high dimensional spaces.
However, we show in the following proposition that the variation of the partition function with respect to p t can be written as a simple form involving q t .
This property will be used to derive a particle method in Section
Proposition 4.
For any p ∈ P (Ω) , we have
[Equation]
where q [ p ] is deﬁned in (7).
Therefore, the dynamics (8) is equivalent with
[Equation]
C ONVERGENCE ANALYSIS
In this section, we analyze the convergence of the quasistatic dynamics (7), (8).
First, we make the following assumptions on K .
Assumption 1.
Assume K ∈ C ∞ (Ω × Ω) , which means K has continuous derivatives of any order (with respect to both x and y ).
Since Ω is compact, assumption 1 implies boundedness and Lipschitz continuity of any derivatives of K .
Now, we state our main theorem, which shows the convergence of QSWGF to the Nash equilibrium.
Theorem 5.
( main theorem )
Assume Assumption 1 holds for K .
Then, starting from any initial p 0 , q 0 ∈ P (Ω) , the dynamics (7), (8) has a unique solution ( p t , q t ) t ≥ 0 , and the solution converges weakly to the unique Nash equilibrium of (2), ( p ∗ , q ∗ ) , which satisﬁes the ﬁxed point problem (3).
Theorem 5 guarantees convergence of the quasistatic Wasserstein gradient ﬂow for any β , giving theoretical endorsement to the discretized algorithm that we will introduce in the next section.
Note that the initialization q 0 in the theorem is not important, because we assume q achieves equilibrium immediately after the initialization.
Remark 3.
The assumption on K ’s smoothness can be made weaker.
For example, during the proof, up to 4 -th order derivatives of K is enough to give sufﬁcient regularity to the solution of the dynamics.
We make the strong assumption partly to prevent tedious technical analysis so as to focus on the idea and insights.
Proof sketch We provide some main steps and ideas of the proof of the main theorem in this section.
The detailed proof is put in the appendix.
By the last section, since q t is always at equilibrium, we only need to considering a Wasserstein gradient descent ﬂow for F p,β ( p ) .
Therefore, we can build our analysis based on the theories in (Mei et al., 2018) and (Jordan et al., 1998).
However, compared with the analysis therein, our theory deals with a new energy term— β − 1 log Z q ( p ) , which has not been studied by previous works.
From now on, let E p,β ( p ) =
β − 1 log Z q ( p ) , and Ψ( · , p ) =
δE p,β ( p ) δp .
By simple calculation we have
[Equation]
First, we study the free energy F p,β ( p ) , and show that it has a unique minimizer which satisﬁes a ﬁxed point condition. This is the result of the convexity of F p,β .
We have the following lemma.
Lemma 1.
Assume Assumption 1 holds for K .
Then, F p,β has a unique minimizer p ∗ that satisﬁes
[Equation]
Moreover, p ∗ is the unique solution of the following ﬁxed point problem,
[Equation]
(12) where Z is the normalization factor.
Next, we want to show that any trajectory given by dynamics (10) will converge to the unique minimizer of F p,β .
To achieve this, we ﬁrst study the existence, uniqueness, and regularity of the solution to (8), i.e. the trajectory indeed exists and is well behaved.
Related results are given by the following lemma.
Lemma 2.
Assume Assumption 1 holds for K .
Then, starting from any initial p 0 ∈ P (Ω) , the weak solution ( p t ) t ≥ 0 to (8) exists and is unique.
Moreover, ( p t ) is smooth on (0 , ∞ )
× Ω .
The proof of Lemma 2 is based on Proposition 5.1 of (Jordan et al., 1998).
Especially, the existence part is proven using the JKO scheme proposed in (Jordan et al., 1998).
We consider a sequence of probability distributions given by the following discrete iteration schemes with time step h ,
[Equation]
where W 2 ( p, q ) means the 2-Wasserstein distance between probability distributions p and q .
Let ( p ht ) t ≥ 0 be the piecewise constant interpolations of ( p hk ) k ≥ 0 on time.
We show ( p ht ) converges weakly (after taking a subsequence) to a weak solution of (8) as h tends to 0 .
Details are given in the appendix.
Finally, noting that F p,β is a Lyapunov function of the dynamics (8), we have the following lemma showing the convergence of ( p t ) t ≥ 0 to the solution of the Boltzmann ﬁxed point problem (12).
This ﬁnishes the proof of the main theorem.
Lemma 3.
Let ( p t ) t ≥ 0 be the solution of (8) from any initial p 0 ∈ P (Ω) .
Let p ∗ be the unique minimizer of F p,β given by (12).
Then, p t converges to p ∗ weakly as t → ∞ .
As a byproduct, since our convergence results does not impose requirement on β , if one is interested in the minimax problem without entropy regularization,
[Equation]
(13) then, Theorem 5 in (Domingo-Enrich et al., 2020) ensures that the quasistatic dynamics converges to approximate Nash equilibrium of (13) as long as β − 1 is small enough.
Speciﬁcally, a pair of probability distributions ( p, q ) is called (cid:15) -Nash equilibrium of (13) if
[Equation]
Then, we have the following theorem as a direct results of Theorem 5 in (Domingo-Enrich et al., 2020):
Theorem 6.
Let C K be the bound of K that satisﬁes | K ( x, y ) | ≤ C K for any x, y ∈ Ω , and let
Lip ( K ) be the Lipschitz constant of K .
For any (cid:15) > 0 , let δ =
(cid:15)/ (2 Lip ( K )) , and let V δ be the volume of a ball with radius δ in Ω .
Then, as long as
[Equation]
, there exists T > 0 which depends on (cid:15) , such that for any t > T , the solution p t , q t of the dynamics (7) and (8) at t satisﬁes
[Equation]
T HE QUASISTATIC L ANGEVIN GRADIENT DESCENT - ASCENT METHOD
It is well known that PDEs with the form
[Equation]
are Fokker-Planck equations for SDEs dX t [Equation] − [Equation]
[Equation] dt [Equation] √
[Equation]
t , and the solution for the
PDE characterizes the law of X t —the solution of the SDE—at any time.
This result connects the
Wasserstein gradient ﬂow with SDE, and gives a natural particle discretization to approximate the continuous Wasserstein gradient ﬂow.
For example, the Wasserstein gradient descent-ascent ﬂow dynamics (4) is the Fokker-Planck equation of the SDEs
[Equation]
where p t and q t are the laws of X t and Y t , respectively, and W t and W (cid:48) t are two Brownian motions.
Note that we have
[Equation]
Therefore, i.i.d.
picking X ( i )∼ p 0 and Y ( i )∼ q 0 for i = 1 , 2 , ..., n , the particle update scheme, named Langevin Gradient Descent-Ascent (LGDA),
[Equation]
[Equation]
approximately solves the SDEs, and thus the empirical distributions of X ( i ) k and Y ( i )
k approximate the solutions of (4) when n is large.
Here, ξ ( i ) k and ζ ( i ) k are i.i.d.
samples from the standard Gaussian.
Quasistatic Langevin gradient descent method Similarly, the dynamics (8) for p is the FokkerPlanck equation for the SDE
[Equation]
(15) where p t is the law of X t .
By proposition 4 we have Ψ( x, p t ) =
U ( x, q [ p t ]) .
Hence, (15) can be written as
[Equation]
[Equation] with q [ p t ] at the equilibrium of the maximization problem (5), which can be attained by solving the
SDE
[Equation]
for sufﬁciently long time.
This motivates us to design a quasistatic particle method as a discretization for the quasistatic Wasserstein gradient ﬂow.
Speciﬁcally, the method consists of an inner loop and an outer loop.
The method starts from some particles
X ( i )
and Y ( i ) 0 , i = 1 , 2 , ..., n , sampled i.i.d.
from p 0 and q 0 , respectively.
Then, at the k -th step, the inner loop conducts enough iterations on the
Y particles to solve (17) with p t ﬁxed (i.e. with the X particles ﬁxed), which drives the empirical distribution of { Y ( i ) k } ni =1 near equilibrium before each update of the outer loop.
Next, the outer loop updates X ( i ) k according the SDE (16).
The algorithm is summarized in Algorithm 1.
input : n x , n y , k 0 , k 1 , k 2 , T ∈ N + , h x , h y > 0 , p 0 , q 0 ∈ P
Ω)
Y ( i ) 0 ,s ← Y
[Equation]
i ) 0 ,s
[Equation] [Equation]
h
[Equation]
(cid:80) j =1 ∇
[Equation] [Equation]
(cid:112) 2 h
[Equation]
ξ ; / end 6 Y i do
Y
i t − 1 ,
−
Y
) t − 1 ,s ← Y ( i ) t − 1 ,s −
+ h y n x n x (cid:80) j =1 ∇ y K
( X ( j ) t − 1 , Y ( i ) t − 1 ,s − 1 )
+ (cid:112) 2 h y β − 1 ξ ; do
Y ( i ) t − 1 ,s + k 1 ← Y ( i ) t − 1 ,s
+ k 1 −
+ h y n x n x (cid:80) j =1 ∇ y K
( X ( j ) t
[Equation]
1 , Y ( i ) t − 1 ,s + k 1 − y β −
; ˆ Y i ) t −←
; end t ← − k 2 n y k n = y i t − Y
− β − 1 ξ ; /* remark 3.2 */ Y i t ← Y −
+
; 18 end
Remark 4.
Generally speaking, Algorithm 1 consists of two nested loops.
The inner loop solves
Y particles to equilibrium in each step of the outer loop, while the outer loop makes one iteration every time, using the equilibrium Y particles.
In the following are some additional explanation for the Algorithm:
1 line 4: at the beginning of the algorithm, we conduct k 0 additional inner iterations for Y , where k 0 may be a large number. This is because at the beginning the Y particles are far from equilibrium. In later outer iterations, since each time the X particles only move for a small distance, the Y particles are close to the equilibrium. Therefore, k 1 and k 2 need not to be large.
2 line 17:
In each inner loop, we conduct k 1 + k 2 inner iterations for the Y particles, and collect those from the last k 2 iterations.
We use these k 2 n particles in the update of X particles to approximate the distribution q [ p ] .
We assume during the last k 2 inner iterations the Y particles are at equilibrium.
One can take k 2 to be 1 if n y is large enough, while taking large k 2 allows smaller number of Y particles.
5. E XAMPLES
In this section, we apply the quasistatic Langevin gradient descent method to several problems.
1 -dimensional game on torus We ﬁrst consider a problem with x and y on the 1 -dimensional torus.
Speciﬁcally, we consider
[Equation]
where x, y ∈ R / Z .
It is easy to show that, with this K and a positive β , at the Nash equilibrium of the problem (1) p and q are both uniform distributions.
We take initial distributions p 0 and q to be the uniform distribution on [0 , 1 / 4] .
Figure 1 shows the comparison of the quasistatic particle method with LGDA for different β , step length, and number of particles.
In the experiments, all quasistatic methods take k 0 = 1000 and k 2 = 1 , with different k 1 shown in the legends.
For each experiment, we conduct 300000 , 150000 , 60000 , 30000 outer iterations for LGDA, QS2, QS5, and QS10, respectively.
We take different different numbers of iterations for different methods in the consideration of different number of inner iterations.
The error is then computed after the last iteration, measured by the KL divergence of the empirical distribution given by particles and the uniform distribution (both in the forms of histograms with 10 equi-length bins).
Each point in the ﬁgures is average of 5 experiments.
Seen from the left ﬁgure, the QSLGD has comparable performance than LGDA when β is small, in which case diffusion dominates the dynamics, while it performs much better than LGDA when β is large.
We can also see better tolerance to large β when more inner iterations are conducted.
This shows the advantage of the QSLGD over LGDA when the regularization stength is weak.
The middle ﬁgures shows slightly better performance of the QSLGD when the step length η
(both η x and η y ) is small.
However, when η is big, LGDA tends to give smaller error.
The results may be caused by the instability of the inner loop when η is big.
It also guides us to pick small step length when applying the proposed method.
Finally, the right ﬁgure compares the inﬂuence of the number of particles when β = 100 and η = 0 .
01 , in which case the two methods perform similarly.
We can see that the
Polynomial games on spheres In the second example, we consider a polynomial games on sphere similar to that studied in (Domingo-Enrich et al., 2020),
[Equation]
where x, y ∈ S
d − 1 and ( x 2 ) is the element-wise square of x .
In this problem, we consider the Nash equilibrium of min p max q E ( p, q ) .
Hence, we take big β (small β − 1 ) and compare the Nikaido and
Isoda (NI) error of the solutions found by different methods (Nikaidˆo & Isoda, 1955).
The NI error is deﬁned by
[Equation]
which is also used in Theorem 6.
The left panel of Figure 2 shows the NI errors of the solutions found by different methods with different dimensions, we see comparable performance of the QSLGD with
LGDA.
GANs Finally, we test our methods on the training of GANs.
We train GANs to learn Gaussian mixtures.
The results after training are shown in the middle and right panels of Figure 2, where
Gaussian mixtures with 4 and 8 modes are learned, respectively.
We train GANs with 5 generators and 5 discriminators, and take k 0 = 100 , k 1 = 5 , k 2 = 1 .
The results show that the mixture of
GANs trained by QSLGD can learn Gaussian mixtures successfully.
In the right panel of Figure 2, we show the results of learning high dimensional Gaussian mixtures. In the d-dimensional experiment, the Gaussian mixture has d modes centered at e 1 , e 2 , ..., e d with standard deviation 0 . Here, e i is the i -th unit vector in the standard basis of R d . Model and algorithm with same hyper-parameters as above are used.
In the ﬁgure, we measure the average squared distance of the generated data to the closest mode center along the training process.
The ﬁgure shows that the average squared distance can be reduced to 0 .
3 − 0 .
5 after 10000 iterations.
While the ideal value is 0 . 1 , the current results still show that the learnt distribution concentrates at the mode centers.
Better results may be obtained after longer training or careful hyper-parameter tuning.
In this paper, we study the quasistatic Wasserstein gradient ﬂow for the mixed Nash equilibrium problem.
We theoretically show the convergence of the continuous dynamics to the unique Nash equilibrium.
Then, a quasistatic particle method is proposed by discretizing the continuous dynamics.
The particle method consists of two nested loops, and conduct sufﬁcient inner loop in each step of the outer loop.
Numerical experiments show the effectiveness of the method.
Comparison with
LGDA shows the proposed method has advantage over LGDA when β is large (which is usually the case of interest), and performs as good as LGDA in most other cases.
Theoretical extensions are possible.
For example, strong convergence results may be established by similar approaches taken in (Feng & Li, 2020).
We leave this as future work.
In practice, the idea of nested loops is not new for minimax optimization problems.
It is already discussed and utilized in the earliest works for GANs (Goodfellow et al., 2014a), and Wasserstein GANs (Arjovsky et al., 2017).
In those works, the discriminator is updated for several steps each time the generator is updated.
Our work is different from these works because we consider mixed Nash equilibrium and hence our method is particle based, while their method searches for pure Nash equilibrium.
Finally, though particle methods ﬁnding mixed Nash equilibria have stronger theoretical guarantees, applying these methods to the training of GANs faces the problem of computational cost.
With both the generator and discriminator being large neural networks, training mixture of GANs with many generators and discriminators imposes formidable computational cost.
Developing more efﬁcient particle methods for GANs is an important future work.
A P ROOFS FOR S ECTIONA. P ROOF OF T HEOREM
Note that the free energy in (5) can be written as
[Equation]
in which the ﬁrst term is linear with respect to q .
Hence, a calculation with Lagrange multiplier shows (19) has a unique minimizer q [ p t ] with the form of a Gibbs distribution (e
[Equation]
g. see Chapterof (Mezard & Montanari, 2009)):
[Equation]
Next, we consider the free energy for p t when q is at the equilibrium.
By (19) we have
[Equation] [Equation]
On the other hand
[Equation]
we have
[Equation] [Equation]
Combining (21) and (22)
[Equation]
we obtain
[Equation]
Therefore, the dynamics of p t is the Wasserstein gradient descent ﬂow minimizing the free energy β − 1 log Z q ( p t ) + β − 1 S ( p t ) , given by
[Equation]
This ﬁnishes the proof.
A. P ROOF OF P ROPOSITION
Since S ( p ) is strongly convex, it sufﬁces to show log Z q ( p ) is convex.
Recall that
[Equation]
Note that V ( · , p ) =
(cid:82) K ( x, · ) p ( x ) dx is linear with respect to p , we have
V ( · , λp 1 + (1 − λ ) p 2 ) = λV ( · , p 1 ) + (1 − λ ) V ( · , p 2 ) .
Hence, log Z q ( λp 1 + (1 − λ ) p 2 ) = log (cid:18)(cid:90)
[Equation]
[Equation]
A. P ROOF OF P ROPOSITION
The proposition follows from the following derivations.
[Equation]
B P ROOF OF T HEOREM
In this section, we prove our main theorem.
The proof will follow the sketch given in Section 4.
Given the assumptions on K and the conclusions of Lemma 1 and Lemma 2, Lemma 3 is a direct result of Lemma 10.12 in (Mei et al., 2018), which we will ignore the proof.
In the following, we show Lemma 1 and Lemma 2.
Some techniques in the proof come from (Jordan et al., 1998) and (Mei et al., 2018).
B. P ROOF OF L EMMA
Our proof follows the proof of Proposition 4.1 in (Jordan et al., 1998).
First, we show the existence of the minimizer for F p,β .
To see this, note that K is bounded on Ω .
Assume C K is a constant such that | K ( x, y ) | ≤ C K for any x, y ∈ Ω .
Then, we have
[Equation]
and
[Equation]
This means F p,β ( p ) is lower bounded, i.e. inf p F p,β ( p ) >
−∞ .
Hence, we can ﬁnd a sequence ( p k ) ∞ k =1 such that
[Equation]
Similar to (Jordan et al., 1998), we can show boundedness of { (cid:82) max { p k log p k , 0 } dx } and { (cid:82) p 2 k dx } , which implies that ( p k ) is uniformly integrable, and thus there exists a weakly convergent subsequence of ( p k ) .
Without loss of generality, assume p k (cid:42) p ∗ in L 1 (Ω) .
Then we need to show p ∗ is a minimizer of
F p,β .
By (Jordan et al., 1998), the entropy term satisﬁes
[Equation]
Hence, the conclusion follows if E p,β is continuous in the weak topology.
To show this, ﬁrst note that for any p ∈ P (Ω) , we have
[Equation]
Because the function log( x ) is 1 /c -Lipschitz for x ∈ [ c, ∞ ] , for any p k we have
[Equation]
By similar boundedness argument, we have
[Equation]
Totally we have
[Equation]
Since K is bounded and Lipschitz
[Equation]
it is easy to show that
[Equation]
Therefore, we have
[Equation]
and thus F p,β ( p ∗ ) = inf p F p,β ( p ) .
Next, we show p ∗ satisﬁes the ﬁxed point condition
[Equation]
This follows the proof of Lemma 10.3 in (Mei et al., 2018), by ﬁrst showing p ∗ has full support on Ω , and then showing Ψ( x, p ∗ ) + β − 1 log p ∗ ( x ) is a constant.
Finally, we show p ∗ is unique following Lemma 10.4 of (Mei et al., 2018).
Speciﬁcally, we show the Boltzmann ﬁxed point problem (25) only has one solution by the convexity of F p,β .
Assume (25) has two different solutions p 1 and p 2 , i.e.
[Equation]
Then, we have
[Equation]
Taking difference of the above two equations, and integrating with p 1 − p 2 , we have
[Equation]
By the monotonicity of log x , the second term of (26) is non-negative, and takes zero only if p 1 = p 2 .
For the ﬁrst term, recall that we have proven in Proposition 3 that E p,β is convex, we then have
[Equation]
and
E
[Equation]
Taking difference of the two equations gives
[Equation]
Therefore, (26) holds if and only if p 1 =
p 2 .
This ﬁnishes the proof of uniqueness of p ∗ , and also completes the proof of Lemma 1.
B. P ROOF OF L EMMA
We show the existence of the weak solution using the JKO scheme used in (Jordan et al., 1998).
Let dist ( · , · ) be the distance metric on Ω .
Then, the 2-Wasserstein distance is on P (Ω) is deﬁned as
[Equation]
where Γ( p 1 , p 2 ) contains all couplings of p 1 and p 2 , i.e. probability distributions on Ω × Ω with ﬁrst and second marginals being p 1 and p 2 , respectively.
Then, for any h > 0 , we consider the sequence of probability distributions ( p hk ) ∞
k =0 obtained by the following iteration scheme:
[Equation]
By similar argument of Proposition 4.1 in (Jordan et al., 1998), each minimization problem in (27) has a unique solution.
Hence, ( p hk ) ∞ k =0 is uniquely deﬁned.
Let p ht be the piecewise constant interpolation of ( p hk ) on t , i.e. p ht =
p hk , for t ∈
[ kh, ( k + 1) h ) , for k = 0 , 1 , 2 , ... .
We now show that there exists a subsequence of h n → 0 and a p t such that p h n t (cid:42) p t on (0 , T ) × Ω for any T > 0 and p t is a weak solution of (8).
This is proven in two steps:
The existence of weakly convergence subsequence, and 2.
p ht approximately satisﬁes the equation (8).
For the ﬁrst point, we show uniform integrability by showing
[Equation] [Equation]
and
[Equation]
for any h and k ≥ 0 , and an absolute constant C .
Equation (28) follows directly from the compactness of Ω .
For (29), note that for any h and k ≥
we have
[Equation]
which implies
[Equation]
Therefore,
[Equation]
Since K is bounded, E p,β is bounded, and thus the above expression is also bounded, which gives (29).
With (28) and (29), there exists p t ( x ) and a sequence ( h n ) with h n → 0 , such that p h n t (cid:42) p t in L 1 ((0 , T ) × Ω) for any T > 0 .
Moreover, p t ∈ P (Ω) for almost every T .
By changing p t on a zero measure set of t , we can assume p t ∈ P (Ω) for any t ∈ (0 , ∞ ) .
With the same analysis as (Jordan et al., 1998), the weak convergence can happen for any t , i.e. p
For the second point, similar to (Jordan et al., 1998), consider any vector ﬁeld ξ ∈ C ∞ (Ω , Ω) and the corresponding ﬂux Φ τ given by
[Equation]
and let q τ =
Φ τ (cid:93)p hk , then we have
[Equation]
for any τ > 0 .
We need to study the limit when τ → 0 + .
By the calculation in (Jordan et al., 1998) we have
[Equation]
and
[Equation]
where the γ in (31) is the optimal transport between p hk − 1 and p hk .
For the E p,β term, we have
[Equation]
Combining the above result with (31) and (32), taking both ξ and − ξ , we get from (30) that
[Equation]
for any ξ ∈ C ∞ (Ω , Ω) .
Then, following the derivation in (Jordan et al., 1998) (proof of Proposition 5.1), as well as the following control
N (cid:88)
[Equation]
for any N that satisﬁes Nh ≤ T for some ﬁxed T , we can integrate (34) over t by viewing p hk as p ht at appropriate t , and take the limit h n → 0 and show that p t is a weak solution.
During the limit, we need to pay special attention to the second term, i.e. the following limit, which is not dealt with in the reference:
[Equation]
We prove this by showing ∇ x Ψ( x, p h n t ) converges to ∇ x Ψ( x, p t ) uniformly.
For any ﬁxed t , recall that we have
[Equation]
Therefore, for any y ∈ Ω , we have
[Equation]
Note that (cid:82) Ω K ( x, y ) p ( x ) dx is uniformly continuous with respect to y for any p ∈ P (Ω) , we can conclude that (cid:82) Ω K ( x, y )
p h n t ( x ) dx converges to (cid:82) Ω K ( x, y )
p t ( x ) dx uniformly over y .
Hence, we have Z q ( p h n t )
→ Z q ( p t ) , and q [ p h n t ]( y ) → q [ p t ]( y ) uniformly.
This further implies that
[Equation]
converges to ∇ x Ψ( x, p t ) for all x ∈ Ω .
This ﬁnishes the proof of (35), and also completes the proof that p t is a weak solution of of equation (8).
Now we have proven the existence of the weak solution.
The regularity and uniqueness of the solution follows the same analysis of Proposition 5.1 in (Jordan et al., 1998).