Deconfounding Factor Weighting (DFW)

• Deconfounding Factor Weighting is a framework of reweighting methods that reduce bias from confounders in observational studies and time-series models by adjusting the effective training distribution.
• Various implementations of DFW use inverse-propensity rules, bounded weight schemes, kernel-based balancing, and deconfounding summaries to improve covariate balance and control variance.
• Empirical results across simulated and real datasets show substantial gains, including up to 15–20% improvements in forecasting accuracy and lower variance in weights under differing overlap conditions.

Deconfounding Factor Weighting (DFW) denotes weighting procedures designed to attenuate confounding by altering the effective training or estimation distribution so that treatment, action, or exposure assignment is less entangled with observed covariates or latent confounders. In recent arXiv literature, the term appears in multiple, non-identical formulations: as a latent-variable inverse-propensity scheme for multivariate time-series forecasting in dynamic human–robot interaction, as a bounded propensity-score transformation for observational treatment-effect estimation, and as a broader principle encompassing overlap-improving representations, independence weights for continuous treatments, mean-balancing weights, and kernel-based direct balancing (Gao et al., 2024, Khan et al., 7 Aug 2025, D'Amour et al., 2021, Huling et al., 2021, Shinkre et al., 2024, De et al., 19 Dec 2025). This suggests that DFW is best understood not as a single universally fixed estimator but as a family of deconfounding reweighting constructions organized around a common causal objective: reducing bias from confounding while controlling variance and preserving the target estimand.

1. Core idea and formal variants

Across the cited formulations, DFW modifies either a predictive loss or an effect-estimation objective by assigning weights to observations, time steps, or treatment coordinates. The immediate aim differs by setting. In time-series prediction, the weights are attached to per-step losses to remove hidden-confounder bias. In observational causal inference, the weights construct a pseudo-population that better approximates a randomized controlled trial. In continuous-treatment settings, the weights are chosen so that treatment and covariates become independent on the weighted sample. In direct balancing approaches, the weights are obtained by solving an optimization problem that explicitly minimizes distributional imbalance rather than inverting a parametric propensity model (Gao et al., 2024, Khan et al., 7 Aug 2025, Huling et al., 2021, De et al., 19 Dec 2025).

Setting	Weighting rule	Immediate objective
Multivariate time series	$w_{t j}=1/p(A_{t j}\mid X_t,U_t)$	Reweight each time step’s loss to remove hidden-confounder bias
Binary treatment	$w_i^{\rm DFW}=1-\hat e_i$	Bounded weights and improved covariate balance
Multi-treatment	$w_i^{\rm DFW}=1-\hat e_{i,t_i}$	Extension of bounded weighting to the received treatment
Continuous treatment	$w^\star=\arg\min \mathcal D_n(w)$, with $w_i\ge 0$ and $\sum_i w_i=n$	Make treatment and covariates independent on the weighted sample
High-dimensional direct balancing	Minimize kernel MMD objectives plus $(\lambda/2)\|w\|_2^2$	Balance treated and control distributions using a random-forest kernel

A recurring technical distinction concerns whether weighting is based on explicit propensity inversion. The time-series formulation uses inverse-propensity-type weights, whereas the 2025 binary-treatment DFW proposal explicitly states that it does not invert the propensity score and instead uses the shifted rule $1-\hat e_i$ (Gao et al., 2024, Khan et al., 7 Aug 2025). Related representation-based work further shifts the emphasis from direct weighting formulas to lower-dimensional deconfounding summaries that permit less extreme reduced propensities under weak overlap (D'Amour et al., 2021).

2. Latent-confounder weighting for multivariate time-series forecasting

In the time-series formulation, the observed data consist of covariates $X_t\in\mathbb R^d$, observed actions or treatments $A_t\in\mathbb R^k$, and a future outcome $w_i^{\rm DFW}=1-\hat e_i$0. Hidden confounders $w_i^{\rm DFW}=1-\hat e_i$1—denoted $w_i^{\rm DFW}=1-\hat e_i$2 in the source paper—affect both $w_i^{\rm DFW}=1-\hat e_i$3 and $w_i^{\rm DFW}=1-\hat e_i$4. DFW proceeds in two stages. Stage 1 infers a time series of latent variables $w_i^{\rm DFW}=1-\hat e_i$5 that capture hidden confounders via a factor model such as an RNN or VAE. Stage 2 computes deconfounding weights

$w_i^{\rm DFW}=1-\hat e_i$6

for each action coordinate $w_i^{\rm DFW}=1-\hat e_i$7, and uses them to reweight the downstream forecasting loss (Gao et al., 2024).

The estimation procedure is explicit. An RNN encoder updates

$w_i^{\rm DFW}=1-\hat e_i$8

or uses the mean of a Gaussian VAE. A separate propensity model is then fit for each action coordinate,

$w_i^{\rm DFW}=1-\hat e_i$9

and the corresponding weights are

$w_i^{\rm DFW}=1-\hat e_{i,t_i}$0

The forecasting network $w_i^{\rm DFW}=1-\hat e_{i,t_i}$1, implemented for example as an LSTM or Transformer, is trained by minimizing

$w_i^{\rm DFW}=1-\hat e_{i,t_i}$2

where $w_i^{\rm DFW}=1-\hat e_{i,t_i}$3 may be squared error and the latent regularizer penalizes degenerate encodings of $w_i^{\rm DFW}=1-\hat e_{i,t_i}$4 (Gao et al., 2024).

The framework is explicitly model-agnostic at the forecasting stage. Once $w_i^{\rm DFW}=1-\hat e_{i,t_i}$5 and weights $w_i^{\rm DFW}=1-\hat e_{i,t_i}$6 are available, they can be fed into an LSTM, iTransformer, TimesNet, Transformer, or Nonstationary Transformer. During training, each time step’s contribution to the loss is multiplied by the corresponding weight so that the net effect of hidden confounders is removed. Under overlap and sequential ignorability, the formulation states that reweighting by $w_i^{\rm DFW}=1-\hat e_{i,t_i}$7 makes the weighted distribution of $w_i^{\rm DFW}=1-\hat e_{i,t_i}$8 unconfounded, written as $w_i^{\rm DFW}=1-\hat e_{i,t_i}$9 and $w^\star=\arg\min \mathcal D_n(w)$0 given weighting by $w^\star=\arg\min \mathcal D_n(w)$1 (Gao et al., 2024).

Empirically, the reported gains are substantial. On simulated and real datasets, including T-Drive taxi GPS, applying DFW yields a 5–10% reduction in MSE or RMSE versus the same model trained without weights, particularly large gains of up to 15–20% in long-horizon forecasts with $w^\star=\arg\min \mathcal D_n(w)$2, and improved $w^\star=\arg\min \mathcal D_n(w)$3-scores in latent confounder recovery. One example given is a Nonstationary Transformer with deconfounding achieving $w^\star=\arg\min \mathcal D_n(w)$4 versus $w^\star=\arg\min \mathcal D_n(w)$5 without deconfounding at history $w^\star=\arg\min \mathcal D_n(w)$6 and future $w^\star=\arg\min \mathcal D_n(w)$7 (Gao et al., 2024).

3. Bounded DFW for binary and multi-treatment effect estimation

A distinct formulation defines DFW for observational causal inference with binary treatments. Here the central quantity is the propensity score $w^\star=\arg\min \mathcal D_n(w)$8. The proposal is motivated by two standard comparators. Inverse Probability Weighting uses

$w^\star=\arg\min \mathcal D_n(w)$9

and Covariate Balancing Propensity Score minimizes a balance criterion over a parametric propensity model. Both can inherit the unbounded-weight problem when overlap is poor (Khan et al., 7 Aug 2025).

DFW introduces the deconfounding factor

$w_i\ge 0$0

and sets the binary-treatment weight to

$w_i\ge 0$1

The formulation emphasizes that it does not invert the propensity score; it simply shifts it by one. Since $w_i\ge 0$2, the weights satisfy

$w_i\ge 0$3

which rules out extreme weights. A second-order Taylor comparison is used to argue that $w_i\ge 0$4, and empirically DFW achieves lower coefficient of variation in weights than IPW for approximately 75% of sample combinations, reported more precisely as 74.8% of all 6-tuple CV comparisons (Khan et al., 7 Aug 2025).

The implementation is intentionally simple. A classifier $w_i\ge 0$5 estimates $w_i\ge 0$6; the weights are set to $w_i\ge 0$7; an outcome model $w_i\ge 0$8 is trained or evaluated under the weighted loss

$w_i\ge 0$9

The stated computational complexity is $\sum_i w_i=n$0 when logistic regression is used for propensity estimation and linear or comparably structured weighted regression is used for outcome modeling. This is on par with IPW and Overlap Weighting and substantially cheaper than CBPS’s iterative moment solver (Khan et al., 7 Aug 2025).

The theoretical claims are framed under SUTVA, unconfoundedness, and overlap. Under these assumptions, reweighting the observed outcomes by $\sum_i w_i=n$1 recovers an unbiased ATE. The method also extends naturally to multi-treatment settings: with a $\sum_i w_i=n$2-class classifier estimating $\sum_i w_i=n$3 and observed treatment $\sum_i w_i=n$4, the weight becomes

$\sum_i w_i=n$5

Boundedness and variance-reduction arguments are stated to hold component-wise (Khan et al., 7 Aug 2025).

The empirical evaluation spans IHDP, Jobs, and synthetic linear and non-linear data. The reported results include all covariates achieving $\sum_i w_i=n$6 on IHDP and Jobs, ECDF curves for treated and control nearly coinciding, K-S statistics that match or beat Overlap on most features and have narrower confidence intervals than IPW or CBPS, and the lowest $\sum_i w_i=n$7 and PEHE in both linear and non-linear outcome models. On synthetic data, DFW is reported to have the lowest ATE bias in every linear and non-linear scenario and the smallest distributional imbalance across low, moderate, and high bias settings (Khan et al., 7 Aug 2025).

4. Deconfounding scores, overlap, and reduced propensity representations

A related but conceptually distinct development is the notion of a deconfounding score. A function $\sum_i w_i=n$8 is a deconfounding score for the ATE if

$\sum_i w_i=n$9

The propensity score $(\lambda/2)\|w\|_2^2$0 and the prognostic scores $(\lambda/2)\|w\|_2^2$1 are special cases, but a deconfounding score need not render $(\lambda/2)\|w\|_2^2$2 independent of $(\lambda/2)\|w\|_2^2$3. Instead, it preserves just enough information to leave the target estimand unchanged while potentially discarding information that harms overlap (D'Amour et al., 2021).

The key identification result is a zero-covariance condition. Under unconfoundedness with respect to the original covariates $(\lambda/2)\|w\|_2^2$4, the reduction bias induced by replacing $(\lambda/2)\|w\|_2^2$5 with $(\lambda/2)\|w\|_2^2$6 is characterized through

$(\lambda/2)\|w\|_2^2$7

and a necessary and sufficient identifiable condition for $(\lambda/2)\|w\|_2^2$8 to be deconfounding is that these conditional covariances vanish for $(\lambda/2)\|w\|_2^2$9. This shifts the design problem from estimating a high-dimensional propensity model to constructing a low-dimensional representation that preserves causal identification while improving overlap (D'Amour et al., 2021).

In the Gaussian-linear specialization, with $1-\hat e_i$0 and linear score $1-\hat e_i$1, the zero-covariance condition reduces to a bilinear constraint

$1-\hat e_i$2

whose solution set is characterized by a hyperbola. The two extreme points correspond to the propensity score and the prognostic score. Intermediate choices interpolate between them and are described as improving overlap without introducing bias. Weighting estimators then use the reduced propensity

$1-\hat e_i$3

inside IPW or AIPW, for example in ATT estimation (D'Amour et al., 2021).

The simulation evidence is explicitly oriented toward weak-overlap regimes. In low-overlap settings, the prognostic-score extreme AIPW-$1-\hat e_i$4 attains the lowest RMSE among the compared methods. The paper’s bias-variance analysis further reports that classical regularization of $1-\hat e_i$5 reduces variance at the cost of large bias, whereas deconfounding scores reduce variance with negligible bias. The source also identifies open questions, including theory beyond the Gaussian-linear setting and semiparametric efficiency (D'Amour et al., 2021).

5. Continuous treatments and independence-based weighting

For continuous treatments, the adjacent DFW principle is to choose weights so that, on the re-weighted sample, the treatment $1-\hat e_i$6 is approximately independent of the covariates $1-\hat e_i$7. This principle is operationalized through a criterion based on weighted distance covariance and energy distances. With nonnegative weights summing to $1-\hat e_i$8, the objective is

$1-\hat e_i$9

where $X_t\in\mathbb R^d$0 is the weighted distance covariance and the $X_t\in\mathbb R^d$1 terms are energy distances between weighted and empirical marginals. The criterion is nonnegative and equals zero if and only if the weighted empirical joint CDF factorizes and the marginals match exactly (Huling et al., 2021).

The resulting estimator, DCOW, solves

$X_t\in\mathbb R^d$2

or the penalized version

$X_t\in\mathbb R^d$3

The optimization is a convex quadratic program in $X_t\in\mathbb R^d$4 variables, with precomputation of pairwise distances taking $X_t\in\mathbb R^d$5 and worst-case QP solution cost roughly $X_t\in\mathbb R^d$6, though modern solvers can exploit structure (Huling et al., 2021).

The theoretical guarantees are stronger than mere finite-sample balancing heuristics. Under finite-moment conditions, asymptotic independence is established in the sense that the weighted empirical joint CDF factorizes. Under standard smoothness and kernel conditions, the weighted Nadaraya–Watson estimator is consistent for the mean potential outcome $X_t\in\mathbb R^d$7. With an additional outcome regression, the doubly robust estimator is asymptotically normal at the usual $X_t\in\mathbb R^d$8 rate with efficient variance (Huling et al., 2021).

The numerical experiments include NMES simulations with continuous smoking exposure and MIMIC data on mechanical power in mechanically ventilated ICU patients. In the NMES study, DCOW gives the lowest mean absolute bias and integrated RMSE among all non-doubly-robust estimators at all reported sample sizes, and its doubly robust version is uniformly the best. In the MIMIC application, DCOW and DCOW(dm) achieve the best independence-and-effective-sample-size trade-off, and the estimated ADRF under DCOW has tight confidence intervals and shows a monotone increasing mortality risk in the upper range of mechanical power (Huling et al., 2021).

6. Direct balancing, regression-based formulations, and high-dimensional adaptivity

Another strand of the literature connects DFW-style weighting to the problem that OLS with covariate adjustment can produce a conditional-variance-weighted average of stratum-specific effects rather than the ATE. Grouping the Frisch–Waugh–Lovell weights by covariate strata yields

$X_t\in\mathbb R^d$9

rather than the natural ATE weights $A_t\in\mathbb R^k$0. The proposed remedy is to relax “single linearity” to “separate linearity,” meaning that each potential outcome is linear in $A_t\in\mathbb R^k$1 without requiring constant treatment effects. Under separate linearity, mean-balancing weights that satisfy

$A_t\in\mathbb R^k$2

yield the ATE through

$A_t\in\mathbb R^k$3

A standard construction solves an entropy-minimization problem, producing strictly positive smooth weights and a low-dimensional dual optimization over Lagrange multipliers (Shinkre et al., 2024).

High-dimensional nonparametric direct balancing pushes this logic further by replacing parametric moment balance with kernel balance derived from a multivariate random forest. The procedure first standardizes treatment and outcome, fits a forest to the bivariate response $A_t\in\mathbb R^k$4, constructs the similarity kernel

$A_t\in\mathbb R^k$5

and then solves a quadratic program minimizing the treated and control MMD objectives plus $A_t\in\mathbb R^k$6, subject to nonnegativity and within-arm normalization. Under SUTVA, strong unconfoundedness, positivity, continuity of $A_t\in\mathbb R^k$7, a universal positive-definite kernel, and a $A_t\in\mathbb R^k$8-Donsker RKHS unit ball, the resulting weights converge in $A_t\in\mathbb R^k$9 norm to normalized inverse-propensity weights, and the corresponding ATE estimator is consistent and asymptotically unbiased (De et al., 19 Dec 2025).

The simulation study for the random-forest-kernel method uses $w_i^{\rm DFW}=1-\hat e_i$00, $w_i^{\rm DFW}=1-\hat e_i$01, and three confounding designs, with 200 repetitions per design. The reported result is that RF Kernel MMD is uniformly lowest-bias across all settings, with especially large gains when $w_i^{\rm DFW}=1-\hat e_i$02 or nonlinear or discontinuous confounding is present, while remaining on par with outcome-adaptive lasso and logistic IPW under the purely linear model. In a real-data application to right-heart catheterization in 5,735 critically ill ICU patients with approximately 70 baseline covariates, the RF-kernel MMD estimate is $w_i^{\rm DFW}=1-\hat e_i$03 with bootstrap $w_i^{\rm DFW}=1-\hat e_i$04, compared with $w_i^{\rm DFW}=1-\hat e_i$05 for Gaussian Kernel MMD, $w_i^{\rm DFW}=1-\hat e_i$06 for Logistic IPW, $w_i^{\rm DFW}=1-\hat e_i$07 for OutLasso, and $w_i^{\rm DFW}=1-\hat e_i$08 for RF IPW (De et al., 19 Dec 2025).

7. Assumptions, diagnostics, misconceptions, and limitations

Despite their formal differences, DFW formulations share a common dependency on causal identifiability conditions. The recurring assumptions are consistency or SUTVA, unconfoundedness or strong unconfoundedness, overlap or positivity, and, in sequential settings, sequential ignorability. Where latent confounders are inferred rather than observed, the quality of the encoder becomes part of the identification-and-estimation problem rather than a purely computational detail (Gao et al., 2024, Khan et al., 7 Aug 2025, Huling et al., 2021, De et al., 19 Dec 2025).

A common misconception is to treat DFW as synonymous with inverse propensity weighting. The literature does not support that equivalence. One formulation explicitly uses inverse-propensity-type weights $w_i^{\rm DFW}=1-\hat e_i$09 over time-series action coordinates; another explicitly avoids inversion and sets $w_i^{\rm DFW}=1-\hat e_i$10; continuous-treatment approaches optimize an independence criterion directly; and direct balancing approaches optimize moment or kernel discrepancy subject to balance constraints (Gao et al., 2024, Khan et al., 7 Aug 2025, Huling et al., 2021, Shinkre et al., 2024, De et al., 19 Dec 2025).

The principal technical failure mode remains poor overlap. In inverse-propensity time-series DFW, if the model predicts zero probability, weights explode. In the bounded binary-treatment DFW formulation, weights may approach zero under very limited overlap, effectively dropping units and reducing effective sample size. In continuous-treatment weighting, positivity is required and large-scale implementations may need incomplete-$w_i^{\rm DFW}=1-\hat e_i$11-statistic approximations or subsampling because of the $w_i^{\rm DFW}=1-\hat e_i$12 distance computations. In mean-balancing approaches, high-dimensional covariates can induce instability, motivating regularization or richer balancing moments (Gao et al., 2024, Khan et al., 7 Aug 2025, Huling et al., 2021, Shinkre et al., 2024).

Diagnostics therefore play a central role. Reported diagnostics include standardized mean difference, K-S statistics with confidence intervals, ECDF plots, coefficient of variation of weights, effective sample size, weighted marginal absolute correlations, explicit independence criteria such as $w_i^{\rm DFW}=1-\hat e_i$13, and direct inspection of weight histograms or balance residuals. In the time-series HRI setting, a further systems-level constraint appears: the latent encoder and propensity networks must be sufficiently lightweight for online, robot-time inference (Gao et al., 2024, Khan et al., 7 Aug 2025, Huling et al., 2021, Shinkre et al., 2024).

Taken together, these formulations position DFW as a technically heterogeneous but causally unified family of methods. Some versions seek to recover latent confounders and reweight losses, some use bounded transforms of estimated treatment probabilities, some compress covariates into overlap-improving deconfounding scores, and others compute weights by directly minimizing dependence or distributional discrepancy. The unifying principle is deconfounding through reweighting; the substantive differences lie in what is weighted, how the weights are constructed, and which assumptions are needed for the resulting estimator or predictor to be unbiased, stable, and practically usable (Gao et al., 2024, Khan et al., 7 Aug 2025, D'Amour et al., 2021, Huling et al., 2021, Shinkre et al., 2024, De et al., 19 Dec 2025).