DNN-Assisted Inverse-Probability Weighting

• The paper shows that replacing a parametric logistic model with a deep neural network yields a more robust and accurate IPW estimator.
• It employs deep ReLU networks and pseudo-log-likelihood optimization to nonparametrically estimate sampling scores under bounded, sparse conditions.
• Simulation results indicate that DIPW significantly reduces bias and mean squared error compared to traditional IPW, especially in nonprobability sample integration.

A DNN-assisted inverse-probability weighted estimator is an inverse-probability weighted estimator in which the unknown sampling, treatment, or labeling probabilities are estimated with a deep neural network rather than a restrictive parametric model. In the finite-population survey-integration formulation developed in "Deep Neural Networks for Doubly Robust Estimation with Nonprobability Survey Samples" (Dai et al., 27 May 2026), the method targets the finite population mean by combining a nonprobability sample that contains the study variable with a reference probability sample that provides design-based auxiliary information. Closely related formulations use deep sequence models for inverse probability of treatment weighting with longitudinal claims records (Lee et al., 2024), impose local balance and local calibration conditions in nonparametric propensity-score estimation (Peng et al., 2024), or combine deep prediction models with Horvitz–Thompson or Hájek IPW rectification under informative labeling (Datta et al., 13 Aug 2025). This suggests that “DNN-assisted IPW” is best understood as a family of reweighting procedures whose common structure is unchanged—estimate a probability of observation or treatment, invert it, and use the resulting weights to recover the target estimand—but whose score model, loss, and asymptotic analysis depend on the sampling regime.

1. Finite-population formulation and the classical IPW construction

In the survey-sampling setting, let $U=\{1,2,\ldots,N\}$ be the finite population and let $y_i$ denote the study variable. The target parameter is the finite population mean

$\mu_y = N^{-1}\sum_{i=1}^N y_i.$

A nonprobability sample $S_A$ of size $n_A$ is observed, with inclusion indicator $R_i=1\{i\in S_A\}$. Under the ignorability assumptions $(A1$–$A3)$,

$\pi_i^A := P(R_i=1\mid x_i) > 0.$

The classical IPW estimator replaces the unknown $\pi_i^A$ by an estimate $y_i$0 and reweights the observed outcomes:

$y_i$1

Units with low estimated selection probability $y_i$2 receive large weight $y_i$3 so as to recover representativeness (Dai et al., 27 May 2026).

The DNN-assisted version preserves this Horvitz–Thompson/Hájek-style logic but changes the score-estimation step. Rather than assuming a linear-logit propensity model, it treats the logit sampling score as an unknown nonparametric function and approximates that function with a deep network. The estimator is therefore “assisted” by a DNN in the sense that the weighting formula remains IPW, while the neural network is used to estimate the probabilities that define the weights.

2. Neural estimation of sampling or propensity scores

In the survey formulation, the unknown logit score is written as

$y_i$4

where $y_i$5 is an unknown smooth function. The proposed method approximates $y_i$6 by a deep ReLU network $y_i$7 and estimates $y_i$8 by maximizing a pseudo-log-likelihood that combines the nonprobability sample $y_i$9 and a reference probability sample $\mu_y = N^{-1}\sum_{i=1}^N y_i.$0 of size $\mu_y = N^{-1}\sum_{i=1}^N y_i.$1, with design weights $\mu_y = N^{-1}\sum_{i=1}^N y_i.$2:

$\mu_y = N^{-1}\sum_{i=1}^N y_i.$3

Equivalently, one minimizes the negative pseudo-likelihood

$\mu_y = N^{-1}\sum_{i=1}^N y_i.$4

No explicit $\mu_y = N^{-1}\sum_{i=1}^N y_i.$5 or $\mu_y = N^{-1}\sum_{i=1}^N y_i.$6 penalty appears in the objective, but the parameter space is constrained to a bounded, sparse-weight DNN class $\mu_y = N^{-1}\sum_{i=1}^N y_i.$7, and overfitting is further controlled by early stopping (Dai et al., 27 May 2026).

The survey paper uses a $\mu_y = N^{-1}\sum_{i=1}^N y_i.$8-layer feedforward architecture,

$\mu_y = N^{-1}\sum_{i=1}^N y_i.$9

with $S_A$0, depth $S_A$1, layer widths $S_A$2, output dimension $S_A$3, bounded entries $S_A$4, and total nonzeros bounded by $S_A$5. The DNN parameters are optimized by ADAM, with a learning rate $S_A$6 such as $S_A$7, first- and second-moment decay parameters $S_A$8 and $S_A$9, $n_A$0, Xavier initialization for $n_A$1, zero initialization for $n_A$2, and early stopping when $n_A$3 (Dai et al., 27 May 2026).

Related work shows that the DNN component is highly setting-dependent. For longitudinal claims records, inverse probability of treatment weighting has been implemented with LSTM, Transformer encoder (“BERT_code”), and Transformer encoder on record embeddings (“BERT_record”) architectures, all trained with binary cross-entropy to estimate $n_A$4 directly from raw claims histories (Lee et al., 2024). In a different nonparametric propensity-score formulation, a three-layer feed-forward network with batch-normalization, ReLU activations, and a residual connection is trained not by cross-entropy but by minimizing a loss that enforces “local balance” and “local calibration” across a dense grid of score values (Peng et al., 2024). These variations do not alter the IPW principle; they alter the way the score function is learned.

3. The DNN-assisted inverse-probability weighted estimator

After optimizing the network parameters, the survey estimator sets

$n_A$5

The DNN-assisted inverse-probability weighted estimator, denoted DIPW in the paper, is

$n_A$6

The same DNN-estimated sampling scores are also incorporated into a deep doubly robust estimator, denoted DDR, within the same framework (Dai et al., 27 May 2026).

The defining feature of DIPW is therefore not a new weighting formula but the replacement of a parametric score model by a deep nonparametric approximation. In the paper’s narrative exposition, the contrast is explicit: instead of positing a logistic regression $n_A$7, the method allows $n_A$8 to be an unknown smooth function. A plausible implication is that the estimator is designed for regimes in which the true selection mechanism contains nonlinear structure that a linear-logit model omits.

4. Assumptions, consistency, and convergence rates

The asymptotic analysis of DIPW is developed under Assumptions $n_A$9–$R_i=1\{i\in S_A\}$0 for ignorability, positivity, and independence; $R_i=1\{i\in S_A\}$1–$R_i=1\{i\in S_A\}$2 for DNN complexity relative to a composite Hölder class $R_i=1\{i\in S_A\}$3; and design-consistency Conditions $R_i=1\{i\in S_A\}$4–$R_i=1\{i\in S_A\}$5 (Dai et al., 27 May 2026). Under these conditions, the paper establishes two central rate results.

First, Theorem 1 states that

$R_i=1\{i\in S_A\}$6

where

$R_i=1\{i\in S_A\}$7

captures the intrinsic smoothness and dimension. Second, Theorem 2 states that

$R_i=1\{i\in S_A\}$8

The proof sketch reported in the supplied material combines uniform convergence of the pseudo-log-likelihood over the sparse DNN class, empirical-process bounds, design consistency, approximation error for composite Hölder $R_i=1\{i\in S_A\}$9, and then standard $(A1$0-estimation and Taylor-expansion arguments to transfer the convergence of $(A1$1 to that of the IPW estimator (Dai et al., 27 May 2026).

A common misconception is that a DNN score model removes the need for identification assumptions. The survey formulation does not claim this. The estimator is still derived under ignorability, positivity, and independence, and its large-sample properties are stated only under the specified regularity and design-consistency conditions. Likewise, the DNN itself is not presented as unconstrained universal flexibility; the theory explicitly ties the estimator to a bounded, sparse-weight network class and to early stopping.

5. Finite-sample behavior and robustness to misspecification

The finite-population simulation in the survey paper uses $(A1$2, $(A1$3, and $(A1$4. The true logit includes nonlinear terms—products, powers, sine, and log—that are omitted by a linear “parametric” logistic model. Two scenarios are considered: TF, in which the outcome regression is correct and the propensity parametric model is misspecified, and FF, in which both the outcome and parametric propensity models are misspecified (Dai et al., 27 May 2026).

The reported results are specific. Standard IPW with a linear-logit model has large bias of approximately $(A1$5 and high MSE. DIPW reduces bias to approximately $(A1$6 and cuts MSE by a factor of greater than $(A1$7. The deep doubly robust DDR estimator further shrinks bias to below $(A1$8 and further reduces MSE. Under FF, conventional doubly robust DR breaks down, with bias of approximately $(A1$9, while DIPW and DDR remain accurate. The paper summarizes these findings as evidence that the proposed estimators can improve robustness to parametric propensity-score misspecification, especially when the true selection mechanism is nonlinear (Dai et al., 27 May 2026).

Beyond simulation, the same study evaluates the proposed estimators in an empirical application using Pew Research Center and Behavioral Risk Factor Surveillance System data. The supplied abstract does not provide numerical results for that application, but it places the estimator in the broader problem of integrating nonprobability and probability survey samples, where the nonprobability sample may contain rich outcome information and the probability sample may provide design-based auxiliary information.

6. Related DNN-assisted IPW variants in adjacent literatures

The broader literature represented in the supplied sources places DNN-assisted IPW estimators in several adjacent regimes.

Setting	DNN component	Weighted estimand
Nonprobability survey integration (Dai et al., 27 May 2026)	Deep ReLU network for $A3)$0 via pseudo-likelihood	Finite population mean
Longitudinal claims or EHRs (Lee et al., 2024)	LSTM, BERT_code, or BERT_record for $A3)$1	Average treatment effect via IPTW
Informative labeling in PPI (Datta et al., 13 Aug 2025)	DNN predictor $A3)$2 plus estimated labeling probabilities $A3)$3	Population mean with HT or Hájek rectifier

In treatment-effect estimation from claims records, inverse probability of treatment weighting is used to address time-dependent confounding. The deep-sequence formulation estimates propensity scores directly from claims histories without feature processing, then constructs either unstabilized weights,

$A3)$4

or stabilized weights,

$A3)$5

and estimates the average treatment effect by

$A3)$6

The paper reports that deep sequence models outperform logistic regression and multilayer perceptron baselines, with and without High-Dimensional Propensity Score adjustment, in PS-MAE and ATE-MAE across all scenarios; it also reports that trimming or clipping at $A3)$7 induces negligible changes in ATE-MAE (Lee et al., 2024).

In nonparametric propensity-score estimation with optimized covariate balance, the DNN is trained to satisfy two sufficient and necessary conditions for a score $A3)$8 to equal the true propensity score: local balance, $A3)$9, and local calibration, $\pi_i^A := P(R_i=1\mid x_i) > 0.$0. The corresponding loss function combines a local-balance criterion $\pi_i^A := P(R_i=1\mid x_i) > 0.$1 and a local-calibration criterion $\pi_i^A := P(R_i=1\mid x_i) > 0.$2 through

$\pi_i^A := P(R_i=1\mid x_i) > 0.$3

and the resulting IPW estimator targets

$\pi_i^A := P(R_i=1\mid x_i) > 0.$4

The paper states that LBC-Net attains the lowest GSD and LSD and the smallest RMSE and variance in Kang–Schafer simulations, and in real data from the EQLS European well-being survey achieves GSD below $\pi_i^A := P(R_i=1\mid x_i) > 0.$5 and LSD below $\pi_i^A := P(R_i=1\mid x_i) > 0.$6 across all covariates and propensity-score levels (Peng et al., 2024).

In prediction-powered inference with informative labeling, the deep network predicts outcomes on the large unlabeled set, while IPW is used only in the bias-correction term. If $\pi_i^A := P(R_i=1\mid x_i) > 0.$7 is the DNN prediction and $\pi_i^A := P(R_i=1\mid x_i) > 0.$8 is the labeling probability, the Horvitz–Thompson and Hájek rectifiers are

$\pi_i^A := P(R_i=1\mid x_i) > 0.$9

and

$\pi_i^A$0

The combined estimator of the population mean is

$\pi_i^A$1

and the paper reports that, in simulations, IPW-adjusted PPI with estimated propensities closely matches the known-probability case while retaining nominal coverage and the variance-reduction benefits of PPI (Datta et al., 13 Aug 2025).

Taken together, these results indicate that DNN assistance is not a single implementation recipe. In some settings the network estimates the sampling score directly by pseudo-likelihood; in others it estimates the treatment propensity by binary cross-entropy; in still others it enters through a prediction model while the IPW component corrects informative labeling. What remains invariant is the inverse-probability weighting principle: probability estimates generated by a learned model are inverted and used to reweight observed information so that the resulting estimator targets a population quantity under the stated assumptions.