# Compensated Dominance OT Regularizer

- ID: 1608
- Canonical URL: https://synthcore.org/idea/1608/compensated-dominance-ot-regularizer
- API JSON: https://synthcore.org/api/idea/1608.json
- API Markdown: https://synthcore.org/api/idea/1608.md
- Verification status: unverified
- Source: [arXiv:2607.29560](https://arxiv.org/abs/2607.29560)
- Category: regularization
- Solves: accuracy, generalization, stability
- ML areas: loss, regularization, world-model
- Math tags: optimal-transport, probability, convex-analysis
- Ratings: usefulness 6/10; difficulty 4/10; novelty 7/10

## Idea description

Add a distribution-level loss that encourages a model's improved outputs \(Q\) to compensate for any regressions relative to baseline outputs \(P\). A weighted attribute decrease is allowed only when the coupled batch contains enough weighted increases, controlled by tolerance \(\gamma\); this is more expressive than requiring every attribute to improve independently.

## Mathematical statement

The paper defines a compensated stochastic dominance coupling between probability measures \(P\) and \(Q\) on \(D\subseteq\mathbb{R}^d\). For positive coordinate weights \(\beta_i>0\) and tolerance \(\gamma\in[0,1]\), a coupling \(\kappa\in\mathcal{C}(P,Q)\) is admissible when \(A(\kappa)\leq\gamma B(\kappa)\), where \(A(\kappa)=\int\sum_{i=1}^d\beta_i(x_i-y_i)_+\,d\kappa(x,y)\) is the weighted expected shortfall of \(Q\) relative to \(P\), \(B(\kappa)=\int\sum_{i=1}^d\beta_i(y_i-x_i)_+\,d\kappa(x,y)\) is the weighted expected improvement, \((u)_+=\max(u,0)\), and \(\mathcal{C}(P,Q)\) is the set of couplings with marginals \(P\) and \(Q\). At \(\gamma=0\), admissibility requires coordinatewise dominance almost surely. For empirical minibatches \(x_1,\ldots,x_n\sim P\) and model outputs \(y_1,\ldots,y_m\sim Q_\theta\), use a transport matrix \(\pi\in\Pi(a,b)\), with row marginals \(a\), column marginals \(b\), and cost \(C_{jk}=\sum_i\beta_i[(x_{j,i}-y_{k,i})_+-\gamma(y_{k,i}-x_{j,i})_+]\). The minimum value of \(\langle\pi,C\rangle\) is the empirical compensated-dominance margin: nonpositive means the batch admits a CSD coupling, while positive values quantify violation.

## Key formulas

- $$\int_{D\times D}\sum_{i=1}^{d}\beta_i(x_i-y_i)_+\,\kappa(dx,dy)\leq\gamma\int_{D\times D}\sum_{i=1}^{d}\beta_i(y_i-x_i)_+\,\kappa(dx,dy).$$
- $$A(\kappa)=\int\sum_{i=1}^{d}\beta_i(x_i-y_i)_+\,d\kappa,\qquad B(\kappa)=\int\sum_{i=1}^{d}\beta_i(y_i-x_i)_+\,d\kappa,\qquad A(\kappa)-\gamma B(\kappa)\leq 0.$$
- $$C_{jk}=\sum_{i=1}^{d}\beta_i\left[(x_{j,i}-y_{k,i})_+-\gamma(y_{k,i}-x_{j,i})_+\right],\qquad \pi^\varepsilon=\arg\min_{\pi\in\Pi(a,b)}\left\{\langle\pi,C\rangle+\varepsilon\sum_{j,k}\pi_{jk}(\log\pi_{jk}-1)\right\}.$$
- $$\mathcal{L}_{\mathrm{CSD}}(\theta)=\operatorname{softplus}\left(\frac{\langle\pi^\varepsilon,C\rangle}{\tau}\right),\qquad \mathcal{L}=\mathcal{L}_{\mathrm{task}}+\lambda\mathcal{L}_{\mathrm{CSD}}.$$

## Implementation notes

(1) Integration point: apply this as an auxiliary loss to a model that outputs a vector of \(d\) attributes, scores, or metrics. Let \(x_j\) be detached baseline outputs, such as outputs from a frozen reference model or historical policy, and let \(y_k=f_\theta(z_k)\) be current-model outputs on the same or bootstrapped inputs. Use this beside the ordinary supervised, preference, or reconstruction loss. Normalize each attribute before computing the transport cost and choose \(\beta_i\) from business importance or inverse training-set scale.

(2) Pseudocode:
```
X = stop_gradient(reference_outputs)       # [n,d]
Y = current_model_outputs                  # [m,d]
C[j,k] = sum_i beta[i] * (relu(X[j,i]-Y[k,i])
                          - gamma*relu(Y[k,i]-X[j,i]))
pi = sinkhorn(C, row_marginals=ones(n)/n,
              col_marginals=ones(m)/m, epsilon=eps)
margin = sum_jk(pi[j,k] * C[j,k])
loss_csd = softplus(margin / tau)
loss = task_loss + lambda * loss_csd
backprop(loss)
```
The formula for \(C_{jk}\) is the empirical version of \(A-\gamma B\); Sinkhorn computes the entropically regularized coupling \(\pi^\varepsilon\). Use log-domain Sinkhorn for numerical stability, and periodically evaluate a low-entropy transport solve to check whether the apparent certificate survives entropy smoothing.

(3) Computed from the mathematics: the asymmetric shortfall/improvement cost, the admissible coupling constraints, and the CSD margin. Estimated empirically: the distributions \(P,Q\), attribute scales, and minibatch transport approximation. Anneal \(\varepsilon\) from a relatively large value to a smaller value, and optionally increase \(\lambda\) only after the task loss has begun decreasing.

(4) First experiment: train a small multilayer perceptron on a synthetic multi-objective regression problem with three correlated attributes, comparing the baseline task loss against baseline plus CSD loss for \(\gamma\in\{0,0.1,0.25,0.5\}\). Include a deliberately conflicting objective where improving one attribute can slightly hurt another. Measure task loss, held-out empirical CSD margin, the fraction of test pairs violating each attribute, and Pareto-dominance success. The expected signal is a lower held-out CSD margin and improved Pareto performance at equal task loss, without the instability caused by hard coordinatewise constraints.

## Disclaimer

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