Wasserstein Distributionally Robust Regret Optimization

• Wasserstein DRRO is a robust decision framework that employs Wasserstein ambiguity sets and regret measures to evaluate performance against the best possible action under uncertainty.
• It encompasses various formulations including single-stage linear problems, static ex-ante stochastic optimization, control systems, and RLHF, each distinguished by its timing and geometry of regret benchmarking.
• Research in DRRO highlights computational challenges and tractable cases, emphasizing its potential to align robust optimization with relative performance metrics.

Searching arXiv for papers on Wasserstein distributionally robust regret optimization and closely related formulations. arxiv_search(query="Wasserstein distributionally robust regret optimization", max_results=10) arxiv_search(query="Distributionally Robust Regret Minimization Wasserstein", max_results=10) Wasserstein Distributionally Robust Regret Optimization (DRRO) denotes a family of minimax decision models in which ambiguity about a probability law is represented by a Wasserstein ball, while performance is measured by regret rather than raw loss or cost. The literature now contains several non-equivalent variants: single-stage ex post regret for linear objective uncertainty over type-1 Wasserstein balls; ex-ante regret over type-$p$ Wasserstein balls in static stochastic optimization; finite- and infinite-horizon control formulations over type-2 Wasserstein disturbance laws; and an RLHF formulation in which ambiguity is imposed on reward functions and reduced to promptwise $\ell_1$ perturbations (Bitar, 2024, Fiechtner et al., 15 Apr 2025, Taha et al., 2023, Hajar et al., 2023, Kargin et al., 2024, Yan et al., 13 Aug 2025, Wang et al., 30 Apr 2026). Across these variants, the defining feature is that the adversarial distribution is evaluated relative to the best action or policy for that same distribution, which separates DRRO from standard Wasserstein DRO.

1. Scope, terminology, and model classes

The expression “Wasserstein DRRO” does not identify a single canonical optimization problem. It covers a collection of models that share two ingredients: a Wasserstein ambiguity set and a regret benchmark. What changes across papers is the timing of the benchmark, the uncertainty object, and the decision class.

Setting	Regret benchmark	Ambiguity geometry
Single-stage linear decision problem	realized cost vs perfect-information minimum	type-1 Wasserstein ball around $P_0$
Static ex-ante stochastic optimization	expected loss vs distribution-specific Bayes optimum	$B_\delta^p(\mathbb{P}_0)$
Finite- or infinite-horizon control	causal policy vs optimal noncausal controller	type-2 Wasserstein ball on disturbance laws
RLHF promptwise model	policy value vs best policy under same perturbed reward	1-Wasserstein / promptwise $\ell_1$ ambiguity

This variation matters because ex post and ex ante regret are distinct objects. In the single-stage linear formulation, regret is realized after the uncertain coefficients are revealed; in the ex-ante static formulation, regret is defined as the gap in expected loss relative to the best decision for the same adversarial distribution; in control, regret is usually measured against a clairvoyant noncausal controller; and in RLHF, regret is measured against the best policy under the same plausible reward perturbation (Bitar, 2024, Fiechtner et al., 15 Apr 2025, Taha et al., 2023, Wang et al., 30 Apr 2026).

A recurring misconception is that replacing worst-case risk by worst-case regret is only a cosmetic change. A conceptually related non-Wasserstein learning-theoretic result shows that worst-case risk need not imply uniformly small regret under distribution shift: in the paper’s counterexample, $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{DRO}})=0.21$$ whereas $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{MRO}})=0.03$$ (Agarwal et al., 2022). This supports the central DRRO viewpoint that robustification should be applied to relative performance, not merely to absolute loss.

2. Canonical mathematical formulations

A basic ex post Wasserstein DRRO model is the single-stage linear decision problem with feasible set $\mathcal X\subseteq\mathbb R^n$, uncertain objective coefficients $w\in\mathbb R^n$, and realized cost $w^\top x$. The regret of choosing $\ell_1$0 after $\ell_1$1 is realized is

$\ell_1$2

With a type-1 Wasserstein ball

$\ell_1$3

the distributionally robust regret problem is

$\ell_1$4

Here $\ell_1$5 may be any probability measure with finite first moment, including an empirical distribution obtained from data (Bitar, 2024).

A distinct ex-ante static formulation defines regret at the distribution level. For loss $\ell_1$6, decision $\ell_1$7, and type-$\ell_1$8 Wasserstein ball

$\ell_1$9

the worst-case ex-ante regret is

$P_0$0

and Wasserstein DRRO is $P_0$1. The same paper distinguishes this from ex-post regret,

$P_0$2

and notes that ex-post regret does not recover ERM when $P_0$3, whereas ex-ante regret does (Fiechtner et al., 15 Apr 2025).

These formulations are related but not interchangeable. In the ex post linear model, the comparator depends on the realized scenario $P_0$4. In ex-ante DRRO, the comparator is the distribution-specific optimizer $P_0$5. In RLHF, the ex-ante comparator is a policy $P_0$6 maximizing value under the same perturbed reward distribution, and the problem becomes

$P_0$7

The formal similarity hides different tractability mechanisms and different geometric effects (Wang et al., 30 Apr 2026).

3. Regularization, geometry, and limiting behavior

A central single-stage result states that if $P_0$8 is nonempty and compact, then for any $P_0$9,

$B_\delta^p(\mathbb{P}_0)$0

Since $B_\delta^p(\mathbb{P}_0)$1 differs from $B_\delta^p(\mathbb{P}_0)$2 only by an $B_\delta^p(\mathbb{P}_0)$3-independent constant, the problem is equivalent to

$B_\delta^p(\mathbb{P}_0)$4

The induced regularizer is the radius of the smallest dual-norm ball centered at $B_\delta^p(\mathbb{P}_0)$5 that contains $B_\delta^p(\mathbb{P}_0)$6, so increasing the Wasserstein radius pulls solutions toward a feasible center rather than toward the origin. The same geometric term appears in worst-case CVaR of regret: $B_\delta^p(\mathbb{P}_0)$7 The paper also notes that this term coincides with the Lipschitz modulus of $B_\delta^p(\mathbb{P}_0)$8 with respect to the ground norm. By contrast, standard Wasserstein DRO for raw linear cost yields $B_\delta^p(\mathbb{P}_0)$9, which pulls toward the origin (Bitar, 2024).

Recent ex-ante analysis shows a different but related limiting picture. Under smoothness and regularity assumptions, the DRRO optimal value $\ell_1$0 satisfies

$\ell_1$1

If the ERM solution set $\ell_1$2 is a singleton, then $\ell_1$3, so DRRO coincides with ERM up to first-order terms. In the convex quadratic case with Euclidean transport, the equivalence is exact for all radii: if

$\ell_1$4

then the DRRO-optimal policy is

$\ell_1$5

for every $\ell_1$6, exactly as in ERM, and the regret is

$\ell_1$7

This establishes an exact ERM/DRRO coincidence in that class (Fiechtner et al., 15 Apr 2025).

These two strands are complementary. The ex post linear theory makes the regularization term explicit and geometric. The ex-ante static theory identifies when Wasserstein DRRO does not move the optimizer at first order, and when it never moves it at all.

4. Tractability, exact solvability, and hardness

Single-stage ex post DRRO is not uniformly easy. In general, evaluating

$\ell_1$8

is a norm maximization problem, and the paper remarks that such problems are NP-hard in general when $\ell_1$9 is a $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{DRO}})=0.21$$0-norm with $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{DRO}})=0.21$$1 and $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{DRO}})=0.21$$2 is a compact convex polytope in halfspace form. Two tractable cases are identified. If $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{DRO}})=0.21$$3, then

$$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{DRO}})=0.21$$4

and DRRO becomes a finite-dimensional convex program; with polyhedral norms it is an LP, with Euclidean norm an SOCP. If $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{DRO}})=0.21$$5, the regularizer admits a support-function reformulation valid for any nonempty compact $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{DRO}})=0.21$$6, yielding another finite-dimensional convex program when the support function is computable (Bitar, 2024).

For ex-ante Wasserstein DRRO, the computational picture is sharper. In the scalar newsvendor with loss $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{DRO}})=0.21$$7, the paper proves that the regret function $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{DRO}})=0.21$$8 is concave on $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{DRO}})=0.21$$9 and on $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{MRO}})=0.03$$0. Hence

$$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{MRO}})=0.03$$1

so exact regret evaluation reduces to maximizing two one-dimensional concave functions. This extends Wasserstein newsvendor tractability to the regret setting (Fiechtner et al., 15 Apr 2025).

Outside special structures, exact ex-ante computation is hard. For empirical reference distributions and max-affine losses, the same paper proves that evaluating $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{MRO}})=0.03$$2 is NP-hard in general, even when $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{MRO}})=0.03$$3, the ground norm is $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{MRO}})=0.03$$4, and the loss contains no bilinear $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{MRO}})=0.03$$5-$$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{MRO}})=0.03$$6 cross terms. The source of hardness is the supremum over the benchmark decision $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{MRO}})=0.03$$7, not the Wasserstein worst-case expectation alone. To address this, the paper proposes a convex relaxation obtained by replacing bilinear products $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{MRO}})=0.03$$8 with auxiliary variables $$\sup_{P\in\mathcal Q}\mathrm{Reg}_P(f_{\mathrm{MRO}})=0.03$$9 and perspective constraints. The relaxation is upper bounded by ex-post regret, and the paper reports that it improves over recent alternatives while remaining convex and broadly computable (Fiechtner et al., 15 Apr 2025).

A plausible implication is that Wasserstein DRRO inherits the classical tractability of Wasserstein DRO only when the regret benchmark preserves convex structure. Once the comparator is itself optimized against the same adversarial law, exact solvability becomes substantially more delicate.

5. Control formulations

Control-theoretic Wasserstein DRRO is organized around linear-quadratic systems and regret relative to a noncausal benchmark. In the finite-horizon full-information formulation, the system is

$\mathcal X\subseteq\mathbb R^n$0

the cost is quadratic, and the regret of a strictly causal linear disturbance-feedback controller $\mathcal X\subseteq\mathbb R^n$1 is

$\mathcal X\subseteq\mathbb R^n$2

where $\mathcal X\subseteq\mathbb R^n$3 is the optimal noncausal controller with perfect knowledge of the disturbance trajectory. With a type-2 Wasserstein ball around a nominal law $\mathcal X\subseteq\mathbb R^n$4 on the stacked disturbance trajectory, the minimax expected-regret problem admits an exact semidefinite reformulation, and the worst-case distribution is the push-forward of $\mathcal X\subseteq\mathbb R^n$5 through the linear map $\mathcal X\subseteq\mathbb R^n$6 (Taha et al., 2023).

Under partial observability, the benchmark cannot be a universally pointwise-optimal noncausal controller, and the measurement-feedback formulation instead uses the noncausal controller minimizing the Frobenius norm of the closed-loop transfer operator. The resulting finite-horizon Wasserstein DRRO-MF problem combines Wasserstein quadratic duality with a Youla-type parameterization and a suboptimal Nehari approximation, yielding an SDP for fixed $\mathcal X\subseteq\mathbb R^n$7 whose size is proportional to the time horizon (Hajar et al., 2023).

The infinite-horizon formulation replaces finite stacked disturbances by a stationary disturbance process and studies

$\mathcal X\subseteq\mathbb R^n$8

Here the ambiguity set allows time correlation. In the stationary limit, the problem becomes a saddle-point problem over covariance operators constrained by a Bures-Wasserstein ball,

$\mathcal X\subseteq\mathbb R^n$9

The optimal controller is causal, LTI, and stabilizing, but generally non-rational; the paper nevertheless shows that it is characterized by a finite-dimensional parameter and computes it through a frequency-domain Frank–Wolfe method with an $w\in\mathbb R^n$0 rate up to discretization error (Kargin et al., 2024).

A later output-feedback formulation uses purified outputs $w\in\mathbb R^n$1 and places a type-2 Wasserstein ball on the joint law of initial state, disturbances, and measurement noise. The paper derives strong duality results for general quadratic objectives, then eliminates first $w\in\mathbb R^n$2 and $w\in\mathbb R^n$3, and later the structured feedback variable $w\in\mathbb R^n$4, yielding a lower-dimensional SDP and an equivalent distributed optimization reformulation (Yan et al., 13 Aug 2025).

A closely related multistage ex-ante DRRO model studies finite-horizon LQR under a Gelbrich ball on the common stage-law moments. That paper states that the Gelbrich distance is a lower bound on squared $w\in\mathbb R^n$5-Wasserstein distance and coincides with it for elliptical distributions, in particular Gaussian laws. This suggests a moment-based Wasserstein-type relaxation rather than a full Wasserstein ball, but the resulting SDP and the strictly causal empirical-mean correction it identifies are directly relevant to multistage regret robustness (Fiechtner et al., 7 Apr 2026).

6. RLHF and reward misspecification

Wasserstein DRRO has also been formulated for reinforcement learning from human feedback, where the reward model is treated as a proxy for an unobserved true human-preference reward. In that setting, a policy $w\in\mathbb R^n$6 is evaluated under a distribution $w\in\mathbb R^n$7 over reward functions through

$w\in\mathbb R^n$8

and ex-ante DRRO is

$w\in\mathbb R^n$9

A key simplification is that $w^\top x$0 depends on $w^\top x$1 only through the mean reward $w^\top x$2. Starting from a 1-Wasserstein ambiguity set over reward-function distributions,

$w^\top x$3

the paper shows that $w^\top x$4, and then specializes to a promptwise ambiguity model

$w^\top x$5

For a fixed prompt with response simplex variable $w^\top x$6, proxy reward vector $w^\top x$7, and perturbation $w^\top x$8, the promptwise problem becomes

$w^\top x$9

The paper proves the exact inner solution

$\ell_1$00

with an adversary that can place all budget on a single coordinate. It then derives a water-filling optimal policy: $\ell_1$01 where $\ell_1$02 is defined through the threshold equations in the paper. As $\ell_1$03, the solution approaches the greedy policy $\ell_1$04; as $\ell_1$05, it approaches the uniform distribution (Wang et al., 30 Apr 2026).

The same work translates the exact promptwise theory into a PPO/GRPO-style algorithm. In the hard version, the “dangerous” sampled response receives a bonus $\ell_1$06; in the soft version, the bonus is weighted by self-normalized importance weights. A dynamic ambiguity budget,

$\ell_1$07

is motivated through a Donsker–Varadhan bound on reward misspecification. In the reported experiment, the main methods achieved the following peak held-out gold rewards: PPO $\ell_1$08, GRPO $\ell_1$09, DRO-RLHF $\ell_1$10, DRRO-RLHF (hard) $\ell_1$11, and DRRO-RLHF (soft + dynamic) $\ell_1$12; the corresponding peak proxy rewards were $\ell_1$13, $\ell_1$14, $\ell_1$15, $\ell_1$16, and $\ell_1$17, with peak KL values $\ell_1$18, $\ell_1$19, $\ell_1$20, $\ell_1$21, and $\ell_1$22 (Wang et al., 30 Apr 2026).

7. Statistical calibration, related frameworks, and boundaries

The direct statistical theory for Wasserstein DRRO is still fragmented, but adjacent Wasserstein-DRO results provide reusable tools. A general asymptotic analysis of Wasserstein DRO shows that if regret can be treated as a loss function $\ell_1$23, then the robust objective

$\ell_1$24

admits the standard dual reformulation

$\ell_1$25

The same work proposes a radius-calibration rule $\ell_1$26 for squared transport cost, more precisely $\ell_1$27, based on an optimal-transport projection argument. It also interprets Wasserstein robustness as adaptive variation regularization, a perspective that transfers naturally whenever regret is sufficiently smooth (Blanchet et al., 2021).

A residuals-based conditional Wasserstein DRO framework with covariates shows how a Wasserstein ball can be centered at an $\ell_1$28-specific residual-generated empirical distribution,

$\ell_1$29

with radius $\ell_1$30. This is not a regret paper, but it provides an explicit template for contextual Wasserstein DRRO by replacing cost with a benchmark-relative regret loss (Kannan et al., 2020).

Distributed Wasserstein DRO supplies another reusable template. In that setting, a samplewise loss $\ell_1$31 leads to the finite-dimensional robust objective

$\ell_1$32

together with per-sample adversarial variables and a saddle-point dynamics. This is not specifically regret-based, but it becomes directly relevant when regret is expressible as a samplewise loss (Cherukuri et al., 2017).

By contrast, online DRO over time with shrinking ambiguity sets develops dynamic regret bounds of order $\ell_1$33, but its main theory is not Wasserstein-based. It is best viewed as a template for online DRRO with evolving ambiguity rather than as a direct Wasserstein DRRO result (Aigner et al., 2023).

The current boundaries of Wasserstein DRRO are therefore sharp. Exact structure is available for single-stage linear ex-post regret, scalar newsvendor, quadratic control, and promptwise RLHF with $\ell_1$34 ambiguity. General max-affine ex-ante Wasserstein DRRO is NP-hard (Fiechtner et al., 15 Apr 2025). Several control results rely critically on linear-quadratic structure and quadratic Wasserstein duality (Taha et al., 2023, Hajar et al., 2023, Kargin et al., 2024, Yan et al., 13 Aug 2025). The RLHF formulation depends critically on promptwise $\ell_1$35 geometry for its coordinate-local adversary and sampled-bonus interpretation (Wang et al., 30 Apr 2026). A reasonable summary is that Wasserstein DRRO is now a well-defined research area, but not yet a uniform methodology: its most explicit results remain highly structure-dependent.