Repository · Full text

Uniform-in-Time Particle Convergence
for Projected Gaussian SVGD

Read PDF

HTML version 1 Added

Papers are listed without authors and are not intended for submission or formal publication.

Contents

Uniform-in-Time Particle Convergence
for Projected Gaussian SVGD

Abstract

Liu, Ghosal, Balasubramanian, and Pillai [12] conjectured uniform-in-time mean-field convergence for projected Gaussian Stein variational gradient descent (SVGD) beyond Gaussian targets. We give a quantitative affirmative answer for the continuous-time, exact-Gaussian-moment system with kernel K1⁢(x,y)=x⊤⁢y+1, assuming π⁡(d⁢x)∝e−V⁡(x)⁢d⁢x, V∈C2⁢(Rd), and 0<α⁢I⪯∇2V⪯β⁢I. For Gaussian i.i.d. initialization and every N≥d+1, the empirical particle law ζN,t and Gaussian mean-field law ρt satisfy E⁡[supt≥0W22⁢(ζN,t,ρt)]≤C⁢rd⁢(N). The asymptotic orders of rd⁢(N) are N−1⁢log⁡log⁢N, N−1⁢(log⁡N)2, and N−2/d in dimensions one, two, and at least three, respectively; each is sharp in particle number. Thus the time supremum can be placed inside the expectation without losing the Gaussian empirical-measure rate, even at the minimal full-rank sample size. We also obtain high-probability all-time bounds and a last-iterate guarantee to the reverse-KL optimal Gaussian at the same statistical scale. The key deterministic inequality separates initial moment mismatch from the Wasserstein discrepancy of the standardized cloud, using stability in square-root covariance coordinates and exact affine transport. At fixed N, we characterize the discrete limiting cloud: its moments are optimal, but its preserved standardized shape leaves a strictly positive full-law error.

Note. This paper was generated entirely by AI, including MiMo, using an automated research pipeline developed by Chenghua Liu and Hanyu Li.

1 Introduction and prior conjecture

This section states the prior conjecture, explains the obstacle to uniform full-law control, and summarizes our resolution. Detailed definitions and results follow in Section 2.

Stein variational gradient descent (SVGD) transports particles by a kernelized deterministic velocity field [11, 10]. Finite-horizon propagation-of-chaos constants can grow with the horizon, and time-averaged bounds do not control a physical-time (fixed-time or last-iterate) law; uniform-in-time full-law control is therefore delicate. Our result concerns a continuous-time Gaussian-score projection with exact Gaussian expectations, not the ordinary unprojected SVGD particle system.

In the arXiv version of Liu et al. [12], Theorem 3.7 gives a Gaussian-target, pointwise-in-time expectation bound with a constant uniform in time under Gaussian i.i.d. initialization. For general targets, their Theorem 4.3 derives the exact-moment affine representation and is followed by a qualitative conjecture of uniform-in-time mean-field convergence. We formulate a stronger quantitative version, making the sampling model explicit.

Open problem 1.1 (Quantitative exact-moment conjecture).

For a possibly non-Gaussian target satisfying V∈C2⁢(Rd) and α⁢I⪯∇2V⪯β⁢I, initialize the projected K1⁢(x,y)=x⊤⁢y+1 particle system with i.i.d. samples from a full-rank Gaussian law ρ0. At fixed dimension, can one place the time supremum inside the expectation, retain the sharp Gaussian empirical-measure rate, and obtain a physical-time last-iterate bound to the reverse-KL optimal Gaussian?

Exact moment closure alone does not answer this question. The empirical law retains a standardized shape that affine dynamics transports rather than Gaussianizes, while the moment vector field becomes sensitive near the positive-definite boundary. We resolve both issues under global strong convexity and a bounded continuous Hessian, without assuming a third derivative or a Hessian-Lipschitz modulus:

  1. 1.

    a square-root-coordinate energy yields semiglobal all-time stability on every energy sublevel;

  2. 2.

    a deterministic oracle separates moment mismatch from a time-independent standardized-shape discrepancy;

  3. 3.

    Gaussian matching and log-Wishart estimates give the sharp expected N-rate, a high-probability upper bound, and the endpoint N=d+1; and

  4. 4.

    the exact finite-particle limit retains a positive shape floor.

A scalar counterexample delineates the scope of the first item: the semiglobal Euclidean Lipschitz estimate used here cannot be replaced by one initialization-uniform constant over the full positive-definite cone.

2 Model and main results

This section defines the projected moment and particle dynamics, then states the deterministic oracle, its probabilistic consequences, and the exact finite-particle limit. We close with the assumptions that delimit their scope.

Let d≥1 be fixed and let

π⁡(d⁢x)=ZV−1⁢e−V⁡(x)⁢d⁢x,V∈C2⁢(Rd),

where ZV<∞ by strong convexity and, for constants 0<α≤β<∞,

α⁢I⪯∇2V⁢(x)⪯β⁢I,x∈Rd.(2.1)

We use W2 for the quadratic Wasserstein distance on P2⁢(Rd) and T#⁢ν for pushforward by T. Vector norms are Euclidean; matrix norms carry subscripts F or op. For q=(μ,A)∈Rd×Sym⁡(d), the product norm is ‖q‖2=|μ|2+‖A‖F2. For every Σ≻0, Σ1/2 denotes its principal symmetric square root, and

Q=Rd×S+⁣+d,q=(μ,A)=(μ,Σ1/2).

We also write γd=N⁡(0,Id), set u+=max⁡{u,0} and log+⁡x=(log⁡x)+, and define dTV⁢(P,Q)=supB|P⁡(B)−Q⁡(B)|. Unless indexed otherwise, C,c>0 may change from line to line and depend only on the fixed problem data in the relevant statement, never on N,t, or a tail parameter.

For (μ,Σ)∈Rd×S+⁣+d, define the exact Gaussian moments

m⁡(μ,Σ)=EN⁡(μ,Σ)⁢[∇V⁢(X)],Γ⁡(μ,Σ)=EN⁡(μ,Σ)⁢[∇2V⁢(X)].(2.2)

The Gaussian mean-field moment flow is

μ˙=(I−Γ⁢Σ)⁢μ−(1+|μ|2)⁢m,(2.3a)
Σ˙=2⁢Σ−Σ⁡(Σ⁢Γ+μ⁢m⊤)−(Γ⁢Σ+m⁢μ⊤)⁢Σ,(2.3b)

where m=m⁡(μt,Σt) and Γ=Γ⁡(μt,Σt). We write ρt=N⁡(μt,Σt) for the solution starting from fixed μ0∈Rd and Σ0≻0.

Given initial points X1⁢(0),…,XN⁢(0), set

μ^t=1N⁢∑i=1NXi⁢(t),Σ^t=1N⁢∑i=1N(Xi⁢(t)−μ^t)⁢(Xi⁢(t)−μ^t)⊤.(2.4)

With

m^t=m⁡(μ^t,Σ^t),Γ^t=Γ⁡(μ^t,Σ^t),

the projected particle system is

X˙i⁢(t)=Ct⁢Xi⁢(t)−m^t,Ct=I−Γ^t⁢Σ^t−m^t⁢μ^t⊤.(2.5)

This is the Gaussian-score projection associated with K1; it is not the ordinary, unprojected SVGD particle system. Define

ζN,t=1N⁢∑i=1NδXi⁢(t).

For Theorems 2.2 and 2.4, the initial points are drawn independently from N⁡(μ0,Σ0). Under this Gaussian initialization, all particle paths and standardized quantities are assigned an arbitrary fixed value on the null event {Σ^0⊁0}. On its complement the paths and Gaussian moments are continuous in t, hence so is t↦W22⁢(ζN,t,ρt). Consequently

supt≥0W22⁢(ζN,t,ρt)=supt∈Q+W22⁢(ζN,t,ρt),(2.6)

so every random supremum below is measurable.

For Z∼γd, use the constant-free energy representative

F(μ,A)=EV(μ+AZ)−logdetA.(2.7)

Then KL(N(μ,A2)∥π)=F(μ,A)+cπ, where cπ=log⁡ZV−d2⁢(1+log⁡(2⁢π)). Let q∗=(μ∗,A∗) be the unique minimizer, put Σ∗=A∗2 and ρ∗=N⁡(μ∗,Σ∗), and define

KR={q:F⁡(q)−F⁡(q∗)≤R}.(2.8)

Section 4 proves that these sublevels are compactly contained in the positive covariance domain.

We first state the deterministic result from which the probabilistic all-time estimates are lifted. Given a deterministic cloud x1,…,xN with empirical mean μ^0 and covariance Σ^0≻0, choose any whitening matrix R0 satisfying R0⁢Σ^0⁢R0⊤=I and set

zi=R0⁢(xi−μ^0),ηN=1N⁢∑i=1Nδzi.(2.9)

The value of W2⁢(ηN,γd) does not depend on the whitening: two whitening matrices differ by a left orthogonal factor, and γd is rotation invariant.

Theorem 2.1 (Deterministic localized oracle).

Let q0=(μ0,Σ01/2), let qt=(μt,Σt1/2) be the solution of (2.3), set ρt=N⁡(μt,Σt), and let ζN,t be the projected particle solution from an arbitrary deterministic cloud with Σ^0≻0. Put qN,0=(μ^0,Σ^01/2). For every 0≤R<∞ there are finite constants SR and bR, depending only on R,d,V, such that, whenever q0,qN,0∈KR,

supt≥0W22⁢(ζN,t,ρt)≤2⁢SR2⁢‖qN,0−q0‖2+2⁢bR2⁢W22⁢(ηN,γd).(2.10)

Both the mean-field and particle solutions are global under these conditions. No independence or distributional assumption on the initial cloud is required.

In particular, any sequence of full-rank deterministic or dependent clouds lying in a common sublevel and satisfying ‖qN,0−q0‖2+W22⁢(ηN,γd)→0 converges uniformly in physical time.

For an unambiguous statement at every admissible N, let

rd⁢(N)={N−1⁢{1+log⁡log⁡(ee+N)},d=1,N−1⁢(1+log⁡N)2,d=2,N−2/d,d≥3.(2.11)

Thus, asymptotically, the first two rates are N−1⁢log⁡log⁢N and N−1⁢(log⁡N)2, respectively. The regularization inside the logarithms only makes these rates finite for every admissible sample size.

We now specialize the oracle to Gaussian sampling, first in expectation.

Theorem 2.2 (Uniform-in-time particle convergence).

Assume (2.1), fix d≥1, μ0∈Rd, and Σ0∈S+⁣+d, let N≥d+1, and draw the initial particles i.i.d. from N⁡(μ0,Σ0). Then Σ^0≻0 almost surely, the systems (2.3) and (2.5) have global solutions, and there is a finite constant C, depending only on d,V,μ0,Σ0, such that

E⁡[supt≥0W22⁢(ζN,t,ρt)]≤C⁢rd⁢(N).(2.12)

In particular, the same bound holds with the supremum outside the expectation. The constant is independent of N and t.

The next proposition shows that the expected rate cannot be improved in its N-dependence, even before the dynamics starts.

Proposition 2.3 (Sharpness in particle number).

Under the Gaussian i.i.d. initialization of Theorem 2.2, for every fixed d,μ0, and Σ0≻0 there is c>0 such that

E⁡[supt≥0W22⁢(ζN,t,ρt)]≥c⁢rd⁢(N),N≥d+1.(2.13)

Thus the N-dependence in Theorem 2.2 is optimal in every fixed dimension.

Proof.

At time zero, ζN,0 is the empirical measure of N i.i.d. samples from ρ0=N⁡(μ0,Σ0). Applying the invertible affine map x↦μ0+Σ01/2⁢x to the standard Gaussian empirical matching problem, with ξi⁢∼iid⁢γd and νN=N−1⁢∑iδξi, gives

E⁢W22⁢(ζN,0,ρ0)≥λmin⁢(Σ0)⁢E⁢W22⁢(νN,γd).

The expectation on the right is bounded below by cd⁢rd⁢(N): in dimension one this is the two-sided Gaussian order-statistic estimate of Bobkov and Ledoux [5, Corollary 6.14] for E⁢W22; in dimension two it follows from the nonstandard two-sample Gaussian matching lower bound of Talagrand [16, main result and display (1)] (if νN′ is an independent copy of νN, then W22⁢(νN,νN′)≤2⁢W22⁢(νN,γd)+2⁢W22⁢(νN′,γd)); and for d≥3 it is the Gaussian matching lower bound of Ledoux and Zhu [9, Theorem 1.1]. Since time zero is included in the supremum, (2.13) follows. Reducing the constant handles the finitely many nonasymptotic sample sizes. ∎

The same decomposition also yields exponential concentration around the dimension-dependent statistical scale.

Theorem 2.4 (High-probability all-time convergence).

Under the assumptions of Theorem 2.2, there are constants C,c,c0>0, depending only on the fixed problem data, such that for every N≥d+1 and 1≤x≤c0⁢N, there is an event HN⁢(x) with P⁡(HN⁢(x)c)≤C⁢e−c⁢x on which

supt≥0W22⁢(ζN,t,ρt)≤C⁡(rd⁢(N)+xN).(2.14)

On HN⁢(x), simultaneously for every t≥0,

W22⁢(ζN,t,ρ∗)≤C⁡{rd⁢(N)+xN+e−2⁢c⁢t}.(2.15)

Equivalently, for C⁢e−c⁢N≤δ≤1/2, the statistical term is C⁡{rd⁢(N)+N−1⁢log⁡(C/δ)} with probability at least 1−δ, after changing the fixed constants.

Combining all-time particle control with convergence of the mean-field flow gives a last-iterate guarantee rather than a time-averaged one.

Corollary 2.5 (Physical-time last iterate).

Under the assumptions of Theorem 2.2, there are constants C,c>0, depending only on the fixed problem data, such that for all t≥0,

E⁢W22⁢(ζN,t,ρ∗)≤C⁡{rd⁢(N)+e−2⁢c⁢t}.(2.16)

Consequently, once t≥(2⁢c)−1⁢log+⁡(1/rd⁢(N)), the error is at the statistical scale O⁢(rd⁢(N)).

The deterministic dynamics has an exact limit at every fixed particle number; the residual discrepancy is precisely an affine shape error.

Proposition 2.6 (Exact finite-particle limit and shape floor).

Let a deterministic full-rank cloud and mean-field initialization satisfy qN,0,q0∈KR for some R>0. There exist CR<∞, λR>0, and an invertible matrix B∞ with B∞⁢B∞⊤=Σ∗ such that, for

ζN,∞=(μ∗+B∞⋅)#ηN,(2.17)

one has

W22⁢(ζN,t,ζN,∞)≤CR⁢e−2⁢λR⁢t,(2.18)
limt→∞W2⁢(ζN,t,ρt)=W2⁢(ζN,∞,ρ∗).(2.19)

Moreover,

λmin⁢(Σ∗)⁢W22⁢(ηN,γd)≤W22⁢(ζN,∞,ρ∗)≤λmax⁢(Σ∗)⁢W22⁢(ηN,γd).(2.20)

The constants CR and λR depend only on R,d,V; the matrix B∞ may depend on the initial cloud and the whitening coordinates, while the law ζN,∞ does not. Thus the moments converge exactly to (μ∗,Σ∗), while every full-rank finite cloud retains a strictly positive full-law error.

This shape floor persists for a fixed non-Gaussian sampling law, even as the number of particles grows.

Corollary 2.7 (Non-Gaussian initialization is not Gaussianized).

On one probability space, let (Xi)i≥1 be an infinite i.i.d. sequence from a non-Gaussian law P0 having a density, positive-definite covariance Σ0, and finite second moment. For each N≥d+1, initialize the particle system with X1,…,XN and define ζN,∞ by Proposition 2.6 on its almost-sure full-rank event. Write

η0=(x↦Σ0−1/2(x−EP0X))#P0.

Put D0=W2⁢(η0,γd)>0. Then, almost surely,

λmin⁢(Σ∗)⁢D02≤lim infN→∞W22⁢(ζN,∞,ρ∗)≤lim supN→∞W22⁢(ζN,∞,ρ∗)≤λmax⁢(Σ∗)⁢D02.(2.21)

In particular, the limiting error is bounded away from zero; if Σ∗=σ∗2⁢I, it converges to σ∗2⁢D02. Thus Gaussianity is a structural consistency condition for a fixed i.i.d. initialization law in Theorems 2.2 and 2.4, not merely a convenient source of concentration. This does not preclude consistent deterministic or N-dependent designs covered by the oracle.

Remark 2.8 (Scope).

The probabilistic theorems concern continuous time, exact evaluation of (2.2), fixed dimension, Gaussian i.i.d. initialization, and the projected system (2.5). The deterministic oracle does allow arbitrary full-rank initialization. These are not dimension-free results or theorems for ordinary SVGD, Euler discretization, or Monte Carlo estimators of m and Γ. Since every centered N-point covariance has rank at most N−1, the restriction N≥d+1 is necessary for this unregularized positive-definite dynamics.

3 Proof overview

This section gives the mechanism behind the results and records where each technical step enters. Complete arguments, including the endpoint and rare event calculations, are developed in Sections 4–7.

In square-root coordinates q=(μ,A), the energy in (2.7) has second variation

D2⁢F⁢(μ,A)⁢[(u,H),(u,H)]=E⁡[(u+H⁢Z)⊤⁢∇2V⁢(μ+A⁢Z)⁢(u+H⁢Z)]+tr⁡(A−1⁢H⁢A−1⁢H),(3.1)

which is at least α⁡(|u|2+‖H‖F2). Its sublevels are compactly contained in Q. The moment flow can be written as q˙=−P(q)∇F(q) with a positive-definite mobility P⁡(q); on each sublevel, P⁡(q)⪰pR⁢I. This yields exponential convergence to q∗. For two trajectories, a Gronwall bound controls the common compact sublevel until both enter a fixed neighborhood of q∗. There the linearization is dissipative in the D2⁢F⁢(q∗)-norm, and patching the two regimes proves the all-time stability estimate. Section 4 and Section 5 give the details.

The particle equation is affine. Its empirical moments solve the same closed ODE, and a fundamental matrix Lt gives

Xi⁢(t)=μ^t+Lt⁢{Xi⁢(0)−μ^0},Σ^t=Lt⁢Σ^0⁢Lt⊤.(3.2)

After whitening the initial cloud, both the empirical law and its moment- matched Gaussian are pushforwards by the same affine map. Consequently,

λmin⁢(Σ^t)⁢W22⁢(ηN,γd)≤W22⁢(ζN,t,N⁡(μ^t,Σ^t))≤λmax⁢(Σ^t)⁢W22⁢(ηN,γd).(3.3)

Combining this with semiglobal moment stability proves the deterministic oracle. Exponential moment convergence also makes the affine coefficient integrable, producing the limit and the two-sided shape floor in Proposition 2.6. These arguments are in Section 6.

For Gaussian initialization, concentration of the sample mean and covariance places the empirical initial state in a deterministic common sublevel, while Gaussian empirical matching controls W2⁢(ηN,γd). This proves the high-probability theorem directly from the oracle. For the expectation, the rare nearly singular event cannot be discarded; energy decrease reduces its contribution to a log-determinant moment. Bartlett’s decomposition gives a sum of log⁡χk2 variables whose second moments remain bounded even when N=d+1. Cauchy–Schwarz then makes the rare-event contribution exponentially small. Section 7 contains the full localization and matching argument.

4 Reverse-KL geometry in square-root coordinates

This section identifies the gradient-flow structure behind the moment ODE. We first compute its Stein mobility and then use square-root coordinates to obtain strong convexity, compact sublevels, and quantitative convergence.

All matrix tangent and cotangent variables below lie in Sym⁡(d), equipped with the Frobenius inner product. The product inner product is

⟨(a,B),(u,H)⟩=a⊤⁢u+tr⁡(B⁢H).

For X∼N⁡(μ,Σ), the exact reverse-KL energy is

E(μ,Σ)=KL(N(μ,Σ)∥π)=EV(X)−12logdetΣ+cπ.(4.1)
Lemma 4.1 (Energy gradient and Stein mobility).

For m and Γ from (2.2),

∇μE=m,∇ΣE=12⁢(Γ−Σ−1).(4.2)

For (a,B)∈Rd×Sym⁡(d), define

[Mμ,Σ⁢(a,B)]μ=2⁢B⁢Σ⁢μ+(1+|μ|2)⁢a,(4.3a)
[Mμ,Σ⁢(a,B)]Σ=Σ⁡(2⁢Σ⁢B+μ⁢a⊤)+(2⁢B⁢Σ+a⁢μ⊤)⁢Σ.(4.3b)

Then

⟨(a,B),Mμ,Σ⁢(a,B)⟩=‖2⁢B⁢Σ+a⁢μ⊤‖F2+|a|2.(4.4)

In particular, Mμ,Σ is symmetric positive definite, and (2.3) is precisely

(μ˙,Σ˙)=−Mμ,Σ∇E(μ,Σ).(4.5)
Proof.

For H∈Sym⁡(d) and all sufficiently small ε, Gaussian differentiation (Price’s identity) gives

Dμ⁢E⁢V⁢(X)⁢[u]=u⊤⁢m,dd⁢ε⁢EN⁡(μ,Σ+ε⁢H)⁢V⁢(X)|ε=0=12⁢tr⁡(Γ⁢H).

The growth needed to differentiate under the integral follows from (2.1); differentiation of the log determinant then proves (4.2).

More generally, direct expansion gives the bilinear identity

⟨(a,B),Mμ,Σ⁢(a′,B′)⟩=⟨2⁢B⁢Σ+a⁢μ⊤,2⁢B′⁢Σ+a′⁢μ⊤⟩F+a⊤⁢a′.(4.6)

The right-hand side is unchanged when the primed and unprimed variables are interchanged, so Mμ,Σ is self-adjoint. Taking the two arguments equal gives

|a|2+|μ|2⁢|a|2+4⁢a⊤⁢B⁢Σ⁢μ+4⁢tr⁡(B⁢Σ2⁢B),

which is (4.4); it vanishes only when a=0 and B=0 because Σ≻0. Substituting a=m and B=(Γ−Σ−1)/2 in −M⁡(a,B) yields (2.3a) and (2.3b). ∎

Recall that q=(μ,A) with A=Σ1/2 and that F is defined by (2.7). Thus E⁡(μ,A2)=F⁡(μ,A)+cπ, so the two energies have identical derivatives in these coordinates.

The next lemma supplies the strong convexity and coercivity used throughout the stability analysis.

Lemma 4.2 (Regularity, strong convexity, and coercivity).

The function F is C2 on Q and, for (u,H)∈Rd×Sym⁡(d),

D2⁢F⁢(μ,A)⁢[(u,H),(u,H)]=E⁡[(u+H⁢Z)⊤⁢∇2V⁢(μ+A⁢Z)⁢(u+H⁢Z)]
+tr⁡(A−1⁢H⁢A−1⁢H)
≥α⁡(|u|2+‖H‖F2).(4.7)

Moreover, F has compact sublevel sets in Q and hence a unique minimizer q∗=(μ∗,A∗).

Proof.

The Hessian bound implies |∇V⁢(x)|≤C+β⁢|x| and |V⁡(x)|≤C⁡(1+|x|2). The first two derivatives of V⁡(μ+A⁢Z) are therefore dominated locally in (μ,A) by integrable polynomials in Z. In particular,

DF(μ,A)[u,H]=E[∇V(μ+AZ)⊤(u+HZ)]−tr(A−1H).

On a compact parameter neighborhood the integrands in the first and second variations are bounded respectively by C⁢(1+|Z|)2 and C⁢(1+|Z|)2. Since ∇2V is bounded and continuous, dominated convergence gives F∈C2 and the displayed second-variation formula. The first term in (4.7) is at least

α⁢E⁢|u+H⁢Z|2=α⁡(|u|2+‖H‖F2),

and the log-determinant term is nonnegative because tr(A−1HA−1H)=‖A−1/2HA−1/2‖F2.

Let xV be the unique minimizer of V and set cV=V⁡(xV). Strong convexity gives, with a1,…,ad the eigenvalues of A,

F⁡(μ,A)≥cV+α2⁢|μ−xV|2+∑j=1d(α2⁢aj2−log⁡aj).(4.8)

The right-hand side diverges if |μ|→∞, if an eigenvalue of A tends to zero, or if ‖A‖op→∞. Thus every sublevel is compactly contained in Q. Existence follows by compactness and uniqueness by (4.7). Under the bijection Σ=A2, this minimizer corresponds to the unique reverse-KL optimal Gaussian ρ∗=N⁡(μ∗,Σ∗), with Σ∗=A∗2. ∎

Let Φ⁡(μ,A)=(μ,A2). Its differential is

Jq⁢(u,H)=(u,A⁢H+H⁢A).(4.9)

The Sylvester map H↦A⁢H+H⁢A is invertible on Sym⁡(d) when A≻0. The chain rule and Lemma 4.1 therefore transform the moment flow into

q˙=f(q)=−P(q)∇F(q),P(q)=Jq−1MΦ⁡(q)Jq−T.(4.10)

Here P is smooth, symmetric, and positive definite. Lemma 4.2 gives ∇F∈C1, and therefore f=−P∇F∈C1(Q). This is the only local ODE regularity used below.

Proposition 4.3 (Sublevel ellipticity and convergence).

For R≥0, recall

KR={q∈Q:F⁡(q)−F⁡(q∗)≤R}.

There are MR,aR,bR>0 such that on KR,

|μ|≤MR,aR⁢I⪯A⪯bR⁢I.(4.11)

For R>0, one may take

P⁡(q)⪰pR⁢I,pR=min⁡(1,4⁢aR4)2⁢(1+MR2)⁢max⁡(1,4⁢bR2)>0.(4.12)

If R>0, every solution of (4.10) starting in KR is global, remains in KR, and satisfies

F⁡(qt)−F⁡(q∗)≤e−2⁢α⁢pR⁢t⁢{F⁡(q0)−F⁡(q∗)},(4.13)
‖qt−q∗‖≤2⁢R/α⁢e−α⁢pR⁢t.(4.14)

For R=0, the only trajectory is qt=q∗, which is global and stationary.

Proof.

For R=0, uniqueness gives K0={q∗}, so all claims follow with the stationary trajectory qt=q∗. Assume henceforth that R>0. The bounds (4.11) follow from Lemma 4.2. To prove (4.12), put s=λmin⁢(Σ) and U=2⁢B⁢Σ. Then

‖U‖F2+|a|2≤2⁢(1+|μ|2)⁢{‖U+a⁢μ⊤‖F2+|a|2},

whereas

‖U‖F2+|a|2≥min⁡(1,4⁢s2)⁢(‖B‖F2+|a|2).

Thus

Mμ,Σ⪰min⁡(1,4⁢s2)2⁢(1+|μ|2)⁢I.

Since s≥aR2 and ‖Jq‖op2≤max⁡(1,4⁢bR2) on KR, the congruence P⁡(q)=Jq−1⁢MΦ⁡(q)⁢Jq−T gives (4.12): indeed, ‖Jq−T⁢z‖≥‖z‖/‖Jq‖op.

Strong convexity and the fact that the segment from q to the interior minimizer q∗ remains in Q imply the Polyak–Lojasiewicz bound

‖∇F⁢(q)‖2≥2⁢α⁢{F⁡(q)−F⁡(q∗)}.(4.15)

Along the flow,

dd⁢t{F(qt)−F(q∗)}=−∇F(qt)⊤P(qt)∇F(qt)≤−2αpR{F(qt)−F(q∗)}.

This proves invariance and (4.13). Strong convexity also gives F⁡(q)−F⁡(q∗)≥(α/2)⁢‖q−q∗‖2, proving (4.14). Finally, a local solution trapped in the compact set KR⋐Q cannot explode or reach the positive-definite boundary, so the standard continuation theorem gives global existence. ∎

5 Semiglobal all-time stability

The next lemma is the deterministic core of the argument. Its constant is uniform in time but is allowed to depend on the initial energy sublevel.

Lemma 5.1 (Semiglobal uniform stability).

For every 0≤R<∞ there is SR<∞ such that any two solutions of (4.10) with q0,q~0∈KR satisfy

supt≥0‖qt−q~t‖≤SR⁢‖q0−q~0‖.(5.1)

If R>0, there also exist TR,DR,κR>0, depending only on R,d,V, such that

‖qt−q~t‖≤DR⁢e−κR⁢(t−TR)⁢‖q0−q~0‖,t≥TR.
Proof.

The argument has two regimes. Sublevel invariance first gives a common compact set and hence an early-time Gronwall bound; exponential energy decay then brings both trajectories into a neighborhood of q∗ where a fixed H∗-norm is contractive. Patching the estimates yields the all-time constant and eventual exponential decay.

The case R=0 is immediate. Suppose R>0 and set

H∗=D2⁢F⁢(q∗),P∗=P⁡(q∗),κ∗=λmin⁢(P∗)⁢λmin⁢(H∗)>0.

Since ∇F⁢(q∗)=0,

D⁢f⁢(q∗)=−P∗⁢H∗.

In the fixed norm ‖v‖H∗2=v⊤⁢H∗⁢v, write cond⁡(H∗)=λmax⁢(H∗)/λmin⁢(H∗). Then

v⊤⁢H∗⁢D⁢f⁢(q∗)⁢v=−(H∗⁢v)⊤⁢P∗⁢(H∗⁢v)≤−κ∗⁢‖v‖H∗2.(5.2)

Continuity of D⁢f gives ϱ>0 such that the convex ellipsoid

U={q:‖q−q∗‖H∗<ϱ}⋐Q

satisfies, for all q∈U and all v,

v⊤⁢H∗⁢D⁢f⁢(q)⁢v≤−κ∗2⁢‖v‖H∗2.(5.3)

Indeed, continuity is used here to control the symmetric part of H∗⁢D⁢f:

sup‖v‖H∗=1|v⊤⁢H∗⁢{D⁢f⁢(q)−D⁢f⁢(q∗)}⁢v|⟶0(q→q∗).

For e=q−q∗, the segment formula and f⁡(q∗)=0 give

f⁡(q)−f⁡(q∗)=∫01D⁢f⁢(q∗+θ⁢e)⁢e⁢dθ.

Consequently, whenever the segment lies in U,

dd⁢t⁢‖qt−q∗‖H∗2=2⁢∫01et⊤⁢H∗⁢D⁢f⁢(q∗+θ⁢et)⁢et⁢dθ≤−κ∗⁢‖et‖H∗2.(5.4)

Since every concentric ellipsoid is convex, the usual first-exit argument applied to (5.4) shows that each closed concentric ellipsoid contained in U is forward invariant.

If qt and q~t lie in the same such ellipsoid, then the segment joining them also lies there and

f⁡(qt)−f⁡(q~t)=∫01D⁢f⁢(q~t+θ⁡(qt−q~t))⁢(qt−q~t)⁢dθ.

Thus

dd⁢t⁢‖qt−q~t‖H∗2≤−κ∗⁢‖qt−q~t‖H∗2.(5.5)

By (4.14), all trajectories starting in KR enter the ellipsoid of radius ϱ/2 no later than

TR=12⁢α⁢pR⁢log+⁡(8⁢λmax⁢(H∗)⁢Rα⁢ϱ2).(5.6)

Before TR, all trajectories remain in the convex compact set

CR={(μ,A):|μ|≤MR,aRI⪯A⪯bRI}⋐Q.

Let ℓR=supq∈CR‖D⁢f⁢(q)‖op<∞, where the operator norm is induced by the Euclidean–Frobenius product norm. The segment between the two trajectories remains in CR, so Gronwall’s inequality gives

‖qt−q~t‖≤eℓR⁢t⁢‖q0−q~0‖,0≤t≤TR.(5.7)

After TR, both trajectories remain in the half-radius ellipsoid. Combining (5.5), norm equivalence, and (5.7) gives

‖qt−q~t‖≤cond⁡(H∗)e−κ∗(t−TR)/2eℓR⁢TR‖q0−q~0‖,t≥TR.

Together with (5.7), this proves (5.1) and the claimed eventual exponential decay. In particular, the construction gives the explicit admissible choice

SR=cond⁡(H∗)⁢eℓR⁢TR.(5.8)

∎

Remark 5.2 (Dependence of the stability constant).

Finiteness of SR requires no global bound on ∇3V: continuity of D2⁢F on the relevant compact parameter sets suffices. A closed-form upper bound for SR, however, requires a quantitative modulus of continuity for ∇2V on those sets. A global bound on ∇3V is one sufficient, but not necessary, condition for such a modulus.

The synchronous coupling μ+A⁢Z and μ~+A~⁢Z gives the useful consequence

W22⁢(N⁡(μ,A2),N⁡(μ~,A~2))≤|μ−μ~|2+‖A−A~‖F2.(5.9)

6 Exact affine decomposition and shape error

We next derive the moment closure and affine representation directly from the particle system. The resulting affine lift separates the evolving moment error from a time-independent discrepancy of the standardized shape.

Lemma 6.1 (Exact closure and affine transport).

If Σ^0≻0, the particle system has a unique global solution. Its empirical moments solve (2.3) from (μ^0,Σ^0) and remain positive definite. If Lt solves

L˙t=Ct⁢Lt,L0=I,(6.1)

then

Xi⁢(t)=μ^t+Lt⁢(Xi⁢(0)−μ^0),(6.2)
Σ^t=Lt⁢Σ^0⁢Lt⊤.(6.3)
Proof.

We first construct the particle solution, thereby avoiding any continuation argument that presupposes positive definiteness of its empirical covariance. Let

qtN=(μtN,AtN),ΣtN=(AtN)2,

be the global solution of (4.10) from (μ^0,Σ^01/2), whose existence follows from Proposition 4.3. Along this trajectory define

mtN=m⁡(μtN,ΣtN),ΓtN=Γ⁡(μtN,ΣtN),CtN=I−ΓtN⁢ΣtN−mtN⁢(μtN)⊤,

and let Lt be the global solution of L˙t=CtN⁢Lt, L0=I. Now set

Xi⁢(t)=μtN+Lt⁢{Xi⁢(0)−μ^0}.(6.4)

Its empirical mean is μtN. Its empirical covariance

Σ~t=Lt⁢Σ^0⁢Lt⊤

solves

Σ~˙t=CtN⁢Σ~t+Σ~t⁢(CtN)⊤,Σ~0=Σ^0.

The covariance equation in (2.3) can equivalently be written

Σ˙tN=CtN⁢ΣtN+ΣtN⁢(CtN)⊤.

Uniqueness for this linear matrix equation therefore gives Σ~t=ΣtN. Likewise, the mean equation is μ˙tN=CtN⁢μtN−mtN. Differentiating (6.4) now verifies

X˙i⁢(t)=CtN⁢Xi⁢(t)−mtN,

so the constructed paths solve (2.5) with their own empirical moments.

For completeness, any local particle solution with positive-definite empirical covariance satisfies, by averaging and centering,

μ^˙=Ct⁢μ^−m^,Σ^˙=Ct⁢Σ^+Σ^⁢Ct⊤.

These are exactly (2.3); uniqueness of the q-flow forces its moments to equal (μtN,ΣtN). Its centered particles then solve the same linear equation Y˙i=CtN⁢Yi with the same initial data, proving uniqueness. Finally,

detLt=exp⁡(∫0ttr⁡CsN⁢ds)≠0

for every finite t, so ΣtN=Lt⁢Σ^0⁢Lt⊤≻0. Since both the global q-flow and its linear lift exist on every finite interval, this proves all claims, with (μtN,ΣtN)=(μ^t,Σ^t). ∎

Henceforth write

qN,t=(μ^t,Σ^t1/2)(6.5)

for this empirical-moment trajectory.

Write the initial particles as

Xi⁢(0)=μ0+Σ01/2⁢ξi,ξi⁢∼iid⁢N⁢(0,Id),(6.6)

and define

ξ¯=1N⁢∑i=1Nξi,S=1N⁢∑i=1N(ξi−ξ¯)⁢(ξi−ξ¯)⊤.(6.7)

For N≥d+1, S≻0 almost surely. Let

zi=S−1/2(ξi−ξ¯),ηN=1N∑i=1Nδzi,γd=N(0,Id).(6.8)

This is precisely (2.9) with the whitening R0=S−1/2Σ0−1/2.

The following estimate relates the standardized shape to an ordinary Gaussian empirical measure without using inverse sample-covariance moments.

Lemma 6.2 (Standardized shape error).

Let N≥d+1, let ξ1,…,ξN be i.i.d. standard Gaussians, and define ξ¯,S,zi,ηN, and γd by (6.7)–(6.8). Then

1N⁢∑i=1N|zi−ξi|2=‖I−S1/2‖F2+|ξ¯|2≤‖I−S‖F2+|ξ¯|2.(6.9)

Moreover, there is Cd<∞, depending only on d, such that

E⁢W22⁢(ηN,γd)≤Cd⁢rd⁢(N).(6.10)
Proof.

Since N−1⁢∑i(ξi−ξ¯)=0, the cross term vanishes in

zi−ξi=(S−1/2−I)(ξi−ξ¯)−ξ¯.

Using the definition of S gives

1N∑i|(S−1/2−I)(ξi−ξ¯)|2=tr{(S−1/2−I)S(S−1/2−I)}=‖I−S1/2‖F2.

The scalar inequality |1−λ|≤|1−λ| for λ≥0 proves (6.9).

Let νN=N−1⁢∑iδξi. Coupling by index and using the squared triangle inequality yields

E⁢W22⁢(ηN,γd)≤2⁢E⁢{‖I−S‖F2+|ξ¯|2}+2⁢E⁢W22⁢(νN,γd).

Because N⁢S is Wishart with N−1 degrees of freedom, the first expectation is explicit:

E⁢|ξ¯|2=dN,E⁢‖S−I‖F2=(N−1)⁢d⁢(d+1)+dN2.(6.11)

For the remaining empirical-matching term, the d=1 estimate is the p=2 Gaussian bound of Bobkov and Ledoux [5, Corollary 6.14]; the d=2 estimate is due to Ledoux [8, Theorem 1]; and for d≥3 the claimed rate follows from Ledoux and Zhu [9, Theorem 1.1, with = p 2 ]:

E⁢W22⁢(νN,γd)≤Cd⁢rd⁢(N).

The finitely many sample sizes excluded by an asymptotic formulation of these estimates are absorbed by enlarging Cd. Since N−1≤Cd⁢rd⁢(N), this proves (6.10). ∎

To transfer the standardized discrepancy through the particle dynamics, we record a two-sided bound for every invertible affine map.

Lemma 6.3 (Two-sided affine lifting).

For any full-rank initial cloud, use the whitening and standardized law in (2.9). Then, for every t≥0,

λmin⁢(Σ^t)⁢W22⁢(ηN,γd)≤W22⁢(ζN,t,N⁡(μ^t,Σ^t))≤λmax⁢(Σ^t)⁢W22⁢(ηN,γd).(6.12)
Proof.

Set Bt=Lt⁢R0−1. Then Bt⁢Bt⊤=Lt⁢Σ^0⁢Lt⊤=Σ^t, and (6.2) gives

ζN,t=(x↦μ^t+Bt⁢x)#⁢ηN.(6.13)

The same affine map pushes γd to N⁡(μ^t,Σ^t). Pushing forward any coupling of ηN and γd multiplies its quadratic cost by at most ‖Bt‖op2=λmax⁢(Σ^t), proving the upper bound. Conversely, pull any coupling of the two image laws back through the invertible affine map and use |Bt⁢u|≥σmin⁢(Bt)⁢|u|. Taking the infimum over image couplings proves the lower bound because σmin⁢(Bt)2=λmin⁢(Σ^t). ∎

Proof of Theorem 2.1.

Lemma 6.1 gives a unique global particle solution and identifies its moments with the q-flow from qN,0. Since both initial moment states lie in KR, Proposition 4.3 and Lemma 5.1 give

supt≥0W22⁢(N⁡(μ^t,Σ^t),ρt)≤SR2⁢‖qN,0−q0‖2,(6.14)

where we used the synchronous Gaussian coupling (5.9). Invariance of KR gives λmax⁢(Σ^t)≤bR2. The upper bound in Lemma 6.3, followed by the squared triangle inequality, now proves (2.10). ∎

Proof of Proposition 2.6.

The proof first uses exponential moment convergence to show that the affine coefficient is integrable. Its fundamental matrix then converges to an invertible limit, which identifies both the limiting empirical law and its two-sided shape floor.

Write

C⁡(q)=I−Γ⁡(μ,A2)⁢A2−m⁡(μ,A2)⁢μ⊤.

The coordinate map Φ has invertible differential. Since q∗ is an interior minimizer, ∇E⁢(μ∗,Σ∗)=0; hence

m⁡(μ∗,Σ∗)=0,Γ⁡(μ∗,Σ∗)=Σ∗−1,C⁡(q∗)=0.(6.15)

The map C is Lipschitz on each KR. For m, this follows by synchronously coupling the Gaussians and using the β-Lipschitzness of ∇V. For Γ, boundedness of ∇2V, Pinsker’s inequality, and the Gaussian KL formula give, for q,q~∈KR,

‖Γ⁡(μ,A2)−Γ⁡(μ~,A~2)‖F≤2⁢d⁢β⁢dTV⁢(N⁡(μ,A2),N⁡(μ~,A~2))≤CR⁢‖q−q~‖.(6.16)

The last inequality holds because the Gaussian KL divergence is bounded by CR⁢‖q−q~‖2 on the compact covariance box containing KR. Set λR=α⁢pR. Proposition 4.3 and (6.15) therefore imply

‖C⁡(qN,t)‖op≤CR⁢e−λR⁢t,∫0∞‖C⁡(qN,t)‖op⁢dt<∞.(6.17)

The fundamental matrix from (6.1) consequently satisfies

supt≥0(‖Lt‖op+‖Lt−1‖op)<∞.

Indeed, this follows by Gronwall for Lt and for dd⁢t⁢Lt−1=−Lt−1⁢C⁢(qN,t). Moreover,

L∞=I+∫0∞C⁡(qN,s)⁢Ls⁢ds

exists, is invertible, and ‖Lt−L∞‖F≤CR⁢e−λR⁢t. Invertibility is explicit from

σmin⁢(L∞)=limt→∞σmin⁢(Lt)≥(supt≥0‖Lt−1‖op)−1>0.

Set Bt=Lt⁢R0−1 and B∞=L∞⁢R0−1. Because qN,0∈KR,

‖R0−1‖op2=λmax⁢(Σ^0)≤bR2,

so ‖Bt−B∞‖F≤CR⁢e−λR⁢t. Passing to the limit in Bt⁢Bt⊤=Σ^t gives B∞⁢B∞⊤=Σ∗. Since the standardized cloud has zero mean and identity covariance, coupling particles by index yields

W22⁢(ζN,t,ζN,∞)≤|μ^t−μ∗|2+1N⁢∑i=1N|(Bt−B∞)⁢zi|2=|μ^t−μ∗|2+‖Bt−B∞‖F2,

which proves (2.18). Metric continuity and ρt→ρ∗ prove (2.19); applying the two-sided lifting argument to B∞ proves (2.20). Finally, ηN is finitely atomic and γd is non-atomic, so their Wasserstein distance is strictly positive. Equivalently, O∞=Σ∗−1/2B∞ is orthogonal: the dynamics optimizes the Gaussian moments but can only rotate, not Gaussianize, the standardized initial shape. If R0′=O⁢R0 is another whitening, with O orthogonal, then ηN′=O#⁢ηN and B∞′=B∞⁢O⊤. Hence the pushforward in (2.17), and therefore the limiting empirical law, is independent of the chosen whitening coordinates. ∎

Proof of Corollary 2.7.

Let PN=N−1⁢∑iδXi⁢(0) and use the principal empirical whitening in (2.9). The empirical Wasserstein law of large numbers gives W2⁢(PN,P0)→0 almost surely; the sample mean and covariance converge almost surely as well. Hence Σ^0−1/2→Σ0−1/2. Coupling corresponding sample points and then applying the fixed limiting affine map shows

W2⁢(ηN,η0)⟶0almost surely.

On the same probability-one event, every N≥d+1 cloud is full rank and its moment state has finite energy, hence belongs to some sublevel KR. The two-sided comparison below is independent of that cloud-dependent sublevel. Explicitly, the squared cost of replacing the empirical centering and whitening by their population values tends to zero by the sample second-moment law of large numbers, while the remaining term is at most ‖Σ0−1/2‖opW2(PN,P0). Taking the lower limit in the lower bound and the upper limit in the upper bound of (2.20) proves (2.21). Here D0>0 because η0=γd would imply that P0 itself is Gaussian. ∎

7 Localization and proof of the main theorem

This section upgrades the deterministic oracle to the expected and high-probability theorems. A fixed well-conditioned event supplies a common energy sublevel, while a log-Wishart estimate controls its rare complement.

Fix ε0=1/4 and define the good event

GN={|ξ¯|≤ε0,‖S−I‖op≤ε0}.(7.1)
Lemma 7.1 (Good-event control).

There are constants Cd,cd>0 such that, for all N≥d+1,

P⁡(GNc)≤Cd⁢e−cd⁢N.(7.2)

There is a deterministic R<∞, depending only on the fixed problem data, such that on GN both q0=(μ0,Σ01/2) and qN,0=(μ^0,Σ^01/2) belong to KR. Furthermore, there is C<∞, depending only on d,μ0,Σ0, such that

E⁡[1GN⁢‖qN,0−q0‖2]≤CN.(7.3)
Proof.

Since N⁢ξ¯∼N⁡(0,Id), the Gaussian mean has an exponential tail at the fixed threshold ε0. Furthermore,

S−I=1N⁢∑i=1N(ξi⁢ξi⊤−I)−ξ¯⁢ξ¯⊤.

Thus

P⁡(‖S−I‖op>ε0)≤P⁡(‖1N⁢∑i=1N(ξi⁢ξi⊤−I)‖op>ε02)
+P⁡(|ξ¯|2>ε0/2).

For each fixed pair of coordinates (j,k), the centered variable ξi⁢j⁢ξi⁢k−δj⁢k has a subexponential norm bounded by a constant independent of i. Scalar Bernstein’s inequality, a union bound over the d2 entries, and fixed-dimensional norm equivalence bound the first probability by Cd⁢e−cd⁢N; a Gaussian tail gives the same bound for the second. Together with the mean event in (7.1), and after enlarging Cd for the finitely many small sample sizes, this proves (7.2).

On GN,

μ^0=μ0+Σ01/2⁢ξ¯,Σ^0=Σ01/2⁢S⁢Σ01/2,

and

(1−ε0)⁢λmin⁢(Σ0)⁢I⪯Σ^0⪯(1+ε0)⁢λmax⁢(Σ0)⁢I.

Thus qN,0 ranges over a fixed compact subset of Q; continuity of F places it, together with q0, in a deterministic sublevel KR.

For positive definite C,D, the identity

C−D=C1/2⁢X+X⁢D1/2,X=C1/2−D1/2,

and the Frobenius pairing give

⟨C−D,X⟩F≥(λmin⁢(C)+λmin⁢(D))⁢‖X‖F2.

Cauchy–Schwarz therefore implies

‖C1/2−D1/2‖F≤‖C−D‖Fλmin⁢(C)+λmin⁢(D).(7.4)

On GN the denominator has a deterministic positive lower bound. Since

|μ^0−μ0|≤‖Σ01/2‖op⁢|ξ¯|,
‖Σ^0−Σ0‖F≤‖Σ0‖op⁢‖S−I‖F,

the square-root bound (7.4) and the exact moments in (6.11) prove (7.3). ∎

Proof of Theorem 2.4.

We intersect concentration events for the empirical measure, mean, and covariance. These events place all empirical initial states in one deterministic sublevel, so the oracle applies with constants independent of N and x.

Let νN=N−1⁢∑iδξi. Matching corresponding atoms shows that the map

(ξ1,…,ξN)⟼W2⁢(νN,γd)

is N−1/2-Lipschitz on Rd⁢N. Gaussian concentration and (E⁢W2)2≤E⁢W22≤Cd⁢rd⁢(N) therefore give

P{W22(νN,γd)>C(rd(N)+xN)}≤e−x,x≥1.(7.5)

Indeed, outside an event of probability e−x, W2⁢(νN,γd)≤E⁢W2⁢(νN,γd)+2⁢x/N, and the squared triangle inequality gives (7.5).

Fixed-dimensional Gaussian concentration for ξ¯ and scalar Bernstein concentration applied to every entry of N−1⁢∑i(ξi⁢ξi⊤−I) imply that, for 1≤x≤c0⁢N, outside an event of probability C⁢e−c⁢x,

|ξ¯|2+‖S−I‖F2≤C⁢1+xN,‖S−I‖op≤12.(7.6)

Here c0>0 is reduced, if needed, so that the second assertion follows from the usual Bernstein scale Cd⁢{x/N+x/N}; indeed, x/N≤c0 throughout the stated range. On the intersection of the good events underlying (7.5) and (7.6), the square-root estimate (7.4) gives

‖qN,0−q0‖2≤C⁢1+xN,W22⁢(ηN,γd)≤C⁡(rd⁢(N)+xN).(7.7)

The second bound follows from the residual identity and coupling the atoms zi with ξi. Moreover, all qN,0 on these events, together with the fixed q0, lie in one deterministic energy sublevel KRhp: the covariance eigenvalues stay in a fixed compact interval, and the sample means stay in a fixed ball because x≤c0⁢N. Here Rhp depends only on the fixed problem data and the chosen c0, not on N or x. Denote this intersection by HN⁢(x); the preceding bounds give P⁡(HN⁢(x)c)≤C⁢e−c⁢x.

The deterministic oracle (2.10), the fact that rd⁢(N)≥N−1, and a union bound prove (2.14). For the last iterate, Proposition 4.3 and the synchronous Gaussian coupling give the deterministic estimate

W22⁢(ρt,ρ∗)≤2⁢{F⁡(q0)−F⁡(q∗)}α⁢e−2⁢α⁢pR¯mf⁢t,R¯mf=1+F⁡(q0)−F⁡(q∗).(7.8)

Combining this with (2.14) by the squared triangle inequality proves (2.15). Finally take x=c−1⁢log⁡(C/δ) and rename the fixed constants to obtain the confidence-level formulation. ∎

On the good event, Lemmas 5.1 and 7.1, together with (5.9), imply

E⁡[1GN⁢supt≥0W22⁢(N⁡(μ^t,Σ^t),ρt)]≤CN.(7.9)

Invariance of KR also gives a deterministic upper bound for suptλmax⁢(Σ^t) on GN. Hence Lemmas 6.2 and 6.3 yield

E⁡[1GN⁢supt≥0W22⁢(ζN,t,N⁡(μ^t,Σ^t))]≤C⁢rd⁢(N).(7.10)

The complement of GN cannot simply be discarded: there the sample covariance can be arbitrarily close to singular. The following lemma is the required weighted tail estimate.

Lemma 7.2 (Weighted control outside the good event).

There are constants C,c>0, depending only on d,V,μ0,Σ0, such that

E⁡[1GNc⁢supt≥0W22⁢(ζN,t,ρt)]≤C⁢e−c⁢N,N≥d+1.(7.11)
Proof.

We first dominate the entire path by the initial energy, reduce that energy to polynomial moments and a log determinant, and then use a uniform log-Wishart second moment with Cauchy–Schwarz on GNc.

For a probability law ν, write M2⁢(ν)=∫|x|2⁢dν⁢(x). The independent coupling through the origin gives

W22⁢(ν,ν~)≤2⁢M2⁢(ν)+2⁢M2⁢(ν~).(7.12)

For the particle cloud,

M2⁢(ζN,t)=|μ^t|2+tr⁡Σ^t=‖qN,t‖2.

Strong convexity of F and energy decrease along the random moment flow give

supt≥0M2⁢(ζN,t)≤C⁡{1+F⁡(qN,0)−F⁡(q∗)}.(7.13)

The upper Hessian bound on V gives

F(qN,0)−F(q∗)≤C{1+|μ^0|2+trΣ^0+(−logdetΣ^0)+}.(7.14)

Indeed, Taylor’s theorem and the upper Hessian bound imply V⁡(x)≤C⁡(1+|x|2), so

E⁢V⁢(μ^0+Σ^01/2⁢Z)≤C⁡{1+|μ^0|2+tr⁡Σ^0};

the entropy term is −12logdetΣ^0, whose positive contribution is exactly one half of (−logdetΣ^0)+. Define

ZN=1+|μ^0|2+trΣ^0+(−logdetΣ^0)+.(7.15)

All log-determinant quantities here and below are evaluated on the almost-sure full-rank event; on its null complement they inherit the fixed extension specified after (2.5).

We next prove

supN≥d+1E⁢ZN2<∞.(7.16)

The polynomial terms have uniform moments of every fixed order: the sample mean is Gaussian with uniformly bounded covariance, while tr⁡Σ^0 is bounded above by a fixed multiple of N−1⁢∑i|ξi|2. For the remaining term, Bartlett’s decomposition [1, Lemma 7.2.1] gives

N⁢S∼Wishartd⁡(N−1,I),det(N⁢S)⁢=d⁢∏j=1dYN−j,Yk∼χk2⁢independently.(7.17)

For s in a neighborhood of zero,

E⁢Yks=2s⁢Γ⁡(k/2+s)Γ⁡(k/2).

Differentiating the cumulant generating function of log⁡Yk at zero gives the digamma and trigamma identities

E⁢log⁡Yk=ψ⁡(k/2)+log⁡2,Var⁡(log⁡Yk)=ψ1⁢(k/2)

and hence the explicit formula

E⁢|log⁡(Yk/k)|2=ψ1⁢(k/2)+{ψ⁡(k/2)+log⁡2−log⁡k}2.

Here ψ1⁢(k/2)≤ψ1⁢(1/2), and the second term is uniformly bounded by the standard digamma asymptotic ψ⁡(x)=log⁡x+O⁡(x−1), together with the finitely many bounded small values of k. Hence

supk≥1E⁢|log⁡(Yk/k)|2<∞.(7.18)

Now

logdetS=∑j=1d{logYN−jN−j+logN−jN}.

For fixed d and N≥d+1, the deterministic logarithms are uniformly bounded. Hence (7.18) and (∑j=1daj)2≤d⁢∑j=1daj2 show that

supN≥d+1E[(−logdetS)+2]<∞.(7.19)

Since detΣ^0=det(Σ0)⁢detS, the asserted uniform second-moment bound (7.16) follows.

Proposition 4.3 gives a deterministic uniform bound on M2⁢(ρt). Combining (7.12)–(7.14) therefore gives the pathwise estimate

supt≥0W22⁢(ζN,t,ρt)≤C⁢ZN.(7.20)

Cauchy–Schwarz, (7.16), and (7.2) now yield

E[1GNcsupt≥0W22(ζN,t,ρt)]≤CP(GNc)1/2(EZN2)1/2≤Ce−cN/2.

Renaming c/2 proves (7.11). ∎

The algebraic endpoint is independent of the dynamics and follows from an affine-span characterization.

Proposition 7.3 (Exact full-rank endpoint).

For any N points in Rd, the centered empirical covariance has rank at most N−1 and is positive definite if and only if the points affinely span Rd. Consequently N≥d+1 is necessary for the unregularized positive-definite dynamics, and it is sufficient almost surely for i.i.d. initialization from any distribution having a density.

Proof.

If Y=[x1−x¯,…,xN−x¯], then Y⁢1N=0 and Σ^=N−1⁢Y⁢Y⊤. Thus rank⁡(Σ^)=rank⁡(Y)≤N−1, and rank d is equivalent to affine spanning. Under a density, affine dependence of any fixed d+1 samples is a Lebesgue-null event. ∎

Remark 7.4 (Logarithmic control at the endpoint).

At N=d+1, the final Bartlett factor in (7.17) has one degree of freedom. The covariance is positive definite almost surely, but E⁢tr⁡(S−1)=∞, whereas E⁡[(log⁡χ12)2]<∞. This is why logarithmic-energy localization reaches the exact algebraic endpoint.

Proof of Theorem 2.2.

On GN, the squared triangle inequality with the intermediate Gaussian N⁡(μ^t,Σ^t), followed by (7.9) and (7.10), gives

E⁡[1GN⁢supt≥0W22⁢(ζN,t,ρt)]≤C⁡{N−1+rd⁢(N)}≤C⁢rd⁢(N).

Lemma 7.2 controls GNc. Since e−c⁢N≤C⁢rd⁢(N) for every fixed d, the two event contributions prove (2.12). Almost-sure positive definiteness at time zero follows from Proposition 7.3; global existence follows from Lemma 6.1 and Proposition 4.3. ∎

Proof of Corollary 2.5.

Apply Proposition 4.3 to the deterministic initial condition. Since q∗ represents ρ∗, (4.14) and (5.9) give

W22⁢(ρt,ρ∗)≤C⁢e−2⁢c⁢t

for a constant c>0. The squared triangle inequality and Theorem 2.2 prove (2.16). The statistical-floor statement follows by balancing the two terms. ∎

8 Why a global Euclidean stability constant is impossible

The stability constant in Lemma 5.1 necessarily depends on an energy sublevel. The next proposition rules out a uniform replacement.

Proposition 8.1 (No global Euclidean Lipschitz constant for the scalar flow).

In dimension d=1, there is a smooth, strongly convex potential with globally bounded Hessian for which no finite S can satisfy

supt≥0|ϕt⁢(r0)−ϕt⁢(r~0)|≤S⁢|r0−r~0|,r0,r~0>0,

where ϕt⁢(r0) is the standard-deviation component of the moment flow started from (μ0,Σ0)=(0,r02).

Proof.

Fix κ>a>0 and k>0, and take

V⁡(x)=κ2⁢x2+ak2⁢cos⁡(k⁢x).(8.1)

Then κ−a≤V′′≤κ+a. The subspace μ=0 is invariant. Writing r=Σ on this subspace gives

m=0,Γ(r)=κ−ae−k2r2/2,r˙=g(r):=r{1−r2Γ(r)}.(8.2)

In fact,

dd⁢r{r2Γ(r)}=2r{κ−ae−k2r2/2}+ak2r3e−k2r2/2>0,

because κ>a. Thus r2⁢Γ⁢(r) is strictly increasing from zero to infinity and has a unique crossing r∗>0 of level one. In particular, g>0 on (0,r∗). Fix rc∈(0,r∗). For r0∈(0,rc), let thit⁢(r0) be the time at which ϕt⁢(r0) first reaches rc, and then freeze time at t0=thit⁢(r0). This time is finite because g is continuous and strictly positive on [r0,rc]. The variational identity for a scalar autonomous flow is

Dr⁢ϕt⁢(r0)=g⁡(ϕt⁢(r0))g⁡(r0).

Moreover, g⁡(r0)=r0⁢(1+o⁡(1)) as r0↓0. Therefore, with t0 fixed while differentiating,

Dr⁢ϕt0⁢(r0)=g⁡(rc)g⁡(r0)∼g⁡(rc)r0⟶∞(r0↓0).(8.3)

Any common Lipschitz constant for all fixed-time maps ϕt would bound the left-hand side of (8.3), a contradiction. If the full moment flow had one initialization-uniform Euclidean Lipschitz constant, its restriction to the invariant subspace μ=0 would have the same property, so the scalar contradiction also rules out that claim. Notice that we have not differentiated the composite ϕthit⁢(r0)⁢(r0)=rc, whose derivative is zero. ∎

This obstruction does not contradict Lemma 5.1: a fixed energy sublevel stays a positive distance away from r=0. It explains why near-singular Wishart samples must be controlled probabilistically through energy rather than by a global derivative bound for the flow.

9 An explicit nonquadratic example

This section verifies the assumptions and identifies the variational optimum for a concrete nonquadratic target. It illustrates that the theorem is not confined to Gaussian potentials.

Example 9.1 (Cosine perturbation of a Gaussian target).

Let

Vε⁢(x)=12⁢x2+ε⁡(1+cos⁡x),0<ε≤0.1.(9.1)

Then 1−ε≤Vε′′⁢(x)≤1+ε, so Theorem 2.2 applies. If s>0 denotes the variance of N⁡(μ,s), then

m(μ,s)=μ−εe−s/2sinμ,Γ(μ,s)=1−εe−s/2cosμ.(9.2)

The moment flow is

μ˙=(1−Γ⁢s)⁢μ−(1+μ2)⁢m,s˙=2⁢s⁢(1−Γ⁢s−μ⁢m).(9.3)

Up to an additive constant, its reverse-KL energy is

Eε(μ,s)=12(μ2+s−logs)+εe−s/2cosμ,(9.4)

and

(μ˙s˙)=−(1+μ22⁢s⁢μ2⁢s⁢μ4⁢s2)∇Eε(μ,s).(9.5)

The mobility determinant is 4⁢s2>0. With a0=e−s/2,

∇2Eε=(1−ε⁢a0⁢cos⁡μ(ε⁢a0/2)⁢sin⁡μ(ε⁢a0/2)⁢sin⁡μ1/(2⁢s2)+(ε⁢a0/4)⁢cos⁡μ).(9.6)

The upper-left entry is at least 1−ε, and its Schur complement is bounded below as follows:

12⁢s2+ε⁢a04⁢cos⁡μ−(ε⁢a0⁢sin⁡μ/2)21−ε⁢a0⁢cos⁡μ(9.7)
≥12⁢s2−εe−s/24−ε2⁢e−s4⁢(1−ε)
≥12⁢s2⁢(1−8⁢e−2⁢ε−2⁢e−2⁢ε21−ε)>0.

Indeed, s2e−s/2≤16e−2 and s2⁢e−s≤4⁢e−2. Hence Eε is strictly convex and coercive, since the perturbation in (9.4) is bounded while μ2+s−log⁡s diverges at every boundary of R×(0,∞). Furthermore,

∂μEε(0,s)=0,∂sEε(0,s)=12(1−1s−εe−s/2).

Let h(s)=s(1−εe−s/2). Then

h′(s)=1−εe−s/2+ε⁢s2e−s/2>1−ε>0,h(0+)=0,h(∞)=∞.

Thus there is a unique s∗>0 with h⁡(s∗)=1. The point (0,s∗) is stationary and, by strict convexity, is the unique minimizer; equivalently,

s∗{1−εe−s∗/2}=1.(9.8)

This gives a fully worked, genuinely nonquadratic target with an explicit scalar characterization of the optimum.

10 Related work and positioning

This section distinguishes the projected exact-moment problem from ordinary SVGD and from time-averaged propagation of chaos. It also identifies the empirical-matching results used only as statistical inputs.

SVGD was introduced by Liu and Wang [11], and its gradient-flow and mean-field viewpoints were developed by Liu [10], Lu et al. [13], and Duncan et al. [6]. Nonasymptotic and finite-particle analyses include Korba et al. [7] and Shi and Mackey [14]. These works concern ordinary SVGD and do not themselves give uniform physical-time W2 stability for the projected system (2.5).

The closest starting point is Liu et al. [12], whose exact-moment closure and affine representation lead to the prior conjecture discussed above. Banerjee et al. [3] prove finite-particle KSD and W2 bounds for ordinary SVGD, including bilinear-plus-Matérn kernels, with long-time statements for time-averaged particle laws. The broad KSD and W1 conclusions of Balasubramanian et al. [2], and their in-probability W2 conclusion, concern time-averaged laws uniformly over deterministic averaging horizons, rather than physical-time last iterates; their finite-feature results have a different scope. Banerjee and Kim [4] obtain physical-time results for unprojected, Langevin-regularized SVGD with Brownian noise, whereas our system is deterministic and uses an exact Gaussian-score projection. Stein and Li [15] analyze generalized bilinear kernels for Gaussian targets. None of these results directly yields the fixed-K1, non-Gaussian, projected full-law theorem here.

The dimension-dependent statistical input comes from Gaussian empirical matching [5, 8, 16, 9]. Our contribution is not a new matching estimate: it shows that the nonlinear all-time dynamics adds no particle-number penalty to the sharp expected time-zero scale.

11 Implications and limitations

The deterministic oracle applies to each fixed full-rank cloud, with constants determined by a sublevel containing both initial moment states. A sequence of deterministic, dependent, or variance-reduced designs inherits a uniform guarantee when it lies in one common sublevel and its moment and standardized-shape errors vanish. Gaussian independence is used only to obtain the sharp expected N-rate and the stated high-probability upper bound.

At fixed N, the affine dynamics converges to a discrete law with moments (μ∗,Σ∗) but preserves standardized shape up to rotation. Thus moment convergence must not be confused with Gaussianization. The nonquadratic target in Section 9 shows that the theory is not limited to Gaussian potentials.

The restrictions are substantive. Constants depend on d,V,μ0,Σ0 and deteriorate near the positive-definite boundary. Section 8 proves, for a smooth scalar potential with bounded Hessian, that the Euclidean standard-deviation flow has no single initialization-uniform Lipschitz constant over (0,∞). This does not exclude other metrics or weighted stability mechanisms. No dimension-free, Euler-discretization, or estimated-moment claim is made. Finally, ρ∗ is the reverse-KL Gaussian approximation, not the non-Gaussian target itself, so approximation bias is separate from particle error.

12 Conclusion

Square-root geometry and affine whitening turn the non-Gaussian projected Gaussian-SVGD problem into a stable moment flow plus a preserved shape term. This yields a deterministic all-time oracle, a sharp expected N-rate, a high-probability upper bound at the corresponding scale, validity at the minimal count N=d+1, and an exact description of the finite-particle limit. The result resolves the strengthened continuous exact-moment conjecture under global strong convexity and a bounded continuous Hessian, without a third-derivative or Hessian-Lipschitz assumption.

References

  • [1] T. W. Anderson. An Introduction to Multivariate Statistical Analysis. Third edition, Wiley-Interscience, Hoboken, NJ, 2003.
  • [2] K. Balasubramanian, S. Banerjee, and A. Korba. Uniform-in-time propagation-of-chaos for Stein variational gradient descent. arXiv:2607.00149, 2026.
  • [3] S. Banerjee, K. Balasubramanian, and P. Ghosal. Improved finite-particle convergence rates for Stein variational gradient descent. In International Conference on Learning Representations, 2025.
  • [4] S. Banerjee and D. Kim. Quantitative target convergence and uniform-in-time propagation of chaos for Langevin-regularized SVGD. arXiv:2608.28827, 2026.
  • [5] S. Bobkov and M. Ledoux. One-dimensional empirical measures, order statistics, and Kantorovich transport distances. Memoirs of the American Mathematical Society, 261(1259), 2019. doi:10.1090/memo/1259.
  • [6] A. Duncan, N. Nüsken, and L. Szpruch. On the geometry of Stein variational gradient descent. Journal of Machine Learning Research, 24(56):1–39, 2023.
  • [7] A. Korba, A. Salim, M. Arbel, G. Luise, and A. Gretton. A non-asymptotic analysis for Stein variational gradient descent. In Advances in Neural Information Processing Systems, volume 33, pages 4672–4682, 2020.
  • [8] M. Ledoux. On optimal matching of Gaussian samples. Journal of Mathematical Sciences, 238(4):495–522, 2019. doi:10.1007/s10958-019-04253-6.
  • [9] M. Ledoux and J.-X. Zhu. On optimal matching of Gaussian samples III. Probability and Mathematical Statistics, 41(2):237–265, 2021. doi:10.37190/0208-4147.41.2.3.
  • [10] Q. Liu. Stein variational gradient descent as gradient flow. In Advances in Neural Information Processing Systems, volume 30, pages 3115–3123, 2017.
  • [11] Q. Liu and D. Wang. Stein variational gradient descent: A general purpose Bayesian inference algorithm. In Advances in Neural Information Processing Systems, volume 29, pages 2378–2386, 2016.
  • [12] T. Liu, P. Ghosal, K. Balasubramanian, and N. S. Pillai. Towards understanding the dynamics of Gaussian–Stein variational gradient descent. In Advances in Neural Information Processing Systems, volume 36, pages 61234–61291, 2023. doi:10.52202/075280-2676; arXiv:2305.14076.
  • [13] J. Lu, Y. Lu, and J. Nolen. Scaling limit of the Stein variational gradient descent: The mean field regime. SIAM Journal on Mathematical Analysis, 51(2):648–671, 2019. doi:10.1137/18M1187611.
  • [14] J. Shi and L. W. Mackey. A finite-particle convergence rate for Stein variational gradient descent. In Advances in Neural Information Processing Systems, volume 36, pages 26831–26844, 2023. doi:10.52202/075280-1166.
  • [15] V. Stein and W. Li. Towards understanding accelerated Stein variational gradient flow: Analysis of generalized bilinear kernels for Gaussian target distributions. arXiv:2509.04008, version 2, 2025.
  • [16] M. Talagrand. Scaling and non-standard matching theorems. Comptes Rendus Mathématique, 356(6):692–695, 2018. doi:10.1016/j.crma.2018.04.018.