Related papers: On semi-discrete sub-partitions of vector-valued m…
The time-discretized, spatially continuous generalized Euler equations are a prototype example of multi-marginal optimal transport, yet the question whether they exhibit mass-splitting (or equivalently, whether they have solutions that are…
A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were…
This paper shows that the semi-dual formulation of the optimal transport problem has a degenerate saddle-point structure, and that its numerical solution is equivalent to solving a constrained optimization problem. We derive necessary and…
We consider a pointwise tracking optimal control problem for a semilinear elliptic partial differential equation. We derive the existence of optimal solutions and analyze first and, necessary and sufficient, second order optimality…
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…
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…
In this work, some counterexamples are given to refute some results reported in the paper by Guo and Li [8] (J Optim Theory Appl 162,(2014), 821-844). We correct the faulty in some of their theorems and we present alternative proofs.…
In this paper, we study optimal transportation problems for multifractal random measures. Since these measures are much less regular than optimal transportation theory requires, we introduce a new notion of transportation which is…
We prove the optimal regularity for some class of vector-valued variational inequalities with gradient constraints. We also give a new proof for the optimal regularity of some scalar variational inequalities with gradient constraints. In…
Sliced optimal transport reduces optimal transport on multi-dimensional domains to transport on the line. More precisely, sliced optimal transport is the concatenation of the well-known Radon transform and the cumulative density transform,…
This paper is devoted to variational problems on the set of probability measures which involve optimal transport between unequal dimensional spaces. In particular, we study the minimization of a functional consisting of the sum of a term…
We consider the problem of estimating the optimal transport map between two probability distributions, $P$ and $Q$ in $\mathbb R^d$, on the basis of i.i.d. samples. All existing statistical analyses of this problem require the assumption…
We study the implicit bias of AdaGrad on separable linear classification problems. We show that AdaGrad converges to a direction that can be characterized as the solution of a quadratic optimization problem with the same feasible set as the…
We study the computational complexity of the optimal transport problem that evaluates the Wasserstein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in…
We propose two deep neural network-based methods for solving semi-martingale optimal transport problems. The first method is based on a relaxation/penalization of the terminal constraint, and is solved using deep neural networks. The second…
We present a primal--dual memory efficient algorithm for solving a relaxed version of the general transportation problem. Our approach approximates the original cost function with a differentiable one that is solved as a sequence of…
In this paper we are interested in the numerical solution of stochastic differential equations with non negative solutions. Our goal is to construct explicit numerical schemes that preserve positivity, even for super linear stochastic…
In this short note, we consider the problem of prescribing the Gauss curvature and image of the Gauss map for the graph of a function over a domain in Euclidean space. The prescription of the image of the Gauss map turns this into a second…
We discuss the semiclassical approximation to transport problems in quantum chaotic systems. The figures of merit are moments of the transmission matrix and of the time delay matrix. After reviewing a few results obtained by treating these…
This article studies problems of optimal transport, by embedding them in a general functional analytic framework of convex optimization. This provides a unified treatment of a large class of related problems in probability theory and allows…