相关论文: Least Wasserstein distance between disjoint shapes…

We establish some deviation inequalities, moment bounds and almost sure results for the Wasserstein distance of order p $\in$ [1, $\infty$) between the empirical measure of independent and identically distributed R d-valued random variables…

We establish asymptotic upper and lower bounds for the Wasserstein distance of any order $p\ge 1$ between the empirical measure of a fractional Brownian motion on a flat torus and the uniform Lebesgue measure. Our inequalities reveal an…

For Euclidean space ($\ell_2$), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss, with a host of known applications. Here, we consider the problem of dimension reduction for all $\ell_p$ spaces $1 \le p…

Given a compact metric space (X,d) equipped with a non-atomic, probability measure m and a real, positive decreasing function p we consider a `natural' class of limsup subsets La(p) of X. The classical limsup sets of `well approximable'…

We study existence and structure of solutions to the Dirichlet and Neumann boundary problems associated with minimizers of the functional $I(u)=\int_{\Omega} (\phi(x, D u + F)+Hu) \, dx$, where $\phi (x, \xi)$, among other properties, is…

Recent quasi-optimal error estimates for the finite element approximation of total-variation regularized minimization problems require the existence of a Lipschitz continuous dual solution. We discuss the validity of this condition and…

The transportation $\mathrm{L}^p$ distance, denoted $\mathrm{TL}^p$, has been proposed as a generalisation of Wasserstein $\mathrm{W}^p$ distances motivated by the property that it can be applied directly to colour or multi-channelled…

The discrete Wasserstein barycenter problem is a minimum-cost mass transport problem for a set of probability measures with finite support. In this paper, we show that finding a barycenter of sparse support is hard, even in dimension 2 and…

In this paper we consider the functional \begin{equation*} E_{p,\la}(\Omega):=\int_\Omega \dist^p(x,\pd \Omega )\d x+\la \frac{\H^1(\pd \Omega)}{\H^2(\Omega)}. \end{equation*} Here $p\geq 1$, $\la>0$ are given parameters, the unknown…

In this article we study a variational problem providing a way to extend for all times minimizing geodesics connecting two given probability measures, in the Wasserstein space. This is simply obtained by allowing for negative coefficients…

We prove global convergence in function space for the steepest descent method in shape optimisation with semilinear elliptic partial differential equations. Steepest descent is realized in the Lipschitz topology. In addition, we prove a…

We address the estimation problem for general finite mixture models, with a particular focus on the elliptical mixture models (EMMs). Compared to the widely adopted Kullback-Leibler divergence, we show that the Wasserstein distance provides…

Discrepancy measures between probability distributions, often termed statistical distances, are ubiquitous in probability theory, statistics and machine learning. To combat the curse of dimensionality when estimating these distances from…

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

We prove that for any $2<p<\infty$ and for every $n$-dimensional subspace $X$ of $L_p$, represented on $\mathbb R^n$, whose unit ball $B_X$ is in Lewis' position one has the following two-level Gaussian concentration inequality: \[ \mathbb…

In his classical argument, Rao derives the Riemannian distance corresponding to the Fisher metric using a mapping between the space of positive measures and Euclidean space. He obtains the Hellinger distance on the full space of measures…

Wasserstein distances are widely used in modern data analysis but pose significant computational and statistical challenges in high dimensions. The sliced Wasserstein distance alleviates these challenges by leveraging one-dimensional…

We investigate a dynamic inverse problem using a regularization which implements the so-called Wasserstein-$1$ distance. It naturally extends well-known static problems such as lasso or total variation regularized problems to a (temporally)…

We consider the Monge-Kantorovich problem between two random measuress. More precisely, given probability measures $\mathbb{P}_1,\mathbb{P}_2\in\mathcal{P}(\mathcal{P}(M))$ on the space $\mathcal{P}(M)$ of probability measures on a smooth…

We propose a learning framework for graph kernels, which is theoretically grounded on regularizing optimal transport. This framework provides a novel optimal transport distance metric, namely Regularized Wasserstein (RW) discrepancy, which…