相关论文: Pinsker's inequality for adapted total variation
In this paper we study the Total Variation Flow (TVF) in metric random walk spaces, which unifies into a broad framework the TVF on locally finite weighted connected graphs, the TVF determined by finite Markov chains and some nonlocal…
Multi-marginal optimal transport enables one to compare multiple probability measures, which increasingly finds application in multi-task learning problems. One practical limitation of multi-marginal transport is computational scalability…
We prove results on the decidability and complexity of computing the total variation distance (equivalently, the $L_1$-distance) of hidden Markov models (equivalently, labelled Markov chains). This distance measures the difference between…
We study the stochastic total variation flow (STVF) equation with linear multiplicative noise. By considering a limit of a sequence of regularized stochastic gradient flows with respect to a regularization parameter $\varepsilon$ we obtain…
Wasserstein distance induces a natural Riemannian structure for the probabilities on the Euclidean space. This insight of classical transport theory is fundamental for tremendous applications in various fields of pure and applied…
The question of optimally approximating an arbitrary probability measure in the Wasserstein distance by a discrete one with uniform weights is considered. Estimates are obtained for the optimal approximation distance, with an explicit rate…
The Sliced-Wasserstein distance (SW) is a computationally efficient and theoretically grounded alternative to the Wasserstein distance. Yet, the literature on its statistical properties -- or, more accurately, its generalization properties…
New lower bounds on the total variation distance between the distribution of a sum of independent Bernoulli random variables and the Poisson random variable (with the same mean) are derived via the Chen-Stein method. The new bounds rely on…
Considering two random variables with different laws to which we only have access through finite size iid samples, we address how to reweight the first sample so that its empirical distribution converges towards the true law of the second…
It is well known that the quadratic Wasserstein distance $W_2 (\mathord{\boldsymbol{\cdot}}, \mathord{\boldsymbol{\cdot}})$ is formally equivalent, for infinitesimally small perturbations, to some weighted $H^{-1}$ homogeneous Sobolev norm.…
This paper provides estimates for the convergence rate of the total variation distance in the framework of the Breuer-Major theorem, assuming some smoothness properties of the underlying function. The results are proved by applying new…
It is known in \cite{beccari} that the standard explicit Euler-type scheme (such as the exponential Euler and the linear-implicit Euler schemes) with a uniform timestep, though computationally efficient, may diverge for the stochastic…
The dynamic time warping (dtw) distance fails to satisfy the triangle inequality and the identity of indiscernibles. As a consequence, the dtw-distance is not warping-invariant, which in turn results in peculiarities in data mining…
A representation for the Kantorovich--Rubinstein distance between probability measures on an abstract Wiener space in terms of the extended stochastic integral (or, divergence) operator is obtained.
We develop Wasserstein-based hypothesis tests for empirical-measure convergence in stationary dependent sequences. For a known candidate invariant measure, $\mu$, we study the statistic $T_n=\sqrt{n}\,W_1(\hat\mu_n,\mu)$ and establish…
In this essay, we discuss the notion of optimal transport on geodesic measure spaces and the associated (2-)Wasserstein distance. We then examine displacement convexity of the entropy functional on the space of probability measures. In…
Defining a divergence between the laws of continuous martingales is a delicate task, owing to the fact that these laws tend to be singular to each other. An important idea, put forward by N. Gantert, is to instead consider a scaling limit…
Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system. This invariance is powerful, but discrete GW is a nonconvex quadratic optimal transport…
We derive a deterministic, non-asymptotic upper bound on the Kullback-Leibler (KL) divergence of the flow-matching distribution approximation. In particular, if the $L_2$ flow-matching loss is bounded by $\epsilon^2 > 0$, then the KL…
For a compact K\"{a}hler-Einstein manifold $M$ of dimension $n\ge 2$, we explicitly write the expression $-c_1^n(M)+\frac{2(n+1)}{n}c_2(M)c_1^{n-2}(M)$ in the form of certain integral on the holomorphic sectional curvature and its average…