Robust Conditional Risk Minimization

• Distributionally robust conditional risk minimization is a framework that optimizes worst-case risks conditioned on side information using ambiguity sets over conditional distributions.
• It encompasses diverse formulations including multi-source unsupervised domain adaptation, non-parametric local estimation, RKHS-based approaches, and worst-case CVaR, each addressing unique data uncertainties.
• Efficient optimization methods transform infinite-dimensional problems into tractable convex or structured nonconvex programs, supported by statistical guarantees under covariate shift and noise.

Distributionally robust conditional risk minimization studies decision and learning problems in which a model, estimator, or control policy minimizes a worst-case risk that is conditional on side information, conditional on a local covariate event, or defined through a conditional risk functional, while the data-generating law is only known to lie in an ambiguity set. In recent work, this paradigm appears in multi-source unsupervised domain adaptation through worst-case mixtures of source conditional outcome distributions (Guo et al., 14 Jul 2025), in local non-parametric conditional estimation through worst-case conditional expected loss over Wasserstein neighborhoods (Nguyen et al., 2020), in kernel-based decision making under conditional distributions represented by RKHS conditional mean operators (Chen et al., 2022), and in risk-sensitive estimation and stochastic optimization through worst-case conditional value-at-risk (CVaR) over Wasserstein balls (Taha et al., 20 Apr 2026, Cherukuri et al., 2020). Closely related constructions also arise in multistage optimization, where conditional distributionally robust risk functionals are defined via essential suprema of conditional expectations (Pichler et al., 2021).

1. Problem class and mathematical formulations

A central formulation replaces nominal conditional risk minimization by a minimax problem over an uncertainty class of conditional laws. In multi-source unsupervised domain adaptation, Conditional Group Distributionally Robust Optimization (CG-DRO) defines the target conditional as a convex combination of source conditionals,

$$\mathcal{C} = \left\{ (\mathbb{Q}_X, \mathbb{T}_{Y|X}) : \mathbb{T}_{Y|X} = \sum_{l=1}^L \gamma_l \mathbb{P}^{(l)}_{Y|X}, \; \gamma \in \Delta^L \right\},$$

and learns

$$\theta^* = \arg\min_{\theta} \max_{\gamma \in \Delta^L} \sum_{l=1}^L \gamma_l \mathbb{E}_{X \sim \mathbb{Q}_X} \mathbb{E}_{Y \sim \mathbb{P}^{(l)}_{Y|X}} \ell(X, Y; \theta),$$

with cross-entropy as the primary classification loss (Guo et al., 14 Jul 2025).

A second formulation arises in local conditional estimation, where the object of interest is a pointwise conditional statistic near a queried covariate value $x_0$. The proposed robust estimator minimizes worst-case conditional expected loss over a type-$\infty$ Wasserstein ball around the empirical measure,

$$\hat{\beta} \in \arg\min_{\beta} \sup_{\mathbb{Q} \in B^\infty_\rho,\ \mathbb{Q}(X \in N_\gamma(x_0)) > 0} \mathbb{E}_\mathbb{Q}\left[ \ell(Y, \beta) \mid X \in N_\gamma(x_0) \right],$$

so that the conditioning event is relaxed from $X=x_0$ to a neighborhood $X\in N_\gamma(x_0)$ (Nguyen et al., 2020).

A third formulation represents conditional distributions in an RKHS. Conditional kernel DRO (CKDRO) uses the conditional mean operator $\mu_{Y|x}$ and solves

$$\min_{\eta} \max_{\mu \in \mathcal{C}[x]} \langle \mu, q(\eta, \cdot) \rangle,$$

where $\mathcal{C}[x]$ is an RKHS ambiguity set centered at the empirical conditional mean embedding for the query $$\theta^* = \arg\min_{\theta} \max_{\gamma \in \Delta^L} \sum_{l=1}^L \gamma_l \mathbb{E}_{X \sim \mathbb{Q}_X} \mathbb{E}_{Y \sim \mathbb{P}^{(l)}_{Y|X}} \ell(X, Y; \theta),$$0 (Chen et al., 2022).

Conditionality also enters through the risk functional itself. In Wasserstein distributionally robust risk-sensitive estimation, the objective is

$$\theta^* = \arg\min_{\theta} \max_{\gamma \in \Delta^L} \sum_{l=1}^L \gamma_l \mathbb{E}_{X \sim \mathbb{Q}_X} \mathbb{E}_{Y \sim \mathbb{P}^{(l)}_{Y|X}} \ell(X, Y; \theta),$$1

with affine estimators $$\theta^* = \arg\min_{\theta} \max_{\gamma \in \Delta^L} \sum_{l=1}^L \gamma_l \mathbb{E}_{X \sim \mathbb{Q}_X} \mathbb{E}_{Y \sim \mathbb{P}^{(l)}_{Y|X}} \ell(X, Y; \theta),$$2, squared error loss, and a type-2 Wasserstein ambiguity set centered at a nominal distribution $$\theta^* = \arg\min_{\theta} \max_{\gamma \in \Delta^L} \sum_{l=1}^L \gamma_l \mathbb{E}_{X \sim \mathbb{Q}_X} \mathbb{E}_{Y \sim \mathbb{P}^{(l)}_{Y|X}} \ell(X, Y; \theta),$$3 (Taha et al., 20 Apr 2026). In risk-constrained stochastic optimization, the robust constraint takes the form

$$\theta^* = \arg\min_{\theta} \max_{\gamma \in \Delta^L} \sum_{l=1}^L \gamma_l \mathbb{E}_{X \sim \mathbb{Q}_X} \mathbb{E}_{Y \sim \mathbb{P}^{(l)}_{Y|X}} \ell(X, Y; \theta),$$4

which is the distributionally robust counterpart of a CVaR-constrained program under an unknown true law (Cherukuri et al., 2020).

In multistage settings, the static robust functional

$$\theta^* = \arg\min_{\theta} \max_{\gamma \in \Delta^L} \sum_{l=1}^L \gamma_l \mathbb{E}_{X \sim \mathbb{Q}_X} \mathbb{E}_{Y \sim \mathbb{P}^{(l)}_{Y|X}} \ell(X, Y; \theta),$$5

is extended to the conditional functional

$$\theta^* = \arg\min_{\theta} \max_{\gamma \in \Delta^L} \sum_{l=1}^L \gamma_l \mathbb{E}_{X \sim \mathbb{Q}_X} \mathbb{E}_{Y \sim \mathbb{P}^{(l)}_{Y|X}} \ell(X, Y; \theta),$$6

which re-assesses future risk after partial realizations and preceding decisions (Pichler et al., 2021). This construction is distinct from merely nesting a static law-invariant risk measure.

2. Ambiguity sets and conditional uncertainty representations

The literature differs primarily in how it parameterizes conditional uncertainty. Some methods place ambiguity directly on conditional outcome distributions, some robustify a conditional estimate, and some impose joint-distribution constraints that induce a conditional uncertainty class.

Setting	Ambiguity object	Key structure
CG-DRO (Guo et al., 14 Jul 2025)	Conditional outcome distributions	Convex combinations of source conditionals
CKDRO (Chen et al., 2022)	RKHS conditional mean embeddings	RKHS norm ball centered at $$\theta^* = \arg\min_{\theta} \max_{\gamma \in \Delta^L} \sum_{l=1}^L \gamma_l \mathbb{E}_{X \sim \mathbb{Q}_X} \mathbb{E}_{Y \sim \mathbb{P}^{(l)}_{Y|X}} \ell(X, Y; \theta),$$7
Local conditional estimation (Nguyen et al., 2020)	Joint laws near empirical data	Type-$$\theta^* = \arg\min_{\theta} \max_{\gamma \in \Delta^L} \sum_{l=1}^L \gamma_l \mathbb{E}_{X \sim \mathbb{Q}_X} \mathbb{E}_{Y \sim \mathbb{P}^{(l)}_{Y|X}} \ell(X, Y; \theta),$$8 Wasserstein ball with conditional event $$\theta^* = \arg\min_{\theta} \max_{\gamma \in \Delta^L} \sum_{l=1}^L \gamma_l \mathbb{E}_{X \sim \mathbb{Q}_X} \mathbb{E}_{Y \sim \mathbb{P}^{(l)}_{Y|X}} \ell(X, Y; \theta),$$9
Robust CVaR estimation (Taha et al., 20 Apr 2026)	Joint distributions of $x_0$0	Type-2 Wasserstein ball $x_0$1
Unlabeled-data DRL (Frogner et al., 2019)	Adversarial joint laws	Wasserstein ball intersected with feature-marginal and label-marginal constraints
Union-ball OT CRM (Xie et al., 27 Sep 2025)	Conditional distributions over outcomes	Union of Wasserstein balls over admissible centers and radii
Parametric likelihood-ratio DRO (Michel et al., 2022)	Likelihood ratios $x_0$2	Normalization and KL control via parametric adversaries

In CG-DRO, the uncertainty set is explicitly conditional: the target covariate marginal is $x_0$3, but the unknown target conditional is restricted to mixtures of source conditionals. This uses unlabeled target features to shape the risk and differs from traditional Group DRO, which considers uncertainty over joint distributions and assumes the target is some mixture over observed source domains (Guo et al., 14 Jul 2025).

CKDRO constructs

$x_0$4

where the radius depends on sample size, regularization, and the proximity of the query $x_0$5 to the observed covariates. The paper states that RKHS balls are analogous to, but tighter than, Wasserstein balls because the test functions are restricted to have finite RKHS norm (Chen et al., 2022).

The union-ball optimal transport framework introduces an ambiguity set of the form

$x_0$6

so both the empirical center and the transport radius vary over an admissible set $x_0$7. The paper states that this subsumes prior predict-then-robustify, full OT joint models, and partial transport constructions as special cases, while allowing arbitrary measurable conditioning sets and a broad class of risk functionals (Xie et al., 27 Sep 2025).

A different route constrains the adversary by marginal information. The unlabeled-data DRL formulation intersects a Wasserstein ball with a set $x_0$8 that fixes the feature marginal to the empirical distribution of unlabeled data and bounds the label marginal. The stated motivation is that conventional DRL can rely on an overly broad adversary and thereby produce classifiers unable to predict with confidence (Frogner et al., 2019).

Parametric likelihood-ratio DRO represents the adversarial distribution through a ratio $x_0$9, together with a normalization constraint $\infty$0 and a KL penalty $\infty$1. The paper emphasizes that this eliminates the need for explicit generative models and allows discriminative deep neural networks to parameterize the ratio (Michel et al., 2022).

3. Optimization methods and tractable reformulations

A recurring theme is that conditional robustness is initially infinite-dimensional, but can often be reduced to finite-dimensional convex or structured nonconvex programs.

CG-DRO develops an efficient Mirror Prox algorithm for the minimax problem and combines it with a double machine learning procedure to estimate the risk function. The stated purpose of the DML step is to ensure that nuisance-estimation errors enter only at higher-order rates under covariate shift, while Mirror Prox exploits the saddle-point geometry and the simplex structure of the adversarial weights $\infty$2 (Guo et al., 14 Jul 2025).

CKDRO dualizes the inner maximization over the RKHS ambiguity set and solves a finite-dimensional convex program. Its dual form is

$\infty$3

which amounts to searching for an affine upper bound on the cost function over $\infty$4 together with a margin determined by the ambiguity-set radius (Chen et al., 2022).

For local non-parametric conditional estimation, the worst-case conditional expected loss can be reduced to an explicit finite-dimensional computation involving the indices of points that can be adversarially moved into the conditioning neighborhood. The paper states that, for popular losses and norms, one obtains closed-form expressions for the inner maximization; for univariate $\infty$5, the resulting problem can be solved by Golden-section search, while for multivariate $\infty$6 it reduces to a second-order cone program (Nguyen et al., 2020).

In Wasserstein robust risk-sensitive estimation with CVaR, finitely supported nominal distributions yield an exact semidefinite programming reformulation. The paper gives an SDP in the variables $\infty$7, with linear matrix inequalities that are equivalent to the original minimax problem when the nominal distribution is empirical (Taha et al., 20 Apr 2026).

In motion control, Wasserstein DR-MPC with CVaR constraints is reformulated from an infinite-dimensional robust control problem to a finite-dimensional nonlinear program using Kantorovich duality, and a spatial branch-and-bound algorithm with McCormick relaxation is designed for globally optimal solution in the case of affine dynamics and output equations (Hakobyan et al., 2020).

Parametric likelihood-ratio DRO is optimized by combining mini-batch-level normalization, a KL penalty, and simultaneous gradient updates. For a mini-batch $\infty$8, the normalized ratio is

$\infty$9

and the practical RP-DRO objective is

$$\hat{\beta} \in \arg\min_{\beta} \sup_{\mathbb{Q} \in B^\infty_\rho,\ \mathbb{Q}(X \in N_\gamma(x_0)) > 0} \mathbb{E}_\mathbb{Q}\left[ \ell(Y, \beta) \mid X \in N_\gamma(x_0) \right],$$0

The paper argues that simultaneous updates improve stability and act as an implicit regularizer for adversarial learning in high-capacity settings (Michel et al., 2022).

The union-ball OT framework supports cutting-plane algorithms because each member of the union yields a tractable subproblem. The paper further states that, for convex, Lipschitz-continuous loss and $$\hat{\beta} \in \arg\min_{\beta} \sup_{\mathbb{Q} \in B^\infty_\rho,\ \mathbb{Q}(X \in N_\gamma(x_0)) > 0} \mathbb{E}_\mathbb{Q}\left[ \ell(Y, \beta) \mid X \in N_\gamma(x_0) \right],$$1 norm, the robust conditional risk reduces to

$$\hat{\beta} \in \arg\min_{\beta} \sup_{\mathbb{Q} \in B^\infty_\rho,\ \mathbb{Q}(X \in N_\gamma(x_0)) > 0} \mathbb{E}_\mathbb{Q}\left[ \ell(Y, \beta) \mid X \in N_\gamma(x_0) \right],$$2

illustrating the connection between conditional Wasserstein robustness and explicit regularization (Xie et al., 27 Sep 2025).

4. Statistical guarantees, consistency, and inference

The statistical theory of distributionally robust conditional risk minimization is heterogeneous because the sources of uncertainty vary: covariate shift, finite-sample conditional estimation error, misspecified label posteriors, and ambiguity about future distributions.

CG-DRO establishes fast statistical convergence rates by constructing two surrogate minimax optimization problems that act as theoretical bridges. The estimator is stated to achieve parametric rates of order $$\hat{\beta} \in \arg\min_{\beta} \sup_{\mathbb{Q} \in B^\infty_\rho,\ \mathbb{Q}(X \in N_\gamma(x_0)) > 0} \mathbb{E}_\mathbb{Q}\left[ \ell(Y, \beta) \mid X \in N_\gamma(x_0) \right],$$3 under realistic conditions, and a sharper bound of the form

$$\hat{\beta} \in \arg\min_{\beta} \sup_{\mathbb{Q} \in B^\infty_\rho,\ \mathbb{Q}(X \in N_\gamma(x_0)) > 0} \mathbb{E}_\mathbb{Q}\left[ \ell(Y, \beta) \mid X \in N_\gamma(x_0) \right],$$4

is given in the details. The paper also emphasizes nonstandard asymptotics: boundary effects and system instability can prevent convergence to a standard limiting distribution, which motivates a perturbation-based inference procedure providing uniformly valid confidence intervals and hypothesis tests (Guo et al., 14 Jul 2025).

For Wasserstein risk- and chance-constrained optimization, asymptotic consistency is available under continuity, convexity, uniform Lipschitz conditions, and shrinking ambiguity radii. If $$\hat{\beta} \in \arg\min_{\beta} \sup_{\mathbb{Q} \in B^\infty_\rho,\ \mathbb{Q}(X \in N_\gamma(x_0)) > 0} \mathbb{E}_\mathbb{Q}\left[ \ell(Y, \beta) \mid X \in N_\gamma(x_0) \right],$$5 is the optimal value under the true distribution and $$\hat{\beta} \in \arg\min_{\beta} \sup_{\mathbb{Q} \in B^\infty_\rho,\ \mathbb{Q}(X \in N_\gamma(x_0)) > 0} \mathbb{E}_\mathbb{Q}\left[ \ell(Y, \beta) \mid X \in N_\gamma(x_0) \right],$$6 is the optimal value of the distributionally robust problem with radius $$\hat{\beta} \in \arg\min_{\beta} \sup_{\mathbb{Q} \in B^\infty_\rho,\ \mathbb{Q}(X \in N_\gamma(x_0)) > 0} \mathbb{E}_\mathbb{Q}\left[ \ell(Y, \beta) \mid X \in N_\gamma(x_0) \right],$$7, then, almost surely, $$\hat{\beta} \in \arg\min_{\beta} \sup_{\mathbb{Q} \in B^\infty_\rho,\ \mathbb{Q}(X \in N_\gamma(x_0)) > 0} \mathbb{E}_\mathbb{Q}\left[ \ell(Y, \beta) \mid X \in N_\gamma(x_0) \right],$$8 for all sufficiently large $$\hat{\beta} \in \arg\min_{\beta} \sup_{\mathbb{Q} \in B^\infty_\rho,\ \mathbb{Q}(X \in N_\gamma(x_0)) > 0} \mathbb{E}_\mathbb{Q}\left[ \ell(Y, \beta) \mid X \in N_\gamma(x_0) \right],$$9, $X=x_0$0, and any accumulation point of robust optimizers solves the original problem (Cherukuri et al., 2020).

The local non-parametric conditional estimator admits a finite-sample probabilistic guarantee: with an appropriate Wasserstein radius, the robust objective upper-bounds the true conditional risk with high probability,

$X=x_0$1

and the paper discusses consistency in the non-robust limit $X=x_0$2 together with the possibility of inconsistency when $X=x_0$3 and $X=x_0$4 is fixed (Nguyen et al., 2020).

Incorporating unlabeled data into DRL yields a computable guarantee on future performance analogous to, but tighter than, conventional DRL. The dual objective $X=x_0$5 upper-bounds the true risk when the adversarial set contains the true distribution, with an $X=x_0$6 term due to finite-sample estimation of the feature marginal (Frogner et al., 2019).

For motion control, a Wasserstein ambiguity set provides a non-asymptotic finite-sample out-of-sample probabilistic safety guarantee: with an appropriate radius, the true disturbance law is contained in the ambiguity set with high probability, and the resulting controller limits the out-of-sample CVaR of the safety loss (Hakobyan et al., 2020).

The deep-learning likelihood-ratio formulation does not claim a tight minimax optimality guarantee in the non-convex setting. Instead, it states that the likelihood-ratio formulation is mathematically equivalent to constrained DRO when distributions are absolutely continuous with respect to the data, and that simultaneous gradient updates converge to the saddle point in convex-concave cases such as linear model and adversary classes (Michel et al., 2022).

5. Empirical behavior and application regimes

Empirical work spans domain adaptation, subpopulation shift, high-stakes forecasting, energy scheduling, robotics, portfolio optimization, and learning from noisy labels.

On subpopulation-shift benchmarks in image and text classification, RP-DRO is reported to improve robust subpopulation accuracy over ERM, nonparametric DRO baselines, and prior parametric generative DRO. The details give concrete examples: on BiasedSST, robust accuracy is reported as ERM 2.15%, P-DRO 34.98%, RP-DRO 50.70%, and Oracle DRO 67.71%; on CelebA, robust accuracy is ERM 40.33%, NonParam-KL 43.33%, RP-DRO 55.78%, and Oracle DRO 89.22%. The same paper states that RP-DRO is notably more resilient to label noise, whereas nonparametric adversaries degrade sharply when noise is added (Michel et al., 2022).

In multi-source unsupervised domain adaptation, CG-DRO is described as better handling domain heterogeneity than both Group DRO and standard ERM, especially when unlabeled target covariates are available. The paper attributes this to the focus on conditional mixtures and direct target-domain adaptation under covariate shift (Guo et al., 14 Jul 2025).

In electricity price forecasting, Wasserstein DR-CVaR and DR-MSE are both computed from the same SDP for varying radii $X=x_0$7, but DR-CVaR is reported to achieve lower out-of-sample CVaR of squared error across all $X=x_0$8. The study also reports that DR-CVaR makes more accurate predictions on days with extreme price spikes, while incurring a slight loss in average accuracy on more typical days (Taha et al., 20 Apr 2026).

CKDRO is applied to a generation scheduling problem in which electricity demand depends on weather. The reported outcome is that CKDRO is superior to common benchmarks in terms of quality and robustness, with nominal cost close to kernel interpolation and optimal cost, and worst-case cost lower than kernel interpolation and naive averaging (Chen et al., 2022).

In robot motion planning, DR-MPC is validated on a nonlinear car-like vehicle model and a linearized quadrotor model. The paper reports that even with small sample sizes $X=x_0$9, DR-MPC satisfies risk constraints for collision avoidance, whereas the sample-average approach may fail and lead to unsafe operation (Hakobyan et al., 2020).

The union-ball OT framework is demonstrated on portfolio allocation with rank-dependent expected utility. The paper states that conditional models converge to optimal solutions where unconditional ones clearly do not, and that the union-ball conditional DRO yields lower and more stable out-of-sample conditional risk than unconditional and plug-in conditional baselines (Xie et al., 27 Sep 2025).

For learning from noisy annotations, conditional DRO over estimated true-label posteriors leads to a robust pseudo-labeling algorithm based on the likelihood ratio test. The paper reports superiority on both synthetic and real-world datasets, particularly in high-noise and sparse-annotation regimes (Guo et al., 2024).

6. Conceptual distinctions, recurring pitfalls, and open directions

A first distinction is between conditional and unconditional ambiguity. Traditional Group DRO is described as operating on mixtures of joint distributions and not using unlabeled target covariates, whereas CG-DRO restricts uncertainty to conditional outcome distributions given target features. The stated consequence is less over-conservatism and better adaptation under covariate shift (Guo et al., 14 Jul 2025).

A second distinction concerns conditional robust functionals versus nested risk measures. In multistage optimization, the conditional functional

$X\in N_\gamma(x_0)$0

is not, in general, equal to the nested analogue obtained by repeated application of law-invariant conditionals. The paper states that the two coincide only in special rectangular cases, where ambiguity factors across stages and dynamic programming decomposition is available (Pichler et al., 2021).

A third issue is adversary calibration. The unlabeled-data DRL paper argues that standard DRL formulations may define an overly broad adversarial set and thereby produce trivial or low-confidence classifiers. Constraining the feature marginal with unlabeled data and bounding the label marginal narrows the adversary and yields tighter non-vacuous guarantees (Frogner et al., 2019). A related point appears in parametric likelihood-ratio DRO: structured adversaries based on discriminative likelihood ratios, mini-batch normalization, KL control, and simultaneous updates are reported to focus on systematic group skew rather than isolated hard examples or label noise (Michel et al., 2022).

A fourth distinction concerns the object of robustness. In some formulations the ambiguity is over conditional distributions given side information; in others, the performance criterion is itself a conditional or tail risk such as CVaR. The electricity-forecasting study shows that directly minimizing worst-case CVaR is not equivalent to minimizing worst-case mean squared error and then evaluating tail risk afterward, because DR-CVaR consistently attains lower out-of-sample CVaR than DR-MSE (Taha et al., 20 Apr 2026).

Finally, recent OT-based work emphasizes that prior conditional DRO methods remained fragmented: some relied on point estimates, some only handled narrow classes of risk measures, and their structural relations were unclear. The union-ball formulation is proposed precisely to expose those relations and provide convex reformulations for expectation, mean-variance, mean-CVaR, shortfall, and general distortion or rank-dependent utility (Xie et al., 27 Sep 2025). This suggests that the main unresolved design choice in distributionally robust conditional risk minimization is not merely the radius of the ambiguity set, but the conditional structure over which robustness is imposed.