Related papers: A Central Limit Theorem for Semidiscrete Wasserste…
Multi-marginal optimal transport enables one to compare multiple probability measures, which increasingly finds application in multi-task learning problems. One practical limitation of multi-marginal transport is computational scalability…
We propose a fundamental metric for measuring the distance between two distributions. This metric, referred to as the decision-focused (DF) divergence, is tailored to stochastic linear optimization problems in which the objective…
We introduce folded optimal transport, as a method to extend a cost or distance defined on the extreme boundary of a convex to the whole convex, related to convex extension. This construction broadens the framework of standard optimal…
Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in…
This paper studies distributional model risk in marginal problems, where each marginal measure is assumed to lie in a Wasserstein ball centered at a fixed reference measure with a given radius. Theoretically, we establish several…
We study the behavior of the Wasserstein-$2$ distance between discrete measures $\mu$ and $\nu$ in $\mathbb{R}^d$ when both measures are smoothed by small amounts of Gaussian noise. This procedure, known as Gaussian-smoothed optimal…
We prove the convergence of an implicit time discretization for the one-phase Mullins-Sekerka equation, possibly with additional non-local repulsion, proposed in [F. Otto, Arch. Rational Mech. Anal. 141 (1998) 63--103]. Our simple argument…
We propose a fast algorithm for the calculation of the Wasserstein-1 distance, which is a particular type of optimal transport distance with homogeneous of degree one transport cost. Our algorithm is built on multilevel primal-dual…
We prove for the rescaled convolution map $f\to f\circledast f$ propagation of polynomial, exponential and gaussian localization. The gaussian localization is then used to prove an optimal bound on the rate of entropy production by this…
In this paper, we establish a Kantorovich duality for weak optimal total variation transport problems. As consequences, we recover a version of duality formula for partial optimal transports established by Caffarelli and McCann; and we also…
The quadratically regularized optimal transport problem has recently been considered in various applications where the coupling needs to be \emph{sparse}, i.e., the density of the coupling needs to be zero for a large subset of the product…
In the paper [25], written in collaboration with Gesine Reinert, we proved a universality principle for the Gaussian Wiener chaos. In the present work, we aim at providing an original example of application of this principle in the…
Open Quantum Random Walks, as developed in \cite{APSS}, are a quantum generalization of Markov chains on finite graphs or on lattices. These random walks are typically quantum in their behavior, step by step, but they seem to show up a…
In order to characterize the fluctuation between the ergodic limit and the time-averaging estimator of a full discretization in a quantitative way, we establish a central limit theorem for the full discretization of the parabolic stochastic…
Optimal transport has found widespread applications in signal processing and machine learning. Among its many equivalent formulations, optimal transport seeks to reconstruct a random variable/vector with a prescribed distribution at the…
This brief note aims to introduce the recent paradigm of distributional robustness in the field of shape and topology optimization. Acknowledging that the probability law of uncertain physical data is rarely known beyond a rough…
Two common problems in time series analysis are the decomposition of the data stream into disjoint segments that are each in some sense "homogeneous" - a problem known as Change Point Detection (CPD) - and the grouping of similar…
We prove the Central Limit Theorem and superpolynomial mixing for environment viewed for the particle process in quasi periodic Diophantine random environment. The main ingredients are smoothness estimates for the solution of the Poisson…
We propose a new statistical model, the spiked transport model, which formalizes the assumption that two probability distributions differ only on a low-dimensional subspace. We study the minimax rate of estimation for the Wasserstein…
The fact that a Markov diffusion semi-group on $\mathbb R^d$ contracts the $L^p$ Wasserstein distance, which has been extensively used to establish uniform-in-time stability estimates (e.g. with respect to numerical discretization errors),…