Knothe-Rosenblatt maps via soft-constrained optimal transport
Preprint
Abstract
In the theory of optimal transport, the Knothe-Rosenblatt (KR) rearrangement provides an explicit construction to map between two probability measures by building one-dimensional transformations from the marginal conditionals of one measure to the other. The KR map has shown to be useful in different realms of mathematics and statistics, from proving functional inequalities to designing methodologies for sampling conditional distributions. It is known that the KR rearrangement can be obtained as the limit of a sequence of optimal transport maps with a weighted quadratic cost. We extend these results in this work by showing that one can obtain the KR map as a limit of maps that solve a relaxation of the weighted-cost optimal transport problem with a soft-constraint for the target distribution. In addition, we show that this procedure also applies to the construction of triangular velocity fields via dynamic optimal transport yielding optimal velocity fields. This justifies various variational methodologies for estimating KR maps in practice by minimizing a divergence between the target and pushforward measure through an approximate map. Moreover, it opens the possibilities for novel static and dynamic OT estimators for KR maps.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Conditional Optimal Transport on Function SpacesSIAM/ASA Journal on Uncertainty Quantification, 2025
- Conditional Sampling with Monotone GANs: From Generative Models to Likelihood-Free InferenceSIAM/ASA Journal on Uncertainty Quantification, 2024
- On the Representation and Learning of Monotone Triangular Transport MapsFoundations of Computational Mathematics, 2023
- Sparse Approximation of Triangular Transports, Part I: The Finite-Dimensional CaseConstructive Approximation, 2022
- Optimal Entropy-Transport problems and a new Hellinger–Kantorovich distance between positive measuresInventiones Mathematicae, 2017
- An Interpolating Distance Between Optimal Transport and Fisher–Rao MetricsFoundations of Computational Mathematics, 2016
- Optimal Transport for Applied Mathematicians2015
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problemNumerische Mathematik, 2000
- Polar factorization and monotone rearrangement of vector‐valued functionsCommunications on Pure and Applied Mathematics, 1991
- Remarks on a Multivariate TransformationThe Annals of Mathematical Statistics, 1952