Optimal transportation with an oscillation-type cost: the one-dimensional case
Didier Lesesvre (CMLA), Paul Pegon (CMLA), Filippo Santambrogio, (LM-Orsay)

TL;DR
This paper proves the existence of an optimal transport map minimizing a cost based on the maximal oscillation at a scale, with applications in privacy-respectful data transmission, but only in one dimension.
Contribution
It introduces a new oscillation-based cost function for optimal transport and proves existence of solutions in the one-dimensional case.
Findings
Existence of an optimal transport map for the oscillation cost in 1D
Application potential in privacy-respectful data transmission
Method relies on monotonicity considerations
Abstract
The main result of this paper is the existence of an optimal transport map between two given measures and , for a cost which considers the maximal oscillation of at scale , given by . The minimization of this criterion finds applications in the field of privacy-respectful data transmission. The existence proof unfortunately only works in dimension one and is based on some monotonicity considerations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Stochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods
