Related papers: On a Neural Implementation of Brenier's Polar Fact…
We show that any non-degenerate vector field $u$ in $ L^{\infty}(\Omega, \R^N)$, where $\Omega$ is a bounded domain in $\R^N$, can be written as {equation} \hbox{$u(x)= \nabla_1 H(S(x), x)$ for a.e. $x \in \Omega$}, {equation} where $S$ is…
Let M be a compact Riemannian manifold and let $\mu$,d be the associated measure and distance on M. Robert McCann obtained, generalizing results for the Euclidean case by Yann Brenier, the polar factorization of Borel maps S : M -> M…
This paper proves some results concerning the polar factorisation of an integrable vector-valued function u into the composition of the gradient of a convex function with a measure-preserving mapping. Not every integrable function has a…
Normalizing Flows (NF) are powerful likelihood-based generative models that are able to trade off between expressivity and tractability to model complex densities. A now well established research avenue leverages optimal transport (OT) and…
Optimal transport (OT) theory has been been used in machine learning to study and characterize maps that can push-forward efficiently a probability measure onto another. Recent works have drawn inspiration from Brenier's theorem, which…
We consider the polar factorization of vector valued mappings introduced by Y. Brenier. In the case of a family of mappings depending on a parameter. We investigate the regularity with respect to this parameter of the terms of the polar…
Over the past few years, numerous computational models have been developed to solve Optimal Transport (OT) in a stochastic setting, where distributions are represented by samples and where the goal is to find the closest map to the ground…
Brenier proved that under certain conditions on a source and a target probability measure there exists a strictly convex function such that its gradient is a transport map from the source to the target distribution. This function is called…
We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…
The polarization decomposition of arbitrary binary-input memoryless channels (BMCs) is studied in this work. By introducing the polarization factor (PF), defined in terms of the conditional entropy of the channel output under various input…
We introduce and analyze a statistical estimator for Monge transport maps: solutions to the quadratic optimal transport problem in Euclidean space. For absolutely continuous source measures, this map is uniquely defined as the gradient of a…
In many scientific fields imaging is used to relate a certain physical quantity to other dependent variables. Therefore, images can be considered as a map from a real-world coordinate system to the non-negative measurements being acquired.…
We investigate an analogue of the irreducible convex paving in the context of generalised convexity. Consider two Radon probability measures $\mu,\nu$ ordered with respect to a cone $\mathcal{F}$ of functions on $\Omega$ stable under…
Brenier's theorem is a cornerstone of optimal transport that guarantees the existence of an optimal transport map $T$ between two probability distributions $P$ and $Q$ over $\mathbb{R}^d$ under certain regularity conditions. The main goal…
In 1960 Schwinger [J. Schwinger, Proc.Natl.Acad.Sci. 46 (1960) 570- 579] proposed the algorithm for factorization of unitary operators in the finite M dimensional Hilbert space according to a coprime decomposition of M. Using a special…
We provide a framework to approximate the 2-Wasserstein distance and the optimal transport map, amenable to efficient training as well as statistical and geometric analysis. With the quadratic cost and considering the Kantorovich dual form…
This paper studies the convergence rates of optimal transport (OT) map estimators, a topic of growing interest in statistics, machine learning, and various scientific fields. Despite recent advancements, existing results rely on regularity…
This paper investigates universal polar coding schemes. In particular, a notion of ordering (called convolutional path) is introduced between probability distributions to determine when a polar compression (or communication) scheme designed…
We consider the transfer operators of non-uniformly expanding maps for potentials of various regularity, and show that a specific property of potentials ("flatness") implies a Ruelle-Perron-Frobenius Theorem and a decay of the transfer…
We derive iterative methods for computing the Fr\'{e}chet derivative of the map which sends a full-rank matrix $A$ to the factor $U$ in its polar decomposition $A=UH$, where $U$ has orthonormal columns and $H$ is Hermitian positive…