相关论文: On global stability of optimal rearrangement maps
We introduce a constrained optimal transport problem where origins $x$ can only be transported to destinations $y\geq x$. Our statistical motivation is to describe the sharp upper bound for the variance of the treatment effect $Y-X$ given…
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat…
In this paper, we investigate optimal (partial) transport problems for which the target is a non-convex polygonal domain in \(\mathbb{R}^2\). For the complete optimal transport problem, we prove that the singular set is locally a smooth…
We consider maps $T$ solving the optimal transport problem with a cost $c(x-y)$ modeled on the $p$-cost. For H\"older continuous marginals, we prove a $C^{1,\alpha}$-partial regularity result for $T $in the set $\{|T(x)-x|>0\}$.
Continuity of the value of the martingale optimal transport problem on the real line w.r.t. its marginals was recently established in Backhoff-Veraguas and Pammer [2] and Wiesel [21]. We present a new perspective of this result using the…
In this paper, we establish a global regularity result for the optimal transport problem with the quadratic cost, where the domains may not be convex. This result is obtained by a perturbation argument, using a recent global regularity of…
We prove existence of an optimal transport map in the Monge-Kantorovich problem associated to a cost $c(x,y)$ which is not finite everywhere, but coincides with $|x-y|^2$ if the displacement $y-x$ belongs to a given convex set $C$ and it is…
We face the well-posedness of linear transport Cauchy problems $$\begin{cases}\dfrac{\partial u}{\partial t} + b\cdot\nabla u + c\,u = f&(0,T)\times{\mathbb R}^n\\u(0,\cdot)=u_0\in L^\infty&{\mathbb R}^n\end{cases}$$ under borderline…
In this work, we construct a novel numerical method for solving the multi-marginal optimal transport problems with Coulomb cost. This type of optimal transport problems arises in quantum physics and plays an important role in understanding…
We formulate and solve a class of finite-time transport and mixing problems in the set-oriented framework. The aim is to obtain optimal discrete-time perturbations in nonlinear dynamical systems to transport a specified initial measure on…
Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of…
In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
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 consider an optimal transport problem with backward martingale constraint. The objective function is given by the scalar product of a pseudo-Euclidean space $S$. We show that the supremums over maps and plans coincide, provided that the…
We study a single-period optimal transport problem on $\mathbb{R}^2$ with a covariance-type cost function $c(x,y) = (x_1-y_1)(x_2-y_2)$ and a backward martingale constraint. We show that a transport plan $\gamma$ is optimal if and only if…
This paper focuses on martingale optimal transport problems when the martingales are assumed to have bounded quadratic variation. First, we give a result that characterizes the existence of a probability measure satisfying some convex…
Optimal transport has found numerous applications across data science, many of which require differentiating the optimal transport map with respect to the underlying probability densities in the Fr\'echet sense. In this work, we show that…
We provide a new proof of the known partial regularity result for the optimal transportation map (Brenier map) between two sets. Contrary to the existing regularity theory for the Monge-Amp{\`e}re equation, which is based on the maximum…
We study global optimization of non-convex functions through optimal control theory. Our main result establishes that (quasi-)optimal trajectories of a discounted control problem converge globally and practically asymptotically to the set…