Skip to Content
EconometricsEconometrics
  • Article
  • Open Access

28 October 2026

30 Pages

Joint Covariate Balancing for Difference-in-Differences with Missing Outcome Evolutions

and
1
School of Business Administration and Customs Affairs, Shanghai Customs University, Shanghai 201204, China
2
Department of Economics, Hitotsubashi University, Tokyo 186-8601, Japan
*
Author to whom correspondence should be addressed.

Abstract

We propose a joint covariate balancing estimator for the average treatment effect on the treated (ATT) in a difference-in-differences (DID) design when the outcome evolution, rather than a specific outcome level, is missing at random (MAR). The proposed estimator combines treatment and response into one indicator and calibrates the two group-based density ratios directly. Point estimation therefore requires only two nuisance working models, and inference adds two linear projections, giving four in total, whereas a factorized implementation of the efficient influence function requires five: one treatment probability, two response probabilities, and two outcome-evolution models. The estimator is automatically self-normalized and attains the semiparametric efficiency bound for the coarsened data model when all working models are correctly specified. Furthermore, we show that the proposed estimator is doubly robust for both consistency and inference. The simulation results support componentwise robustness and confirm the efficiency result when all nuisance models are correctly specified, while highlighting substantial small-sample limitations under low response probabilities. An all-correct design further shows that the efficiency ordering relative to an estimator using the always-observed outcome level can reverse.

1. Introduction

Semiparametric difference-in-differences (DID) estimators adjust for differences in pre-treatment covariates when parallel trends hold conditionally rather than unconditionally (Abadie, 2005; Sant’Anna & Zhao, 2020). In practice, however, the outcome is often missing for some units, and a simple complete-case analysis that discards all units with any missing outcome is inefficient, and is biased whenever response depends on covariates that also shift the outcome evolution. To address this issue, researchers have developed methods assuming that outcomes are missing at random (MAR) (Tang et al., 2024; Tsiatis, 2006; A. Zhao et al., 2024). In DID with MAR, Testa et al. (2026) propose a semiparametric DID estimator based on the efficient influence function (EIF) of the ATT to enhance efficiency. However, this construction introduces several nuisance models that must all be correctly specified to attain the semiparametric efficiency bound, which is challenging in practice. Reducing the number of nuisance models in the MAR DID setting is therefore desirable, though it is not obvious how to achieve this. The covariate balancing propensity score (CBPS) framework (Fan et al., 2023; Imai & Ratkovic, 2014; Li & Matsushita, 2025) provides this possibility, as it allows the composite of the treatment and response probabilities, namely, the group-based density ratio, to be calibrated directly in a single step.
In this paper, we propose a joint covariate balancing estimator for the ATT in a DID design with outcomes missing at random. The proof architecture for double robustness in DID follows Sant’Anna and Zhao (2020), and the calibration machinery follows the covariate balancing literature (Fan et al., 2023; Imai & Ratkovic, 2014) and its complete-data DID implementation (Li & Matsushita, 2025). Two elements are new. First, we coarsen the outcome to its evolution and combine treatment and response into a single indicator, so that the missingness restriction is placed on the outcome evolution rather than on a particular outcome level; the efficient influence function of the resulting observed-data model is derived in Proposition 1, and Remark 1 quantifies the efficiency consequence of the coarsening. Second, the calibration condition is joint across the two respondent groups, estimates the two group-based density ratios directly, and uses the treated sample as the common balancing target.
These two choices deliver the three properties that constitute our contribution. First, the proposed DID estimator reduces the number of nuisance models required, using only two working models for point estimation where a factorized implementation would require five, without losing local efficiency (i.e., it attains the semiparametric efficiency bound), and it is automatically self-normalized (i.e., it has the Hájek form). Inference additionally uses the two weighted least-squares projections, so that four working models enter in total, against five in the factorized implementation. Second, the proposed DID estimator is componentwise doubly robust for consistency: it is consistent if, for each respondent group, at least one of the density-ratio model and the outcome-evolution model is correctly specified. Third, the proposed DID estimator has a form-invariant asymptotic variance as long as, for each respondent group, at least one of the density-ratio model and the outcome-evolution model is correctly specified, a property known as double robustness for inference. Our numerical study examines small-sample inference, both favorable and unfavorable working-model configurations, and the efficiency comparison with an outcome-level estimator.
The estimator also sits within a broader literature on balancing and calibration weights. Inverse probability tilting (Graham et al., 2012) and entropy balancing (Hainmueller, 2012) construct weights by exponential tilting subject to moment constraints; Q. Zhao and Percival (2017) show that entropy balancing is doubly robust, and Chan et al. (2016) establish global efficiency for empirical balancing calibration weighting with a growing dictionary. Related constructions include stable balancing weights (Zubizarreta, 2015), kernel-based covariate functional balancing (Wong & Chan, 2018), and tailored loss functions (Q. Zhao, 2019). Our joint balancing condition inherits from this literature the exponential-tilting form of the weights, the exact finite-sample moment matching, and the convexity of the calibration problem. What is new is that the balancing target is the treated sample for both respondent groups simultaneously, and that each set of weights calibrates a composite of a treatment probability and a response probability rather than a single selection probability. On the missing-data side we rely on the coarsened data framework of Robins et al. (1994), Bang and Robins (2005) and Tsiatis (2006), and on the efficiency side on Hahn (1998) and Hirano et al. (2003). Finally, reducing the number of nuisance models is complementary to, rather than a substitute for, debiased machine learning (Chernozhukov et al., 2018).
The rest of the paper is organized as follows. Section 2 introduces the setup and assumptions. Section 3 derives the efficient influence function for the ATT and the associated componentwise doubly robust estimand. Section 4 presents the joint covariate balancing estimator. Section 5 establishes its local efficiency and its double robustness for both consistency and inference. Section 6 reports the Monte Carlo results. Section 7 concludes.

2. Setup

There are two periods, t ∈ { 0 , 1 } , and treatment starts only at t = 1 . Let D ∈ { 0 , 1 } indicate treatment, Y t ( d ) denote potential outcomes, and Δ Y = Y 1 − Y 0 . The indicator R equals one when both outcome levels needed for Δ Y are observed. The coarsened data are i.i.d. copies of O = ( X , D , R , R Δ Y ) , where X is a fully observed vector of pre-treatment covariates. The parameter of interest is the ATT, defined as
τ = E [ Y 1 ( 1 ) − Y 1 ( 0 ) ∣ D = 1 ] .
Define p = P ( D = 1 ) , e * ( x ) = P ( D = 1 ∣ X = x ) , r d * ( x ) = P ( R = 1 ∣ D = d , X = x ) , m d * ( x ) = E ( Δ Y ∣ D = d , X = x ) , S 1 = D R , and S 0 = ( 1 − D ) R . Write a d * ( x ) = P ( S d = 1 ∣ X = x ) , so that
a 1 * ( x ) = e * ( x ) r 1 * ( x ) , a 0 * ( x ) = { 1 − e * ( x ) } r 0 * ( x ) .
The joint indicator is therefore multiplicative: each a d * is a product of two probabilities. Next, we introduce the identification conditions for the ATT and the MAR conditions for the outcome evolution.
Assumption 1 (Identification conditions).
The following conditions hold:
 (i) 
Y 1 = D Y 1 ( 1 ) + ( 1 − D ) Y 1 ( 0 ) and Y 0 = Y 0 ( 0 ) almost surely;
 (ii) 
E [ Y 1 ( 0 ) − Y 0 ( 0 ) ∣ D = 1 , X ] = E [ Y 1 ( 0 ) − Y 0 ( 0 ) ∣ D = 0 , X ] almost surely;
 (iii) 
For some ε > 0 , p > ε and e * ( X ) ≤ 1 − ε almost surely.
Assumption 1(i) imposes consistency and no anticipation: the observed post-treatment outcome agrees with the potential outcome under the realized treatment status, while the baseline outcome is untreated for every unit. Assumption 1(ii) is conditional parallel trends, which restricts the conditional mean of the untreated outcome evolution rather than the levels of the potential outcomes. Assumption 1(iii) is ATT overlap: treatment occurs with positive probability, and comparison units remain available over the covariate support relevant to the treated population. These conditions are standard in semiparametric DID analyses of the ATT (Abadie, 2005; Li & Matsushita, 2025; Sant’Anna & Zhao, 2020).
Assumption 2 (Missing at random and response overlap).
For each d ∈ { 0 , 1 } ,
 (i) 
R ⊥ ⊥ Δ Y ∣ ( D = d , X ) ;
 (ii) 
For some r ̲ > 0 , r d * ( X ) ≥ r ̲ almost surely on the covariate support of treated units.
Assumption 2(i) is an MAR restriction on observability of the outcome evolution, not a pair of date-specific MAR restrictions as imposed in Testa et al. (2026). It allows R = 0 to arise from a missing baseline, a missing follow-up, or simultaneous missingness. If Y 0 is always observed, R is the post-treatment response indicator; if Y 1 is always observed, it is the pre-treatment response indicator. When either outcome may be missing, R is the complete-pair indicator, i.e., R = R 0 R 1 , where R t = 1 { Y t observed } for t ∈ { 0 , 1 } .
Example 1.
Assumption 2(i) restricts only outcome evolution, so it is useful to clarify the forms of dependence between R and the outcome levels ( Y 0 , Y 1 ) that it permits. For example, suppose that for some measurable h and some unobserved U,
R = h ( X , D , Y 0 , U ) , U ⊥ ⊥ ( Y 0 , Δ Y ) ∣ ( D , X ) , Y 0 ⊥ ⊥ Δ Y ∣ ( D , X ) .
Clearly, ( Y 0 , U ) ⊥ ⊥ Δ Y ∣ ( D , X ) implies R ⊥ ⊥ Δ Y ∣ ( D , X ) , so Assumption 2(i) holds. However, since R is a nondegenerate function of the baseline outcome Y 0 and Y 1 = Y 0 + Δ Y , neither of the date-specific conditions Y 0 ⊥ ⊥ R ∣ ( D , X ) and Y 1 ⊥ ⊥ R ∣ ( D , X ) need hold. An empirical example is missingness driven by the baseline outcome level: workers with low baseline earnings are more likely to be nonrespondents in a population where, conditional on age, education, and gender, baseline earnings carry no information about subsequent outcome evolution. In this setting, Assumption 2(i) accommodates mechanisms that are missing not at random (MNAR) with respect to the specific outcome levels, that is, Y 0 ⫫ R ∣ ( D , X ) and Y 1 ⫫ R ∣ ( D , X ) .
More importantly, under Assumption 2(i), one can use the observed data to identify the conditional mean of the outcome evolution for each treatment group, i.e., E ( Δ Y ∣ D = d , R = 1 , X ) = E ( Δ Y ∣ D = d , X ) , d ∈ { 0 , 1 } . Finally, under Assumptions 1–2, the ATT is identified by
τ = 1 p E { S 1 ω 1 * ( X ) − S 0 ω 0 * ( X ) } Δ Y ,
where
ω 1 * ( x ) = e * ( x ) a 1 * ( x ) = 1 r 1 * ( x ) , ω 0 * ( x ) = e * ( x ) a 0 * ( x ) = e * ( x ) { 1 − e * ( x ) } r 0 * ( x )
are the group-based density ratios. The role of Assumption 2(ii) is now transparent: by (2) the denominator of ω d * = e * / a d * is a product of two probabilities, so overlap in treatment alone does not keep the weights bounded. Identification itself only requires a d * ( X ) > 0 on the covariate support of treated units, but Assumptions 1(iii) and 2(ii) are needed jointly to bound the weights. This identification result extends the inverse probability weighting (IPW) representation of Abadie (2005), in which only e * enters, to outcome evolutions that are missing at random. When outcomes are fully observed, (4) reduces to that representation. The proof is given in Appendix A.1.

3. Efficient Influence Function and Componentwise Doubly Robust Estimation

Before introducing the proposed estimator, we characterize the efficiency benchmark under the outcome evolution MAR condition.
Proposition 1 (Efficient influence function).
Under Assumptions 1–2, the efficient influence function for τ in the nonparametric model for O = ( X , D , R , R Δ Y ) is
φ eff ( O ) = 1 p [ S 1 ω 1 * ( X ) { Δ Y − m 1 * ( X ) } − S 0 ω 0 * ( X ) { Δ Y − m 0 * ( X ) } + D { m 1 * ( X ) − m 0 * ( X ) − τ } ] ,
which satisfies E [ φ eff ( O ) ] = 0 , and V eff = E [ φ eff ( O ) 2 ] is the semiparametric efficiency bound for regular estimators of τ. When the outcome evolution is fully observed, that is, r 1 * ( X ) = r 0 * ( X ) = 1 almost surely so that R = 1 for all units, φ eff ( O ) reduces to the efficient influence function for the ATT with fully observed panel data derived in Sant’Anna and Zhao (2020). The proof is given in Appendix A.2.
Remark 1.
Proposition 2.8 of Testa et al. (2026) derives the efficient influence function for the ATT when the post-treatment outcome Y 1 is always observed and only the baseline outcome Y 0 may be missing. Their setting differs from ours in two respects. First, the MAR conditions differ. Their MAR condition is date-specific, requiring Y 0 ⊥ ⊥ R ∣ ( D , X ) (their Assumption 2.3), whereas Assumption 2(i) imposes a single restriction on the observability of the outcome evolution Δ Y while allowing either outcome level, or both, to be missing. Hence, Assumption 2(i) is not nested within their date-specific restriction, nor is theirs nested within ours. Second, the observed data differ: in their setting, units with R = 0 still contribute their post-treatment outcomes, whereas under our coarsening O = ( X , D , R , R Δ Y ) they contribute only ( X , D , R ) . To compare the efficiency bounds implied by the two MAR conditions, we work within the intersection of the two non-nested conditions by imposing the joint restriction
( Y 0 , Y 1 ) ⊥ ⊥ R ∣ ( D , X ) ,
which implies both their date-specific condition Y 0 ⊥ ⊥ R ∣ ( D , X ) and our Assumption 2(i). Specializing our setup to theirs, so that R indicates whether Y 0 is observed, let φ T denote their efficient influence function and let V eff T = E ( φ T 2 ) denote the corresponding semiparametric efficiency bound for the observed data O T = ( X , D , Y 1 , R , R Y 0 ) . Under the intersection condition (7), their efficient influence function can then be written as φ T ( O T ) = φ eff ( O ) + Δ ( O , Y 1 ) , where
Δ ( O , Y 1 ) = D p 1 − R r 1 * ( X ) { Y 1 − ν 1 * ( X ) } − ( 1 − D ) e * ( X ) p { 1 − e * ( X ) } 1 − R r 0 * ( X ) { Y 1 − ν 0 * ( X ) } ,
is the adjustment that exploits the post-treatment outcomes of nonrespondents; here, ν d * ( X ) = E ( Y 1 ∣ D = d , X ) , and Δ ( O , Y 1 ) is not a function of O. Under the intersection condition (7), straightforward algebra yields the following expression for the efficiency comparison:
V eff T = V eff − 1 p 2 ∑ d = 0 1 E q d * ( X ) { σ Δ , d * 2 ( X ) − σ 0 , d * 2 ( X ) } ,
where σ Δ , d * 2 ( X ) = Var ( Δ Y ∣ D = d , X ) , σ 0 , d * 2 ( X ) = Var ( Y 0 ∣ D = d , X ) , and the nonnegative weights are
q 1 * ( X ) = e * ( X ) { 1 − r 1 * ( X ) } r 1 * ( X ) , q 0 * ( X ) = e * ( X ) 2 { 1 − r 0 * ( X ) } { 1 − e * ( X ) } r 0 * ( X ) .
The efficiency ranking can therefore go in either direction, depending on the serial dependence of the outcome. Writing σ 1 , d * 2 ( X ) = Var ( Y 1 ∣ D = d , X ) and σ Δ , d * 2 = σ 0 , d * 2 + σ 1 , d * 2 − 2 ρ d * σ 0 , d * σ 1 , d * with ρ d * the conditional correlation between Y 0 and Y 1 given ( D = d , X ) , the coarsened bound V eff is the smaller of the two whenever σ Δ , d * 2 < σ 0 , d * 2 . For example, if σ 1 , d * = σ 0 , d * , then ρ d * > 1 / 2 implies V eff < V eff T . In panel settings in which DID is typically applied, outcomes tend to exhibit strong serial correlation. Thus, coarsening the observed data to O and imposing Assumption 2(i) can be more, rather than less, informative than observing Y 1 for nonrespondents under the date-specific MAR condition. The ranking is reversed when the outcome evolution is more variable than the baseline outcome. The proof of (9) is provided in Appendix A.3.
In terms of the underlying conditional probabilities, S 1 ω 1 * ( X ) = D R / r 1 * ( X ) and S 0 ω 0 * ( X ) = ( 1 − D ) R e * ( X ) / [ { 1 − e * ( X ) } r 0 * ( X ) ] , so (6) involves the three probability models e * , r 1 * , and r 0 * , together with the two outcome-evolution models m 1 * and m 0 * . Motivated by Equation (6), let ω d ( X ) and m d ( X ) denote working models for the group-based density ratio ω d * ( X ) and the outcome evolution m d * ( X ) , either of which may be misspecified, and define the augmented estimand
τ dr = 1 p E D { m 1 ( X ) − m 0 ( X ) } + S 1 ω 1 ( X ) { Δ Y − m 1 ( X ) } − S 0 ω 0 ( X ) { Δ Y − m 0 ( X ) } .
Proposition 2 (Componentwise double robustness).
Under Assumptions 1–2, τ dr = τ if, for each d ∈ { 0 , 1 } , either ω d ( X ) = ω d * ( X ) or m d ( X ) = m d * ( X ) almost surely.
Proposition 2 shows that the augmented estimand equals the ATT as long as, for each respondent group, at least one of the two working models is correctly specified. Modeling the weights through the two density ratios rather than the three probabilities also weakens the requirements: ω 1 is correctly specified if and only if r 1 is, while ω 0 is correctly specified whenever e and r 0 both are, but also under compensating misspecification of the two. Nevertheless, a factorized implementation of τ dr would still fit the three probability models separately and combine them, so that five working models enter in total. The proof is given in Appendix A.4.
Recall that while the efficient influence function involves the outcome-evolution models, the identification result (4) involves only the weighting functions. It is therefore worth exploiting this lower-nuisance identification while retaining the double robustness property. The joint covariate balancing approach of the next section calibrates the two group-based density ratios in (5) directly and dispenses with the separate estimation of e * , r 1 * , and r 0 * ; in addition, no outcome-evolution model m d * ( X ) needs to be estimated for point estimation. Furthermore, the resulting estimator retains componentwise double robustness.

4. Joint Covariate Balancing Estimator

Let b ( X ) = ( 1 , b 2 ( X ) , … , b K ( X ) ) ⊤ be a fixed dictionary. For each respondent group, consider a single-index working family generated by a scalar link function g d : R → ( 0 , ∞ ) that is positive and twice continuously differentiable, with g ˙ d ( u ) > 0 for every u ∈ R ,
ω d ( X ; λ d ) = g d { b ( X ) ⊤ λ d } , λ d ∈ Λ d ⊂ R K , d ∈ { 0 , 1 } ,
these conditions on the link are also collected in Assumption 3(ii) below. To distinguish the three roles associated with ω d , we use g d for the scalar link function, ω d ( · ; λ d ) for the density-ratio working model induced by the link, and ω d * for the true group-specific density ratio. The derivative with respect to λ d takes the convenient form ∂ g d { b ( X ) ⊤ λ d } / ∂ λ d = g ˙ d { b ( X ) ⊤ λ d } b ( X ) , where g ˙ d ( u ) = d g d ( u ) / d u > 0 . The complete notation is summarized in Table 1 below.
Table 1. Notation for the working models.
For ω d , one may, for example, use the exponential link g d ( u ) = exp ( u ) to specify log-linear group-specific density ratios. Under this specification, correct specification requires log ω 1 * ( X ) = − log r 1 * ( X ) = b ( X ) ⊤ λ 1 and log ω 0 * ( X ) = log e * ( X ) / { 1 − e * ( X ) } − log r 0 * ( X ) = b ( X ) ⊤ λ 0 for some λ 1 , λ 0 ∈ R K . Thus, the exponential specification is a direct working model for each composite density ratio; it is not generally implied by fitting separate logistic models for e and r d . However, the comparison group specification can be restrictive because the true log ω 0 * combines treatment odds and response selection; the robustness results below allow either working family to be misspecified.

4.1. Composite Versus Factorized Working Models

Correct specification of the composite model ω 0 * neither implies nor is implied by correct specification of the separate models for e * and r 0 * . For example, consider the exponential link specification of ω 0 * mentioned above. In one direction, if e * is logistic with index linear in b and r 0 * is log-linear in b, then log ω 0 * = logit e * − log r 0 * is linear in b and therefore the composite model is correctly specified; if instead r 0 * is logistic, log ω 0 * is not linear in b, so the composite model is misspecified under exponential link specification, even though both factors are correctly specified. In the other direction, the composite model is correct whenever the two factor misspecifications cancel in the difference logit e * − log r 0 * ; for example, if the two factors satisfy logit e * ( X ) = b ( X ) ⊤ α + h ( X ) , log r 0 * ( X ) = b ( X ) ⊤ γ + h ( X ) , for some α , γ ∈ R K and some bounded h, then neither the logistic model for e * nor the log-linear model for r 0 * is correctly specified. However, log ω 0 * ( X ) = b ( X ) ⊤ ( α − γ ) is exactly linear in b and the composite model is correct. Thus, correctness of the composite can hold under compensating misspecification. The composite is the natural object when selection into treatment and nonresponse operate through the same latent index—for instance, when both are driven by a single measure of attachment to the program—since log ω 0 * is then a single index even if neither factor belongs to a convenient parametric family; the factorized specification is preferable when assignment and response are governed by clearly distinct mechanisms with separately credible models. As a trade-off, the composite model is parsimonious and directly targeted, since ω 0 * is the only object that enters the identification result (4). However, it does not disentangle the two underlying mechanisms and therefore provides no mechanism-specific diagnostic, whereas the factorized model remains interpretable at the level of each mechanism.

4.2. Joint Covariate Balancing Condition

Let E ^ [ h ] = n − 1 ∑ i = 1 n h ( O i ) . We estimate λ = ( λ 1 ⊤ , λ 0 ⊤ ) ⊤ from the joint covariate balancing condition
E ^ [ S 1 g 1 { b ( X ) ⊤ λ ^ 1 } − D ] b ( X ) [ S 0 g 0 { b ( X ) ⊤ λ ^ 0 } − D ] b ( X ) = 0 2 K .
This condition is valid because, at the true ratios,
E [ S d ω d * ( X ) b ( X ) ∣ X ] = a d * ( X ) ω d * ( X ) b ( X ) = e * ( X ) b ( X ) = E [ D b ( X ) ∣ X ] .
Equation (11) extends the CBPS principle of Imai and Ratkovic (2014) and Fan et al. (2023) simultaneously to the two respondent groups. It targets balance rather than prediction of treatment or response, avoids separately fitting three probabilities, and exactly matches both groups, weighted by their group-based density ratios, to the treated sample. When R = 1 almost surely, the covariate balancing condition reduces to the complete-data CBPS DID condition of Li and Matsushita (2025). The link also governs whether the balancing condition can be solved in a given sample. Because g d is strictly increasing, (11) is the first-order condition of the separable convex problem
λ ^ d = arg min λ d ∈ Λ d E ^ S d G d { b ( X ) ⊤ λ d } − D b ( X ) ⊤ λ d , G d ′ = g d ,
whose Hessian matrix E ^ [ S d g ˙ d { b ( X ) ⊤ λ d } b ( X ) b ( X ) ⊤ ] is positive definite whenever E ^ [ S d b ( X ) b ( X ) ⊤ ] is nonsingular, because g ˙ d > 0 . Strict convexity delivers uniqueness, but not existence. We discuss this in Appendix A.6.

4.3. Estimation

Given a solution λ ^ d of the calibration problem (12), equivalently of the balancing condition (11), write ω ^ d ( X ) = g d { b ( X ) ⊤ λ ^ d } for the fitted group-based weights. The joint covariate balancing (JCB) DID estimator is
τ ^ JCB = 1 p ^ E ^ { S 1 ω ^ 1 ( X ) − S 0 ω ^ 0 ( X ) } Δ Y , p ^ = E ^ [ D ] .
Balancing the intercept normalizes the group-based weights in each respondent group to the number treated, so that τ ^ JCB is automatically self-normalized and takes the Hájek form (Hájek, 1971). Self-normalized weighting estimators are known to exhibit more stable finite-sample performance than their unnormalized counterparts (Busso et al., 2014). Moreover, the joint covariate balancing condition (11) implies, for any β 1 , β 0 ∈ R K ,
τ ^ JCB = 1 p ^ E ^ D b ( X ) ⊤ ( β 1 − β 0 ) + S 1 ω ^ 1 ( X ) { Δ Y − b ( X ) ⊤ β 1 } − S 0 ω ^ 0 ( X ) { Δ Y − b ( X ) ⊤ β 0 } ,
which is similar in form to Equation (10) and hence doubly robust, as we will discuss in the next section. Unlike Equation (10), however, the JCB DID estimator does not require estimating the outcome-evolution models for point estimation.
For the choice of the dictionary b ( X ) , we recommend including an intercept and all covariates that enter the outcome-evolution model linearly, augmenting them with low-order transformations and interactions of variables that are likely to jointly affect treatment assignment and nonresponse, and keeping the dimension K fixed. For inference, we suggest choosing β ^ d to satisfy
E ^ S d g ˙ d { b ( X ) ⊤ λ ^ d } b ( X ) { Δ Y − b ( X ) ⊤ β ^ d } = 0 , d ∈ { 0 , 1 } .
Equation (15) is the normal equation of a weighted least-squares regression of Δ Y on b ( X ) with weights S d g ˙ d { b ( X ) ⊤ λ ^ d } evaluated at the same λ ^ d that enters (13). Define the estimated influence function by
ψ ^ i = 1 p ^ [ D i { b ( X i ) ⊤ ( β ^ 1 − β ^ 0 ) − τ ^ JCB } + ∑ d = 0 1 s d S d i ω ^ d ( X i ) { Δ Y i − b ( X i ) ⊤ β ^ d } ] , s 1 = 1 , s 0 = − 1 ,
and estimate its variance by
V ^ = E ^ ( ψ ^ i 2 ) .
For α ∈ ( 0 , 1 ) , an asymptotic level 1 − α confidence interval for τ is τ ^ JCB ± z 1 − α / 2 V ^ / n . The same λ ^ d therefore enters (13), (15), and (16); Theorem 3 shows why this, and the choice of weights in (15), matters for the validity of the inference, and Section 6.1 gives the numerical details.

5. Theoretical Properties

This section establishes the asymptotic properties of the JCB DID estimator. We first state the regularity conditions and formalize the correctness conditions for the group-based density-ratio and outcome-evolution working models. We then show that the estimator is asymptotically normal and attains the semiparametric efficiency bound when all working models are correctly specified, and finally show that it remains consistent and that the variance estimator (17) delivers valid inference throughout the componentwise union model. Throughout this section, a superscript 0 denotes a pseudo-true parameter, defined as the solution to the corresponding population estimating equation, which is well defined even under misspecification; a superscript * denotes the true quantity. Under correct specification the two coincide, for example, ω d 0 = ω d * and ℓ d 0 = m d * .
Assumption 3 (Regularity).
For d ∈ { 0 , 1 } ,
 (i) 
The dictionary is bounded, ∥ b ( X ) ∥ ≤ C b < ∞ almost surely; E ( Δ Y 4 ) < ∞ ; and E [ S d b ( X ) b ( X ) ⊤ ] is positive definite;
 (ii) 
The link g d : R → ( 0 , ∞ ) is twice continuously differentiable and satisfies g ˙ d ( u ) > 0 for every u ∈ R ;
 (iii) 
The parameter space Λ d ⊂ R K is compact and convex, and the population calibration equation E [ ( S d g d { b ( X ) ⊤ λ d } − D ) b ( X ) ] = 0 has a unique solution λ d 0 , which lies in the interior of Λ d .
Assumption 3 collects three primitive conditions. Part (i) restricts the dictionary: b ( X ) is bounded, its second-moment matrix on the group-d respondents is nonsingular, and the outcome evolution has a finite fourth moment. Part (ii) requires a positive, twice continuously differentiable link with a strictly positive first derivative. Positivity makes ω d ( · ; λ d ) a candidate density ratio, and g ˙ d > 0 makes (11) the first-order condition of a strictly convex problem and g ˙ d a positive weight in (15). The second derivative is needed because the projection estimating function already contains g ˙ d : differentiating it with respect to λ d involves g ¨ d . Together with the bounded dictionary and compact parameter space, continuity of g ¨ d gives the parameter-Lipschitz bounds used in Lemma A1. Part (iii) restricts the parameter space to be compact and convex and requires the population calibration equation to have a unique solution λ d 0 in its interior; λ d 0 is the pseudo-true calibration parameter, and its existence is an overlap statement, since it asks the treated distribution of b ( X ) to be covered by that of the group-d respondents. Conditions of this kind are standard in the covariate balancing and calibration literature; see, for example, Chan et al. (2016), Q. Zhao (2019), and Imai and Ratkovic (2014).
Assumption 3 serves one purpose in what follows: it makes the two nuisance estimators λ ^ d and β ^ d root-n consistent and asymptotically linear, with a positive-definite Jacobian and square-integrable envelopes. This is exactly what the uniform laws of large numbers, mean-value expansions, and central limit theorems behind Theorems 1–3 require. The statement is given in Appendix A.5.
Write ω d 0 ( X ) = g d { b ( X ) ⊤ λ d 0 } , g ˙ d 0 ( X ) = g ˙ d { b ( X ) ⊤ λ d 0 } , and ℓ d 0 = b ( X ) ⊤ β d 0 . For each respondent group define the group-based density-ratio and outcome-model correctness conditions:
W d : ω d * ( X ) = g d { b ( X ) ⊤ λ d 0 } , M d : m d * ( X ) = b ( X ) ⊤ β d 0 ,
that is, the working family is correctly specified at the pseudo-true parameter. By the uniqueness of pseudo-true parameters, W d (resp. M d ) is equivalent to the existence of some λ d ∈ R K (resp. β d ∈ R K ) for which the working model equals the true function, since any such parameter solves the corresponding population equation and must therefore coincide with the pseudo-true value. In particular, ω d 0 = ω d * under W d and ℓ d 0 = m d * under M d .

5.1. Local Efficiency

We first consider the benchmark case in which all working models are correctly specified.
Theorem 1 (Local efficiency).
Under Assumptions 1–3, if W d and M d hold for both d ∈ { 0 , 1 } , then
n ( τ ^ JCB − τ ) → d N ( 0 , V eff ) ,
where V eff is the semiparametric efficiency bound of Proposition 1.
Theorem 1 shows that the JCB DID estimator is locally efficient: it attains the semiparametric efficiency bound without estimating the three probability models e * , r 1 * , and r 0 * separately. The proof is given in Appendix A.7. Local efficiency is a property at the intersection of correctly specified working models; the next two subsections show that consistency and valid inference are preserved on the much larger componentwise union model.

5.2. Double Robustness for Consistency

The relevant union model is componentwise:
( W 1 or M 1 ) and ( W 0 or M 0 ) .
Theorem 2 (Double robustness for consistency).
Under Assumptions 1–3, (20) implies τ ^ JCB → p τ .
Theorem 2 shows that the JCB DID estimator is doubly robust for consistency in a componentwise sense: for each respondent group d, it suffices that either the group-based density-ratio model or the outcome-evolution model is correctly specified, and the two groups may rely on different correctly specified components. The probability-limit bias of τ ^ JCB is
plim τ ^ JCB − τ = 1 p E [ ( a 1 * ω 1 0 − e * ) ( m 1 * − ℓ 1 0 ) ] − E [ ( a 0 * ω 0 0 − e * ) ( m 0 * − ℓ 0 0 ) ] .
For component d, W d makes a d * ω d 0 = e * , whereas M d makes m d * − ℓ d 0 = 0 . Thus, either model removes that component’s bias, independently across the two respondent groups. It should be stressed that M d requires the true outcome evolution m d * to be linear in the same dictionary b ( X ) that is used for calibration. The proof is given in Appendix A.8.

5.3. Double Robustness for Inference

Consistency alone does not guarantee valid inference: the limiting distribution of n ( τ ^ JCB − τ ) could in principle depend on the estimation error of λ ^ d , and this contribution varies with which working models are correctly specified. This subsection shows that the weighted least-squares choice of β ^ d in (15) removes this first-order effect, so that the variance estimator (17) delivers valid inference throughout the union model (20).
Define
ψ i 0 = 1 p D i { b ( X i ) ⊤ ( β 1 0 − β 0 0 ) − τ } + ∑ d = 0 1 s d S d i ω d 0 ( X i ) { Δ Y i − b ( X i ) ⊤ β d 0 } .
The population projection equation selects
β d 0 = E [ S d g ˙ d 0 ( X ) b ( X ) b ( X ) ⊤ ] − 1 E [ S d g ˙ d 0 ( X ) b ( X ) Δ Y ] .
Under (20), a first-order Taylor expansion of (14), evaluated at β 0 = ( β 1 0 ⊤ , β 0 0 ⊤ ) ⊤ and expanded in λ ^ around λ 0 = ( λ 1 0 ⊤ , λ 0 0 ⊤ ) ⊤ , gives
n ( τ ^ JCB − τ ) = 1 n ∑ i = 1 n ψ i 0 + 1 p ∑ d = 0 1 s d κ d ( β d 0 ) ⊤ n ( λ ^ d − λ d 0 ) + o p ( 1 ) , κ d ( β d ) = E S d g ˙ d 0 ( X ) b ( X ) { Δ Y − b ( X ) ⊤ β d } .
Exact calibration makes the derivative with respect to β d vanish. Moreover, κ d ( β d ) = 0 is precisely the population projection equation that defines β d 0 in (23), so κ d ( β d 0 ) = 0 by construction, even when the outcome model is misspecified; for any other choice of β d , the corresponding term κ d ( β d ) ⊤ n ( λ ^ d − λ d 0 ) would not vanish and the estimation error of λ ^ d would enter the limiting distribution. This choice removes the first-order effect of estimating λ d ; it does not remove the fixed misspecification bias in (21), which is why the union condition remains necessary. This projection argument parallels the complete-data constructions for doubly robust inference in Sant’Anna and Zhao (2020) and Li and Matsushita (2025).
Theorem 3 (Double robustness for inference).
Let ψ i 0 be defined by (22) with β 0 given by the weighted least-squares projection (23) . Under Assumptions 1–3 and (20) ,
n ( τ ^ JCB − τ ) = 1 n ∑ i = 1 n ψ i 0 + o p ( 1 ) → d N ( 0 , V 0 ) , V 0 = E [ ( ψ i 0 ) 2 ] ,
and V ^ → p V 0 .
Theorem 3 shows that inference based on (17) is valid throughout the componentwise union model, with the same variance formula regardless of which working models are correctly specified. If both the group-based density-ratio and outcome-evolution models are correctly specified for both groups, ψ i 0 equals the efficient influence function φ eff ( O i ) of Proposition 1 and V 0 = V eff , recovering the local efficiency stated in Theorem 1. The proof is given in Appendix A.9.
Remark 2.
It is worth being precise about what Theorem 3 delivers outside the intersection of correctly specified working models, since V 0 and V eff are then different objects. Because V ^ → p V 0 and V 0 is the actual asymptotic variance of τ ^ JCB under whichever part of the union model (20) holds, the confidence intervals are asymptotically exact rather than conservative: their coverage converges to the nominal level throughout the union model. What is given up outside that intersection is efficiency, not validity, since V 0 need not equal the bound V eff attained in Theorem 1. The consistency of V ^ in (25) is not automatic. In particular, the weights in (15) must be S d g ˙ d { b ( X ) ⊤ λ ^ d } , evaluated at the estimated calibration parameter λ ^ d , and that same λ ^ d must be used in (13) , (15) , and (16) .

6. Monte Carlo Study

This section examines the finite-sample behavior of τ ^ JCB along four dimensions: componentwise robustness and the accuracy of the associated inference throughout the union model (20); local efficiency at the intersection of correctly specified working models, together with a direct comparison with the estimator of Testa et al. (2026); what is given up when the factorized working models are correct and the composite ones are not; and the sensitivity of precision to the choice of dictionary. Appendix B.1 adds a weak-response design in which the calibration itself can fail.

6.1. Baseline Designs

We first consider four baseline designs with n ∈ { 250 , 500 , 1000 , 2000 , 5000 } , while the additional designs use selected sample sizes specified below. Within each design and sample size, all estimators are evaluated on the same simulated datasets. We fix the number of attempts per design and sample size, and record method-specific failures without replacing unsuccessful replications.
The raw covariates are independent standard normal variables, X 1 , X 2 ∼ i . i . d . N ( 0 , 1 ) . Define Z j = 2 Φ ( X j ) − 1 , j ∈ { 1 , 2 } , where Φ is the standard normal distribution function. Thus, Z 1 and Z 2 are independent Uniform [ − 1 , 1 ] variables, while the underlying covariates remain normally distributed. All estimators use the same working dictionary b ( X ) = ( 1 , Z 1 , Z 2 ) ⊤ . Let Q = Z 1 2 − 1 / 3 , which is omitted from the dictionary. Treatment is generated from
logit e * ( X ) = − 0.20 + 0.80 Z 2 2 − 1 3 .
The true group-based density ratios are
log ω 1 * ( X ) = 1 + 0.75 Z 1 , W 1 correct , 1 + 0.75 Z 1 + 0.50 Z 1 2 , W 1 incorrect ,
log ω 0 * ( X ) = 1.30 − 0.65 Z 1 + 0.10 Z 2 , W 0 correct , 1.30 − 0.65 Z 1 + 0.10 Z 2 + 0.60 Z 1 2 , W 0 incorrect .
Thus correctness means that the log density ratio is linear in b ( X ) ; misspecification is created by adding Z 1 2 . The response probabilities are
r 1 * ( X ) = exp { − log ω 1 * ( X ) } , r 0 * ( X ) = exp { logit e * ( X ) − log ω 0 * ( X ) } .
The separate logistic working models for e * , r 1 * , and r 0 * are therefore generally misspecified even when a composite density-ratio model W d is correct. Let g ( X ) = 1 + Z 1 − 0.70 Z 2 . The true outcome-evolution models are
m 0 * ( X ) = g ( X ) , M 0 correct , g ( X ) − 4 Q , M 0 incorrect , m 1 * ( X ) = g ( X ) + 2 , M 1 correct , g ( X ) + 2 + 2.5 Q , M 1 incorrect .
Hence, a correct outcome model is linear in b ( X ) , whereas an incorrect model contains the omitted quadratic component Q. We generate Δ Y = D m 1 * ( X ) + ( 1 − D ) m 0 * ( X ) + ε , ε ∼ N ( 0 , 1 ) , and draw R ∣ ( D = d , X ) ∼ Bernoulli { r d * ( X ) } independently of ε . Consequently, R ⊥ ⊥ Δ Y ∣ ( D , X ) , so Assumption 2(i) holds by construction. Because Z 1 and Z 2 are bounded, the response probabilities are also bounded away from zero, so Assumption 2(ii) holds.
The four designs are DGP1: W 1 and W 0 correct, with M 1 and M 0 incorrect; DGP2: W 1 and M 0 correct, with M 1 and W 0 incorrect; DGP3: M 1 and W 0 correct, with W 1 and M 0 incorrect; and DGP4: M 1 and M 0 correct, with W 1 and W 0 incorrect. Each design satisfies (20). Since treatment depends on Z 2 but not on Z 1 , E ( Q ∣ D = 1 ) = 0 . The true ATT is τ = 2 in every design.
We consider three estimators: the naive estimator, the proposed JCB estimator, and the plug-in estimator. The naive estimator is the difference in mean outcome evolution between the two respondent groups. The plug-in estimator uses (10), with three logistic probability regressions and two ordinary least-squares outcome-evolution regressions on the same dictionary. The JCB estimator is defined in Section 4.3. For the plug-in estimator and, in DGP5 below, the Testa estimator, standard errors are computed from joint sandwich estimators that include all fitted nuisance scores and their cross-covariances; JCB uses the influence-function variance estimator in (17). The calibration problem (12) is solved by Newton–Raphson with step halving, started at λ d = 0 , which under the exponential link corresponds to the unweighted respondent sample, and stopped when the largest absolute element of the gradient falls below 10 − 8 within 200 iterations. The projection (15) is an ordinary weighted least-squares fit. All computations are carried out in R version 4.6.0; the code and the simulation results are provided in the Supplementary Materials.
Remark 3.
Equation (5) implies ω 1 * ( x ) = 1 / r 1 * ( x ) ≥ 1 , a restriction the exponential link does not impose, so ω ^ 1 ( x ) < 1 can occur in finite samples. A reasonable alternative is the shifted link g 1 ( u ) = 1 + exp ( u ) , which enforces ω 1 > 1 and has g ˙ 1 ( u ) = exp ( u ) > 0 , so it satisfies Assumption 3(ii) and every result above applies to it unchanged. We nevertheless work with the unconstrained exponential link, for two reasons. It makes the calibration problem an exponential tilting, and hence directly comparable to entropy balancing (Hainmueller, 2012; Q. Zhao & Percival, 2017); and ω 1 * ≥ 1 is a property of the truth rather than a requirement for any of Theorems 1–3, so imposing it is unnecessary for consistency, efficiency or valid inference. We therefore report the share of treated respondents with ω ^ 1 < 1 as a diagnostic, and the constrained link is the natural choice when that share is large.
The results of the four baseline designs are summarized in Table 2 at n = 5000 and, across sample sizes, in Figure 1. Bias is the average deviation of the replicated estimates from the true ATT; SD is the empirical standard deviation of the replicated estimates and SE is the average of their estimated standard errors; RMSE is the root mean squared error; and coverage is the proportion of nominal 95% Wald intervals containing the true ATT. Parentheses give Monte Carlo standard errors (MCSEs), computed as in Table 6 of Morris et al. (2019): SD / m for the bias and { c ^ ( 1 − c ^ ) / m } 1 / 2 for the coverage c ^ , where m is the number of successful fits in the cell, equal to 2000 throughout Table 2.
Table 2. Baseline results.
Figure 1. Coverage against sample size in DGP1–DGP4. Bars are ± 1.96 Monte Carlo standard errors; the horizontal dotted line marks 0.95. Filled circles and solid lines denote JCB; open circles and dashed lines denote the plug-in estimator.
At n = 5000 , JCB has absolute bias below 0.005 in each baseline design, whereas the plug-in biases in DGP1–DGP3 are 0.075, 0.054, and 0.024. Measured against the Monte Carlo standard errors in Table 2, these plug-in departures are 39, 35, and 14 MCSEs from zero, and the associated coverages of 0.8580 in DGP1 and 0.8625 in DGP2 lie about twelve MCSEs below nominal, so they reflect misspecification rather than simulation noise. The JCB departures are smaller by an order of magnitude: only DGP1 exceeds two MCSEs, at − 0.0041 against an MCSE of 0.0018, and JCB coverage is within 2.3 MCSEs of 0.95 in every design. In DGP4, where both outcome models are correct, JCB and the plug-in estimator have essentially identical RMSE (0.061); their biases agree to four decimals and both lie 1.5 MCSEs from zero, so this design does not separate them. These comparisons illustrate correctness of the composite working models as a distinct source of robustness, rather than a general advantage over factorized models. The results above are all at n = 5000 , whereas Theorems 2 and 3 are asymptotic and the samples available in applied DID studies are often far smaller. We therefore turn to the behavior of the estimator and of its inference as n falls.
Figure 1 plots coverage against sample size for both estimators in the four baseline designs, with bars of ± 1.96 Monte Carlo standard errors. Two features stand out. First, at n = 250 neither estimator attains nominal coverage: JCB ranges from 0.897 to 0.916, and its mean estimated standard error is only 0.87 to 0.90 times the Monte Carlo standard deviation, so the asymptotic approximation understates the sampling variability. The gap closes as n grows; by n = 5000 , JCB coverage ranges from 0.938 to 0.955 and that ratio lies between 0.97 and 1.03. Second, the two estimators diverge in DGP1 and DGP2: the plug-in curve peaks near 0.934 at n = 1000 and then falls to 0.858 and 0.863 at n = 5000 , while JCB stays close to nominal. The plug-in bias settles near 0.07 and 0.05 from n = 500 onwards, while its standard error shrinks at the rate n − 1 / 2 , so the ratio of the two grows and the intervals miss increasingly often; this is the finite-sample signature of an inconsistent estimator. In DGP3 and DGP4 the two curves stay close, the smaller plug-in bias in DGP3 not yet being visible in coverage at these sample sizes. Detailed results are reported in Table A2 of Appendix B. We also examine the behavior of the JCB estimator when respondents are scarce, a setting in which its calibration can fail outright; that experiment is reported in Appendix B.1 and Table A4.

6.2. Efficiency Comparison

To illustrate the non-monotonic efficiency ranking discussed in Remark 1, we consider DGP5. Let e * = p = 0.4 and r 1 * = r 0 * = r = 0.6 . Define μ ( X ) = 0.5 Z 1 + 0.5 Z 2 and generate Y 0 = μ ( X ) + ε 0 , Y 1 = μ ( X ) + g ( X ) + 2 D + ε 1 , where ( ε 0 , ε 1 ) is mean-zero bivariate normal with unit marginal variances and correlation ρ ∈ { 0.2 , 0.8 } , independent of ( X , D , R ) . We retain Y 1 for every unit and reveal Y 0 only when R = 1 . Both MAR restrictions in Remark 1 hold, the ATT is 2, and all probability, density-ratio, and outcome working models on b ( 3 ) = ( 1 , Z 1 , Z 2 ) ⊤ are correctly specified. The sample sizes are 500, 1000, and 5000.
We directly implement the estimator under Assumption 2.3 of Testa et al. (2026), using low-dimensional logistic and linear regressions. This is a parametric implementation of their estimating equation, not a replication of their random-forest procedure. Write μ d * ( X ) = E ( Y 0 ∣ D = d , X ) , ν 0 * ( X ) = E ( Y 1 ∣ D = 0 , X ) and m 0 * = ν 0 * − μ 0 * . The estimator is
τ ^ T = 1 n 1 ∑ i = 1 n D i { U ^ 1 i − m ^ 0 ( X i ) } − ( 1 − D i ) e ^ ( X i ) 1 − e ^ ( X i ) { U ^ 0 i − m ^ 0 ( X i ) } ,
where m ^ 0 ( X ) = ν ^ 0 ( X ) − μ ^ 0 ( X ) , n 1 = ∑ i = 1 n D i is the number of treated units and U ^ d i = Y 1 i − μ ^ d ( X i ) − R i r ^ d ( X i ) { Y 0 i − μ ^ d ( X i ) } . Write V J = V eff for the semiparametric efficiency bound of the coarsened model in Proposition 1 and V T = V eff T for the bound of the outcome-level model in Remark 1, both evaluated at the generating distribution; the same notation is used for the other designs in Appendix B. In the present design, Proposition 1 and the comparison identity (9) give
V J = 2 ( 1 − ρ ) 1 p r + 1 ( 1 − p ) r , V T = 1 + 1 r − 2 ρ 1 p + 1 1 − p .
For ρ = 0.2 , ( V J , V T ) = ( 11.1111 , 9.4444 ) ; for ρ = 0.8 , they are ( 2.7778 , 4.4444 ) . Since e * and r d * are constant here and m 1 * − m 0 * = τ , both bounds reduce to functions of ρ alone, and because σ 0 , d * 2 = σ 1 , d * 2 , Remark 1 places the crossing point at ρ = 1 / 2 : the two values chosen are symmetric about it, so the ranking reverses, with V J > V T at ρ = 0.2 and V J < V T at ρ = 0.8 .
Table 3 confirms this prediction in the simulated data. Both estimators are essentially unbiased, and V ^ ¯ matches the corresponding bound. The reversal is therefore visible in the estimated variances and not only in the efficiency bounds: V ^ ¯ = 11.1267 for JCB against V ^ ¯ T = 9.4559 for Testa at ρ = 0.2 , and 2.7765 against 4.4475 at ρ = 0.8 . Because all four working models are correctly specified in DGP5, this finding also directly verifies Theorem 1.
Table 3. Efficiency comparison under intersection MAR.

6.3. Correct Factorized Models and Dictionary Sensitivity

Designs DGP6-N and DGP6-L reverse the roles of the two implementations: the probability models are genuinely logistic, so the factorized plug-in estimator is correctly specified, and we can quantify what JCB gives up in that case. They use
logit e * = − 1 + 1.5 Z 1 + 0.3 Z 2 , logit r 1 * = 0.3 − 0.7 Z 1 + 0.2 Z 2 , logit r 0 * = − 0.2 + 0.6 Z 1 − 0.2 Z 2 .
These models belong to the factorized working families on b ( 3 ) , whereas the composite density ratios generally do not belong to the exponential working family. DGP6-N uses m 0 * = g − 4 Q and m 1 * = g + 2 + 2.5 Q , so both linear outcome models are misspecified. Numerical integration gives E ( Q ∣ D = 1 ) = 0.0242 and τ = 2.1572 . DGP6-L uses m 0 * = g , m 1 * = g + 2 and τ = 2 . Both designs use n ∈ { 500 , 1000 } and unit-variance normal outcome-evolution noise.
Design DGP7 turns to the choice of dictionary. It retains the two correct composite ratios and two nonlinear outcome models from DGP1, but changes treatment assignment to
logit e * = − 0.5 + 0.8 ( Z 2 2 − 1 / 3 ) + 0.6 Q .
Now, E ( Q ∣ D = 1 ) = 0.0329 and τ = 2 + 6.5 E ( Q ∣ D = 1 ) = 2.2137 ; the omitted term therefore contributes to the ATT. We use n ∈ { 500 , 1000 } and compare JCB with b ( 2 ) = ( 1 , Z 1 ) ⊤ , b ( 3 ) , and b ( 4 ) = ( 1 , Z 1 , Z 2 , Q ) ⊤ on the same data. The control-group robustness condition fails for b ( 2 ) , both density ratios are correct for b ( 3 ) , and all four JCB working models are correct for b ( 4 ) . The results of DGP6-N, DGP6-L, and DGP7 are summarized in Table 4.
Table 4. Factorized correctness and dictionary sensitivity at n = 1000 .
At n = 1000 in DGP6-N, JCB bias is − 0.0249 (MCSE: 0.0034), compared with − 0.0014 (MCSE: 0.0036) for the plug-in estimator. JCB is outside its componentwise union model here. Its somewhat smaller RMSE, 0.153 versus 0.159, reflects a finite-sample variance trade-off and does not establish consistency. In DGP6-L both outcome models are correct, and the two estimators have almost identical bias and RMSE.
At n = 1000 , enriching b ( 3 ) to b ( 4 ) reduces JCB bias from − 0.0106 to − 0.0022 and RMSE from 0.207 to 0.181; it does not improve coverage (0.9415 versus 0.9315). The K = 4 calibration fails once in 2000 attempts at n = 500 . Dictionary enrichment can reduce approximation error and variance while making calibration more demanding; its effect on finite-sample coverage is not monotone.

7. Conclusions

This paper studies the estimation of the ATT in a DID design when the outcome evolution is missing at random. We derive the efficient influence function for the coarsened observed-data model and propose a joint covariate balancing estimator that combines treatment and response into a single indicator and calibrates the two group-based density ratios directly, thereby dispensing with the separate estimation of the treatment and response probabilities. The estimator requires only two working models for point estimation, is automatically self-normalized, and attains the semiparametric efficiency bound when all working models are correctly specified. Beyond local efficiency, it is componentwise doubly robust: for each respondent group, correct specification of either the density-ratio model or the outcome-evolution model suffices for consistency, and the weighted least-squares projection makes the same influence-function-based variance estimator valid throughout the union model, so that the resulting inference is doubly robust. The simulation results support the componentwise robustness of the proposed estimator and confirm the efficiency result when all nuisance models are correctly specified, while also highlighting substantial small-sample limitations under low response probabilities. Designs with correctly specified factorized probability models further show that the JCB estimator does not enjoy a universal advantage under model misspecification.
Several extensions merit further study. First, the two-period design studied here is the building block of the group-time average treatment effects of Callaway and Sant’Anna (2021), surveyed together with the recent DID literature in Roth et al. (2023); the joint balancing approach could be extended to multiple periods and staggered adoption, where group-time ATTs would require a family of calibration conditions. Second, the fixed dictionary b ( X ) could be allowed to grow with the sample size, connecting the joint balancing approach to sieve-based automatic estimation of the density ratios. Third, relaxing the MAR restriction on the outcome evolution toward instrument- or shadow-variable-based identification under missingness not at random is a natural next step.

Supplementary Materials

The following supporting information can be downloaded at https://www.mdpi.com/article/10.3390/econometrics14040054/s1.

Author Contributions

Conceptualization, J.L. (Jun Luo); methodology, J.L. (Jun Luo) and J.L. (Junjie Li); software, J.L. (Junjie Li); writing—original draft preparation, J.L. (Junjie Li); writing—review and editing, J.L. (Jun Luo). All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the 2026 Annual Project of the National Social Science Fund of China (NSSFC).

Data Availability Statement

All numerical results are generated by simulation. The R code and the simulation results are provided in the Supplementary Materials.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Proofs

Throughout, E denotes expectation under the true data-generating distribution of O = ( X , D , R , R Δ Y ) , and we use the factorization a 1 * = e * r 1 * , a 0 * = ( 1 − e * ) r 0 * recorded in (2). Assumption 2(i) and iterated expectations imply, for any measurable g with the requisite moments and d ∈ { 0 , 1 } ,
E [ S d g ( X ) ] = E [ a d * ( X ) g ( X ) ] , E [ S d g ( X ) Δ Y ] = E [ a d * ( X ) g ( X ) m d * ( X ) ] .

Appendix A.1. Proof of the Identification Result (4)

Proof. 
Applying the second identity in (A1) with g = ω d * and using a d * ω d * = e * from (5),
1 p E { S 1 ω 1 * ( X ) − S 0 ω 0 * ( X ) } Δ Y = 1 p E [ e * ( X ) m 1 * ( X ) ] − 1 p E [ e * ( X ) m 0 * ( X ) ] .
By Assumption 1(i), m 1 * ( X ) = E [ Y 1 ( 1 ) − Y 0 ( 0 ) ∣ D = 1 , X ] , and by conditional parallel trends (Assumption 1(ii)), m 0 * ( X ) = E [ Y 1 ( 0 ) − Y 0 ( 0 ) ∣ D = 0 , X ] = E [ Y 1 ( 0 ) − Y 0 ( 0 ) ∣ D = 1 , X ] on the treated support. Hence, the display equals E [ E [ Y 1 ( 1 ) − Y 1 ( 0 ) ∣ D = 1 , X ] ∣ D = 1 ] = τ . □

Appendix A.2. Proof of Proposition 1

Proof. 
The proof follows the structure of Hahn (1998) and Sant’Anna and Zhao (2020). The observed-data density with respect to a dominating measure factorizes as
f ( O ) = f X ( x ) e * ( x ) D { 1 − e * ( x ) } 1 − D r D * ( x ) R { 1 − r D * ( x ) } 1 − R f 1 ( Δ y ∣ x ) D R f 0 ( Δ y ∣ x ) ( 1 − D ) R ,
where r D * ( x ) = D r 1 * ( x ) + ( 1 − D ) r 0 * ( x ) and f d ( Δ y ∣ x ) denotes the conditional density of Δ Y given ( D = d , R = 1 , X = x ) ; by Assumption 2(i), m d * ( x ) = ∫ Δ y f d ( Δ y ∣ x ) d Δ y . For a regular parametric submodel through the truth, the score takes the form
S ( O ) = u ( X ) { D − e * ( X ) } + v ( D , X ) { R − r D * ( X ) } + D R s 1 ( Δ Y ∣ X ) + ( 1 − D ) R s 0 ( Δ Y ∣ X ) + t ( X ) ,
with ∫ s d ( Δ y ∣ x ) f d ( Δ y ∣ x ) d Δ y = 0 for all x and E [ t ( X ) ] = 0 .
We justify the claim that these elements generate the tangent space. The five factors f X , e * , r D * , f 1 , and f 0 in the displayed factorization are variation-independent, and the observed-data model places no restriction on any of them: Assumption 2(i) is a restriction on the joint law of ( R , Δ Y ) given ( D , X ) , which is not identified from O because Δ Y is recorded only when R = 1 ; it therefore restricts the full-data law but leaves the model for O nonparametric. Consequently, the tangent space is the orthogonal direct sum
T = T X ⊕ T D ⊕ T R ⊕ T 1 ⊕ T 0 ,
where T X = { t ( X ) : E t = 0 , E t 2 < ∞ } , T D = { u ( X ) { D − e * ( X ) } } , T R = { v ( D , X ) { R − r D * ( X ) } } , and T d = { S d s d ( Δ Y ∣ X ) : E [ s d ∣ D = d , R = 1 , X ] = 0 } , each intersected with L 2 . Orthogonality of the five summands follows from iterated expectations, using E [ D − e * ∣ X ] = 0 , E [ R − r D * ∣ D , X ] = 0 , and E [ s d ∣ D = d , R = 1 , X ] = 0 . That each summand is generated by regular parametric submodels is standard: for a bounded h in the relevant subspace, the one-dimensional submodel obtained by tilting the corresponding factor by 1 + θ h is regular with score h at θ = 0 , and bounded functions are dense in each summand, so the mean-square closure of the scores is the whole summand. This is precisely the coarsened data construction of Tsiatis (2006, Chapters 7–10), specialized to a two-stage coarsening by D and R; see also Hahn (1998) for the complete-data case. Because the observed-data model is nonparametric, T is the entire space of mean-zero square-integrable functions of O, so an influence function for τ is unique and is automatically efficient once it is shown to be an influence function; the verification below therefore establishes both claims at once. Along the submodel, (4) gives
τ ( θ ) = ∫ e θ ( x ) { m 1 , θ ( x ) − m 0 , θ ( x ) } f X , θ ( x ) d x ∫ e θ ( x ) f X , θ ( x ) d x , m d , θ ( x ) = ∫ Δ y f d , θ ( Δ y ∣ x ) d Δ y ,
whose pathwise derivative at the truth is
∂ θ τ = 1 p [ E e * ( X ) ∫ Δ y s 1 ( Δ y ∣ X ) f 1 ( Δ y ∣ X ) d Δ y − E e * ( X ) ∫ Δ y s 0 ( Δ y ∣ X ) f 0 ( Δ y ∣ X ) d Δ y + E { m 1 * ( X ) − m 0 * ( X ) − τ } ∂ θ e ( X ) + E { m 1 * ( X ) − m 0 * ( X ) − τ } e * ( X ) t ( X ) ] ,
where ∂ θ e ( X ) = ∂ e θ ( X ) / ∂ θ | θ = θ * denotes the pathwise derivative of the treatment probability along the submodel; matching the Bernoulli score component u ( X ) { D − e * ( X ) } gives ∂ θ e ( X ) = u ( X ) e * ( X ) { 1 − e * ( X ) } . Decompose
φ eff ( O ) = u ¯ ( X ) { D − e * ( X ) } + D R s ¯ 1 ( Δ Y ∣ X ) + ( 1 − D ) R s ¯ 0 ( Δ Y ∣ X ) + t ¯ ( X ) ,
with u ¯ = { m 1 * − m 0 * − τ } / p , s ¯ 1 = ω 1 * ( X ) { Δ Y − m 1 * ( X ) } / p , s ¯ 0 = − ω 0 * ( X ) { Δ Y − m 0 * ( X ) } / p , and t ¯ = e * ( X ) { m 1 * − m 0 * − τ } / p . Each s ¯ d integrates to zero against f d , and E [ t ¯ ( X ) ] = 0 because p τ = E [ e * ( m 1 * − m 0 * ) ] ; hence, φ eff ∈ T , and E [ φ eff ( O ) ] = 0 follows from the same identities. Pairing φ eff with each score component via iterated expectations, using E [ D { D − e * ( X ) } ∣ X ] = e * ( X ) { 1 − e * ( X ) } , E [ R − r D * ( X ) ∣ D , X ] = 0 , r 1 * ω 1 * = 1 , ( 1 − e * ) r 0 * ω 0 * = e * , and the zero conditional means of the residuals Δ Y − m d * ( X ) given ( D = d , R = 1 , X ) , all cross-terms vanish and
E [ φ eff ( O ) S ( O ) ] = ∂ θ τ
for every regular submodel, with the four surviving pairings matching the four terms of (A2). Therefore, φ eff is an influence function for τ ; being an element of T , it is the efficient influence function, and V eff = E [ φ eff 2 ] is the semiparametric efficiency bound. □

Appendix A.3. Proof of the Efficiency Comparison in Remark 1

Proof. 
Throughout this subsection we specialize to the design of Testa et al. (2026) under their Assumption 2.3: the post-treatment outcome Y 1 is always observed, R indicates that the baseline outcome Y 0 is observed, and the observed data are O T = ( X , D , Y 1 , R , R Y 0 ) , of which O = ( X , D , R , R Δ Y ) is a coarsening. We impose the intersection condition (7), that is, ( Y 0 , Y 1 ) ⊥ ⊥ R ∣ ( D , X ) , under which both MAR conditions are satisfied. The two bounds are defined in their respective observed-data models: V eff in the nonparametric model for O under Assumption 2(i), and V eff T in the nonparametric model for O T under their Assumption 2.3. Write ν d * ( X ) = E ( Y 1 ∣ D = d , X ) , μ d * ( X ) = E ( Y 0 ∣ D = d , X ) , so that m d * = ν d * − μ d * , and set
σ 1 , d * 2 ( X ) = Var ( Y 1 ∣ D = d , X ) , σ 0 , d * 2 ( X ) = Var ( Y 0 ∣ D = d , X ) , σ Δ , d * 2 ( X ) = Var ( Δ Y ∣ D = d , X ) .
Step 1 (Comparison of the two efficient influence functions). Based on Equation (5) in Proposition 2.8 of Testa et al. (2026), the efficient influence function for τ in the nonparametric model for O T is given by
φ T = 1 p [ D ( Y 1 − ν 1 * ) − R r 1 * ( Y 0 − μ 1 * ) − ( 1 − D ) e * 1 − e * ( Y 1 − ν 0 * ) − R r 0 * ( Y 0 − μ 0 * ) + D { m 1 * − m 0 * − τ } ] ,
where the dependence on X is suppressed for notational simplicity. Substituting Δ Y − m d * = ( Y 1 − ν d * ) − ( Y 0 − μ d * ) into (6), we obtain φ T − φ eff = Δ ( O , Y 1 ) , where Δ is defined in (8). Under (7), an application of the law of iterated expectations yields E [ Δ ( O , Y 1 ) ] = 0 .
Step 2 (Second and cross-moments). Because r d * ( X ) = P ( R = 1 ∣ D = d , X ) and R 2 = R , for d ∈ { 0 , 1 } ,
E 1 − R r d * | D = d , X = 0 , E 1 − R r d * 2 | D = d , X = 1 − r d * r d * ,
E R r d * 1 − R r d * | D = d , X = − 1 − r d * r d * ,
and, by (7), each of them factorizes from any function of ( Y 0 , Y 1 ) given ( D , X ) . The two terms of Δ are supported on D = 1 and D = 0 , respectively, so their cross-product vanishes because D ( 1 − D ) = 0 . Applying the law of iterated expectations conditional on ( D , X ) together with the second identity above, the second moment of Δ is
p 2 E ( Δ 2 ) = E e * 1 − r 1 * r 1 * σ 1 , 1 * 2 + E ( 1 − e * ) e * 1 − e * 2 1 − r 0 * r 0 * σ 1 , 0 * 2 = ∑ d = 0 1 E q d * σ 1 , d * 2 ,
where E [ ( Y 1 − ν d * ) 2 ∣ D = d , X ] = σ 1 , d * 2 , q 1 * = e * { 1 − r 1 * } r 1 * , and q 0 * = ( e * ) 2 { 1 − r 0 * } { 1 − e * } r 0 * . By a similar argument, the cross-moment of φ eff and Δ can be evaluated component by component. The component D { m 1 * − m 0 * − τ } of φ eff is a function of ( D , X ) ; it is orthogonal to the first term of Δ by the first identity above, and to the second term because D ( 1 − D ) = 0 . For the remaining components, S 1 ω 1 * = D R / r 1 * and S 0 ω 0 * = ( 1 − D ) R e * / { ( 1 − e * ) r 0 * } , so the third identity gives
p 2 E ( φ eff Δ ) = − E e * 1 − r 1 * r 1 * c 1 * − E ( e * ) 2 1 − e * 1 − r 0 * r 0 * c 0 * = − ∑ d = 0 1 E q d * c d * ,
where c d * = Cov ( Δ Y , Y 1 ∣ D = d , X ) .
Step 3 (Conclusion). Since φ T = φ eff + Δ and both terms have mean zero, V eff T = E ( φ T 2 ) = V eff + 2 E ( φ eff Δ ) + E ( Δ 2 ) . Combining the two displays in Step 2,
p 2 V eff T − V eff = p 2 2 E ( φ eff Δ ) + E ( Δ 2 ) = ∑ d = 0 1 E q d * σ 1 , d * 2 − 2 c d * .
Since c d * = Cov ( Y 1 − Y 0 , Y 1 ∣ D = d , X ) = σ 1 , d * 2 − Cov ( Y 0 , Y 1 ∣ D = d , X ) ,
σ 1 , d * 2 − 2 c d * = 2 Cov ( Y 0 , Y 1 ∣ D = d , X ) − σ 1 , d * 2 = − σ Δ , d * 2 − σ 0 , d * 2 ,
which is (9). □

Appendix A.4. Proof of Proposition 2

Proof. 
Applying the identities in (A1) to each term of (10),
p τ dr = E [ e * ( m 1 − m 0 ) ] + E [ a 1 * ω 1 ( m 1 * − m 1 ) ] − E [ a 0 * ω 0 ( m 0 * − m 0 ) ] ,
where all functions are evaluated at X. Subtracting p τ = E [ e * ( m 1 * − m 0 * ) ] and rearranging,
p ( τ dr − τ ) = E [ ( a 1 * ω 1 − e * ) ( m 1 * − m 1 ) ] − E [ ( a 0 * ω 0 − e * ) ( m 0 * − m 0 ) ] .
Each term in (A3) is the product of a weighting error and an outcome error for one respondent group. If ω d = ω d * , then a d * ω d = e * by (5); if m d = m d * , then m d * − m d = 0 . Hence, under the componentwise condition of Proposition 2, both terms vanish and τ dr = τ . □

Appendix A.5. Auxiliary Lemmas

Lemma A1 (Primitive conditions imply the asymptotic regularity used in Section 5).
Let Assumptions 1–3 hold and let d ∈ { 0 , 1 } . Then,
 (a) 
The population calibration objective λ d ↦ E [ S d G d { b ( X ) ⊤ λ d } − D b ( X ) ⊤ λ d ] , with G d ′ = g d , is strictly convex on Λ d , so the interior solution λ d 0 of Assumption 3(iii) is its global minimizer, and the Jacobian J d = E [ S d g ˙ d { b ( X ) ⊤ λ d 0 } b ( X ) b ( X ) ⊤ ] is finite and positive definite;
 (b) 
The population projection equation has the unique solution β d 0 of (23) , whose design matrix is exactly the calibration Jacobian J d , and the projection is a weighted least-squares fit with weights S d g ˙ d 0 ( X ) ;
 (c) 
With probability approaching one, the sample problem (12) has a unique minimizer λ ^ d in the interior of Λ d , and λ ^ d → p λ d 0 and β ^ d → p β d 0 ;
 (d) 
( λ ^ d , β ^ d ) is root-n consistent and asymptotically linear, with
n ( λ ^ d − λ d 0 ) = 1 n ∑ i = 1 n J d − 1 { D i − S d i ω d 0 ( X i ) } b ( X i ) + o p ( 1 ) ,
and
n ( β ^ d − β d 0 ) = J d − 1 1 n ∑ i = 1 n ζ d 0 ( O i ) + H d J d − 1 { D i − S d i ω d 0 ( X i ) } b ( X i ) + o p ( 1 ) ,
where
ζ d 0 ( O ) = S d g ˙ d 0 ( X ) b ( X ) { Δ Y − b ( X ) ⊤ β d 0 } , H d = E S d g ¨ d { b ( X ) ⊤ λ d 0 } b ( X ) b ( X ) ⊤ { Δ Y − b ( X ) ⊤ β d 0 } ;
 (e) 
The calibration and projection estimating functions, indexed by ( λ d , β d ) in a neighborhood of ( λ d 0 , β d 0 ) , are continuously differentiable in the parameters; the functions and their first derivatives have square-integrable envelopes, and the functions satisfy a parameter-Lipschitz bound with a square-integrable random coefficient.
Lemma A2 (Population calibration and projection identities).
Let Assumptions 1–3 hold. For d ∈ { 0 , 1 } ,
 (a) 
E [ { a d * ( X ) ω d 0 ( X ) − e * ( X ) } b ( X ) ] = 0 ;
 (b) 
If ω d * ( X ) = g d { b ( X ) ⊤ λ ¯ d } for some λ ¯ d ∈ R K , then λ ¯ d = λ d 0 , so that W d holds and a d * ω d 0 = e * almost surely;
 (c) 
If m d * ( X ) = b ( X ) ⊤ β ¯ d for some β ¯ d ∈ R K , then β ¯ d = β d 0 , so that M d holds and ℓ d 0 = m d * almost surely.
The two lemmas play different roles. Lemma A1 converts Assumption 3 into the asymptotic regularity that the later proofs use: a strictly convex population calibration objective with a finite, positive-definite Jacobian, a unique population projection coefficient whose design matrix is that same Jacobian, consistency of ( λ ^ d , β ^ d ) , their root-n asymptotic linearity, and square-integrable envelopes for the estimating functions. Parts (c)–(e) are what justify the uniform laws of large numbers, mean-value expansions and central limit theorems invoked in the proofs of Theorems 2 and 3.
Lemma A2 records the population identities behind the double-robustness arguments. Part (a) is the population counterpart of the sample balancing condition (11); it holds at the pseudo-true parameter whether or not the working models are correctly specified, and it is what removes each respondent group’s bias term. Parts (b)–(c) state that if the true density ratio ω d * or the true outcome evolution m d * belongs to the corresponding working family, then the pseudo-true parameter recovers it, so that W d holds at λ d 0 or M d holds at β d 0 . The lemma is used in the proofs of Theorems 1–3.
Proof of Lemma A1.
Fix d ∈ { 0 , 1 } and let C Λ = sup λ d ∈ Λ d ∥ λ d ∥ < ∞ , which is finite by Assumption 3(iii). By Assumption 3(i), | b ( X ) ⊤ λ d | ≤ C b C Λ = : C almost surely, uniformly in λ d ∈ Λ d . Because g d is continuous and strictly positive and g ˙ d is continuous and strictly positive by Assumption 3(ii), the constants
0 < c 1 = min | u | ≤ C g ˙ d ( u ) ≤ max | u | ≤ C g ˙ d ( u ) = c 2 < ∞ , 0 < c 3 = min | u | ≤ C g d ( u ) ≤ max | u | ≤ C g d ( u ) = c 4 < ∞ ,
are well defined, since a continuous positive function attains its bounds on a compact interval. By Assumption 3(ii), c 5 : = max | u | ≤ C | g ¨ d ( u ) | < ∞ . Hence, g d and g ˙ d are Lipschitz on [ − C , C ] , with constants c 2 and c 5 , respectively.
(a) The population objective Q d ( λ d ) = E [ S d G d { b ( X ) ⊤ λ d } − D b ( X ) ⊤ λ d ] is finite on Λ d and twice continuously differentiable, with ∇ 2 Q d ( λ d ) = E [ S d g ˙ d { b ( X ) ⊤ λ d } b ( X ) b ( X ) ⊤ ] ⪰ c 1 E [ S d b ( X ) b ( X ) ⊤ ] ≻ 0 by Assumption 3(i). Hence, Q d is strictly convex on the convex set Λ d , and the interior stationary point λ d 0 of Assumption 3(iii) is its global minimizer. The same display at λ d 0 shows that J d is positive definite, and J d ⪯ c 2 C b 2 I K shows that it is finite.
(b) The population projection equation is linear in β d with coefficient matrix E [ S d g ˙ d 0 ( X ) b ( X ) b ( X ) ⊤ ] = J d , which by (a) is nonsingular; the unique solution is therefore (23), and it is finite because ∥ b ∥ ≤ C b , g ˙ d 0 ≤ c 2 and E ( Δ Y 2 ) < ∞ . Since g ˙ d 0 > 0 , the equation is the normal equation of a genuine weighted least-squares fit.
(c) The class { S d G d { b ( X ) ⊤ λ d } − D b ( X ) ⊤ λ d : λ d ∈ Λ d } is uniformly bounded by max | u | ≤ C | G d ( u ) | + C and is Lipschitz in λ d with constant ( c 4 + 1 ) C b , hence Glivenko–Cantelli; therefore, sup λ d ∈ Λ d | Q ^ d ( λ d ) − Q d ( λ d ) | → p 0 , where Q ^ d is the sample objective in (12). Both objectives are convex, and Q d has a unique minimizer in the interior of Λ d , so the standard argument for convex M-estimation (Newey & McFadden, 1994) gives λ ^ d → p λ d 0 and, with probability approaching one, λ ^ d lies in the interior of Λ d and solves (11). Uniqueness holds with probability approaching one because ∇ 2 Q ^ d ⪰ c 1 E ^ [ S d b b ⊤ ] and E ^ [ S d b b ⊤ ] → p E [ S d b b ⊤ ] ≻ 0 . For β d , β ^ d solves a linear system whose matrix E ^ [ S d g ˙ d { b ( X ) ⊤ λ ^ d } b b ⊤ ] converges in probability to J d by the same uniform law and the continuity of g ˙ d , and whose right-hand side converges to E [ S d g ˙ d 0 b Δ Y ] ; hence, β ^ d → p β d 0 .
(d) On the event that λ ^ d is an interior solution, the integral form of the mean-value expansion of the sample calibration equation gives
0 = E ^ [ { S d ω d 0 ( X ) − D } b ( X ) ] + J ¯ d ( λ ^ d − λ d 0 ) ,
where
J ¯ d = ∫ 0 1 E ^ S d g ˙ d { b ( X ) ⊤ [ λ d 0 + t ( λ ^ d − λ d 0 ) ] } b ( X ) b ( X ) ⊤ d t .
The integrand has a bounded envelope and is Lipschitz in the calibration parameter, with constant c 5 C b 3 . A uniform law of large numbers, consistency from part (c), and continuity therefore give J ¯ d → p J d ≻ 0 . Rearranging and applying the central limit theorem to { D i − S d i ω d 0 ( X i ) } b ( X i ) , which has mean zero and a finite second moment, yields the stated asymptotic expansion for λ ^ d .
For the projection coefficient, use ζ d 0 and H d as defined in part (d) of the lemma. The derivatives of the projection equation with respect to λ d ⊤ and β d ⊤ have population limits H d and − J d , respectively. They are continuous in the parameters and dominated by an integrable envelope, as shown in part (e). Their uniform laws of large numbers, consistency from part (c), and the integral mean-value expansion therefore give
{ J d + o p ( 1 ) } n ( β ^ d − β d 0 ) = 1 n ∑ i = 1 n ζ d 0 ( O i ) + { H d + o p ( 1 ) } n ( λ ^ d − λ d 0 ) .
Since J d is nonsingular, n ( λ ^ d − λ d 0 ) = O p ( 1 ) , and the sum on the right is O p ( 1 ) , this first establishes n ( β ^ d − β d 0 ) = O p ( 1 ) and then yields
J d n ( β ^ d − β d 0 ) = 1 n ∑ i = 1 n ζ d 0 ( O i ) + H d n ( λ ^ d − λ d 0 ) + o p ( 1 ) .
Here, E [ ζ d 0 ( O ) ] = 0 by the population projection equation, and ζ d 0 has a finite second moment. Substituting the expansion for λ ^ d gives the stated expansion for β ^ d . Thus, both nuisance estimators are root-n consistent and asymptotically linear.
(e) Write b = b ( X ) , u = b ⊤ λ d , and r β = Δ Y − b ⊤ β d . The two functions used in Appendices Appendix A.8 and Appendix A.9 are
h d ( O ; λ d , β d ) = S d g d ( u ) r β , ζ d ( O ; λ d , β d ) = S d g ˙ d ( u ) b r β ,
or products of them with D or components of b. Their parameter derivatives are
∇ λ d h d = S d g ˙ d ( u ) b r β , ∇ β d h d = − S d g d ( u ) b , ∂ ζ d ∂ λ d ⊤ = S d g ¨ d ( u ) b b ⊤ r β , ∂ ζ d ∂ β d ⊤ = − S d g ˙ d ( u ) b b ⊤ .
These derivatives exist and are continuous by Assumption 3(ii). The calibration estimating function { S d g d ( u ) − D } b is also continuously differentiable, with derivative S d g ˙ d ( u ) b b ⊤ .
Let K be a compact convex neighborhood of β d 0 and B β = sup β d ∈ K ∥ β d ∥ . Since | r β | ≤ | Δ Y | + C b B β , the functions above and their first derivatives are bounded in norm, uniformly on Λ d × K , by
F d ( O ) = A d ( 1 + | Δ Y | ) ,
where A d < ∞ depends only on C b , C Λ , c 2 , c 4 , c 5 , and K . Products with D or components of b obey a bound of the same form. Integrating the first derivatives along the segment between any two parameter values θ = ( λ d ⊤ , β d ⊤ ) ⊤ and θ ˜ gives
| h d ( O ; θ ) − h d ( O ; θ ˜ ) | + ∥ ζ d ( O ; θ ) − ζ d ( O ; θ ˜ ) ∥ ≤ F d ( O ) ∥ θ − θ ˜ ∥ ,
after increasing A d if necessary. By Assumption 3(i), E [ F d ( O ) 4 ] < ∞ , so this is a square-integrable random Lipschitz coefficient and envelope, and the squared functions have integrable envelopes.
On the compact parameter neighborhood, the estimating functions, their first derivatives, and the squared estimating functions are continuous in the parameters and have integrable envelopes. Hence, uniform laws of large numbers apply. Together with consistency, these justify the convergence of the sample Jacobians in part (d) and the consistency of the variance estimator. At the limiting parameter values, square integrability ensures the ordinary central limit theorems used below. □
Proof of Lemma A2.
(a) Applying the first identity in (A1) coordinatewise, together with E [ D b ( X ) ] = E [ e * ( X ) b ( X ) ] , the population calibration equation in Assumption 3(iii) becomes E [ { a d * ω d 0 − e * } b ] = 0 . (b) By (5), a d * ω d * = e * , so λ ¯ d solves the population calibration equation; uniqueness in Assumption 3(iii) gives λ ¯ d = λ d 0 , and W d holds with a d * ω d 0 = a d * ω d * = e * . (c) If m d * = b ⊤ β ¯ d , the second identity in (A1) gives
E [ S d g ˙ d 0 ( X ) b ( X ) { Δ Y − b ( X ) ⊤ β ¯ d } ] = E [ a d * ( X ) g ˙ d 0 ( X ) b ( X ) { m d * ( X ) − b ( X ) ⊤ β ¯ d } ] = 0 ,
so β ¯ d solves the population projection equation; uniqueness (Lemma A1(b)) gives β ¯ d = β d 0 , and M d holds with ℓ d 0 = b ( X ) ⊤ β d 0 = m d * . □

Appendix A.6. Existence of a Finite Calibration Solution Under the Exponential Link

Here, we discuss the existence of a finite solution to the sample calibration problem in (12) under the exponential link; i.e., g d ( · ) = exp ( · ) , for which G d ( · ) = exp ( · ) . Under this link, (12) is an exponential tilting, or entropy balancing, problem (Graham et al., 2012; Hainmueller, 2012). Recall that the first element of b ( X ) is the constant b 1 ≡ 1 , and suppose E ^ [ S d b ( X ) b ( X ) ⊤ ] is nonsingular. Then, the sample objective in (12), minimized over R K , has a minimizer only if the support condition
∑ i = 1 n D i − 1 ∑ i = 1 n D i b ( X i ) ∈ ri conv b ( X i ) : S d i = 1 ,
where ri denotes the relative interior. Equivalently, b ¯ T ∈ ri conv B d , where b ¯ T = n 1 − 1 ∑ i = 1 n D i b ( X i ) , n 1 = ∑ i = 1 n D i , and B d = { b ( X i ) : S d i = 1 } . The minimizer, when it exists, is unique because the objective is strictly convex.
Two consequences are worth recording. First, the population analogue of (A4) is implied by Assumptions 1(iii) and 2(ii) with the factorization (2), since these guarantee a d * ( X ) > 0 on the covariate support of the treated, so that the treated distribution of b ( X ) is dominated by the group-d respondent distribution; the sample condition then holds with probability approaching one. Second, condition (A4) shows exactly how the risk of failure scales: (A4) is a statement in R K about ∑ i S d i points, so it becomes more demanding as K increases or as the number of respondents in the smaller group falls, which is the formal counterpart of separation in logistic regression and of the convex-hull condition in empirical likelihood. Condition (A4) therefore fails in exactly the situations practitioners worry about: a comparison group with few respondents; a covariate region populated by treated units but not by group-d respondents; or a dictionary rich enough that the treated mean escapes the K-dimensional hull.
Proof. 
Write n L ( λ ) = ∑ i : S d i = 1 exp { b ( X i ) ⊤ λ } − n 1 b ¯ T ⊤ λ for n times the objective in (12). Its Hessian is ∑ i : S d i = 1 exp { b ( X i ) ⊤ λ } b ( X i ) b ( X i ) ⊤ , which is positive definite because E ^ [ S d b b ⊤ ] is nonsingular and the exponential weights are strictly positive; hence, L is strictly convex. At a minimizer λ ^ d the first-order condition is ∑ i : S d i = 1 exp { b ( X i ) ⊤ λ ^ d } b ( X i ) = n 1 b ¯ T . Its first coordinate, which exists because b 1 ≡ 1 , gives ∑ i : S d i = 1 exp { b ( X i ) ⊤ λ ^ d } = n 1 . Hence, p i = exp { b ( X i ) ⊤ λ ^ d } / n 1 are strictly positive, sum to one, and satisfy ∑ i p i b ( X i ) = b ¯ T , which exhibits b ¯ T as a convex combination of B d with all weights strictly positive, that is, b ¯ T ∈ ri conv B d . □

Appendix A.7. Proof of Theorem 1

Proof. 
If W d and M d hold for both d ∈ { 0 , 1 } , then the union condition (20) also holds. Hence, Equation (25) in Theorem 3 yields
n ( τ ^ JCB − τ ) = 1 n ∑ i = 1 n ψ i 0 + o p ( 1 ) → d N ( 0 , V 0 ) , V 0 = E [ ( ψ i 0 ) 2 ] .
The proof of Equation (25) is provided in Appendix A.9. Obviously, when ω d 0 = ω d * and ℓ d 0 = m d * for both d, we have ψ i 0 = φ eff ( O i ) in (A10), and hence V 0 = E [ φ eff ( O ) 2 ] = V eff . □

Appendix A.8. Proof of Theorem 2

Proof. 
By Lemma A1(c), λ ^ d → p λ d 0 and the law of large numbers gives p ^ → p p > 0 . The envelope conditions supplied by Lemma A1(e) justify a uniform law of large numbers for λ d ↦ E ^ [ S d g d { b ( X ) ⊤ λ d } Δ Y ] in a neighborhood of λ d 0 , so by the continuous mapping theorem,
τ ^ JCB → p 1 p E [ { S 1 ω 1 0 ( X ) − S 0 ω 0 0 ( X ) } Δ Y ] = 1 p E [ a 1 * ω 1 0 m 1 * ] − E [ a 0 * ω 0 0 m 0 * ] ,
where the equality uses (A1). Combining (4) with (A1) evaluated at ω d * and using a d * ω d * = e * gives p τ = E [ e * ( m 1 * − m 0 * ) ] . Hence,
p plim τ ^ JCB − τ = E [ ( a 1 * ω 1 0 − e * ) m 1 * ] − E [ ( a 0 * ω 0 0 − e * ) m 0 * ] .
Because ℓ d 0 = b ( X ) ⊤ β d 0 , Lemma A2(a) yields E [ ( a d * ω d 0 − e * ) ℓ d 0 ] = 0 ; subtracting these zero terms from (A6) gives the product-bias formula (21). Consider component d. Under W d , Lemma A2(b) gives a d * ω d 0 − e * = 0 almost surely. Under M d , m d * = b ⊤ β d 0 is linear in b, so E [ ( a d * ω d 0 − e * ) m d * ] = 0 by Lemma A2(a). Under the union condition (20), both terms in (A6) therefore vanish, and τ ^ JCB → p τ . □

Appendix A.9. Proof of Theorem 3

Proof. 
Let β 0 = ( β 1 0 ⊤ , β 0 0 ⊤ ) ⊤ be defined by (23). The proof proceeds in six steps.
Step 1 (Augmented representation). The sample calibration condition (11) implies E ^ [ S d ω ^ d ( X ) b ( X ) ⊤ β d ] = E ^ [ D b ( X ) ⊤ β d ] for every β d ∈ R K ; adding and subtracting these quantities in (13) yields (14). Evaluating (14) at β = β 0 and subtracting τ ,
p ^ ( τ ^ JCB − τ ) = E ^ D { b ( X ) ⊤ ( β 1 0 − β 0 0 ) − τ } + ∑ d = 0 1 s d S d g d { b ( X ) ⊤ λ ^ d } { Δ Y − b ( X ) ⊤ β d 0 } .
Step 2 (Expansion in λ ^ ). Lemma A1(d)–(e) permits a mean-value expansion of λ d ↦ E ^ [ S d g d { b ( X ) ⊤ λ d } { Δ Y − b ( X ) ⊤ β d 0 } ] around λ d 0 ; the uniform convergence of the sample derivative to κ d ( β d 0 ) in shrinking neighborhoods of λ d 0 , combined with λ ^ d − λ d 0 = O p ( n − 1 / 2 ) , gives
p ^ ( τ ^ JCB − τ ) = p E ^ ( ψ i 0 ) + ∑ d = 0 1 s d κ d ( β d 0 ) ⊤ ( λ ^ d − λ d 0 ) + o p ( n − 1 / 2 ) ,
which yields (24) after dividing by p ^ and using p ^ → p p . By the definition of β d 0 in (23), κ d ( β d 0 ) = 0 , so the second term on the right-hand side of (A8) vanishes.
Step 3 (Mean zero under the union model). By (A1) and rearrangement,
p E ( ψ i 0 ) = E [ a 1 * ω 1 0 m 1 * ] − E [ a 0 * ω 0 0 m 0 * ] − p τ − ∑ d = 0 1 s d E [ ( a d * ω d 0 − e * ) b ( X ) ⊤ β d 0 ] .
The bracketed term equals the right-hand side of (A6) and vanishes under (20) by the proof of Theorem 2; each summand in the second term vanishes by Lemma A2(a), regardless of the value of β d 0 . Hence, E ( ψ i 0 ) = 0 .
Step 4 (Asymptotic normality). Assumption 3(i) and Lemma A1(e) ensure V 0 = E [ ( ψ i 0 ) 2 ] < ∞ . By Steps 1–3 and the central limit theorem, n E ^ ( ψ i 0 ) → d N ( 0 , V 0 ) . Since p ^ → p p > 0 , Slutsky’s theorem applied to n ( τ ^ JCB − τ ) = ( p / p ^ ) n E ^ ( ψ i 0 ) + o p ( 1 ) yields (25).
Step 5 (Consistency of the variance estimator). The quantity ψ ^ i in (16) equals ψ i 0 with ( λ 0 , β 0 , τ , p ) replaced by ( λ ^ , β ^ , τ ^ JCB , p ^ ) . All replaced quantities are consistent by Lemma A1(c)–(d) and Steps 1–4, the estimating function is continuous in the parameters in a neighborhood of their limits, and Assumption 3(i) with Lemma A1(e) supplies square-integrable envelopes; a standard uniform law of large numbers then gives V ^ = E ^ ( ψ ^ i 2 ) → p E [ ( ψ i 0 ) 2 ] = V 0 .
Step 6 (Local efficiency). Suppose W d and M d hold for both d ∈ { 0 , 1 } . Lemma A2(b)–(c) give ω d 0 = ω d * and ℓ d 0 = m d * , so
ψ i 0 = 1 p [ D i { m 1 * ( X i ) − m 0 * ( X i ) − τ } + S 1 i ω 1 * ( X i ) { Δ Y i − m 1 * ( X i ) } − S 0 i ω 0 * ( X i ) { Δ Y i − m 0 * ( X i ) } ] .
The right-hand side of (A10) coincides with the efficient influence function φ eff ( O i ) derived in Proposition 1. Hence, V 0 = V eff equals the semiparametric efficiency bound for the coarsened observed-data model. □

Appendix B. Additional Numerical Results

This appendix collects the full numerical output of the Monte Carlo study of Section 6. Table A1 records the population quantities that define each design, and Table A2 and Table A3 report performance and weight diagnostics for every design, estimator and sample size. Appendix B.1 then presents an additional design in which respondents are scarce.
Table A1. Probability bounds and population group response rates.
Table A2. Complete Monte Carlo performance results (2000 attempts per cell).
Table A3. JCB response, weight, and relative-variance diagnostics.

Appendix B.1. Weak Response

Design DGP8 divides both response probabilities of DGP1 by three, preserving correctness of both exponential density-ratio models by adding log 3 to their intercepts. The control-group response probability can be as low as 0.0296, and the population control-group response rate is approximately 0.0800. We use n ∈ { 250 , 500 , 1000 } .
Table A4. Weak response: Failures and conditional coverage.
DGP8 exposes an important finite-sample limitation. At n = 250 , JCB fails in 216 of 2000 attempts under the stated implementation; conditional coverage is 0.7668 and the proportion of all attempts yielding a covering interval is only 0.6840. Table A3 shows what drives this. The median effective sample sizes among successful fits are 11.0 for the treated respondents and 8.0 for the controls, while the median largest calibrated weight is 17.7 and 22.4 in the two groups and the 95th percentile of the largest control weight is 54.4, so a handful of respondents carries the estimate; 2.60% of treated respondents even receive a fitted weight below one, which ω 1 * ≥ 1 excludes. Both the failures and the undercoverage recede as the sample grows: at n = 1000 every fit succeeds, the effective sample sizes rise to 48.9 and 36.4, and coverage reaches 0.9250. None of this is an artifact of trimming. The calibrated weights of JCB are never trimmed, and the [ 0.01 , 0.99 ] clipping that the plug-in applies to its fitted probabilities is immaterial here: removing it leaves that estimator’s bias and coverage essentially unchanged, so the difficulty lies in the scarcity of respondents rather than in any stabilizing device.

References

  1. Abadie, A. (2005). Semiparametric difference-in-differences estimators. Review of Economic Studies, 72(1), 1–19. [Google Scholar] [CrossRef] [Scilit]
  2. Bang, H., & Robins, J. M. (2005). Doubly robust estimation in missing data and causal inference models. Biometrics, 61(4), 962–973. [Google Scholar] [CrossRef] [Scilit]
  3. Busso, M., DiNardo, J., & McCrary, J. (2014). New evidence on the finite sample properties of propensity score reweighting and matching estimators. Review of Economics and Statistics, 96(5), 885–897. [Google Scholar] [CrossRef] [Scilit]
  4. Callaway, B., & Sant’Anna, P. H. C. (2021). Difference-in-differences with multiple time periods. Journal of Econometrics, 225(2), 200–230. [Google Scholar] [CrossRef] [Scilit]
  5. Chan, K. C. G., Yam, S. C. P., & Zhang, Z. (2016). Globally efficient non-parametric inference of average treatment effects by empirical balancing calibration weighting. Journal of the Royal Statistical Society: Series B, 78(3), 673–700. [Google Scholar] [CrossRef] [Scilit]
  6. Chernozhukov, V., Chetverikov, D., Demirer, M., Duflo, E., Hansen, C., Newey, W., & Robins, J. (2018). Double/debiased machine learning for treatment and structural parameters. The Econometrics Journal, 21(1), C1–C68. [Google Scholar] [CrossRef] [Scilit]
  7. Fan, J., Imai, K., Lee, I., Liu, H., Ning, Y., & Yang, X. (2023). Optimal covariate balancing conditions in propensity score estimation. Journal of Business & Economic Statistics, 41(1), 97–110. [Google Scholar] [CrossRef] [Scilit]
  8. Graham, B. S., Pinto, C. C. d. X., & Egel, D. (2012). Inverse probability tilting for moment condition models with missing data. Review of Economic Studies, 79(3), 1053–1079. [Google Scholar] [CrossRef] [Scilit]
  9. Hahn, J. (1998). On the role of the propensity score in efficient semiparametric estimation of average treatment effects. Econometrica, 66(2), 315–331. [Google Scholar] [CrossRef] [Scilit]
  10. Hainmueller, J. (2012). Entropy balancing for causal effects: A multivariate reweighting method to produce balanced samples in observational studies. Political Analysis, 20(1), 25–46. [Google Scholar] [CrossRef] [Scilit]
  11. Hájek, J. (1971). Discussion of “An essay on the logical foundations of survey sampling, Part I,” by D. Basu. In V. P. Godambe, & D. A. Sprott (Eds.), Foundations of statistical inference. Holt, Rinehart and Winston. [Google Scholar]
  12. Hirano, K., Imbens, G. W., & Ridder, G. (2003). Efficient estimation of average treatment effects using the estimated propensity score. Econometrica, 71(4), 1161–1189. [Google Scholar] [CrossRef] [Scilit]
  13. Imai, K., & Ratkovic, M. (2014). Covariate balancing propensity score. Journal of the Royal Statistical Society: Series B, 76(1), 243–263. [Google Scholar] [CrossRef] [Scilit]
  14. Li, J., & Matsushita, Y. (2025). A difference-in-differences estimator by covariate balancing propensity score. arXiv, arXiv:2508.02097. [Google Scholar] [CrossRef] [Scilit]
  15. Morris, T. P., White, I. R., & Crowther, M. J. (2019). Using simulation studies to evaluate statistical methods. Statistics in Medicine, 38(11), 2074–2102. [Google Scholar] [CrossRef] [Scilit]
  16. Newey, W. K., & McFadden, D. (1994). Large sample estimation and hypothesis testing. In R. F. Engle, & D. L. McFadden (Eds.), Handbook of econometrics (Vol. 4, pp. 2111–2245). Elsevier. [Google Scholar]
  17. Robins, J. M., Rotnitzky, A., & Zhao, L. P. (1994). Estimation of regression coefficients when some regressors are not always observed. Journal of the American Statistical Association, 89(427), 846–866. [Google Scholar] [CrossRef] [Scilit]
  18. Roth, J., Sant’Anna, P. H. C., Bilinski, A., & Poe, J. (2023). What’s trending in difference-in-differences? A synthesis of the recent econometrics literature. Journal of Econometrics, 235(2), 2218–2244. [Google Scholar] [CrossRef] [Scilit]
  19. Sant’Anna, P. H. C., & Zhao, J. (2020). Doubly robust difference-in-differences estimators. Journal of Econometrics, 219(1), 101–122. [Google Scholar] [CrossRef] [Scilit]
  20. Tang, S., Zhan, M., Jiang, Q., & Zhang, T. (2024). Efficient covariate balancing for the average treatment effect with missing outcome. Economics Letters, 244, 111961. [Google Scholar] [CrossRef] [Scilit]
  21. Testa, L., Kennedy, E. H., & Reimherr, M. (2026). Efficient difference-in-differences estimation when outcomes are missing at random. arXiv, arXiv:2509.25009v2. Available online: https://arxiv.org/abs/2509.25009 (accessed on 14 September 2026). [CrossRef] [Scilit]
  22. Tsiatis, A. A. (2006). Semiparametric theory and missing data. Springer. [Google Scholar]
  23. Wong, R. K. W., & Chan, K. C. G. (2018). Kernel-based covariate functional balancing for observational studies. Biometrika, 105(1), 199–213. [Google Scholar] [CrossRef] [Scilit]
  24. Zhao, A., Ding, P., & Li, F. (2024). Covariate adjustment in randomized experiments with missing outcomes and covariates. Biometrika, 111(4), 1413–1420. [Google Scholar] [CrossRef] [Scilit]
  25. Zhao, Q. (2019). Covariate balancing propensity score by tailored loss functions. Annals of Statistics, 47(2), 965–993. [Google Scholar] [CrossRef] [Scilit]
  26. Zhao, Q., & Percival, D. (2017). Entropy balancing is doubly robust. Journal of Causal Inference, 5(1), 20160010. [Google Scholar] [CrossRef] [Scilit]
  27. Zubizarreta, J. R. (2015). Stable weights that balance covariates for estimation with incomplete outcome data. Journal of the American Statistical Association, 110(511), 910–922. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.