在流形分布演化中,预测未来分布的最优误差有时间-空间双重限制。
A Temporal Spatial Minimax Rate for Smoothly-Varying Distributions in Wasserstein Space

- 通过平滑性约束将时间推演转化为空间打包,构建统一下界
- 最小风险率受样本量与维度共同影响,体现时间外推和空间估计的权衡
- 适用于动态分布建模、统计学习中的长期预测研究
我们研究在 $2$-Wasserstein 空间 $\\(mathcal{P}_2(\\(\mathbb{R}^d)$$ 中,从有限个过去带噪声的快照出发,估计未来值 $μ_{t_n+h}$ 的极小极大速率,受限于速度场第 $k$ 阶协变导数的绝热约束 $\\(\| abla_t^k v\\(\| less \varepsilon$。核心结果为统一的时间-空间极小极大下界:在正则且局部运输丰富的子类上,任意估计器的 $W_2$ 风险具有 $M$-指数 $γ_d(k+1)/(k+1+γ_d)$,其中 $M$ 为总样本量,$γ_d = \min(1/d, 1/2)$。该下界源于时间到空间的归约:平滑性预算定义了一个可达的 $W_2$ 球,沿时间轴嵌入运输打包,全窗口信息由 Fano 不等式控制——空间打包经典,但其平滑可容许的时间嵌入与全窗分析为新贡献。该下界介于无观测未来的不可约代价 $ε h^{k+1}$(维度无关)与空间估计诅咒 $M^{-γ_d}$ 之间,当 $k\to\infty$ 时恢复静态分布估计率。下界以设计相关形式给出,包含设计加权有效样本量,适用于任意观测时间;在密集(等距)情形下获得闭式指数。上界在 $k=0$ 时($d\ge3$ 时速率为 $M^{-1/(d+1)}$)及平移子模型中对所有 $k$ 成立;对 $k\ge1$,协变估计器在已知两个估计(比较几何偏差界与最优传输映射估计率)条件下达到该速率,一般 $k$ 的无条件上界仍为开放问题。合成曲线与平坦族的数值实验验证了预测指数。
原文摘要 · Abstract (English)
We study the minimax rate of estimating a future value $μ_{t_n+h}$ of a curve $t\mapstoμ_t$ in the $2$-Wasserstein space $\mathcal{P}_2(\mathbb{R}^d)$ from finitely many noisy snapshots of its past, under an adiabatic bound $\|\nabla_t^k v\|\le\varepsilon$ on the $k$-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 $W_2$-risk with $M$-exponent $γ_d(k+1)/(k+1+γ_d)$, $γ_d=\min(1/d,1/2)$ ($M$ the total sample size). It follows from a temporal-to-spatial reduction: the smoothness budget defines a reachable $W_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 $\varepsilon h^{k+1}$ -- the irreducible cost of an unobserved future, present even with the exact past -- and the spatial estimation curse $M^{-γ_d}$, recovering the static distribution-estimation rate as $k\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=0$ (rate $M^{-1/(d+1)}$, $d\ge3$) and, in a translation submodel, for all $k$; for $k\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-$k$ upper bound as an open problem. Numerical experiments on synthetic curved and flat families corroborate the predicted exponents.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。