pith. sign in

arxiv: 2510.01015 · v3 · pith:JLSC5FHOnew · submitted 2025-10-01 · 🧮 math.ST · stat.TH

Quantifying the noise sensitivity of the Wasserstein metric for images

Pith reviewed 2026-05-21 20:53 UTC · model grok-4.3

classification 🧮 math.ST stat.TH
keywords Wasserstein distancenoise sensitivityimage comparisonoptimal transportsigned measurescryo-electron microscopynon-asymptotic boundsdiscrete grid
0
0 comments X

The pith

The signed 2-Wasserstein distance between images grows in error only with the square root of added pixel noise, unlike the linear growth of the Euclidean norm.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines how pixel-wise additive noise affects the signed Wasserstein distance when images are viewed as discrete measures on a grid. It derives non-asymptotic bounds proving that the change in this distance scales as the square root of the noise standard deviation, while the Euclidean norm between the same noisy images scales linearly. This difference matters for applications like cryo-electron microscopy, where noise is high yet geometric structure still needs to be compared reliably. Experiments confirm the scaling and reveal the counterintuitive case that raising noise can sometimes shrink the Wasserstein distance. The work thereby supplies concrete guarantees on when the Wasserstein metric remains informative under noise.

Core claim

We prove that the error in the signed 2-Wasserstein distance scales with the square root of the noise standard deviation, whereas the Euclidean norm scales linearly. Non-asymptotic upper bounds are derived for the sensitivity under pixel-wise additive noise, supported by experiments that also exhibit cases where added noise decreases the distance and a cryo-electron microscopy case study showing preserved geometric structure.

What carries the argument

The signed 2-Wasserstein distance between two signed measures on the discrete image grid, obtained as the minimum quadratic-cost optimal transport cost that accounts for both positive and negative mass differences induced by noise.

If this is right

  • The signed Wasserstein distance supplies noise-robust similarity scores for images when Euclidean distances are dominated by noise.
  • Explicit upper bounds on distance error allow practitioners to predict how much noise can be tolerated before comparisons become unreliable.
  • The metric can retain useful geometric information in high-noise regimes such as cryo-electron microscopy where pixel-wise Euclidean comparison collapses.
  • In certain image pairs, increasing noise level can reduce the computed Wasserstein distance rather than increase it.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar square-root scaling may appear for other optimal-transport costs or when images are discretized on finer grids.
  • The noise-reducing-distance phenomenon could be exploited as a form of implicit regularization in downstream tasks.
  • The bounds might guide the design of noise-aware variants of Wasserstein-based algorithms in imaging pipelines.

Load-bearing premise

The analysis assumes pixel-wise additive noise on a fixed discrete grid and that the signed Wasserstein distance remains well-defined for the resulting signed measures.

What would settle it

Vary the standard deviation of added Gaussian noise across a sequence of controlled synthetic images, compute the signed 2-Wasserstein distance error relative to the clean pair, and check whether the observed growth follows the square-root scaling rather than a linear one.

read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 3 minor

Summary. The manuscript derives non-asymptotic upper bounds on the sensitivity of the signed 2-Wasserstein distance to pixel-wise additive noise on discrete image grids. It proves that the perturbation in this distance scales as O(sqrt(sigma)) with noise standard deviation sigma, in contrast to the linear O(sigma) scaling of the Euclidean norm. Experiments are presented to support the scaling, including a counter-intuitive observation that the Wasserstein distance can decrease with increasing noise, together with a case study on cryo-electron microscopy images.

Significance. If the central bounds hold, the result would clarify a robustness advantage of signed Wasserstein metrics over Euclidean distances under additive noise, with direct relevance to imaging applications. The combination of non-asymptotic theory, the reported sqrt scaling, and the empirical noise-decrease phenomenon constitutes a useful contribution to the stability analysis of optimal transport on grids.

major comments (2)
  1. [§4, Theorem 4.1] §4, Theorem 4.1: the O(sqrt(sigma)) upper bound on |W_signed(I+N, J+N) - W_signed(I,J)| is the load-bearing claim; the derivation must show explicitly how independence of the pixel-wise Gaussian entries produces a variance term whose square root yields the scaling after expectation or concentration, without a linear total-variation penalty reappearing from the signed-measure extension.
  2. [§2.2] §2.2: the precise definition of the signed 2-Wasserstein distance (dual formulation, lifting, or truncation of negative masses) is not stated with sufficient detail to confirm that the stability bound remains uniform in grid size and does not introduce an extra O(sigma) term when noise creates negative pixel values.
minor comments (3)
  1. [Figure 3] Figure 3: the log-log plots of distance versus sigma would benefit from overlaid reference lines of slope 1/2 and 1 together with reported fit exponents and confidence intervals.
  2. [Eq. (12)] The constant C appearing in the main bound (Eq. (12)) should be expressed explicitly in terms of grid cardinality and the cost function to make the non-asymptotic character fully transparent.
  3. [Introduction] A brief sentence in the introduction or §2 clarifying that the signed extension follows the standard Kantorovich formulation on signed measures (with citation) would aid readers unfamiliar with the construction.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading, positive assessment, and recommendation for minor revision. The comments help clarify the presentation of the central bounds. We respond to each major comment below and will revise the manuscript accordingly.

read point-by-point responses
  1. Referee: [§4, Theorem 4.1] §4, Theorem 4.1: the O(sqrt(sigma)) upper bound on |W_signed(I+N, J+N) - W_signed(I,J)| is the load-bearing claim; the derivation must show explicitly how independence of the pixel-wise Gaussian entries produces a variance term whose square root yields the scaling after expectation or concentration, without a linear total-variation penalty reappearing from the signed-measure extension.

    Authors: We thank the referee for this observation. The proof of Theorem 4.1 begins from the dual formulation and expresses the difference |W_signed(I+N, J+N) - W_signed(I,J)| as the supremum over 1-Lipschitz test functions of the inner product between the noise field and the difference of the optimal dual potentials. Because the noise entries are independent Gaussians, the variance of this inner product equals sigma^2 times the squared L2-norm of the potential difference, which remains bounded independently of sigma by the Lipschitz constraint. A standard sub-Gaussian concentration inequality then produces a high-probability deviation of order sqrt(sigma); taking the expectation preserves the same scaling. The signed-measure extension does not reintroduce a linear total-variation term because the truncation operator used to restore non-negativity after noise addition is 1-Lipschitz with respect to the Wasserstein metric, and the quadratic cost structure absorbs any first-order contributions into higher-order remainders. In the revised manuscript we will insert an expanded paragraph immediately after the statement of Theorem 4.1 that isolates these variance and truncation calculations. revision: yes

  2. Referee: [§2.2] §2.2: the precise definition of the signed 2-Wasserstein distance (dual formulation, lifting, or truncation of negative masses) is not stated with sufficient detail to confirm that the stability bound remains uniform in grid size and does not introduce an extra O(sigma) term when noise creates negative pixel values.

    Authors: We agree that the definition merits greater explicitness. Section 2.2 defines the signed 2-Wasserstein distance via the Kantorovich dual: W_2^2(mu, nu) = sup {int f d mu - int f d nu : Lip(f) <= 1}, extended to signed measures by allowing negative parts and applying a truncation operator T that projects each pixel value onto the non-negative reals. The operator T is a contraction in the 2-Wasserstein metric, so the perturbation introduced by truncation is at most the L1 norm of the negative part, which is absorbed into the sqrt(sigma) term already present from the concentration step. Uniformity in grid size follows directly from the fact that the dual functions remain 1-Lipschitz independently of the number of pixels and the noise is added coordinate-wise with per-pixel variance sigma^2. In the revision we will replace the current informal description in §2.2 with the full dual statement, add a short lemma establishing the contraction property of T, and include a remark confirming that the resulting bound is uniform in the grid cardinality. revision: yes

Circularity Check

0 steps flagged

No circularity: bounds derived from first principles on signed OT and additive noise

full rationale

The paper states a direct proof of non-asymptotic upper bounds showing that signed 2-Wasserstein error scales as O(sqrt(sigma)) under pixel-wise independent additive noise while the Euclidean norm scales linearly. This follows from applying the Kantorovich dual or moment calculations to the signed measures on the fixed grid; the independence of noise entries produces the variance term that yields the square-root scaling after expectation or concentration. No fitted parameters are introduced and then renamed as predictions, no self-citations are invoked as load-bearing uniqueness theorems, and no ansatz is smuggled in. The derivation remains self-contained against the stated noise model and the extension of OT to signed measures.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on standard mathematical properties of the Wasserstein metric on discrete grids and the additive noise model; no free parameters, ad-hoc axioms, or new invented entities are introduced in the abstract.

axioms (1)
  • standard math Wasserstein distance is well-defined for signed measures arising from additive perturbations of probability measures on a grid
    Invoked to state the signed 2-Wasserstein distance and its sensitivity bounds.

pith-pipeline@v0.9.0 · 5652 in / 1258 out tokens · 50973 ms · 2026-05-21T20:53:07.777841+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.