research39 min studyLesson 766 in Mathematics

Displacement interpolation and Wasserstein geodesics

Build constant-speed distributional paths from optimal couplings and contrast moving particles with mixing endpoint weights.

On this page

What you’ll understand

  • Construct displacement interpolation from an optimal quadratic coupling.
  • Explain the constant-speed identity using upper bounds and the endpoint triangle inequality.
  • Distinguish a Wasserstein geodesic from a linear mixture of probability measures.

Interpolating two probability densities by averaging their heights is simple, but it does not describe where their particles travel. Optimal transport gives a different interpolation: pair origins with destinations optimally, then move each pair along its straight segment. The resulting distribution follows a constant-speed shortest path for quadratic Wasserstein distance. Even a source atom that must split can be handled through a coupling, so this geometric construction is broader than interpolation through a deterministic map.

Move the pairs, then take their distribution

Let μ₀ and μ₁ belong to P₂ of Euclidean space, and choose a coupling π that minimizes squared distance. For each t between zero and one, map a pair (x, y) to (1 − t)x + ty and let ρₜ be its distribution under π. At the endpoints these pushforwards are μ₀ and μ₁. Finite second moments persist along the segment by the squared triangle bound, so the full path remains in P₂.

No density assumption is needed for this plan-based construction. If the optimal coupling is induced by a map T, the expression reduces to pushing μ₀ forward through (1 − t)id + tT. When a source atom splits, however, the joint pair variable is essential: different fractions of that atom follow different segments. The interpolation contains information about which destinations are matched to which origins; knowing just the two endpoint marginals does not specify an arbitrary intermediate distribution.

Ft(x,y)=(1−t)x+ty,ρt=(Ft)#π,π∈argmin⁡γ∈Π(μ0,μ1)∫∣x−y∣2 dγF_t(x,y)=(1-t)x+ty,\qquad \rho_t=(F_t)_\#\pi,\qquad \pi\in\operatorname*{argmin}_{\gamma\in\Pi(\mu_0,\mu_1)}\int|x-y|^2\,d\gamma
The parameter t lies in [0, 1], and both endpoint measures have finite second moments. The same optimal coupling is used throughout the path.↔ Scroll wide equations horizontally.

The endpoint triangle inequality forces constant speed

Using the same paired particles couples ρₛ with ρₜ. Their displacement is (t − s)(y − x), giving W₂(ρₛ, ρₜ) at most |t − s| times the endpoint distance. This is initially only an upper bound: a coupling of the intermediate distributions need not look optimal merely because it came from a convenient parameterization. The optimality conclusion comes from comparing all pieces with the original endpoints.

For 0 ≤ s ≤ t ≤ 1, apply the metric triangle inequality along μ₀, ρₛ, ρₜ, μ₁. The three upper bounds sum to exactly W₂(μ₀, μ₁). Any strict inequality in one piece would make the total smaller than the endpoint distance, which is impossible. Hence every piece attains its bound. This proves that the constructed curve is a constant-speed geodesic; straight segments with an arbitrary nonoptimal endpoint coupling do not receive this certificate.

W2(ρs,ρt)=∣t−s∣ W2(μ0,μ1)(0≤s,t≤1)W_2(\rho_s,\rho_t)=|t-s|\,W_2(\mu_0,\mu_1)\qquad(0\le s,t\le1)
A geodesic travels the endpoint distance proportionally to the parameter difference. Its speed is constant in the Wasserstein metric, not necessarily a common speed for every particle.↔ Scroll wide equations horizontally.

Weight mixing changes a different part of the distribution

The ordinary mixture (1 − t)μ₀ + tμ₁ keeps the endpoint locations and transfers their weights. It is often appropriate for mixture models, but usually differs from displacement interpolation. Between two distinct atoms, displacement interpolation is one moving atom, whereas the mixture contains two stationary atoms with changing masses. Intermediate locations and spreads therefore distinguish the constructions even when their means happen to coincide.

For one-dimensional Gaussians, the increasing affine optimal map interpolates the mean and the standard deviation linearly. Variance is the square of that interpolated standard deviation, not the linear average of endpoint variances. In higher-dimensional Gaussian examples the covariance formula depends on the optimal matrix map and cannot generally be obtained by interpolating matrix entries arbitrarily. This is a useful warning for geometric visualization: a smooth-looking deformation is not automatically a shortest distributional path.

A branching geodesic from one atom

Let μ₀ = δ₀ and μ₁ = (δ₋₁ + δ₁)/2. Find displacement interpolation, its halfway second moment, and compare the halfway linear mixture.

  1. The unique endpoint coupling sends half the source mass to each target. Straight pair interpolation gives ρₜ = (δ₋ₜ + δₜ)/2, and the endpoint squared distance is one.

  2. At t = 1/2 the particles lie at −1/2 and 1/2. The second moment is 1/4, so W₂ from δ₀ is 1/2, exactly half the endpoint distance.

  3. The halfway linear mixture instead has masses 1/2 at zero and 1/4 at each of −1 and 1. Its second moment is 1/2, so its distance from δ₀ is 1/√2. That is larger than 1/2 and therefore violates the required halfway distance for a constant-speed geodesic.

The result

Displacement interpolation moves split particles to ±t; linear mixing retains endpoint locations and is not the same constant-speed path.

Explore the model

Interactive lab

Interactive lab · matrix

A stretch whose first interpolation leg is a geodesic

Pause and Reset, then set both controls: diagonal scale a = 2 and shear b = 0. After four Steps the clock is two seconds and the display blend is 50%; predict width 1.5 and area 1.5 for the moving unit square. On the first four-second leg, the geometry is displacement interpolation from the uniform unit square to its horizontal stretch. The final determinant readout remains 2, and the dashed target remains fixed. The later reversing loop is presentation, not one continuing shortest path.

A stretch whose first interpolation leg is a geodesicThe selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Current readings: Area scale · det A: 1.4; Singular values · σmax, σmin: 1.597, 0.876; Condition number · κ₂(A): 1.823. All parameters are adjustable with the labeled controls below.Matrix A with first row 1.4, 0.6 and second row zero, one; display interpolates between identity and A while final determinant remains 1.4.−4−2024−2−1012x · equal geometric scaleyA = [ 1.4 0.6 ; 0 1 ]Display blend: 0% · final values below
Interpolated geometryOriginal unit squareSelected final transform
Area scale · det A
1.4
Singular values · σmax, σmin
1.597, 0.876
Condition number · κ₂(A)
1.823
t = 0 s

The selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forA convex-gradient stretch yields a Wasserstein geodesic when the geometry is interpreted as a pushed-forward uniform distribution.

Check your understanding

Which halfway measure lies on the displacement geodesic from δ₀ to δ₂?

Try it yourself

Let μ₀ be N(0, 1) and μ₁ be N(2, 9) on the line. Find the optimal map, the displacement-interpolated Gaussian at time t, and its halfway W₂ distance from μ₀.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Interpolate the increasing affine map, then compute the changes in mean and standard deviation rather than interpolating variances.

Compare with the solution

The increasing optimal map is T(x) = 2 + 3x. Interpolation sends x to 2t + (1 + 2t)x, so ρₜ is N(2t, (1 + 2t)²). At time one-half its mean is one and its variance is four. The endpoint squared distance equals the squared mean change plus the squared standard-deviation change, namely 2² + (3 − 1)² = 8. At halfway those changes are both one, giving squared distance two and distance √2, half the endpoint distance 2√2. This uses standard deviations one and three, not variances one and nine.

Take it with you

  • Displacement interpolation pushes one optimal joint allocation along straight paired trajectories.
  • The metric triangle inequality upgrades the natural intermediate coupling bound to exact constant speed.
  • Linear mixtures of weights and geodesic motion of particles usually give different distributions.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.