transportation of measure underlies many contemporary methods in machine learning and statistics. sampling, which is a fundamental building block in computational science, can be done efficiently given an appropriate measure-transport map. we ask: what is the effect of using approximate maps in such algorithms?

we propose a new framework to analyze the approximation power of measure transport. this framework applies to existing algorithms, but also suggests new ones. at the core of our analysis is the theory of optimal transport regularity, approximation theory, and an emerging class of inequalities, previously studied in the context of uncertainty quantification (uq).