Cumulative Wasserstein Drift

• Cumulative Wasserstein drift is the sum of Wasserstein distances between successive probability measures, quantifying total distributional change over time.
• It underpins finite-sample guarantees, dynamic regret bounds, and concentration inequalities in stochastic processes and online optimization.
• Optimal weighting schemes leveraging cumulative drift balance bias and variance, guiding parameter choices in nonstationary and robust methods.

Cumulative Wasserstein drift quantifies the total “distance” traversed by a time-evolving sequence of probability measures, typically under the Wasserstein metric, over a given time horizon. It is a central nonstationarity measure in stochastic processes, online optimization, Markov dynamics, and empirical process theory, capturing both instantaneous and aggregated changes in distributions. Rigorous frameworks for cumulative Wasserstein drift underpin concentration inequalities, dynamic regret bounds, convergence rates for flows in the space of measures, and finite-sample guarantees in distributionally robust optimization.

1. Definition and Foundational Concepts

Let $\{P_t\}_{t=1}^T$ be a sequence of probability measures on a Polish space $\Xi$. The $p$-Wasserstein distance between $P_t$ and $P_{t+1}$ at each time $t$ is given by

$\Delta_t := W_p(P_t, P_{t+1})$

The unweighted cumulative Wasserstein drift over $T$ periods is

$D_T := \sum_{t=1}^{T-1} \Delta_t$

This sum captures the total geometric “movement” of the underlying data-generating law as measured in the Wasserstein space. In settings with weighted empirical estimators or time-decayed observations, the natural generalization is the $L_p$-norm-type drift: $\Xi$0 where $\Xi$1 is a vector of nonnegative weights, and $\Xi$2 is a uniform bound on $\Xi$3 (Keehan et al., 21 Oct 2025).

2. Weighted Empirical Measures and Effective Sample Size

In nonstationary environments, weighted empirical measures are used to balance effective sample size against the impact of distributional drift: $\Xi$4 with $\Xi$5. A key metric is the effective sample size

$\Xi$6

which quantifies the statistical reliability of $\Xi$7 under the weighting scheme $\Xi$8. The interplay between $\Xi$9 and $p$0 is critical for controlling estimation error and variance in time-evolving data (Keehan et al., 21 Oct 2025).

3. Finite-Sample Concentration and Nonstationary Robustness

A central technical result is a concentration inequality for Wasserstein distances in the nonstationary, weighted setting: $p$1 where $p$2 and $p$3 depend on the geometry of $p$4 and $p$5 (Keehan et al., 21 Oct 2025). For sufficiently large $p$6,

$p$7

This quantifies deviations of the empirical process in the presence of cumulative nonstationary drift, explicitly balancing sample variance and drift-induced bias.

4. Optimal Weighting: Variance–Drift Tradeoff

Optimal weights $p$8 simultaneously control bias due to drift and estimation variance, solving

$p$9

The unique structure of the solution is

$P_t$0

with scalars $P_t$1 determined by simplex constraints. As $P_t$2 grows, the optimal scheme exhibits sharper cutoff of past (older) data, reducing to pure sliding-window or exponential-decay weighting depending on parameter choices. Explicit calibrations,

$P_t$3

arise for windowing and exponential smoothing in the $P_t$4 case, providing optimal parameter choices in terms of desired accuracy $P_t$5, drift bound $P_t$6, and Wasserstein order $P_t$7 (Keehan et al., 21 Oct 2025).

5. Cumulative Drift in Dynamic Optimization and Learning

In online convex optimization where objective distributions $P_t$8 evolve, the cumulative Wasserstein drift $P_t$9 enters directly into dynamic regret bounds: $P_{t+1}$0 and the sequence of minimizers $P_{t+1}$1 satisfies

$P_{t+1}$2

The corresponding dynamic regret is lower-bounded by an $P_{t+1}$3 term—cumulative drift sets the intrinsic limit on performance in adapting to distributional changes, with all other regret contributions (noise, initialization) being controllable via algorithmic parameters (Shames et al., 2020).

6. Wasserstein Drift in PDEs, Stochastic Flows, and Markov Chains

The notion of cumulative Wasserstein drift generalizes to continuous-time measure-valued flows:

• For gradient flows in $P_{t+1}$4,

$P_{t+1}$5

where $P_{t+1}$6 is the instantaneous velocity field from the continuity equation. The total path-length controls convergence rates and is uniformly bounded in terms of the initial suboptimality of the functional $P_{t+1}$7 (Chizat et al., 16 Jul 2025).

• In measure-valued SPDEs and diffusions, the time integral of instantaneous drift or squared gradient quantifies both cumulative displacement in Wasserstein space and the action or Fisher information over time (Delarue et al., 2024).
• In discrete-time Markov chains, geometric contractivity plus one-step non-contractive “drift” yields cumulative bounds:

$P_{t+1}$8

where $P_{t+1}$9 is the per-step drift and $t$0 is the contraction rate. The second term encodes the aggregated perturbation—the “cumulative drift” of the Markov process (Madras et al., 2011).

7. Applications and Broader Significance

Cumulative Wasserstein drift is a central concept in:

• Design and analysis of distributionally robust methods under nonstationarity, providing the basis for weighted empirical ambiguity sets and finite-sample risk guarantees (Keehan et al., 21 Oct 2025).
• Online and adaptive algorithms, where $t$1 quantifies the inevitable penalty from time-varying environments (Shames et al., 2020).
• Empirical process concentration, governing the balance between effective sample use and tracking distributional shifts (Keehan et al., 21 Oct 2025).
• Evolution and regularity analysis in nonlinear PDEs, mean-field diffusions, and interacting particle systems, where path-length or total drift controls long-time behavior, ergodicity, and rates of mixing (Chizat et al., 16 Jul 2025, Delarue et al., 2024, Hwang et al., 2021).
• Markov chain convergence diagnostics and quantitative ergodic bounds (Madras et al., 2011).

These frameworks provide precise nonasymptotic characterizations, parameter choices for weighting schemes, and convergence rates that systematically account for nonstationarity and time-varying complexity in modern stochastic systems.