arXiv — Machine Learning · · 3 min read

Quantifying the noise sensitivity of the Wasserstein metric for images

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Mathematics > Statistics Theory

arXiv:2510.01015 (math)
[Submitted on 1 Oct 2025 (v1), last revised 7 Jun 2026 (this version, v3)]

Title:Quantifying the noise sensitivity of the Wasserstein metric for images

View a PDF of the paper titled Quantifying the noise sensitivity of the Wasserstein metric for images, by Erik Lager and Gilles Mordant and Amit Moscovich
View PDF HTML (experimental)
Abstract:Wasserstein metrics are increasingly adopted as similarity scores for images. We consider the sensitivity of Wasserstein metrics with respect to pixel-wise additive noise when the images are treated as discrete measures on the pixel grid. We derive finite-sample expectation bounds for a Gaussian noise model. Among other results, we prove that the error in the signed 2-Wasserstein discrepancy scales with the square root of the noise standard deviation. This is favorable compared to the Euclidean metric that scales linearly, and thus provides a theoretical basis for the benefits of optimal transport distances in noisy settings. We present experiments that support our theoretical findings and point to a peculiar phenomenon where increasing the level of noise can decrease the Wasserstein distance. A case study on cryo-electron microscopy images demonstrates that the Wasserstein metric can capture the geometry of the data manifold in high noise settings even when the Euclidean metric fails.
Subjects: Statistics Theory (math.ST); Machine Learning (cs.LG); Image and Video Processing (eess.IV)
Cite as: arXiv:2510.01015 [math.ST]
  (or arXiv:2510.01015v3 [math.ST] for this version)
  https://doi.org/10.48550/arXiv.2510.01015
arXiv-issued DOI via DataCite

Submission history

From: Erik Lager [view email]
[v1] Wed, 1 Oct 2025 15:22:12 UTC (292 KB)
[v2] Sat, 27 Dec 2025 13:08:05 UTC (336 KB)
[v3] Sun, 7 Jun 2026 15:03:42 UTC (1,125 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Quantifying the noise sensitivity of the Wasserstein metric for images, by Erik Lager and Gilles Mordant and Amit Moscovich
  • View PDF
  • HTML (experimental)
  • TeX Source

Current browse context:

math.ST
< prev   |   next >
Change to browse by:

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
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?)
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.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning