相关论文: Smoothing operators in multi-marginal Optimal Tran…
We consider Monge-Kantorovich optimal transport problems on $\mathbb{R}^d$, $d\ge 1$, with a convex cost function given by the cumulant generating function of a probability measure. Examples include the Wasserstein-2 transport whose cost…
Entropic Optimal Transport (EOT), also referred to as the Schr\"odinger problem, seeks to find a random processes with prescribed initial/final marginals and with minimal relative entropy with respect to a reference measure. The relative…
The basic problem of optimal transportation consists in minimizing the expected costs $\mathbb {E}[c(X_1,X_2)]$ by varying the joint distribution $(X_1,X_2)$ where the marginal distributions of the random variables $X_1$ and $X_2$ are…
We obtain bounds on the distribution of the maximum of a martingale with fixed marginals at finitely many intermediate times. The bounds are sharp and attained by a solution to $n$-marginal Skorokhod embedding problem in Ob{\l}\'oj and…
This paper studies line planning for urban bus networks that face multiple resource limits such as budget, labor, and emission caps while using heterogeneous fleets. The objective is to maximize total reward from serving passengers by…
We show that limits of sequences of smooth maps between compact Riemannian manifolds with equi-integrable $W^{1, p}$-Sobolev energy can always be strongly approximated by smooth maps, giving a counterpart of Hang's density result in $W^{1,…
Computationally solving multi-marginal optimal transport (MOT) with squared Euclidean costs for $N$ discrete probability measures has recently attracted considerable attention, in part because of the correspondence of its solutions with…
We investigate stability properties of weak supermartingale optimal transport (WSOT) problems on $\mathbb{R}$. For probability measures $\mu,\nu\in\mathcal{P}_r$ satisfying $\mu \leq_{cd} \nu$ (equivalently, $\Pi_S(\mu,\nu)\neq\emptyset$),…
We investigate the convergence rate of multi-marginal optimal transport costs that are regularized with the Boltzmann-Shannon entropy, as the noise parameter $\varepsilon$ tends to $0$. We establish lower and upper bounds on the difference…
We show that every $\mathbb{R}^d$-valued Sobolev path with regularity $\alpha$ and integrability $p$ can be lifted to a Sobolev rough path provided $\alpha < 1/p<1/3$. The novelty of our approach is its use of ideas underlying Hairer's…
Given samples from two joint distributions, we consider the problem of Optimal Transportation (OT) between them when conditioned on a common variable. We focus on the general setting where the conditioned variable may be continuous, and the…
In this review/tutorial article, we present recent progress on optimal control of partially observed Markov Decision Processes (POMDPs). We first present regularity and continuity conditions for POMDPs and their belief-MDP reductions, where…
Grogan et al [11,12] have recently proposed a solution to colour transfer by minimising the Euclidean distance L2 between two probability density functions capturing the colour distributions of two images (palette and target). It was shown…
In this work we consider a generalized version of Probability Smoothing, the core elementary model for sequential prediction in the state of the art PAQ family of data compression algorithms. Our main contribution is a code length analysis…
We consider the conjecture proposed in Matsumoto, Zhang and Schiebinger (2022) suggesting that optimal transport with quadratic regularisation can be used to construct a graph whose discrete Laplace operator converges to the…
This paper improves the state-of-the-art rate of a first-order algorithm for solving entropy regularized optimal transport. The resulting rate for approximating the optimal transport (OT) has been improved from…
We prove that $c$-cyclically monotone transport plans $\pi$ optimize the Monge-Kantorovich transportation problem under an additional measurability condition. This measurability condition is always satisfied for finitely valued, lower…
In this note we will adapt Topping's $\mathcal{L}$-optimal transportation theory for Ricci flow to a more general situation, i.e. to a closed manifold $(M,g_{ij}(t))$ evolving by $\partial_tg_{ij}=-2S_{ij}$, where $S_{ij}$ is a symmetric…
Establishing almost sure convergence rates for stochastic approximation and reinforcement learning under Markovian noise is a fundamental theoretical challenge. We make progress towards this challenge for a class of stochastic approximation…
The paper proposes and justifies a new algorithm of the proximal Newton type to solve a broad class of nonsmooth composite convex optimization problems without strong convexity assumptions. Based on advanced notions and techniques of…