Related papers: Weak Optimal Entropy Transport Problems
We obtain a dual representation of the Kantorovich functional defined for functions on the Skorokhod space using quotient sets. Our representation takes the form of a Choquet capacity generated by martingale measures satisfying additional…
We consider the multiple quantile hedging problem, which is a class of partial hedging problems containing as special examples the quantile hedging problem (F{\"o}llmer \& Leukert 1999) and the PnL matching problem (introduced in Bouchard…
We study the entropic regularizations of optimal transport problems under suitable summability assumptions on the point-wise transport cost. These summability assumptions already appear in the literature. However, we show that the weakest…
We develop a mathematical theory of entropic regularisation of unbalanced optimal transport problems. Focusing on static formulation and relying on the formalism developed for the unregularised case, we show that unbalanced optimal…
The optimal transport problem has recently developed into a powerful framework for various applications in estimation and control. Many of the recent advances in the theory and application of optimal transport are based on regularizing the…
We introduce and study a multi-marginal optimal partial transport problem. Under a natural and sharp condition on the dominating marginals, we establish uniqueness of the optimal plan. Our strategy of proof establishes and exploits a…
This note exposes the differential topology and geometry underlying some of the basic phenomena of optimal transportation. It surveys basic questions concerning Monge maps and Kantorovich measures: existence and regularity of the former,…
Replacing positivity constraints by an entropy barrier is popular to approximate solutions of linear programs. In the special case of the optimal transport problem, this technique dates back to the early work of Schr\"odinger. This approach…
This paper presents a widely applicable approach to solving (multi-marginal, martingale) optimal transport and related problems via neural networks. The core idea is to penalize the optimization problem in its dual formulation and reduce it…
We study the potential functions that determine the optimal density for $\varepsilon$-entropically regularized optimal transport, the so-called Schr\"odinger potentials, and their convergence to the counterparts in classical optimal…
This paper investigates the optimal transport problem within the framework of Linear Quadratic optimal control systems. We establish the well-posedness of the Monge problem and analyze the regularity of the resulting optimal transport map,…
We study an optimal transport problem with a backward martingale constraint in a pseudo-Euclidean space $S$. We show that the dual problem consists in the minimization of the expected values of the Fitzpatrick functions associated with…
In this paper we study two basic facts of optimal transportation on Wiener space W. Our first aim is to answer to the Monge Problem on the Wiener space endowed with the Sobolev type norm (k,gamma) to the power of p (cases p = 1 and p > 1…
We study the optimal transport between two probability measures on the real line, where the transport plans are laws of one-step martingales. A quasi-sure formulation of the dual problem is introduced and shown to yield a complete duality…
We present a simple proof of the entropy-power inequality using an optimal transportation argument which takes the form of a simple change of variables. The same argument yields a reverse inequality involving a conditional differential…
A fundamental concept in optimal transport is c-cyclical monotonicity: it allows to link the optimality of transport plans to the geometry of their support sets. Recently, related concepts have been successfully applied in the…
We introduce an extension of the Optimal Transport problem when multiple costs are involved. Considering each cost as an agent, we aim to share equally between agents the work of transporting one distribution to another. To do so, we…
Optimal Transport (OT) theory has seen an increasing amount of attention from the computer science community due to its potency and relevance in modeling and machine learning. It introduces means that serve as powerful ways to compare…
The Skorokhod embedding problem aims to represent a given probability measure on the real line as the distribution of Brownian motion stopped at a chosen stopping time. In this paper, we consider an extension of the optimal Skorokhod…
We study an optimal weak transport cost related to the notion of convex order between probability measures. On the real line, we show that this weak transport cost is reached for a coupling that does not depend on the underlying cost…