相关论文: How to quantise probabilities while preserving the…
In this paper, for $\mu$ and $\nu$ two probability measures on $\mathbb{R}^d$ with finite moments of order $\rho\ge 1$, we define the respective projections for the $W_\rho$-Wasserstein distance of $\mu$ and $\nu$ on the sets of probability…
Quantization provides a very natural way to preserve the convex order when approximating two ordered probability measures by two finitely supported ones. Indeed, when the convex order dominating original probability measure is compactly…
Let $C$ be an open cone in a Banach space equipped with the Thompson metric with closure a normal cone. The main result gives sufficient conditions for Borel probability measures $\mu,\nu$ on $C$ with finite first moment for which $\mu\leq…
Wasserstein projections in the convex order were first considered in the framework of weak optimal transport, and found application in various problems such as concentration inequalities and martingale optimal transport. In dimension one,…
For probability measures $\mu,\nu$ and $\rho$ define the cost functionals \begin{align*} C(\mu,\rho):=\sup_{\pi\in \Pi(\mu,\rho)} \int \langle x,y\rangle\, \pi(dx,dy),\quad C(\nu,\rho):=\sup_{\pi\in \Pi(\nu,\rho)} \int \langle x,y\rangle\,…
Wiesel and Zhang [2023] established that two probability measures $\mu,\nu$ on $\mathbb{R}^d$ with finite second moments are in convex order (i.e. $\mu \preceq_c \nu$) if and only if $W_2(\nu,\rho)^2-W_2(\mu,\rho)^2 \leq \int |y|^2\nu(dy) -…
The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality…
Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are…
Optimal transport distances are powerful tools to compare probability distributions and have found many applications in machine learning. Yet their algorithmic complexity prevents their direct use on large scale datasets. To overcome this…
A wide array of machine learning problems are formulated as the minimization of the expectation of a convex loss function on some parameter space. Since the probability distribution of the data of interest is usually unknown, it is is often…
We consider approximating distributions within the framework of optimal mass transport and specialize to the problem of clustering data sets. Distances between distributions are measured in the Wasserstein metric. The main problem we…
We show that in any complete metric space the probability measures $\mu$ with compact and connected support are the ones having the property that the optimal tranportation distance to any other probability measure $\nu$ living on the…
Obtaining solutions to Optimal Transportation (OT) problems is typically intractable when the marginal spaces are continuous. Recent research has focused on approximating continuous solutions with discretization methods based on i.i.d.…
The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamics formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE…
Optimal transport (OT) provides powerful tools for comparing probability measures in various types. The Wasserstein distance which arises naturally from the idea of OT is widely used in many machine learning applications. Unfortunately,…
Greedy algorithms which use only function evaluations are applied to convex optimization in a general Banach space $X$. Along with algorithms that use exact evaluations, algorithms with approximate evaluations are treated. A priori upper…
We consider the optimization problem of minimizing a functional defined over a family of probability distributions, where the objective functional is assumed to possess a variational form. Such a distributional optimization problem arises…
We provide rates of convergence in the central limit theorem in terms of projective criteria for adapted stationary sequences of centered random variables taking values in Banach spaces, with finite moment of order $p \in ]2,3]$ as soon as…
Exact approximations of Markov chain Monte Carlo (MCMC) algorithms are a general emerging class of sampling algorithms. One of the main ideas behind exact approximations consists of replacing intractable quantities required to run standard…
Given a $d$-dimensional continuous (resp. discrete) probability distribution $\mu$ and a discrete distribution $\nu$, the semi-discrete (resp. discrete) Optimal Transport (OT) problem asks for computing a minimum-cost plan to transport mass…