Related papers: Uniform large-scale $\varepsilon$-regularity for e…
Weak optimal transport generalizes the classical theory of optimal transportation to nonlinear cost functions and covers a range of problems that lie beyond the traditional theory - including entropic transport, martingale transport, and…
We study an optimization problem related to the approximation of given data by a linear combination of transformed modes. In the simplest case, the optimization problem reduces to a minimization problem well-studied in the context of proper…
We obtain an explicit solution for the static Kullback--Leibler (KL) unbalanced optimal transport problem between finite non-degenerate Gaussian measures with quadratic cost, two independent positive marginal relaxation parameters, and no…
We study optimal transport for stationary stochastic processes taking values in finite spaces. In order to reflect the stationarity of the underlying processes, we restrict attention to stationary couplings, also known as joinings. The…
Optimal Transport is a useful metric to compare probability distributions and to compute a pairing given a ground cost. Its entropic regularization variant (eOT) is crucial to have fast algorithms and reflect fuzzy/noisy matchings. This…
Classical optimal transport problem seeks a transportation map that preserves the total mass betwenn two probability distributions, requiring their mass to be the same. This may be too restrictive in certain applications such as color or…
The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently gained popularity in machine learning and statistics, as it makes feasible the use of smoothed optimal transportation distances for data…
We consider weak optimal problems (possibly entropically penalized) incorporating both soft and hard (including the case of the martingale condition) moment constraints. Even in the special case of the martingale optimal transport problem,…
The optimal transport map between the standard Gaussian measure and an $\alpha$-strongly log-concave probability measure is $\alpha^{-1/2}$-Lipschitz, as first observed in a celebrated theorem of Caffarelli. In this paper, we apply two…
Optimal transportation distances are a fundamental family of parameterized distances for histograms. Despite their appealing theoretical properties, excellent performance in retrieval tasks and intuitive formulation, their computation…
In this paper we consider the Benamou-Brenier formulation of optimal transport for nonlinear control affine systems on $\Rd$, removing the compactness assumption of the underlying manifold in previous work by the author. By using Bernard's…
Sharp lower and upper uniform estimates are obtained for fundamental frequencies of $p$-Laplace type operators generated by quadratic forms. Optimal constants are exhibited, rigidity of the upper estimate is proved, anisotropic…
Fix a pair of smooth source and target densities $\rho$ and $\rho^*$ of equal mass, supported on bounded domains $\Omega, \Omega^* \subset \mathbb{R}^n$. Also fix a cost function $c_0 \in C^{4,\alpha}(\overline{\Omega} \times…
We consider the optimal transportation problem on a globally hyperbolic spacetime for some cost function $c_2$, which corresponds to the optimal transportation problem on a complete Riemannian manifold where the cost function is the…
The modeling of phenomenological structure is a crucial aspect in inverse imaging problems. One emerging modeling tool in computational imaging is the optimal transport framework. Its ability to model geometric displacements across an…
Variational problems that involve Wasserstein distances and more generally optimal transport (OT) theory are playing an increasingly important role in data sciences. Such problems can be used to form an examplar measure out of various…
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…
In this paper, we introduce weak optimal entropy transport problems that cover both optimal entropy transport problems and weak optimal transport problems introduced by Liero, Mielke, and Savar\'{e} [27]; and Gozlan, Roberto, Samson and…
In this series of lectures we introduce the Monge-Kantorovich problem of optimally transporting one distribution of mass onto another, where optimality is measured against a cost function c(x,y). Connections to geometry, inequalities, and…
We present a numerical method to solve the optimal transport problem with a quadratic cost when the source and target measures are periodic probability densities. This method is based on a numerical resolution of the corresponding…