Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformer
Doron Haviv, Russell Zhang Kunes, Thomas Dougherty, Cassandra Burdziak, Tal Nawy, Anna Gilbert, Dana Pe'er
Abstract
Optimal transport (OT) and the related Wasserstein metric (W) are powerful and ubiquitous tools for comparing distributions. However, computing pairwise Wasserstein distances rapidly becomes intractable as cohort size grows. An attractive alternative would be to find an embedding space in which pairwise Euclidean distances map to OT distances, akin to standard multidimensional scaling (MDS). We present Wasserstein Wormhole, a transformer-based autoencoder that embeds empirical distributions into a latent space wherein Euclidean distances approximate OT distances. Extending MDS theory, we show that our objective function implies a bound on the error incurred when embedding non-Euclidean distances. Empirically, distances between Wormhole embeddings closely match Wasserstein distances, enabling linear time computation of OT distances. Along with an encoder that maps distributions to embeddings, Wasserstein Wormhole includes a decoder that maps embeddings back to distributions, allowing for operations in the embedding space to generalize to OT spaces, such as Wasserstein barycenter estimation and OT interpolation. By lending scalability and interpretability to OT approaches, Wasserstein Wormhole unlocks new avenues for data analysis in the fields of computational geometry and single-cell biology. Software is available at http://wassersteinwormhole.readthedocs.io/en/latest/.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b002ebad-ca19-4140-8a04-f9b87cdc18a7Cited by top-tier papers5
- Fast Estimation of Wasserstein Distances via Regression on Sliced Wasserstein DistancesKhai Nguyen, Hai Nguyen, Nhat HoICLR 2026 · 5 citations
- Revisiting Multi-Permutation Equivariance through the Lens of irreducible RepresentationsYonatan Sverdlov, Ido Springer, Nadav DymICLR 2025
- Graph Alignment via Dual-Pass Spectral Encoding and Latent Space CommunicationMaysam Behmanesh, Erkan Turan, Maks OvsjanikovICML 2026
- Generative Distribution Embeddings: Lifting autoencoders to the space of distributions for multiscale representation learningNic Fishman, Gokul Gowri, Peng Yin, Jonathan Gootenberg et al.NeurIPS 2025
- FACET: A Fragment-Aware Conformer Ensemble TransformerDuy Nguyen, Trung Nguyen, Hong-Ha Le, Mai T. N. Truong et al.ICLR 2026
Builds on4
- Low-Rank Sinkhorn FactorizationMeyer Scetbon, Marco Cuturi, Gabriel PeyréICML 2021 · 76 citations
- Diffusion Earth Mover's Distance and Distribution EmbeddingsAlexander Tong, Guillaume Huguet, Amine Natik, Kincaid MacDonald et al.ICML 2021 · 34 citations
- Meta Optimal TransportBrandon Amos, Giulia Luise, Samuel Cohen, Ievgen RedkoICML 2023 · 32 citations
- How can classical multidimensional scaling go wrong?Rishi Sonthalia, Greg Van Buskirk, Benjamin Raichel, Anna C. GilbertNeurIPS 2021 · 9 citations
Related papers
- Unsupervised Ground Metric Learning Using Wasserstein Singular VectorsGeert-Jan Huizing, Laura Cantini, Gabriel PeyréICML 2022 · 8 citations
- Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature HierarchyYa-Wei Eileen Lin, Ronald R. Coifman, Gal Mishne, Ronen TalmonICLR 2025
- Wasserstein Flow Matching: Generative Modeling Over Families of DistributionsDoron Haviv, Aram-Alexandre Pooladian, Dana Pe'er, Brandon AmosICML 2025
- Manifold Interpolating Optimal-Transport Flows for Trajectory InferenceGuillaume Huguet, Daniel Sumner Magruder, Alexander Tong, Oluwadamilola Fasina et al.NeurIPS 2022 · 126 citations
- Fast unsupervised ground metric learning with tree-Wasserstein distanceKira Michaela Düsterwald, Samo Hromadka, Makoto YamadaICLR 2025
