Wass-to-Unif in NMT & Speech Processing

• Wass-to-Unif is a Wasserstein-based label that quantifies decoder attention concentration in NMT and enforces latent alignment in audio-visual speech enhancement.
• In NMT, the 1-Wasserstein distance is used to compare cross-attention distributions to a uniform baseline, achieving AUROCs up to 0.946 for full-unsupport hallucination detection in specific decoder layers.
• In speech processing, UniVoiceLite applies a 2-Wasserstein penalty to align Gaussian latent spaces with visually conditioned priors, resulting in measurable improvements in SDR, STOI, and other audio metrics.

“Wass-to-Unif” is a Wasserstein-based label used in two distinct recent arXiv contexts. In “Layer-Resolved Optimal Transport for Hallucination Detection in NMT and Abstractive Summarization” (Onyshchuk et al., 11 Jun 2026), it denotes a fully unsupervised concentration metric defined as the 1-Wasserstein distance between decoder cross-attention and the uniform distribution over source positions, with the aim of detecting hallucinations caused by source disengagement. In the UniVoiceLite technical report (Park et al., 7 Dec 2025), the same label is attached to a Wasserstein-regularized unified speech enhancement and separation framework, where a 2-Wasserstein penalty aligns a latent posterior to a visually conditioned Gaussian prior. The shared terminology reflects common OT machinery, but the two uses differ in domain, mathematical object, and failure mode.

1. Terminological scope

Within the available literature, “Wass-to-Unif” does not denote a single invariant construct. In neural machine translation and summarization, it is a specific detector built from cross-attention geometry: decoder-layer attention distributions are compared to a flat uniform reference, and larger distances indicate greater concentration or “detachment” from broad source scanning (Onyshchuk et al., 11 Jun 2026). In speech processing, the term appears in a technical report subtitle for UniVoiceLite, an unsupervised audio-visual Wasserstein Auto-Encoder in which Wasserstein regularization replaces the usual VAE KL-divergence and structures the latent space around a visually conditioned prior (Park et al., 7 Dec 2025).

The distinction is mathematically substantive. The NMT/summarization usage operates on discrete probability vectors over source-token positions and employs the 1-Wasserstein distance with ground cost $c(i,j)=|i-j|$ (Onyshchuk et al., 11 Jun 2026). The UniVoiceLite usage operates on Gaussian latent distributions and uses the 2-Wasserstein distance between diagonal-covariance Gaussians (Park et al., 7 Dec 2025). A plausible implication is that the label should always be interpreted together with its task domain and target representation.

2. Cross-attention Wass-to-Unif as an OT concentration metric

In the hallucination-detection formulation, let $S$ be the source-token length and let $\mu,\nu\in\Delta^{S-1}$ be discrete probability vectors over positions $\{1,\dots,S\}$. The 1-Wasserstein distance is defined as

$$W_1(\mu,\nu) = \inf_{\gamma\in\Gamma(\mu,\nu)} \sum_{i=1}^S\sum_{j=1}^S |i-j|\gamma_{ij},$$

where $$\Gamma(\mu,\nu)=\{\gamma\ge 0:\gamma \mathbf{1}=\mu,\gamma^T\mathbf{1}=\nu\}$$ (Onyshchuk et al., 11 Jun 2026). The reference distribution is uniform,

$\mathbf{u}=\bigl(\tfrac1S,\ldots,\tfrac1S\bigr)^T.$

At decoder layer $\ell$ and generation step $t$, the raw $H\times S$ cross-attention tensors $S$0 are averaged across heads,

$S$1

The per-step Wass-to-Unif score is then

$S$2

and the layer-level summary is

$S$3

An overall detector can be obtained by averaging across a subset of layers (Onyshchuk et al., 11 Jun 2026).

The intended semantics are explicit: a large $S$4 means that the cross-attention distribution is more “peaked” relative to the flat uniform distribution, hence more concentrated on a small set of source positions. In this setting, Wass-to-Unif is therefore a concentration-based proxy for whether generation remains coupled to normal source scanning.

The numerical implementation exploits the one-dimensional support of token positions. Instead of Sinkhorn or other entropic regularization, the detector uses the exact cumulative-distribution-function identity

$S$5

which runs in $S$6 time and has zero regularization error (Onyshchuk et al., 11 Jun 2026). This exactness is important because the metric is intended as a layerwise interpretability signal rather than an approximate training loss.

3. Layer specialization in NMT hallucination detection

The layer-resolved study is carried out on a DE$S$7EN hallucination corpus using a Fairseq model with six decoder layers, $S$8–$S$9, and $\mu,\nu\in\Delta^{S-1}$0 examples (Onyshchuk et al., 11 Jun 2026). The results show that Wass-to-Unif is strongly layer-specialized and hallucination-type-specific.

For full-unsupport hallucinations, the signal is concentrated in the early-to-middle decoder stack. Layers $\mu,\nu\in\Delta^{S-1}$1–$\mu,\nu\in\Delta^{S-1}$2 detect this type very well, with a peak at $\mu,\nu\in\Delta^{S-1}$3 of $\mu,\nu\in\Delta^{S-1}$4, and performance remaining at or above $\mu,\nu\in\Delta^{S-1}$5 for $\mu,\nu\in\Delta^{S-1}$6, $\mu,\nu\in\Delta^{S-1}$7, and $\mu,\nu\in\Delta^{S-1}$8 (Onyshchuk et al., 11 Jun 2026). By contrast, $\mu,\nu\in\Delta^{S-1}$9 is near-random, with $\{1,\dots,S\}$0, indicating almost no concentration signal. The final layer $\{1,\dots,S\}$1 is different again: it is highly concentrated in all cases, with mean WTU $\{1,\dots,S\}$2 corpus-wide, and this makes it anti-predictive for subtler errors. For full-unsupport its AUROC falls to $\{1,\dots,S\}$3, and for milder types it drops below $\{1,\dots,S\}$4 (Onyshchuk et al., 11 Jun 2026).

For strong-unsupport and repetitions, the detector is markedly weaker. The WTU AUROC never rises above $\{1,\dots,S\}$5 and collapses at $\{1,\dots,S\}$6, including anti-predictive behavior (Onyshchuk et al., 11 Jun 2026). The stated interpretation is that these milder errors retain some degree of normal source scanning, so absolute concentration is a weaker cue than it is for utter-detached outputs.

The temporal dynamics are also diagnostic. Hallucinated translations lack the exploratory attention phase present in correct translations from the first decoding step, and early-step WTU scores, such as the first $\{1,\dots,S\}$7 of generation, already reveal this absence (Onyshchuk et al., 11 Jun 2026). This suggests a possible online use case: detection before full output generation.

4. Complementarity with Wass-to-Data and related detectors

The same study introduces a comparison with Wass-to-Data, abbreviated WTD. Whereas WTU measures distance to the uniform distribution, WTD measures the mean $\{1,\dots,S\}$8 distance from the test sentence’s step-averaged $\{1,\dots,S\}$9 to the $$W_1(\mu,\nu) = \inf_{\gamma\in\Gamma(\mu,\nu)} \sum_{i=1}^S\sum_{j=1}^S |i-j|\gamma_{ij},$$0 nearest neighbours’ $$W_1(\mu,\nu) = \inf_{\gamma\in\Gamma(\mu,\nu)} \sum_{i=1}^S\sum_{j=1}^S |i-j|\gamma_{ij},$$1 in a reference set of known-correct translations (Onyshchuk et al., 11 Jun 2026). The two detectors are not redundant.

The complementarity is sharpest when broken down by hallucination type. For full-unsupport hallucinations, WTU substantially exceeds WTD in aggregate AUROC, $$W_1(\mu,\nu) = \inf_{\gamma\in\Gamma(\mu,\nu)} \sum_{i=1}^S\sum_{j=1}^S |i-j|\gamma_{ij},$$2 versus $$W_1(\mu,\nu) = \inf_{\gamma\in\Gamma(\mu,\nu)} \sum_{i=1}^S\sum_{j=1}^S |i-j|\gamma_{ij},$$3, because absolute concentration is the strongest cue (Onyshchuk et al., 11 Jun 2026). For strong-unsupport and repetitions, the ranking reverses: WTD reaches approximately $$W_1(\mu,\nu) = \inf_{\gamma\in\Gamma(\mu,\nu)} \sum_{i=1}^S\sum_{j=1}^S |i-j|\gamma_{ij},$$4–$$W_1(\mu,\nu) = \inf_{\gamma\in\Gamma(\mu,\nu)} \sum_{i=1}^S\sum_{j=1}^S |i-j|\gamma_{ij},$$5, while WTU is approximately $$W_1(\mu,\nu) = \inf_{\gamma\in\Gamma(\mu,\nu)} \sum_{i=1}^S\sum_{j=1}^S |i-j|\gamma_{ij},$$6–$$W_1(\mu,\nu) = \inf_{\gamma\in\Gamma(\mu,\nu)} \sum_{i=1}^S\sum_{j=1}^S |i-j|\gamma_{ij},$$7. In these categories, distributional shape relative to a correct reference is more informative than mere peakedness.

The contrast persists in late layers. WTD remains robust even at $$W_1(\mu,\nu) = \inf_{\gamma\in\Gamma(\mu,\nu)} \sum_{i=1}^S\sum_{j=1}^S |i-j|\gamma_{ij},$$8, with AUROC approximately $$W_1(\mu,\nu) = \inf_{\gamma\in\Gamma(\mu,\nu)} \sum_{i=1}^S\sum_{j=1}^S |i-j|\gamma_{ij},$$9–$$\Gamma(\mu,\nu)=\{\gamma\ge 0:\gamma \mathbf{1}=\mu,\gamma^T\mathbf{1}=\nu\}$$0, whereas WTU becomes actively misleading there (Onyshchuk et al., 11 Jun 2026). The broader NMT figures reinforce the point: on full-unsupport, WTU is approximately $$\Gamma(\mu,\nu)=\{\gamma\ge 0:\gamma \mathbf{1}=\mu,\gamma^T\mathbf{1}=\nu\}$$1 AUROC, while routing-consistency is approximately $$\Gamma(\mu,\nu)=\{\gamma\ge 0:\gamma \mathbf{1}=\mu,\gamma^T\mathbf{1}=\nu\}$$2; on strong-unsupport, WTU is approximately $$\Gamma(\mu,\nu)=\{\gamma\ge 0:\gamma \mathbf{1}=\mu,\gamma^T\mathbf{1}=\nu\}$$3 and WTD approximately $$\Gamma(\mu,\nu)=\{\gamma\ge 0:\gamma \mathbf{1}=\mu,\gamma^T\mathbf{1}=\nu\}$$4; on repetitions, WTU is approximately $$\Gamma(\mu,\nu)=\{\gamma\ge 0:\gamma \mathbf{1}=\mu,\gamma^T\mathbf{1}=\nu\}$$5 and WTD approximately $$\Gamma(\mu,\nu)=\{\gamma\ge 0:\gamma \mathbf{1}=\mu,\gamma^T\mathbf{1}=\nu\}$$6 (Onyshchuk et al., 11 Jun 2026).

The practical recommendation is accordingly composite rather than exclusive. Wass-to-Unif is indicated when the suspected failure mode is literal source disengagement, especially in severe NMT hallucinations and especially in layers $$\Gamma(\mu,\nu)=\{\gamma\ge 0:\gamma \mathbf{1}=\mu,\gamma^T\mathbf{1}=\nu\}$$7–$$\Gamma(\mu,\nu)=\{\gamma\ge 0:\gamma \mathbf{1}=\mu,\gamma^T\mathbf{1}=\nu\}$$8, with $$\Gamma(\mu,\nu)=\{\gamma\ge 0:\gamma \mathbf{1}=\mu,\gamma^T\mathbf{1}=\nu\}$$9 often best. It should be combined with complementary metrics such as Wass-to-Data, routing consistency, or downstream NLI/QA-based checks when both retrieval failures and content-misuse failures must be covered (Onyshchuk et al., 11 Jun 2026).

5. Transfer to abstractive summarization and principled limits

The same OT machinery is evaluated for abstractive summarization faithfulness detection on AggreFact, with $\mathbf{u}=\bigl(\tfrac1S,\ldots,\tfrac1S\bigr)^T.$0 examples drawn from CNN and XSum (Onyshchuk et al., 11 Jun 2026). Here the results are above chance but substantially weaker than in NMT. Unsupervised WTU on T5-base reaches balanced accuracy of approximately $\mathbf{u}=\bigl(\tfrac1S,\ldots,\tfrac1S\bigr)^T.$1, specifically $\mathbf{u}=\bigl(\tfrac1S,\ldots,\tfrac1S\bigr)^T.$2 on CNN and $\mathbf{u}=\bigl(\tfrac1S,\ldots,\tfrac1S\bigr)^T.$3 on XSum. Supervised MiniCheck-Flan-T5-L reaches approximately $\mathbf{u}=\bigl(\tfrac1S,\ldots,\tfrac1S\bigr)^T.$4, specifically $\mathbf{u}=\bigl(\tfrac1S,\ldots,\tfrac1S\bigr)^T.$5 and $\mathbf{u}=\bigl(\tfrac1S,\ldots,\tfrac1S\bigr)^T.$6 (Onyshchuk et al., 11 Jun 2026).

The paper presents this gap as principled rather than incidental. Unlike NMT hallucinations, unfaithful summaries can attend correctly to source tokens while still misrepresenting or inventing content downstream of attention. By construction, a concentration-based OT metric such as WTU is blind to these “content misuse” errors; it can only detect “source disengagement” failures (Onyshchuk et al., 11 Jun 2026). This is an explicit limitation of the method, not merely an empirical shortfall on one benchmark.

Structural experiments on T5-base nonetheless show consistent decoder organization across depth: Layer 3 shows peak concentration, and Layer 12 is most critical for generation quality (Onyshchuk et al., 11 Jun 2026). The significance of these findings is interpretive rather than competitive. Even where WTU is not a strong faithfulness detector, cross-attention OT remains a principled interpretability tool.

A common misconception would be to treat a good source-attention pattern as sufficient evidence of factual faithfulness. The summarization results directly contradict that view: attending to the right source region does not guarantee faithful semantic use of that material (Onyshchuk et al., 11 Jun 2026).

6. Wasserstein-regularized unified speech enhancement and separation in UniVoiceLite

A separate usage of “Wass-to-Unif” appears in the technical report on UniVoiceLite, described as a lightweight and unsupervised audio-visual Wasserstein Auto-Encoder that unifies speech enhancement and speech separation in a single forward pass (Park et al., 7 Dec 2025). Here the central operation is not comparison to a uniform token distribution, but Wasserstein regularization of latent Gaussian distributions conditioned on visual information.

The notation is framewise. The audio frame power spectrum is $\mathbf{u}=\bigl(\tfrac1S,\ldots,\tfrac1S\bigr)^T.$7, the visual conditioning is $\mathbf{u}=\bigl(\tfrac1S,\ldots,\tfrac1S\bigr)^T.$8 with dynamic lip embedding $\mathbf{u}=\bigl(\tfrac1S,\ldots,\tfrac1S\bigr)^T.$9 and static face-ID embedding $\ell$0, and the latent code is $\ell$1 (Park et al., 7 Dec 2025). The posterior is

$\ell$2

with parameters produced by an audio-plus-visual encoder. The visually conditioned prior is

$\ell$3

with parameters produced by a PriorNet (Park et al., 7 Dec 2025). Conditioned on $\ell$4 and $\ell$5, the decoder generates complex STFT coefficients by

$\ell$6

where $\ell$7 is a zero-mean complex Gaussian with learned variance.

The loss decomposes into reconstruction plus Wasserstein regularization. For single-speaker noisy SE training, the reconstruction term is $\ell$8; for multi-speaker SS training, it is $\ell$9; in both cases the total objective is

$t$0

with

$t$1

Because both posterior and prior are Gaussians with diagonal covariances, the squared 2-Wasserstein distance simplifies to

$t$2

so the regularizer becomes an analytic sum of mean and standard-deviation mismatches (Park et al., 7 Dec 2025). The report emphasizes that this avoids adversarial critics or gradient-penalty machinery while enforcing a smooth, structured latent space.

The architecture is deliberately shallow: a log-magnitude spectrogram passes through two shallow FC layers with Tanh to a 128-dimensional audio embedding; AV-HuBERT mouth embeddings and face-ID embeddings, both 512-dimensional and pre-computed, are each projected to 64 dimensions with one FC layer and ReLU; the fused 256-dimensional representation feeds two parallel heads producing $t$3 and $t$4 with latent dimension $t$5; the decoder concatenates sampled $t$6 with the fused visual embedding and uses three FC layers to output per-frequency variance (Park et al., 7 Dec 2025). Training uses the GRID corpus with 34 speakers and 1000 sentences, DEMAND noises at $t$7 for SE evaluation, random 2–3 speaker mixtures at the same SNRs for SS evaluation, Adam with learning rate $t$8, batch size $t$9, early stopping on validation loss, and $H\times S$0 (Park et al., 7 Dec 2025).

The quantitative results are presented across standard SE and SS metrics. For SE, metrics include SDR, STOI, DNSMOS-sig, and DNSMOS-ovr; for SS, PESQ, SDR, STOI, DNSMOS-s, and DNSMOS-o (Park et al., 7 Dec 2025). A reported example is station noise at $H\times S$1, where RVAE achieves SDR $H\times S$2, AV-VAE achieves $H\times S$3, and UniVoiceLite achieves $H\times S$4. For 2-speaker mixtures, PESQ is $H\times S$5 for RVAE versus $H\times S$6 for UniVoiceLite, SDR is $H\times S$7 versus $H\times S$8, and STOI is $H\times S$9 versus $S$00 (Park et al., 7 Dec 2025). The report also states that the model outperforms audio-only MossFormer2 and VisualVoice on SDR in that setting.

Ablation studies make the role of Wasserstein regularization explicit. Removing visual information drops SDR from $S$01 to $S$02 and STOI from $S$03 to $S$04; replacing the Wasserstein term with KL drives SDR to $S$05 and STOI to $S$06 (Park et al., 7 Dec 2025). The latent-space discussion attributes the effect to alignment of the posterior with the visually conditioned prior, producing stable clusters, preventing posterior collapse, and enabling a one-to-one mapping in latent space between visual identity and speech content. In this usage, “Wass-to-Unif” refers not to a hallucination detector but to a Wasserstein-regularized unification of SE and SS within the same network.