Monge, Bregman and Occam: Interpretable Optimal Transport in High-Dimensions with Feature-Sparse Maps
Marco Cuturi, Michal Klein, Pierre Ablin

TL;DR
This paper introduces a novel interpretable optimal transport model for high-dimensional data that produces sparse, meaningful maps by leveraging feature-sparse regularization, demonstrated on single-cell gene expression data without dimensionality reduction.
Contribution
It proposes a new OT map model based on translation-invariant costs and Bregman centroids, enabling sparse, interpretable transport maps in high dimensions.
Findings
Successfully estimated OT maps for 34,000-dimensional gene data.
Maps induce sparse displacement vectors, enhancing interpretability.
Method retains gene-level detail without dimensionality reduction.
Abstract
Optimal transport (OT) theory focuses, among all maps that can morph a probability measure onto another, on those that are the ``thriftiest'', i.e. such that the averaged cost between and its image be as small as possible. Many computational approaches have been proposed to estimate such Monge maps when is the distance, e.g., using entropic maps [Pooladian'22], or neural networks [Makkuva'20, Korotin'20]. We propose a new model for transport maps, built on a family of translation invariant costs , where and is a regularizer. We propose a generalization of the entropic map suitable for , and highlight a surprising link tying it with the Bregman centroids of the divergence generated by , and the proximal operator of . We show that…
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
TopicsStatistical Methods and Inference
