Conceptio › Archive › arXiv (All)
arXiv (All) open access

The Observable Wasserstein Distance

Santos, Edivaldo Lopes dos et al. · 2026 · arxiv_all
arXiv (All) · Papers · 2026
Open Source ↗Direct PDF ↓
machine-learningmetric-geometry
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

[2605.09916] The Observable Wasserstein Distance Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Mathematics > Metric Geometry arXiv:2605.09916 (math) [Submitted on 11 May 2026 ( v1 ), last revised 14 Aug 2026 (this version, v2)] Title: The Observable Wasserstein Distance Authors: Edivaldo Lopes dos Santos , Leandro Vicente Mauri , Washington Mio , Tom Needham View a PDF of the paper titled The Observable Wasserstein Distance, by Edivaldo Lopes dos Santos and 3 other authors View PDF HTML (experimental) Abstract: We introduce the observable Wasserstein distance, a framework for deriving lower bounds on the Wasserstein distance between probability measures on Polish metric spaces, designed to bypass the computational intractability of exact optimal transport in large-scale, non-Euclidean datasets. Analogous to the sliced Wasserstein distance in $\mathbb{R}^d$, our approach projects measures onto the real line via 1-Lipschitz observables and computes the Wasserstein distances between the resulting pushforward distributions. We define a hierarchy of pseudo-metrics by restricting observables to a nested chain of subspaces. A central theoretical contribution is an injectivity result linking the metric covering dimension of the support of a measure to the specific order in the hierarchy that guarantees unique recovery. This serves as a metric-space analogue to the Cramér-Wold Device for Euclidean distributions. We demonstrate that this hierarchy offers a tunable trade-off between sharpness as a lower bound on the Wasserstein distance and computational efficiency. We also present a discrete computational model for finite grids and numerical experiments validating the efficacy and utility of these approximations. Subjects: Metric Geometry (math.MG) ; Machine Learning (cs.LG) Cite as: arXiv:2605.09916 [math.MG] (or arXiv:2605.09916v2 [math.MG] for this version) https://doi.org/10.48550/arXiv.2605.09916 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Tom Needham [ view email ] [v1] Mon, 11 May 2026 03:10:33 UTC (14,710 KB) [v2] Fri, 14 Aug 2026 19:45:46 UTC (5,170 KB) Full-text links: Access Paper: View a PDF of the paper titled The Observable Wasserstein Distance, by Edivaldo Lopes dos Santos and 3 other authors View PDF HTML (experimental) TeX Source view license Current browse context: math.MG < prev | next > new | recent | 2026-05 Change to browse by: cs cs.LG math References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

Record · ID 609937 · SHA-256 793e6cfa6913137a
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive