Related papers: Optimal Transport and Skorokhod Embedding
The \emph{Skorokhod distance} is a natural metric on traces of continuous and hybrid systems. For two traces, from $[0,T]$ to values in a metric space $O$, it measures the best match between the traces when allowed continuous bijective…
We consider the problem of finding an optimal transport plan between an absolutely continuous measure $\mu$ on $\mathcal{X} \subset \mathbb{R}^d$ and a finitely supported measure $\nu$ on $\mathbb{R}^d$ when the transport cost is the…
In this paper, we present a numerical method, based on iterative Bregman projections, to solve the optimal transport problem with Coulomb cost. This is related to the strong interaction limit of Density Functional Theory. The first idea is…
The planar Skorokhod embedding problem was first proposed and solved by R. Gross in 2019 [#gross2019]. Gross worked with probability distributions having finite second moment. In [#boudabra2019remarks, #Boudabra2020], the solutions extended…
We prove a strong duality result for a linear programming problem which has the interpretation of being a discretised optimal Skorokhod embedding problem, and we recover this continuous time problem as a limit of the discrete problems. With…
A simple procedure to map two probability measures in $\mathbb{R}^d$ is the so-called \emph{Knothe-Rosenblatt rearrangement}, which consists in rearranging monotonically the marginal distributions of the last coordinate, and then the…
An innovative extension of Geometric Brownian Motion model is developed by incorporating a weighting factor and a stochastic function modelled as a mixture of power and trigonometric functions. Simulations based on this Modified Brownian…
We consider the problem of finding optimal strategies that maximize the average growth-rate of multiplicative stochastic processes. For a geometric Brownian motion the problem is solved through the so-called Kelly criterion, according to…
This paper deals with optimal prediction in a regime-switching model driven by a continuous-time Markov chain. We extend existing results for geometric Brownian motion by deriving optimal stopping strategies that depend on the current…
The subject of this work has its roots in the so called Schroedginer Bridge Problem (SBP) which asks for the most likely distribution of Brownian particles in their passage between observed empirical marginal distributions at two distinct…
In this article we show a robustness theorem for controlled stochastic differential equations driven by approximations of Brownian motion. Often, Brownian motion is used as an idealized model of a diffusion where approximations such as…
We consider transport over a strongly connected, directed graph. The scheduling amounts to selecting transition probabilities for a discrete-time Markov evolution which is designed to be consistent with certain initial and final marginals.…
In this thesis, we extend the recently introduced theory of stochastic modified equations (SMEs) for stochastic gradient optimization algorithms. In Ch. 3 we study time-inhomogeneous SDEs driven by Brownian motion. For certain SDEs we prove…
Gradient optimization algorithms using epochs, that is those based on stochastic gradient descent without replacement (SGDo), are predominantly used to train machine learning models in practice. However, the mathematical theory of SGDo and…
The \emph{Schr\"odinger problem} is obtained by replacing the mean square distance with the relative entropy in the Monge-Kantorovich problem. It was first addressed by Schr\"odinger as the problem of describing the most likely evolution of…
Transport phenomena play a key role in a variety of application domains, and efficient simulation of these dynamics remains an outstanding challenge. While quantum computers offer potential for significant speedups, existing algorithms…
We address the problem of identifying the dynamical law governing the evolution of a population of indistinguishable particles, when only aggregate distributions at successive times are observed. Assuming a Markovian evolution on a discrete…
We introduce a stochastic version of the optimal transport problem. We provide an analysis by means of the study of the associated Hamilton-Jacobi-Bellman equation, which is set on the set of probability measures. We introduce a new…
Here we present an ergodic theorem which adapts a Theorem by J. Elton to the classical thermodynamical formalism and to ergodic transport. First, we discuss how Elton's theorem can be used to characterise Gibbs measures for expanding maps.…
Many numerical and learning algorithms rely on the solution of the Monge-Kantorovich problem and Wasserstein distances, which provide appropriate distributional metrics. While the natural approach is to treat the problem as an…