math.STJun 5, 2026

A Temporal Spatial Minimax Rate for Smoothly-Varying Distributions in Wasserstein Space

Authors: Munsik Kim

Abstract

We study the minimax rate of estimating a future value μtn+hμ_{t_n+h} of a curve tμtt\mapstoμ_t in the 22-Wasserstein space P2(Rd)\mathcal{P}_2(\mathbb{R}^d) from finitely many noisy snapshots of its past, under an adiabatic bound tkvε\|\nabla_t^k v\|\le\varepsilon on the kk-th covariant derivative of the velocity field. Our central result is a unified temporal-spatial minimax lower bound: over regular, locally transport-rich subclasses, every estimator incurs W2W_2-risk with MM-exponent γd(k+1)/(k+1+γd)γ_d(k+1)/(k+1+γ_d), γd=min(1/d,1/2)γ_d=\min(1/d,1/2) (MM the total sample size). It follows from a temporal-to-spatial reduction: the smoothness budget defines a reachable W2W_2-ball into which a transport packing is embedded along the time axis, and the information of the entire snapshot experiment is controlled by a Fano argument -- the spatial packing is classical, but its smoothness-admissible temporal embedding and the full-window analysis are new. The bound interpolates a dimension-free extrapolation floor of order εhk+1\varepsilon h^{k+1} -- the irreducible cost of an unobserved future, present even with the exact past -- and the spatial estimation curse MγdM^{-γ_d}, recovering the static distribution-estimation rate as kk\to\infty. We state the lower bound in a design-dependent form -- with a design-weighted effective sample size -- valid for arbitrary observation times, and obtain the closed-form exponent in the dense (equispaced) regime. The matching upper bound is established at k=0k=0 (rate M1/(d+1)M^{-1/(d+1)}, d3d\ge3) and, in a translation submodel, for all kk; for k1k\ge1 a covariant estimator attains the rate conditionally on two estimates (a comparison-geometry bias bound and an optimal-transport map-estimation rate), leaving the unconditional general-kk upper bound as an open problem. Numerical experiments on synthetic curved and flat families corroborate the predicted exponents.

Explore similar work

May 19, 2026stat.ML

Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation

Squared Wasserstein distance is a frequently used tool to measure discrepancy between probability distributions. This distance is typically computed between empirical measures of size nn from two underlying random samples. Unfortunately, even in lower dimensional Euclidean space problems (d{2,3})\left( d \in \{2,3\} \right), algorithms for Wasserstein distance computation with approximate or exact precision guarantees scale poorly in the runtime as a function of nn and the desired precision. In response, we consider the computational-statistical runtime, where the goal is to estimate from samples the Wasserstein distance between potentially smooth measures up to εε-additive error in expectation with respect to the sampling; we allow O(1)O(1) computational cost for collecting a sample. Towards this, we develop a Sample-Sketch-Solve paradigm where we introduce a regular cartesian grid sketch of the samples. We show that (especially under αα-Hölder smooth distributions) this can compress the data without increasing asymptotic error, and also regularizes the structure which enables faster exact algorithms. Ultimately, we approximate W22(P,Q)W_2^2(P,Q) within εε error in εmax(2,d+1+o(1)1+α)ε^{-\max(2,\frac{d+1+o(1)}{1+α})} time for 0<α<10 < α< 1 Hölder smooth distributions P,QP,Q on (0,1)d(0,1)^{d}; an optimal Θ(ε2)Θ(ε^{-2}) for α>1/2α> 1/2 when d=2d=2 and nearly optimal as α1α\to 1 when d=3d = 3.
Peter Matthew Jacobs, Jeff M. Phillips
Apr 20, 2026cs.LG

Wasserstein Distributionally Robust Risk-Sensitive Estimation via Conditional Value-at-Risk

We propose a distributionally robust approach to risk-sensitive estimation of an unknown signal x from an observed signal y. The observation and unknown signal are modeled as random vectors whose joint probability distribution is unknown, but assumed to belong to a given type-2 Wasserstein ball of distributions, termed the ambiguity set. The performance of an estimator is measured according to the conditional value-at-risk (CVaR) of the squared estimation error. Within this framework, we study the problem of computing affine estimators that minimize the worst-case CVaR over all distributions in the given ambiguity set. As our main result, we show that, when the nominal distribution at the center of the Wasserstein ball is finitely supported, such estimators can be exactly computed by solving a tractable semidefinite program. We evaluate the proposed estimators on a wholesale electricity price forecasting task using real market data and show that they deliver lower out-of-sample CVaR of squared error compared to existing methods.
Feras Al Taha, Eilyan Bitar
Jul 27, 2026stat.ML

Minimax Lower Bounds of Kernel Discrepancy Estimation: MMD, HSIC, KSD

Over the past 20 years, kernel discrepancies have been leveraged as a highly powerful tool for quantifying the disagreement of distributions, with numerous successful applications in two-sample, goodness-of-fit, and independence testing, among others. Their fastest estimators are known to converge at a parametric rate---n1/2n^{-1/2}---under mild conditions. While this rate is known to be minimax optimal on Rd\mathbb R^d under strict assumptions with bounded kernels, little is known about its optimality beyond the finite-dimensional Euclidean setting with unbounded kernels. In this work, we prove that the minimax lower bound of estimation of the most popular kernel discrepancies (maximum mean discrepancy, Hilbert-Schmidt independence criterion and kernel Stein discrepancy; MMD, HSIC, KSD) is n1/2n^{-1/2} on general topological spaces, and under mild assumptions on the kernel; the same rates are shown (as corollaries) to hold for the estimation of the mean embedding and the centered cross-covariance operator. Our results settle the question of optimal estimation of these kernel discrepancies.
Jose Cribeiro-Ramallo, Florian Kalinke, Zoltán Szabó