Related papers: Sparse approximation of triangular transports. Par…

Given a compactly supported probability measure on a Riemannian manifold, we study the asymptotic speed at which it can be approximated (in Wasserstein distance of any exponent p) by finitely supported measure. This question has been…

We show that any bounded operator $T$ on a separable, reflexive, infinite-dimensional Banach space $X$ admits a rank one perturbation which has an invariant subspace of infinite dimension and codimension. In the non-reflexive spaces, we…

We relate transport-entropy inequalities to the study of critical points of functionals defined on the space of probability measures. This approach leads in particular to a new proof of a result by Otto and Villani [43] showing that the…

Statistical applications often involve the calculation of intractable multidimensional integrals. The Laplace formula is widely used to approximate such integrals. However, in high-dimensional or small sample size problems, the shape of the…

We study Sinkhorn's algorithm for solving the entropically regularized optimal transport problem. Its iterate $\pi_{t}$ is shown to satisfy $H(\pi_{t}|\pi_{*})+H(\pi_{*}|\pi_{t})=O(t^{-1})$ where $H$ denotes relative entropy and $\pi_{*}$…

Bobkov (J. Theoret. Probab. 18(2) (2005) 399-412) investigated an approximate de Finetti representation for probability measures, on product measurable spaces, which are symmetric under permutations of coordinates. One of the main results…

The goal of the paper is to give an optimal transport characterization of sectional curvature lower (and upper) bounds for smooth $n$-dimensional Riemannian manifolds. More generally we characterize, via optimal transport, lower bounds on…

We propose a simple subsampling scheme for fast randomized approximate computation of optimal transport distances. This scheme operates on a random subset of the full data and can use any exact algorithm as a black-box back-end, including…

Optimization-based samplers such as randomize-then-optimize (RTO) [2] provide an efficient and parallellizable approach to solving large-scale Bayesian inverse problems. These methods solve randomly perturbed optimization problems to draw…

Efficient computation of the optimal transport distance between two distributions serves as an algorithm subroutine that empowers various applications. This paper develops a scalable first-order optimization-based method that computes…

We formulate the Riemannian calculus of the probability set embedded with $L^2$-Wasserstein metric. This is an initial work of transport information geometry. Our investigation starts with the probability simplex (probability manifold)…

We consider stochastic optimization problems with possibly nonsmooth integrands posed in Banach spaces and approximate these stochastic programs via a sample-based approaches. We establish the consistency of approximate Clarke stationary…

Let $Q$ be a relatively compact subset in a Hilbert space $V$. For a given $\e>0$ let $N(\e,Q)$ be the minimal number of linear measurements, sufficient to reconstruct any $x \in Q$ with the accuracy $\e$. We call $N(\e,Q)$ a sampling…

We study non-trivial translation-invariant probability measures on the space of entire functions of one complex variable. The existence (and even an abundance) of such measures was proven by Benjamin Weiss. Answering Weiss question, we find…

We introduce an algorithm which, given probabilities $\mu \leq_{\text{cx}} \nu$ in convex order and defined on a separable Banach space $B$, constructs finitely-supported approximations $\mu_n \to \mu, \nu_n\to \nu$ which are in convex…

Assume that $\mathfrak A$ is a real Banach space of finite dimension $n\geq2$. Consider any Borel probability measure $\nu$ supported on the unit ball $K$ of $\mathfrak A$. We show that \[\Delta(\nu)=\int_{x \in K}\int_{ y\in…

In this work we develop an algorithmic procedure for associating a function defined on the Riemann surface of the $\log$ to given asymptotic data from a function at an essential singularity. We do this by means of rational approximations…

We introduce a new non-linear optimal transport formulation for a pair of probability measures on $\mathbb{R}^d$ sharing a common barycentre, in which admissible transference plans satisfy two martingale-type constraints. This bi-martingale…

We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…

We deal with the approximate solution of initial value problems in infinite-dimensional Banach spaces with a Schauder basis. We only allow finite-dimensional algorithms acting in the spaces $\rr^N$, with varying $N$. The error of such…