Quantifying the noise sensitivity of the Wasserstein metric for images
Erik Lager, Gilles Mordant, Amit Moscovich
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 cryoelectron 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.
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 f72e3bcd-f6fd-4859-9026-87f5dfe6e964Builds on6
- Flow Matching for Generative ModelingYaron Lipman, Ricky T. Q. Chen, Heli Ben-Hamu, Maximilian Nickel et al.ICLR 2023 · 87 citations
- Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified FlowXingchao Liu, Chengyue Gong, Qiang LiuICLR 2023 · 75 citations
- Partial Optimal Tranport with applications on Positive-Unlabeled LearningLaetitia Chapel, Mokhtar Z. Alaya, Gilles GassoNeurIPS 2020 · 30 citations
- Building Normalizing Flows with Stochastic InterpolantsMichael S. Albergo, Eric Vanden-EijndenICLR 2023 · 21 citations
- Flow Matching with Semidiscrete CouplingsAlireza Mousavi-Hosseini, Stephen Y. Zhang, Michal Klein, Marco CuturiICLR 2026 · 11 citations
Related papers
- Asymptotics of smoothed Wasserstein distances in the small noise regimeYunzi Ding, Jonathan Niles-WeedNeurIPS 2022 · 3 citations
- Scalable Approximation Algorithms for p-Wasserstein Distance and Its VariantsNathaniel Lahn, Sharath Raghvendra, Emma Saarinen, Pouyan ShirzadianICML 2025
- A New Robust Partial p-Wasserstein-Based Metric for Comparing DistributionsSharath Raghvendra, Pouyan Shirzadian, Kaiyi ZhangICML 2024 · 10 citations
- Comparing noisy neural population dynamics using optimal transport distancesAmin Nejatbakhsh, Victor Geadah, Alex H. Williams, David LipshutzICLR 2025
- Achieving Structurally Robust Gromov Wasserstein Distance via Adaptive Dual-MaskKangke Cheng, Jiawei Huang, Jingni Song, Wanlin Zhang et al.ICML 2026
