Unverified 2026

Directional Almost-Dominance OT Loss

Implementation & benchmark of arXiv:2607.28215 — Almost stochastic dominance via optimal transport

Usefulness6/10
Difficulty5/10
Novelty6/10

Source paper: Almost stochastic dominance via optimal transport arXiv:2607.28215 ⓘ · analyzed Aug 31, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Add a directional optimal-transport penalty that discourages samples from a model distribution P from exceeding samples from a reference distribution Q in task-relevant coordinates, while allowing a calibrated amount of violation controlled by γ. Unlike symmetric Wasserstein matching, the loss distinguishes harmful upward or downward deviations and can encode that one predictive or reward distribution should dominate another.

Formulas

$$D^{+}(P,Q):=\int_0^1\left(F_P^{-1}(u)-F_Q^{-1}(u)\right)_+\,du,\qquad D^{-}(P,Q):=\int_0^1\left(F_Q^{-1}(u)-F_P^{-1}(u)\right)_+\,du.$$
$$\gamma(P,Q):=\frac{D^{+}(P,Q)}{D^{+}(P,Q)+D^{-}(P,Q)+\varepsilon},\qquad P\leq_{st}Q\ \Longleftrightarrow\ D^{+}(P,Q)=0.$$
$$c_{+}(x,y):=\sum_{j=1}^{d}w_j(x_j-y_j)_+,\qquad \operatorname{OT}_{+}(P,Q):=\inf_{\pi\in\Pi(P,Q)}\mathbb{E}_{(x,y)\sim\pi}[c_{+}(x,y)].$$
$$\mathcal{L}_{\mathrm{AAD}}(\theta)=\max\left(0,\frac{\operatorname{OT}_{+}(P_\theta,Q)}{\operatorname{OT}_{+}(P_\theta,Q)+\operatorname{OT}_{+}(Q,P_\theta)+\varepsilon}-\gamma_0\right)^2.$$

Mathematical statement

For one-dimensional distributions P and Q with quantile functions F_P^{-1} and F_Q^{-1}, define the positive and compensating quantile areas D^+(P,Q)=∫_0^1(F_P^{-1}(u)-F_Q^{-1}(u))_+du and D^-(P,Q)=∫_0^1(F_Q^{-1}(u)-F_P^{-1}(u))_+du, where (z)_+=max(z,0). Exact stochastic dominance P≤_st Q holds when D^+=0, equivalently when a monotone coupling has no violations X>Y. A usable almost-dominance index is γ(P,Q)=D^+/(D^++D^-+ε), with γ=0 for exact dominance and larger γ for greater directional violation. For multidimensional samples x,y∈R^d, use the quasi-pseudo-metric c_+(x,y)=Σ_{j=1}^d w_j(x_j-y_j)_+, where w_j≥0 are coordinate importance weights, and define OT_+(P,Q)=inf_{π∈Π(P,Q)}E_(x,y)~π[c_+(x,y)]. Here Π(P,Q) is the set of couplings with marginals P and Q. The neural loss is the normalized directional ratio OT_+(P,Q)/(OT_+(P,Q)+OT_+(Q,P)+ε), optionally constrained to be at most a target γ_0. The dual perspective motivates estimating the discrepancy through monotone test functions f, using sup_{f∈F_γ}(E_P[f]-E_Q[f]), where F_γ is a class of increasing functions with bounded relative marginal sensitivities; this is an optional critic-based alternative to Sinkhorn.

Implementation notes

(1) Integration point: use this as an auxiliary loss on a minibatch of model outputs whose distribution should not exceed a reference distribution. Examples are predicted risk distributions versus a safety target, distributional-RL returns versus a baseline, or generated samples that should be no worse than another generator. Let x_1,...,x_n be model samples and y_1,...,y_m reference samples. For multidimensional outputs choose w_j from domain importance or set w_j=1. (2) Pseudocode: compute pairwise costs C_xy[i,k]=Σ_j w_j·softplus((x_i[j]-y_k[j])/τ)·τ and C_yx[k,i]=Σ_j w_j·softplus((y_k[j]-x_i[j])/τ)·τ; run log-domain Sinkhorn with entropic coefficient η to obtain plans Π_xy and Π_yx; set ot_xy=Σ_i,k Π_xy[i,k]C_xy[i,k], ot_yx=Σ_k,i Π_yx[k,i]C_yx[k,i]; set gamma_hat=ot_xy/(ot_xy+ot_yx+ε); set loss=relu(gamma_hat-γ0)^2; add λ·loss to the task objective and backpropagate through the Sinkhorn iterations. (3) The mathematical quantities computed directly are the directional cost, coupling optimization, and γ ratio; τ, η, ε, λ, and γ0 are engineering hyperparameters. Estimate w_j from validation sensitivity if desired, but do not adapt them from the same minibatch. For one-dimensional outputs, sort samples and replace Sinkhorn by the exact empirical quantile formula, which is O(n log n). (4) First experiment: train a small heteroscedastic MLP on synthetic regression where the target conditional distribution is deliberately shifted upward in 20% of regions. Compare ordinary NLL, symmetric Wasserstein-1 regularization, and NLL plus this loss at equal batch size and wall-clock budget. Measure violation probability P[X>Y], estimated gamma_hat, calibration error, and test NLL. A useful success signal is substantially lower directional violation and calibration error at matched NLL, without destabilizing training; in distributional RL, additionally test whether return distributions improve under stochastic dominance rather than merely having lower mean.

Verification

This idea has not been verified yet.

Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.

Artifacts

Artifacts unavailable.