Related papers: Backward and Forward Wasserstein Projections in St…
Optimal transport is widely used in pure and applied mathematics to find probabilistic solutions to hard combinatorial matching problems. We extend the Wasserstein metric and other elements of optimal transport from the matching of sets to…
We provide a comprehensive study of the convergence of the forward-backward algorithm under suitable geometric conditions, such as conditioning or {\L}ojasiewicz properties. These geometrical notions are usually local by nature, and may…
We are interested in martingale rearrangement couplings. As introduced by Wiesel [37] in order to prove the stability of Martingale Optimal Transport problems, these are projections in adapted Wasserstein distance of couplings between two…
We construct geodesics in the Wasserstein space of probability measure along which all the measures have an upper bound on their density that is determined by the densities of the endpoints of the geodesic. Using these geodesics we show…
This paper deals with the estimation of a probability measure on the real line from data observed with an additive noise. We are interested in rates of convergence for the Wasserstein metric of order $p\geq 1$. The distribution of the…
In this paper, we study the stability of the shadow, a projection of a measure onto the set of couplings with respect to the Wasserstein distance. The shadow was introduced by \citet{Eckstein_Nutz_2022} to analyze the stability of the…
In this article, we derive first-order necessary optimality conditions for a constrained optimal control problem formulated in the Wasserstein space of probability measures. To this end, we introduce a new notion of localised metric…
In this work we study the method of Bregman projections for deterministic and stochastic convex feasibility problems with three types of control sequences for the selection of sets during the algorithmic procedure: greedy, random, and…
In this paper, we use the class of Wasserstein metrics to study asymptotic properties of posterior distributions. Our first goal is to provide sufficient conditions for posterior consistency. In addition to the well-known Schwartz's…
We consider optimization problems with manifold-valued constraints. These generalize classical equality and inequality constraints to a setting in which both the domain and the codomain of the constraint mapping are smooth manifolds. We…
Building on recent developments in models focused on the shape properties of odds ratios, this paper introduces two new models that expand the class of available distributions while preserving specific shape characteristics of an underlying…
We study the Wasserstein projection of a compactly supported probability measure onto the class of measures whose density ratio is bounded, and we place this projection in a broader program connecting generative modeling, optimal transport,…
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…
We investigate properties of some extensions of a class of Fourier-based probability metrics, originally introduced to study convergence to equilibrium for the solution to the spatially homogeneous Boltzmann equation. At difference with the…
Distributionally-robust optimization is often studied for a fixed set of distributions rather than time-varying distributions that can drift significantly over time (which is, for instance, the case in finance and sociology due to…
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…
In this paper, we study higher-order-accurate-in-time minimizing movements schemes for Wasserstein gradient flows. We introduce a novel accelerated second-order scheme, leveraging the differential structure of the Wasserstein space in both…
We consider solving large scale nonconvex optimisation problems with nonnegativity constraints. Such problems arise frequently in machine learning, such as nonnegative least-squares, nonnegative matrix factorisation, as well as problems…
In this paper we wish to tackle stochastic programs affected by ambiguity about the probability law that governs their uncertain parameters. Using optimal transport theory, we construct an ambiguity set that exploits the knowledge about the…
For probability measures $\mu,\nu$ and $\rho$ define the cost functionals \begin{align*} C(\mu,\rho):=\sup_{\pi\in \Pi(\mu,\rho)} \int \langle x,y\rangle\, \pi(dx,dy),\quad C(\nu,\rho):=\sup_{\pi\in \Pi(\nu,\rho)} \int \langle x,y\rangle\,…