Related papers: Optimal Transport and Skorokhod Embedding
Sinkhorn algorithm is the de-facto standard approximation algorithm for optimal transport, which has been applied to a variety of applications, including image processing and natural language processing. In theory, the proof of its…
The Gromov--Wasserstein problem is a non-convex optimization problem over the polytope of transportation plans between two probability measures supported on two spaces, each equipped with a cost function evaluating similarities between…
We provide a complete characterisation of the Root solution to the Skorokhod embedding problem (SEP) by means of an optimal stopping formulation. Our methods are purely probabilistic and the analysis relies on a tailored time-reversal…
Constructions of numerous approximate sampling algorithms are based on the well-known fact that certain Gibbs measures are stationary distributions of ergodic stochastic differential equations (SDEs) driven by the Brownian motion. However,…
Entropy-regularized optimal transport, which has strong links to the Schr\"odinger bridge problem in statistical mechanics, enjoys a variety of applications from trajectory inference to generative modeling. A major driver of renewed…
In this paper, we will present a strong (or pathwise) approximation of standard Brownian motion by a class of orthogonal polynomials. The coefficients that are obtained from the expansion of Brownian motion in this polynomial basis are…
Suppose $X$ is a time-homogeneous diffusion on an interval $I^X \subseteq \mathbb R$ and let $\mu$ be a probability measure on $I^X$. Then $\tau$ is a solution of the Skorokhod embedding problem (SEP) for $\mu$ in $X$ if $\tau$ is a…
Surprisingly the looking natural random walk leading to Brownian motion occurs to be often biased in a very subtle way: usually refers to only approximate fulfillment of thermodynamical principles like maximizing uncertainty. Recently, a…
We give a statistical interpretation of entropic optimal transport by showing that performing maximum-likelihood estimation for Gaussian deconvolution corresponds to calculating a projection with respect to the entropic optimal transport…
We consider an optimal transport problem on the unit simplex whose solutions are given by gradients of exponentially concave functions and prove two main results. First, we show that the optimal transport is the large deviation limit of a…
Let the process Y(t) be a Skorohod integral process with respect to Brownian motion. We use a recent result by Tudor (2004), to prove that Y(t) can be represented as the limit of linear combinations of processes that are products of forward…
We study optimal transportation with the quadratic cost function in geodesic metric spaces satisfying suitable non-branching assumptions. We introduce and study the notions of slope along curves and along geodesics and we apply the latter…
We develop a computationally tractable method for estimating the optimal map between two distributions over $\mathbb{R}^d$ with rigorous finite-sample guarantees. Leveraging an entropic version of Brenier's theorem, we show that our…
In this paper we introduce a numerical method for optimal stopping in the framework of one dimensional diffusion. We use the Skorokhod embedding in order to construct recombining tree approximations for diffusions with general coefficients.…
Our object is to formulate and analyze a physically plausible and mathematically sound model to better understand the phenomenon of clumping in colloid dispersions. Our model is stochastic but rigorously derived from a deterministic setup…
We study the optimal transport problem for pairs of stationary finite-state Markov chains, with an emphasis on the computation of optimal transition couplings. Transition couplings are a constrained family of transport plans that capture…
We consider the optimal control problem of steering an agent population to a desired distribution over an infinite horizon. This is an optimal transport problem over dynamical systems, which is challenging due to its high computational…
An optimal transport path may be viewed as a geodesic in the space of probability measures under a suitable family of metrics. This geodesic may exhibit a tree-shaped branching structure in many applications such as trees, blood vessels,…
We investigate stochastic processes that generalize geometric Brownian motion, focusing on cases where the standard invariant measure, i.e. the solution of the stationary Fokker-Planck equation does not necessarily exist. We demonstrate…
We provide a unifying interpretation of various optimal transport problems as a minimisation of a linear functional over the set of all Choquet representations of a given pair of probability measures ordered with respect to a certain convex…