{"id":844,"date":"2024-12-20T14:48:08","date_gmt":"2024-12-20T14:48:08","guid":{"rendered":"https:\/\/www.let-all.com\/blog\/?p=844"},"modified":"2024-12-20T14:48:08","modified_gmt":"2024-12-20T14:48:08","slug":"structure-agnostic-causal-estimation","status":"publish","type":"post","link":"https:\/\/www.let-all.com\/blog\/2024\/12\/20\/structure-agnostic-causal-estimation\/","title":{"rendered":"Structure-Agnostic Causal Estimation"},"content":{"rendered":"\n

We have another new technical blog post, courtesy Jikai Jin<\/a> and Vasilis Syrgkanis<\/a>, about optimality of double machine learning for causal inference.<\/p>\n\n\n\n

\n\n\n\n

An introduction to causal inference<\/h2>\n\n\n\n

Causal inference deals with the fundamental question of \u201cwhat if\u201d, trying to estimate\/predict the counterfactual outcome that one does not directly observe. For instance, one may want to understand the effect of a new medicine on a population of patients. For each patient, we never simultaneously observe the outcome under the new medicine (treatment) and the outcome under the baseline treatment (control). This makes causal inference a challenging task, and the ground-truth causal parameter of interest is identifiable only under additional assumptions on the data generating process.<\/p>\n\n\n\n

The most central quantity of interest in the causal inference literature is the Average Treatment Effect (ATE). To mathematically define the ATE, we will use the language of potential outcomes. We posit that nature generates two potential outcomes \"Y_i(0),, where \"Y_i(d)\" can be thought as the outcome we would have observed from unit \"i\", had we treated them with treatment \"d\in. Then the ATE is defined as the average difference of these two potential outcomes in the population:<\/p>\n\n\n\n

\"\theta.<\/p>\n\n\n\n

Unless otherwise specified, we will always use a subscript \"0\" to denote the ground-truth quantity. The main problem is that for each unit we do not observe both potential outcomes. Rather, we observe the potential outcome for the assigned treatment, \"Y_i. <\/p>\n\n\n\n

The first key question in causal inference is the identification question<\/em>: can we write the ATE, which depends on the distribution of unobserved quantities, as a function of the distribution of observed random variables? Many techniques have been developed in causal inference that solve the identification question under various assumptions on the data generating process and the kinds of variables that are observed. For the interested reader, one can search for terms such as identification by conditioning, instrumental variables, proximal causal inference, difference-in-differences, regression discontinuity and synthetic controls, and refer to related textbooks [AP09,CHK+24].<\/p>\n\n\n\n

For the purpose of this blog we will focus on identification by conditioning, which has been well-studied in the literature and very frequently used in the practice of causal inference. This identification approach makes the assumption that, once we condition on a large enough set of observed characteristics \"X\" (typically referred to as \u201ccontrol variables\u201d or \u201cconfounders\u201d), the treatment is assigned as if it was a randomized trial; a condition typically referred to as the conditional ignorability assumption<\/p>\n\n\n\n

\"\{Y(0),Y(1)\}.<\/p>\n\n\n\n

Under this assumption, the ATE is identifiable via the well-known g-formula:<\/p>\n\n\n\n

\"\theta.<\/p>\n\n\n\n

where the function \"g(d,x) is a regression function and is thus uniquely determined by the distribution of observed data. Intuitively, this formula says: train a predictive model that predicts the outcome from the treatment and the control variables and then take the average difference of the predictions of this model as you flip the treatment variable on or off. This quantity is also strongly related to the partial dependence plot<\/a>, used frequently in interpretable machine learning. It basically corresponds to the difference of the value of the partial dependence plot of the outcome with the treatment, when the treatment takes value one vs when the treatment takes value zero.<\/p>\n\n\n\n

The causal machine learning paradigm<\/h2>\n\n\n\n

The second key question in causal inference is the estimation question<\/em>: given \"n\" samples of the observed variables, how should we estimate the ATE? In other words, we need to translate the identification strategy into an estimation strategy. For instance, in the context of identification by conditioning, note that even though our goal is to estimate \"\theta\", to achieve that we also need to estimate the complicated non-parametric regression function \"g\". Such auxiliary functions, whose estimation is required in order to estimate the target parameter of interest, are referred to as nuisance functions. The requirement to estimate complicated nuisance functions in a flexible manner arises in most identification strategies in causal inference and this is exactly where machine learning techniques can be of great help, giving rise to the Causal Machine Learning paradigm.<\/p>\n\n\n\n

At a high level, causal machine learning is an emerging research area that incorporates machine learning (ML) techniques into statistical problems that emerge in causal inference. In the past decade, ML has gained tremendous success on numerous tasks, such as image classification, language processing, and video games. These problems more or less possess certain intrinsic structures that one can exploit. In image classification problems, for example, semantically meaningful objects can typically be found locally as a combination of pixels, and this suggests that using convolutional neural networks, rather than standard feed-forward neural networks, might lead to better results. The idea of causal machine learning is to leverage the ability of ML techniques to adapt to intrinsic notions of dimension, when learning the complex nuisance quantities that arise in causal identification strategies.<\/p>\n\n\n\n

Double\/debiased machine learning: an overview<\/h2>\n\n\n\n

What makes causal ML different from ML? To answer this question, it is instructive to revisit an extremely popular algorithm in causal ML: double\/debiased machine learning (DML)[CCD+17] (variants of the ideas we will present below have also appeared in the targeted learning literature [LR11], but for simplicity of exposition we adopt the DML paradigm in this blogpost). <\/p>\n\n\n\n

Suppose that we are given i.i.d. data \"\{(X_i,D_i,Y_i)\}_{i=1}^n\" where \"X_i\" is a high-dimensional covariate vector, \"D_i\" is a binary treatment variable and \"Y_i\" is an outcome of interest. Without loss of generality, we can describe the data generating process of these variables via the following nonparametric regression equations:<\/p>\n\n\n\n

\"Y<\/p>\n\n\n\n

\"D=p(X)+\eta,.<\/p>\n\n\n\n

where \"g(d,x)\" is known as the outcome regression and \"p(x)\" is known as the propensity score. Let \"P_0\" be the distribution of \"(X,D,Y)\". Then the ATE problem asks us to estimate the quantity \"\theta_0. <\/p>\n\n\n\n

The ATE is just one example of a broad class of causal parameter estimation problems, for which the ground-truth parameter \"\theta_0\" satisfies some moment equation<\/p>\n\n\n\n

\"\mathbb{E}[m(Z,\theta_0,h_0(X))]=0\",<\/p>\n\n\n\n

where \"m(\cdot)\" is some moment function, \"Z\" is the observed data, \"X\" is a subvector of \"Z\" and \"h_0\" is the ground-truth nuisance function. In the case of ATE, we can for example choose \"Z=X\", \"h=(g,p)\"  and \"m\left(Z,. Given this expression, a naive approach for estimating \"\theta_0\" can be derived by first using ML to fit an estimate \"\hat{h}\" of the ground-truth nuisance functions \"h_0\", and then solve the empirical moment equation<\/p>\n\n\n\n

\"\frac{1}{n}\sum_{i=1}^n.<\/p>\n\n\n\n

However, the resulting estimate \"\hat{\theta}\" would be biased if the nuisance estimates are biased. The latter happens quite often in practice, since ML typically requires using regularization to prevent the model from overfitting. As a result, it would be desirable if the quality of our estimate is more robust to nuisance estimation errors.<\/p>\n\n\n\n

The key observation is that this would be the case if a Neyman orthogonality<\/em> condition holds, namely <\/p>\n\n\n\n

\"\mathbb{E}\left[\partial_h,<\/p>\n\n\n\n

where \"\partial_h\" denotes the functional derivative of \"h\".<\/p>\n\n\n\n

Intuitively, this condition implies that the induced error is less sensitive to misspecification of nuisance function. Then a simple Taylor expansion would imply that the estimation error \"\hat{\theta}_{DML}\" solved from the empirical moment equation would have second-order dependency on the nuisance errors.<\/p>\n\n\n\n

In the case of ATE, the moment function<\/p>\n\n\n\n

\"m(Z,<\/p>\n\n\n\n

satisfies such requirements, where \"Z=(X,D,Y)\" and \"h=(g,p)\". Given a dataset \"\{(X_i,D_i,Y_i)\}_{i=1}^n\", we can split it into two datasets \"\mathcal{D}_1=\{(X_i,D_i,Y_i)\}_{i=1}^{n\/2}\" and \"\mathcal{D}_2=\{(X_i,D_i,Y_i)\}_{i=n\/2+1}^{n}\" each with \"n\/2\" samples. Then DML consists of the following two stages:<\/p>\n\n\n\n

    \n
  1. Use our favorite ML method (e.g. Lasso, random forest, neural network etc.) to estimate \"g(\cdot)\" and \"p(\cdot)\".<\/li>\n\n\n\n
  2. Solve for \"\theta\" from the empirical moment equation<\/li>\n<\/ol>\n\n\n\n

     \"\sum_{i=n\/2+1}^n<\/p>\n\n\n\n

     where \"\hat{h}=(\hat{g},\hat{p})\" is our first-stage nuisance estimate.<\/p>\n\n\n\n

    Note that the main reason why DML would improve over the naive approach is that the moment function is chosen to satisfy the Neyman orthogonality property. By contrast, one can easily verify that the moment function \"m\left(Z, is not<\/em> Neyman orthogonal.<\/p>\n\n\n\n

    It is well-known that for the case of the ATE, the DML approach also possesses double robustness properties<\/em>; a property that dates back to the seminal work of [RRZ94]. In fact the resulting estimator is the well-known doubly robust estimator [RRZ94] with the extra element of sample splitting, when estimating the nuisance functions. Specifically, suppose that our first-stage nuisance estimates have mean-square errors \"\epsilon_g\" and \"\epsilon_p\" respectively, then under mild regularity assumptions, the DML estimate \"\hat{\theta}_{DML}\" satisfies<\/p>\n\n\n\n

    \"\left|\hat{\theta}_{DML}-\theta_0\right|<\/p>\n\n\n\n

    with high probability. Intuitively, because the estimation error of \"\hat{\theta}_{DML}\" stems from the misspecification of nuisance functions in the moment equation, by Taylor\u2019s formula, it would contain the term \"\epsilon_g^{\alpha}\epsilon_p^{\beta}\" if and only if \"\mathbb{E}\left[\partial_g^{\alpha}\partial_p^{\beta}. By calculating the functional derivatives, it is then easy to check that \"\epsilon_g\epsilon_p\" is the dominating term. In particular, Neyman orthogonality implies that all first-order error terms vanish.<\/p>\n\n\n\n

    Importantly, this guarantee is structure-agnostic<\/em>: this rate does not rely on any structural assumptions on the nuisance functions. What we need to assume is merely access to black-box ML estimates with some mean-squared error bounds. This is the reason why DML is widely adopted in practice: while there exist alternative estimators that can achieve improved error rates under structural assumptions on the non-parametric components, these assumptions can easily be violated, making these estimators cumbersome to deploy.<\/p>\n\n\n\n

    The problems that causal ML studies are not new. In the non-parametric estimation literature, there have been extensive results that focus on non-parametric efficiency and optimal rates for estimating causal quantities, under structural assumptions on the model such as smoothness of the non-parametric parts of the data generating process [RLM17,KBRW22]. However, the causal ML approach takes a more structure-agnostic view on the estimation of these nuisance quantities, and essentially solely assumes access to a good black-box oracle that provides us with relatively accurate estimates. This naturally gives rise to the structure-agnostic minimax optimality framework.<\/p>\n\n\n\n

    The structure-agnostic framework<\/h2>\n\n\n\n

    We have seen that the key characteristic that differentiates the causal ML approach to estimation (e.g. the DML approach) with the traditional approaches is its structure-agnostic nature. In this section, we discuss the structure-agnostic framework that allows us to compare the performance of structure-agnostic estimators. This framework was originally proposed by [BKW23].<\/p>\n\n\n\n

    To keep things simple, we restrict ourselves to the same setting as the previous section. Now suppose we have nuisance estimates \"\hat{h}=(\hat{g},\hat{p})\" with mean-square errors \"\epsilon_g\" and \"\epsilon_p\". The structure agnostic minimax optimality framework asks the following question: if we don\u2019t make any further restriction on the data generating process other than the fact that we have access to estimates for the nuisance functions that have mean-squared-error that is upper bounded of \"\epsilon_g\" and \"\epsilon_p\", then what is the best estimation rate that is achievable by any estimation method?<\/p>\n\n\n\n

    To formalize this, we define the uncertainty set, as the set containing all distributions that are consistent with the given estimators:<\/p>\n\n\n\n

    \"\mathcal{F}_{\epsilon_g,<\/p>\n\n\n\n

    \"\left\|<\/p>\n\n\n\n

    where \"P_X\" is the marginal distribution of \"X\". Here we restrict ourselves to the case where \"D\" and \"Y\" are binary. This additional constraint would only strengthen our minimax lower bounds presented in this blog. In this case,  each tuple \"(P_X,p,g)\" uniquely determines a distribution over observational data. For any set \"\mathcal{F}\", we define the minimax \"1-\gamma\" quantile risk for estimating the ATE by<\/p>\n\n\n\n

    \"\mathfrak{M}_{n,,<\/p>\n\n\n\n

    where \"P_s\" and \"\theta_s^{\mathrm{ATE}}\" are the data distribution and the ATE induced by \"s\" respectively, and \"Q_{P,1-\gamma}(\cdot)\" is the quantile function under data distribution \"P\". Clearly, our previous discussions of DML implies that the worst-case risk is at most \"\epsilon_g\epsilon_p+n^{-1\/2}\". This framework precisely captures the main idea behind causal ML estimators that we described in the previous section.<\/p>\n\n\n\n

    Main results<\/h2>\n\n\n\n

    In this section, we introduce our main results on structure-agnostic lower bounds [JS24]. Prior to our work, the only known structure agnostic lower bounds were established in [BKW23]. In their paper, it is shown that DML is optimal for estimating a set of functionals of interest, which relate to the ATE but which do not include the ATE functional.<\/p>\n\n\n\n

    Our first result establishes the optimality of DML for estimating the ATE, i.e., the doubly robust estimator with sample splitting, achieves the statistically optimal rate. As discussed in the previous section, the DML estimator for the ATE is given by<\/p>\n\n\n\n

    \"\hat{\theta}^{\mathrm{ATE}}=\frac{1}{n}<\/p>\n\n\n\n

    and has the structure-agnostic rate of \"\epsilon_g\epsilon_p+n^{-1\/2}\". We now establish a matching lower bound.<\/p>\n\n\n\n

    Theorem 1.<\/strong> Let \"\mathrm{supp}(X)=[0,1]^K\" and \"\tilde{\mathcal{F}}_{\epsilon_g, contains all distributions in \"\mathcal{F}_{\epsilon_g, with marginal distribution of \"X\" being uniform.  For any constant \"1\/2<\gamma<1\", if our nuisance estimates \"(\hat{g},\hat{p})\" take values in \"[c,1-c]\", where \"c\in(0,1\/2)\" is a constant, then <\/p>\n\n\n\n

    \"\mathfrak{M}_{n,<\/p>\n\n\n\n

    Interestingly, knowing the marginal distribution of \"X\" would not change the statistical limit.<\/p>\n\n\n\n

    We also consider another important causal parameter, the average treatment effect of the treated (ATT), defined by \"\theta^{ATT}=\mathbb{E}\left[Y(1)-Y(0). Under conditional ignorability, it can be written as<\/p>\n\n\n\n

    \"\theta^{ATT}=\mathbb{E}\left[Y-g_0(0,.<\/p>\n\n\n\n

    The DML estimate of \"\theta^{ATT}\" is <\/p>\n\n\n\n

    \"\hat{\theta}_{DML}=\left(\sum_{i=1}^n<\/p>\n\n\n\n

    and can be shown to achieve the same \"\epsilon_g\epsilon_p+n^{-1\/2}\" rate as for ATE. We also show that this rate is unimprovable:<\/p>\n\n\n\n

    Theorem 2.<\/strong> In the same setting as Theorem 1, we have<\/p>\n\n\n\n

    \"\mathfrak{M}_{n,. <\/p>\n\n\n\n

    Finally, we can also extend Theorem 1 to the weighted ATE (WATE) defined as<\/p>\n\n\n\n

    \"\theta^{WATE}=\mathbb{E}_{P_0}[w(X)(Y(1)-Y(0))]\",<\/p>\n\n\n\n

    which arises in policy evaluation [AW21]. Here \"w(x)\" is a uniformly bounded weight function but is not required to be non-negative. The following theorem addresses the minimax structure-agnostic rate for estimating WATE:<\/p>\n\n\n\n

    Theorem 3.<\/strong> In the same setting as Theorem 1, we have<\/p>\n\n\n\n

    \"\mathfrak{M}_{n,<\/p>\n\n\n\n

    where \"P_X\" is the uniform distribution over \"\mathrm{supp}(X)=[0,1]^K\". Moreover, this rate is achieved by the DML estimator<\/p>\n\n\n\n

    \"\hat{\theta}^{\mathrm{WATE}}=\frac{1}{n}<\/p>\n\n\n\n

    Conclusion and discussions<\/h2>\n\n\n\n

    In this blogpost, we introduced the setting and main results of our recent paper [JS24], that establishes the optimality of the celebrated DML algorithm, and in particular the doubly robust estimator with sample splitting, in a structure-agnostic framework for two important causal parameters: the ATE and the ATT, as well as the weighted version of the former. For practitioners, the main takeaway is that if no particular structural insights are available, then it might be better to use DML rather than more refined estimators that leverage potentially brittle assumptions on the non-parametric components of the data generating process. <\/p>\n\n\n\n

    [AW21] Susan Athey and Stefan Wager. Policy learning with observational data. Econometrica 89.1 (2021): 133-161.<\/p>\n\n\n\n

    [BKW23] Sivaraman Balakrishnan, Edward H Kennedy, and Larry Wasserman. The fundamental limits of structure-agnostic functional estimation. arXiv preprint arXiv:2305.04116, 2023. <\/p>\n\n\n\n

    [CCD+17] Victor Chernozhukov, Denis Chetverikov, Mert Demirer, Esther Duflo, Christian Hansen, and Whitney Newey. Double\/debiased\/neyman machine learning of treatment effects. American Economic Review,107(5):261\u2013265, 2017.<\/p>\n\n\n\n

    [JS24] Jikai Jin and Vasilis Syrgkanis. Structure-agnostic Optimality of Doubly Robust Learning for Treatment Effect Estimation. arXiv preprint arXiv:2402.14264, 2024.<\/p>\n\n\n\n

    [KBRW22] Edward H Kennedy, Sivaraman Balakrishnan, James M Robins, and Larry Wasserman. Minimax rates for heterogeneous causal effect estimation. The Annals of Statistics 52.2 (2024): 793-816.<\/p>\n\n\n\n

    [RLM17] James M Robins, Lingling Li, and Rajarshi Mukherjee. Minimax estimation of a functional on a structured high-dimensional model. The Annals of Statistics, 45(5):1951\u20131987, 2017.<\/p>\n\n\n\n

    [RRZ94] James M Robins, Andrea Rotnitzky, and Lue Ping Zhao. “Estimation of regression coefficients when some regressors are not always observed.” Journal of the American Statistical Association 89.427 (1994): 846-866.<\/p>\n\n\n\n

    [LR11] M.J. Van der Laan and Sherri Rose. Targeted learning: causal inference for observational and experimental data (Vol. 4). New York: Springer.<\/p>\n\n\n\n

    [AP09] Joshua D. Angrist, and J\u00f6rn-Steffen Pischke. Mostly harmless econometrics: An empiricist’s companion. Princeton university press, 2009.<\/p>\n\n\n\n

    [CHK+24] Victor Chernozhukov, Christian Hansen, Nathan Kallus, Martin Spindler, Vasilis Syrgkanis (2024). Applied Causal Inference Powered by ML and AI.<\/p>\n","protected":false},"excerpt":{"rendered":"

    We have another new technical blog post, courtesy Jikai Jin and Vasilis Syrgkanis, about optimality of double machine learning for causal inference. An introduction to causal inference Causal inference deals with the fundamental question of \u201cwhat if\u201d, trying to estimate\/predict the counterfactual outcome that one does not directly observe. For instance, one may want to […]<\/p>\n","protected":false},"author":16,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"nf_dc_page":"","om_disable_all_campaigns":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_post_was_ever_published":false},"categories":[4],"tags":[],"class_list":["post-844","post","type-post","status-publish","format-standard","hentry","category-technical"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.let-all.com\/blog\/wp-json\/wp\/v2\/posts\/844","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.let-all.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.let-all.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.let-all.com\/blog\/wp-json\/wp\/v2\/users\/16"}],"replies":[{"embeddable":true,"href":"https:\/\/www.let-all.com\/blog\/wp-json\/wp\/v2\/comments?post=844"}],"version-history":[{"count":38,"href":"https:\/\/www.let-all.com\/blog\/wp-json\/wp\/v2\/posts\/844\/revisions"}],"predecessor-version":[{"id":885,"href":"https:\/\/www.let-all.com\/blog\/wp-json\/wp\/v2\/posts\/844\/revisions\/885"}],"wp:attachment":[{"href":"https:\/\/www.let-all.com\/blog\/wp-json\/wp\/v2\/media?parent=844"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.let-all.com\/blog\/wp-json\/wp\/v2\/categories?post=844"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.let-all.com\/blog\/wp-json\/wp\/v2\/tags?post=844"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}