DR Covariate Shift Adaptation

• DR Covariate Shift Adaptation is a method that exploits low-dimensional invariant representations to address both covariate and concept shifts caused by unobserved confounders.
• It uses a structural causal model and an optimization framework on the Stiefel manifold to obtain invariant subspaces that ensure reliable risk transfer between source and target domains.
• The approach balances predictive accuracy and stability through regularized ridge regression and Riemannian gradient descent, with theoretical guarantees on excess risk bounds.

Dimensionality-Reduction Covariate Shift Adaptation (DR Covariate Shift Adaptation) addresses the generalization failure that arises when models trained in a labeled source domain must be deployed in a target domain where the joint covariate–response law has shifted, and the only available target data are unlabeled samples from the shifted covariate distribution. The DR variant of covariate shift adaptation specifically exploits low-dimensional, invariant representations to mitigate both covariate and concept shift—particularly when distributional changes are driven by unobserved confounders. The methodology is rooted in a structural-causal framework, providing guarantees for risk transfer, optimization landscape, and practical algorithms for subspace discovery.

1. Problem Setting: Covariate and Concept Shift with Unobserved Confounding

The DR covariate shift adaptation setting formalizes two domains:

• Source domain S: joint distribution $P_S(X, Y)$, with labeled samples $(X, Y)$.
• Target domain T: marginal distribution $P_T(X)$, with unlabeled samples $X$.

The predictor $Y = f(X)$ developed from $S$ must be robust to shifted covariate distribution in $T$ and potential changes in the optimal conditional $P(Y|X)$ (concept shift). The key generative ingredients are:

• $X \in \mathbb{R}^d$, $Y \in \mathbb{R}$.
• Unobserved confounder $(X, Y)$0, with $(X, Y)$1 in $(X, Y)$2 and $(X, Y)$3 in $(X, Y)$4.
• Invariant (exogenous, instrument-like) latent $(X, Y)$5, and independent noise variables $(X, Y)$6, $(X, Y)$7, all mutually independent and zero-mean.

The crux is that $(X, Y)$8 shifts distributionally between $(X, Y)$9 and $P_T(X)$0, leading to both covariate shift ($P_T(X)$1 due to $P_T(X)$2) and concept shift (altered $P_T(X)$3 via $P_T(X)$4).

2. Structural Causal Model and Invariant Subspace Formalism

The problem is formalized via a linear structural causal model (SCM):

• $P_T(X)$5
• $P_T(X)$6

Here, $P_T(X)$7 and $P_T(X)$8 have orthonormal columns so that $P_T(X)$9 is orthonormal. The confounder $X$0 has domain-dependent second-moment: $X$1, $X$2.

A linear subspace $X$3 ($X$4, $X$5) is called invariant if the conditional expectation $X$6 is identical in both domains. This is achieved if and only if $X$7 projects entirely orthogonally to the confounder subspace, i.e., $X$8.

Equivalently, the invariance condition $X$9 (where $Y = f(X)$0) holds when projecting $Y = f(X)$1 onto $Y = f(X)$2, thus “dodging” the shift-prone confounder directions.

3. Optimization Formulation: Predictability–Stability Tradeoff on the Stiefel Manifold

To construct an invariant, predictive subspace, one seeks $Y = f(X)$3 (the Stiefel manifold of $Y = f(X)$4-frames in $Y = f(X)$5) and regression parameters $Y = f(X)$6 that jointly minimize: $Y = f(X)$7

• The first term enforces source-domain predictive accuracy.
• The second term is $Y = f(X)$8 regularization (ridge penalty).
• The third term penalizes deviation from invariance by penalizing the subspace where the second-moment shift is large.

The minimization is non-convex due to the Stiefel constraint. The solution for $Y = f(X)$9 at fixed $S$0 is the standard ridge-regression: $S$1 The outer minimization

$S$2

constitutes the DR adaptation procedure.

4. Optimization Landscape and Invariance Guarantees

Denoting $S$3 and the “endogenous” confounder subspace $S$4, the geometry of local minima is characterized as follows:

• Any first-order stationary point $S$5 (not fully collapsed onto $S$6) obeys $S$7. Thus, with sufficiently large $S$8, $S$9, and the learned subspace is nearly orthogonal to the confounder span.
• The optimization landscape is benign in that almost all local minima correspond to invariant subspaces, provided the stability regularization is high enough.

This ensures that, except in degenerate cases, the iterative optimization will converge to subspaces that are both predictive and maximally invariant to confounding-induced drift.

5. Generalization Properties and Excess Risk Bounds

Write $T$0, let $T$1 be the “oracle” weight combining structural and confounder effects. The learned predictor $T$2 enjoys a risk gap bound, proven as: $T$3 As $T$4, the second term vanishes, and the model attains the best-possible difference between target and source risk according to the underlying SCM. This bound confirms that by coupling predictability (empirical risk) and invariance (covariate stability), dimensionality-reduced models can nearly achieve the ideal adaptation gap, even under shifting confounding.

6. Practical Algorithm and Implementation Aspects

Riemannian gradient descent on the Stiefel manifold is deployed for optimization. At each iteration:

1. Compute the current ridge regression $T$5 for the projection $T$6.
2. Form the Euclidean gradient $T$7 of the objective, then project onto the Stiefel tangent space: $T$8.
3. Update $T$9 by a polar-factor retraction:

$P(Y|X)$0

with Armijo line search for $P(Y|X)$1.

1. Terminate when gradient norm falls below a threshold.

Final output: the DR-adapted predictor $P(Y|X)$2.

Table: Key Elements of the DR Covariate Shift Adaptation Algorithm

Step	Description	Key Object
Invariance	$P(Y|X)$3	Subspace orthogonal to $P(Y|X)$4
Objective	Predictability + stability (see above)	$P(Y|X)$5
Optimization	Riemannian gradient descent, Stiefel constraint	$P(Y|X)$6
Risk guarantee	Oracle gap $P(Y|X)$7	Source/target risk gap

Hyperparameters:

• Stability coefficient $P(Y|X)$8 controls the invariance strength; cross-validation over a held-out set and estimated invariance $P(Y|X)$9 can guide tuning.
• Regularization $X \in \mathbb{R}^d$0 balances overfitting/underfitting in the projected regression.

Generalization to non-linear representations is possible by replacing linear projections $X \in \mathbb{R}^d$1 with $X \in \mathbb{R}^d$2 (e.g., a neural net), in which case the invariance penalty becomes a kernel Maximum Mean Discrepancy (MMD) or Wasserstein term; optimization then proceeds via (stochastic) Riemannian SGD.

7. Limitations, Extensions, and Theoretical Implications

Several considerations and potential limitations are noted:

• The invariance notion is only as rich as the subspace and the SCM: if $X \in \mathbb{R}^d$3 affects $X \in \mathbb{R}^d$4 in the target directly (beyond $X \in \mathbb{R}^d$5), invariance may not suffice.
• Very large $X \in \mathbb{R}^d$6 enforces invariance at possible cost to source predictability; balance is data-dependent.
• The model assumes linear SCM; in highly non-linear settings, further representational learning is required.
• For high-dimensional $X \in \mathbb{R}^d$7, estimation of $X \in \mathbb{R}^d$8 and $X \in \mathbb{R}^d$9 and effective dimension-reduction are critical bottlenecks.
• The approach requires access to sufficient unlabeled target samples to estimate $Y \in \mathbb{R}$0 accurately.

Nonetheless, the method provides both theoretical guarantees and empirical validation on real datasets, supporting its role as a robust DR principle for covariate and concept shift adaptation (Dharmakeerthi et al., 2024). It unifies causality, invariance, and dimension reduction in a principled, optimization-friendly framework for domain adaptation.