Estimation of the mean of an outcome subject to missingness has been extensively studied in the literature. Under the assumption that missingness is independent of the outcome conditional on observed covariates, the marginal expectation is identified as a parameter depending on the conditional expectation given covariates among observed individuals (outcome regression henceforth) and the marginal distribution of the covariates. If the covariate vector consists of a few categorical variables, a nonparametric maximum likelihood estimator yields an optimal (i. e., asymptotically efficient) estimator of the mean outcome. However, if the covariate vector contains continuous variables or its dimension is large, estimation of the outcome regression requires smoothing on the covariate space. This has often been achieved by means of a parametric model. Unfortunately, the correct specification of a parametric model is a chimerical task in high-dimensional settings or in the presence of continuous variables , and data-adaptive estimation methods such as those developed in the statistical learning literature (e. g., super learning, model stacking, bagging) must be used.
Our methods are developed in the context of targeted learning [2, 3], a branch of statistics that deals with the use of data-adaptive methods coupled with optimal estimation theory for infinite-dimensional models. In particular, the targeted minimum loss-based estimation (TMLE) framework allows consistent and locally efficient estimation of arbitrary low-dimensional parameters in high-dimensional models under regularity and smoothness conditions. In our context, targeted learning allows the incorporation of flexible data-adaptive estimators of the outcome regression into the estimation procedure.
Several doubly robust and locally efficient estimators have been proposed for the missing data problem. These estimators are based on a first-order expansion of the parameter functional, and are asymptotically efficient, under certain conditions. Arguably, the most important condition is that the outcome regression and the probability of missingness conditional on covariates (missingness score henceforth) are estimated consistently at an appropriate rate. A sufficient assumption for establishing of doubly robust estimators is that the outcome regression and the missingness score converge to their true values at rates faster than In this paper we are concerned with asymptotically efficient estimation under slower consistency rates of these estimators. In particular, we present a second-order TMLE that incorporates a second-order expansion of the parameter functional in order to relax this assumption, which may be implausible in high dimensions and for certain data-adaptive estimators. The method we present is an application of the general higher-order estimation theory we present in Ref. . We refer to the second-order estimator as 2-TMLE in contrast to the first-order TMLE discussed by Ref. , referred to as 1-TMLE.
A complete literature review of higher-order estimation theory is presented in Ref. . The most relevant references for the problem studied here are  and . In particular , presents a particular second-order expansion of the target parameter, as well as a second-order estimator based on that expansion. This estimator directly uses inverse weighting by a kernel estimate of the covariate density. As a result of the curse of dimensionality, the estimator may perform poorly in finite samples as the dimension of the covariate space increases. Particularly, it may fall outside of the parameter space. In contrast, the 2-TMLE presented here is a substitution estimator that always falls in the parameter space. The results presented in Ref.  establish the asymptotic properties of various calibration estimators in the context of missing data problems, concluding that some of them are second-order estimators. However, their results are not directly related to this manuscript since they assume a Euclidean parametrization of the outcome model and a known missingness score.
As with the estimator presented in Ref. , implementation of the 2-TMLE requires approximating the second-order influence function by means of kernel smoothing. When the covariate space is high-dimensional, this approximation is subject to the curse of dimensionality. This issue may be circumvented by utilizing an alternative second-order expansion that uses kernel smoothing on the missingness score, which is a one-dimensional function of the covariate vector. Since the true missingness score is generally unknown, implementation of this estimator must be carried out using an estimated missingness score. Unfortunately, introduction of the estimated missingness score in place of its true value yields a second-order remainder term in the analysis of the estimator. As a consequence, the estimator obtained is not a second-order estimator. We refer to this estimator as a 1*-TMLE in accordance with this observation. Notably, the second-order remainder term obtained with the 1*-TMLE is different from that of the 1-TMLE, which implies they have different finite sample properties. We conjecture that the 1*-TMLE improves finite sample performance over the 1-TMLE, and present a case study in which there are considerable finite sample gains.
Compared to the standard 1-TMLE, implementation of the 1*-TMLE requires the inclusion of one additional covariate in the outcome regression. As a result, its implementation is straightforward and comes at no computational cost. Moreover, the potential finite sample gains in performance can be overwhelming, as we illustrate in a simulation studying the coverage probability and mean squared error of the two estimators.
The paper is organized as follows. In Section 2 we review first-order efficient estimation theory for the mean outcome in a missing data model. In Section 3 we present the second-order expansion of the parameter functional and use it in Section 3.1 to construct a 2-TMLE. In Section 3.2 we introduce the 1*-TMLE discussed above. Section 4 presents a simulation showing that the 1*- TMLE and the 2-TMLE have improved coverage probabilities and mean squared error for slow convergence rates of the estimated outcome regression and missingness score. We conclude with Section 5 illustrating the use of the 1*-TMLE in a real data application.
2 Review of first-order estimation theory
Let W denote a d-dimensional vector of covariates, and let Y denote an outcome of interest measured only when a missingness indicator A is equal to one. To simplify the exposition, we assume that Y is binary or continuous taking values in the interval (0, 1). The observed data is assumed to have a distribution P0 in the nonparametric model . Assume we observe an i.i.d. sample O1,…, On, and denote the empirical distribution by Pn. For every element , we define
where EP denotes expectation under P. We denote , , and . We refer to as the outcome regression, and to g as the missingness score. We suppress the argument P from the notation QW(P), g(P), and whenever it does not cause confusion. For a function f of o, we use the notation . Let : be a parameter mapping defined as , and let . Under the assumptions that missingness A is independent of the outcome Y conditional on the covariates W and , it can be shown that , where F0 is the true distribution of the full data (W, Y). Because depends on P only through , we also use the alternative notation to refer to .
First-order inference for is based on the following expansion of the parameter functional around the true P0: (1)
where D(1)(P) is a function of an observation that depends on P, and R2(P, P0) is a second-order remainder term. The super index (1) is used to denote a first-order approximation. This expansion may be seen as analogous to a Taylor expansion when P is indexed by a finite-dimensional quantity, and the expression second-order may be interpreted in the same way.
We use the expression first-order estimator to refer to estimators based on first-order approximations as in eq. (1). Analogously, the expression second-order estimator is used to refer to estimators based on second-order approximations, e. g., as presented in Section 3 below.
Doubly robust locally efficient inference is based on approximation (1) with (2) (3)
Straightforward algebra suffices to check that eq. (1) holds with the definitions given above. D(1) as defined in eq. (2) is referred to as the canonical gradient or the efficient influence function [8, 3].
First-order targeted minimum loss-based estimation of is performed in the following steps :
Step 1. Initial estimators. Obtain initial estimators and of g0 and . In general, the functional form of g0 and will be unknown to the researcher. Since consistent estimation of these quantities is key to achieve asymptotic efficiency of , we advocate for the use of data-adaptive predictive methods that allow flexibility in the specification of these functional forms.
Step 2. Compute auxiliary covariate. For each subject i, compute the auxiliary covariate
Step 3. Solve estimating equations. Estimate the parameter ò in the logistic regression model (4)
by fitting a standard logistic regression model of Yi on , with no intercept and with offset logit , among observations with . Alternatively, fit the model
with weights among observations with . In either case, denote the estimate of .
Step 4. Update initial estimator and compute 1-TMLE. Update the initial estimator as , and define the 1-TMLE as .
converges to D(1)(P0) in L2(P0) norm, and
the size of the class of functions considered for estimation of is bounded (technically, there exists a Donsker class so that with probability tending to one),
In addition, if (5)
we obtain that . This implies, in particular, that is a -consistent estimator of , it is asymptotically normal, and it is locally efficient.
The first-order TMLE requires convergence of the second-order term to zero at rate or faster. When this convergence holds with one of or replaced by a misspecified limit or , an additional assumption (stating that a certain functional of the data-adaptive estimator or is asymptotically linear) is necessary to prove asymptotic linearity of the first-order TMLE. A method is presented in Ref.  that tackles this problem by proposing an estimator that satisfies the required asymptotic linearity assumption.
In this paper we discuss ways of constructing an estimator that requires a consistency assumption weaker than eq. (5). Note that eq. (5) is an assumption about the convergence rate of a second-order term involving the product of the differences and . Using the Cauchy-Schwarz inequality repeatedly, may be bounded as
where , and . For assumption (5) to hold, it is sufficient to have that
is bounded away from zero with probability tending to one;
is the MLE of (i. e., g0 is estimated in a correctly specified parametric model) since this implies ; and
3 Second-order estimation
Let us first introduce some notation. For a function of a pair of observations , let denote the expectation of with respect to the product measure .
Second-order estimators are based on second-order expansions of the parameter functional of the form (6)
where is a function of a pair of observations that depends on P, and is a third-order remainder term. is referred to as a second-order gradient. This representation exists only if W has finite support. If the support of W is infinite, it is necessary to use an approximate second-order influence function relying on smoothing, which yields a bias term referred to as the representation error. This may introduce challenges due to the curse of dimensionality. In this section we discuss two possible estimation strategies: (i) an estimator that implements kernel smoothing on the covariate vector, and (ii) an estimator that implements kernel smoothing on the missingness score. Strategy (i) is only practical in the presence of a few, possibly data-adaptively selected covariates, although a greater number of covariates may be included as sample size increases. Strategy (ii) requires a-priori knowledge of the true missingness score, and is therefore not applicable in most practical situations. As a solution, we propose to use strategy (ii) with the estimated missingness score to obtain an estimator we refer to as 1*-TMLE. As discussed below, the 1*-TMLE is not a second-order estimator, since introduction of an estimated missingness score yields a second-order term in the remainder term. Nevertheless, the potential finite sample gains obtained with the 1*-TMLE compared to the standard 1-TMLE are worth further investigation. In Section 4.2 we present a simulation study in which the 1*-TMLE showed considerable finite sample improvement in both mean squared error and coverage probability of associated confidence intervals.
3.1 Second-order estimator with Kernel smoothing on the covariate vector
Assume momentarily that W is discretely supported. Then the second-order expansion (6) holds with
In most practical situations, however, W is high-dimensional or it contains continuous variables so that the indicator is essentially always zero. To circumvent this issue, we propose to use the above expansion replacing the indicator function with a kernel function for a given bandwidth h. If W takes values on a discrete set, we define , so that the estimator below is the non-parametric estimator using empirical means in strata defined by W. We denote the corresponding approximation of D(2) by . The following lemma establishes conditions under which the representation error is negligible.
Suppose that the distribution of W has compact support and is absolutely continuous with respect to Lebesgue measure with density . Suppose that is a working estimate of . If
both and are -times continuously differentiable almost surely;
K is orthogonal to all polynomial powers up until ;
there exists some such that g0 is bounded below by , and both and are bounded below by with probability tending to one,
then we have that
The result above explicitly deals with kernel smoothing with common bandwidth in all dimensions. The lemma also holds, however, if a multivariate bandwidth is utilized, with h substituted by maxj hj in the statement of the lemma.
3.1.1 A corresponding 2-TMLE
Analogous to the 1-TMLE discussed in the previous section, we construct an estimator satisfying . Solving these equations allows us to exploit expansion (6) and construct a -consistent estimator in which assumption is replaced by the weaker assumption .
For a fixed bandwidth h, the proposed 2-TMLE is given by the following algorithm, which is implemented in the R code provided in the supplementary material.
Step 1. Initial estimators. See the previous section on the 1-TMLE.
Step 2. Compute auxiliary covariates. For each subject i, compute auxiliary covariates where
is a kernel regression estimator of g0 (w).
Step 3. Solve estimating equations. Estimate the parameter in the logistic regression model
by fitting a standard logistic regression model of Yi on and , with no intercept and with offset , among observations with . Denote the estimate of .
Step 4. Update initial estimator and compute 2-TMLE. Update the initial estimator as , and define the h-specific 2-TMLE as
Computation of involves inverse weighting by the square of . If the exposure is rare, these weights may be highly variable and cause instability and losses in finite sample performance of all estimators using inverse probability weighting. The provision of the theory of targeted minimum loss based learning [11, 12] for these cases is to take out one from the denominator of H(1) (W) and , and fit a weighted logistic regression model in Step 3, with weights given by . This method has been seen to perform well in practice and does not affect the validity of the asymptotic claims of this section.
The estimators presented above required a user-selected bandwidth h. Here we discuss briefly two possible ways to select a bandwidth to use in practice. Certain convergence rates are required of this bandwidth so that the resulting estimators achieve second-order properties (see Theorem 1 below). The first and easiest option is to select the bandwidth that maximizes the log-likelihood loss function of the density q0. However, because this choice is targeted to estimation of q0, it may be sub-optimal for estimation of . The second alternative is to use the collaborative TMLE (C-TMLE) presented in Ref. , which may result in correct convergence rates as argued in Ref. . The question of whether these selectors achieve the required convergence rate is an open research problem and will be the subject of future research.
The theorem below provides the exact conditions that guarantee asymptotic linearity of .
Under the conditions of Lemma 1, and provided that
each of and tend to zero in -norm;
there exists some such that and are bounded below by with probability tending to one;
each of and have uniform sectional variation norm bounded by some with probability tending to one;
the kernel function K is 2d-times differentiable and ,
and either of
holds, is an asymptotically efficient estimator of .
The proof of this theorem is presented in the supplementary materials. A key argument in the proof is that solves the estimating equations . The score equations of the logistic regression model (7) are equal to
Because the maximum likelihood estimator solves the score equations, it can be readily seen that
which, from the definitions of and , correspond to and , respectively.
As is evident from the conditions of the theorem, the rate at which the bandwidth decreases plays a critical role in the asymptotic behavior of the 2-TMLE described. On one hand, condition 5b of the theorem requires that the bandwidth converge to zero sufficiently quickly in order for to itself converge to zero, where m0 is the order of the kernel K used. This ensures that the representation error is negligible. On the other hand, condition 4 requires to converge to zero slowly enough to allow control of a V statistic term displayed in the proof of the theorem in the appendix.
Scrutiny of the theorem above reveals that a 2-TMLE will indeed generally be asymptotically linear and efficient in a larger model compared to a corresponding 1-TMLE. On one hand, as explicitly reflected in Theorem 1, for example, it is generally true that whenever a 1-TMLE is efficient, so will be a 2-TMLE. This illustrates that 2-TMLE operates in a safe haven wherein we expect not to hurt (asymptotically) a 1-TMLE by performing the additional targeting required to construct a 2-TMLE. On the other hand, we note that 2-TMLE will be efficient in many instances in which 1-TMLE is not. As an illustration, suppose in the setting of our motivating example that W is a univariate random variable with a sufficiently smooth density function. Suppose also that g0 is smooth enough so that an optimal univariate second-order kernel smoother can be utilized to produce an estimate of g0, so that . In this case, efficiency of a 1-TMLE requires that tends to Q0 at a rate faster than . In contrast, the corresponding 2-TMLE built upon a second-order canonical gradient approximated using an optimal second-order kernel smoother will be efficient provided that is consistent for , irrespective of the actual rate of convergence. The difference between these requirements may not seem drastic in settings where is sufficiently smooth since then constructing an estimator which satisfies both requirements is easy. This is certainly not so if fails to be smooth, in which case achieving convergence even at -rate may be a challenge. This problem is exacerbated further if W has several components. For example, if W is 5-dimensional, a 1-TMLE requires that tend to faster than , whereas the corresponding 2-TMLE based on a third-order kernel-smoothed approximation requires that tend to faster than . While the latter is achievable using an optimal second-order kernel smoother, the former is not, and without further smoothness assumptions on , a 1-TMLE will generally not be efficient.
3.1.2 Comparison with Alternative Second-Order Estimators
To the best of our knowledge, the only second-order estimator preceding our proposal is discussed in Ref. . For a bandwidth , their estimator is defined as (8)
Unlike our proposal, this estimator involved direct computation of , which in turn involves inverse weighting by an estimated multivariate density estimate As a consequence of the curse of dimensionality these weights may be very unstable, which may lead to a highly variable estimator in practice. In addition, the above estimator does not always satisfy the global constraints on the parameter space. In contrast, our proposed 2-TMLE is always in the parameter space, since it is defined as a substitution estimator.
3.2 Second-order estimator with Kernel smoothing on the missingness score
As transpires from the developments above, even if the support of W is finite but nonetheless rich, large samples will be required to ensure that the non-parametric estimator behaves sufficiently well. Given the sufficiency property of the propensity score as a summary of potential confounders, it is natural to inquire whether the use of a second-order partial gradient based on the propensity score (see discussion in Ref. ) may allow us to circumvent the dimensionality of W. Suppose that W is finitely supported, and consider the second-order expansion (6) with
In contrast to the previous section, here qW,0(w) represents the density function and represents Analogous to the multivariate case, it is often necessary to consider a kernel function instead of the indicator which may not be well supported in the data. We again denote the approximate second-order influence function obtained with such an approximation by to emphasize the dependence on the choice of bandwidth. Using this approximation the estimation procedure described in the previous section may be carried out in exactly the same fashion, but with replaced by This algorithm yields an asymptotically linear estimator of under the assumption that among other regularity assumptions.
Since is often unknown, we must instead use an estimate of ; for example, we may take:
Unfortunately, a careful analysis of the remainder term associated with this estimator reveals that the introduction of an estimate in place of g0 yields a second-order remainder term. This implies that asymptotic efficiency of this estimator, denoted 1*-TMLE, requires a second-order term to be negligible in order to be -consistent. The second-order term associated to this 1*-TMLE, however, is different from R2 defined in eq. (3) and required for asymptotic linearity of the 1-TMLE. As a consequence, these estimators are expected to have different finite sample properties. We conjecture that the 1*-TMLE of this section has improved finite sample properties over the 1-TMLE, and present a case study in Section 4 supporting our conjecture.
4 Simulation studies
In this section we present the results of two simulation studies, illustrating the improvements obtained by the 1*-TMLE and 2-TMLE compared to the 1-TMLE. We use covariate dimensions and and sample sizes to assess the performance of the estimators in different scenarios. Kernel smoothers were computed using the R package ks . The bandwidth was chosen using the default method of that package .
4.1 Simulation study with
4.1.1 Simulation setup
For each sample size n, we simulated 1,000 datasets from the joint distribution implied by the conditional distributions
where Ber denotes the Bernoulli distribution, expit denotes the inverse of the logit function, and Beta(a; b) denotes the Beta distribution.
For each dataset, we fitted correctly-specified parametric models for and g0. For a perturbation parameter p, we then varied the convergence rate of by multiplying the linear predictor by a random variable with distribution and subtracting a Gaussian random variable with mean and standard deviation . Analogously, the convergence rate of was varied using a perturbation parameter q by multiplying the linear predictor by a random variable and subtracting a Gaussian random variable with mean and standard deviation . We varied the values of p and q in a grid This perturbation of the MLE in a correctly specified parametric models is carried out to obtain initial estimators that have varying consistency rates. This allows us to easily vary the convergence rate in order to assess the performance of the estimators under such scenarios. To see how this procedure achieves varying consistency rates, denote the MLE of g0 in the correct parametric model by and denote the perturbed estimate by Let Un and Vn be random variables distributed and respectively. Then, substituting yields
Consider now different values of q. For example, yields the parametric consistency rate
whereas yields an inconsistent estimator.
We computed a 1-TMLE, 1*-TMLE, as well as a 2-TMLE for each initial estimator obtained through this perturbation. We compare the performance of the two estimators through their bias inflated by a factor relative variance compared to the nonparametric efficiency bound, and the coverage probability of 95 % confidence interval assuming a known variance. We assume the variance is known (and compute it as a empirical variance across simulated datasets) in order to isolate randomness and bias in its estimation. The variance, bias, and coverage probabilities are approximated through empirical means across the 1,000 simulated datasets.
4.1.2 Simulation results
Table 1 shows the relative variance (rVar, defined as n times the variance divided by the efficiency bound), the absolute bias inflated by a factor as well as the coverage probability of a 95 % confidence interval for selected values of the perturbation parameter (p, q). Figure 1 shows the absolute bias of each estimator multiplied by and Figure 2 shows the coverage probability of a 95 % confidence interval.
First, we notice that for certain slow convergence rates all the estimators have a very large bias (e. g., and and ). In contrast, for some other slow convergence rates, the absolute bias scaled by of the 1-TMLE diverges very fast in comparison to the 2- TMLE and 1*-TMLE (e. g., and ). The improvement in asymptotic absolute bias of the proposed estimators comes at the price of increased variance in certain small sample scenarios such as when the outcome model converges at a fast enough rate but the missingness mechanism does not In this case, the 1-TMLE has lower variance than its competitors. This advantage of the first-order TMLE disappears asymptotically as predicted by theory.
In terms of coverage, the improvement obtained with the 1*-TMLE and the 2-TMLE is overwhelming for small values of both p and q. As an example, consider the case in which the coverage probability is 0 and 0.91 for the 1-TMLE and the 1*-TMLE, respectively. This simulation illustrates the potential for dramatic improvement obtained by using the 1*-TMLE and the 2-TMLE, which comes at the cost of over-coverage in small sample sizes with a fast enough convergence rate
Figures 1 and 2 show clearly a region of slow convergence rates in which the proposed estimators outperform the standard first-order TMLE. In addition, as seen in Figure 1, we observe a small advantage of the 2-TMLE over the 1*-TMLE in terms of bias.
4.2 Simulations study with
4.2.1 Simulation setup
For each sample size we simulated 1,000 datasets from the joint distribution implied by the conditional distributions
where denotes the Bernoulli distribution, expit denotes the inverse of the logit function, and denotes the beta distribution. For each dataset, we fitted correctly-specified parametric models for and g0. We then varied the convergence rate of and by adding Gaussian random variables as in the previous subsection.
4.2.2 Simulation results
Table 2 shows the absolute bias, relative variance, and coverage probability of each estimator for selected values of the convergence perturbation (p, q). Figures 3 and 4 show the absolute bias and coverage probability of a 95 % confidence interval for all values of (p, q) used in the simulation.
The remarks of the previous section regarding the trade-offs between variance and bias in different regions of the convergence rates also hold for this simulation. The main difference observed here is that the 2-TMLE has poorer performance in terms of bias than the 1-TMLE and the 1*-TMLE for small samples when one of the models converges at a fast enough rate This problem disappears somewhat as n increases, but it highlights the point that the 2-TMLE should be used with caution in small samples.
In this simulation we do not see any practical advantage of the 2-TMLE over the 1*-TMLE. In fact, the 1*-TMLE performs better than the 2-TMLE for small samples, and outperforms the 1-TMLE in all sample sizes, with the caveat of increased variance in certain scenarios as discussed in the previous section.
5 Data illustration
In order to illustrate the method presented, we make use of the dataset lindner available in the R package PSAgraphics. The dataset contains data on 996 patients treated at the Lindner Center, Christ Hospital, Cincinnati in 1997, and were originally analyzed in Ref. . All patients received a Percutaneous Coronary Intervention (PCI). One of the primary goals of the original study was to assess whether administration of Abciximab, an anticoagulant, during PCI improves short and long term health outcomes of patients undergoing PCI. We reanalyze the lindner dataset focusing on the cardiac related costs incurred within 6 months of patients initial PCI as an outcome. The covariates measured are: indicator of coronary stent deployment during the PCI, height, sex, diabetes status, prior acute myocardial infarction, left ejection fraction, and number of vessels involved in the PCI.
As noted by several authors [e. g. Refs 8, 17, 18], causal inference problems may be tackled using methods for missing data. Let T denote an indicator of having received Abciximab. Adopting the potential outcomes framework, consider the potential outcomes given by the outcomes that would have been observed in a hypothetical world if, contrary to fact, The consistency assumption states that implies that where Y is the observed outcome. Thus, E(Yt) may be estimated using methods for missing outcomes, where Yt is observed only when In particular, estimation of E(Y1) and E(Y0) is carried out using the methods described in the previous sections with and respectively. Our parameter of interest is the average treatment effect
Since the outcome is continuous, we first used the transformation to map it to the interval [0; 1]. We then used the approach outlined in Ref.  to construct the 1-TMLE and the 1*-TMLE. We do not consider the 2-TMLE since the curse of dimensionality precludes estimation of the propensity score via kernel regression. The distribution of both estimators was estimated with the bootstrap as discussed in Section 4.2 of Ref. , which involves bootstrapping the second-order expansion of the estimator. This bootstrapped distribution is preferred to using the first order influence function, as it is expected to capture the second-order behavior of the estimators and therefore possibly results in finite sample gains for the 1*-TMLE. For comparison, we also present the confidence interval obtained using the asymptotic normal distribution with the variance estimated as the empirical variance of the first-order efficient influence function.
The mean of the outcome conditional on covariates was estimated separately for the two treatment groups. Both the outcome regression and the treatment mechanism where estimated using a model stacking technique called Super Learning . Super Learning takes a collection of candidate estimators and combines them in a weighted average, where the weights are chosen to minimize the cross-validated prediction error of the final predictor, measured in terms of the L2 loss function. The collection of algorithms used is described in Table 3. Table 4 shows the cross-validated risks of the algorithms as well as their weights in the final predictor of and g0.
For bandwidth selection, we use a loss function that targets directly the first-order expansion of the parameter of interest, which is equivalent to the first step of the collaborative TMLE (C-TMLE) presented in Ref. . This approximation of the C-TMLE is computationally more tractable and is justified theoretically as argued below.
Following , let index a random sample split into a validation sample and a training sample The cross-validation bandwidth selector is defined as
are the cross-validated residual sum of squares (RSS), cross-validated variance estimate, and cross-validated bias estimate, respectively. The key idea is to select the bandwidth h that makes most predictive of Y, while adding an asymptotically negligible penalty term for increases in bias and variance in estimation of Here, and are the result of applying the estimation algorithms described in Section 3 using only data in the training sample T(s).
This loss function is the result of adding a mean squared error (MSE) term to the usual RSS loss function used in regression problems. Since he MSE contribution to the loss function is asymptotically negligible compared to the RSS, this loss function yields a valid loss function for the parameter Intuitively, the cross-validated MSE term serves the purpose of penalizing bandwidths that are solely targeted to estimation of but perform poorly for This bandwidth selection algorithm as well as the estimator is implemented in the R code provided in the supplementary materials.
The unadjusted dollar difference in the outcome between the two groups is equal to US$1512. The 1-TMLE and the give an adjusted difference of US$765 and US$561; with 95 % bootstrap confidence intervals and , respectively. The bootstrap standard errors of the two estimators are 803 and 826, respectively. For comparison. the confidence interval obtained with the 2-TMLE using its asymptotic Gaussian distribution and the empirical variance of the first-order efficient influence function is The larger variance of the may be a consequence of our conjectured property that the has a better finite sample bias-variance trade-off. In this illustration the use of an estimator with improved asymptotic properties considerably changes the point estimate and confidence intervals.
We proposed a second-order estimator of the mean of an outcome missing at random, and present a theorem showing the conditions under which it is expected to be asymptotically efficient. Our main accomplishment is to show that the second-order TMLE achieves efficiency under slower convergence rates of the initial estimators than those required for efficiency of first-order estimators. The conditions for effficiency of our proposed second-order procedure include the convergence of a kernel bandwidth estimator at rates that are not allowed to be too fast or too slow. The construction of algorithms that achieve the required rates remains an open question.
In addition to the second-order estimator, we presented a novel first-order estimator whose construction is inspired by a second-order expansion of the parameter functional. We showed dramatic improvements in bias and coverage probability of this estimator compared to a first-order competitor in simulations. We conjecture that gains of this kind are expected to hold in general for finite samples, but a formal study of the remainder terms of both estimators remains to be done.
The properties of our proposed method under inconsistent estimation of one of the estimators of g0 and Q0 remain to be studied. In particular, an extension of the methodology of Ref.  to obtain second-order, doubly robust asymptotic inference is the subject of the future research in this area.
1. Starmans R.J. Models, inference, and truth: probabilistic reasoning in the information era. In: M van der Laan and S Rose, editors. Targeted Learning: Causal Inference for Observational and Experimental Data. New York: Springer, 2011. Web of ScienceGoogle Scholar
2. van der Laan MJ, Rubin D. Targeted maximum likelihood learning. Int J Biostat 2006;2. http://www.bepress.com/ijb/vol2/iss1/11. Google Scholar
9. van der Vaart AW. Asymptotic statistics. Cambridge: Cambridge University Press, 1998. Google Scholar
15. Wand MP, Jones MC. Multivariate plug-in bandwidth selection. Comput Stat 1994;9:97–116. Google Scholar
16. Bertrand ME, Simoons ML, Fox KA, Wallentin LC, Hamm CW, McFadden E, et al. Management of acute coronary syndromes in patients presenting without persistent ST-segment elevation. Eur Heart J 2002;23(23):1809–40. PubMedCrossrefWeb of ScienceGoogle Scholar
21. Gruber S, van der Laan M. C-tmle of an additive point treatment effect. In: M van der Laan and S Rose, editors. Targeted Learning: Causal Inference for Observational and Experimental Data. New York: Springer, 2011. Web of ScienceGoogle Scholar
The online version of this article (DOI: 10.1515/ijb-2015-0031) offers supplementary material, available to authorized users
About the article
Published Online: 2016-05-26
Published in Print: 2016-05-01
Funding: Marco Carone was supported in part by NIH grant UM1AI068635, by an endowment generously provided by Genentech, and by the University of Washington Department of Biostatistics Career Development Fund. Mark J. van der Laan was supported NIH grant R01AI07434506.