EconBase
← Back to paper

Adjustment with Many Regressors Under Covariate-Adaptive Randomizations

Extracted main text — title through conclusion, appendix excluded. This is what our citation measures are computed over, published so the extraction can be checked by eye.

96,149 characters · 16 sections · 135 citation commands

Rendered from LaTeX for readability, not typeset faithfully. Citation keys are highlighted; maths is left as source; figures, tables and equation environments are summarised rather than reproduced; unrecognised commands are greyed out so nothing is silently dropped. Email addresses are removed.

Adjustments with Many Regressors under Covariate-Adaptive Randomizations

abstractOur paper discovers a new trade-off of using regression adjustments (RAs) in causal inference under covariate-adaptive randomizations (CARs). On one hand, RAs can improve the efficiency of causal estimators by incorporating information from covariates that are not used in the randomization. On the other hand, RAs can degrade estimation efficiency due to their estimation errors, which are not asymptotically negligible when the number of regressors is of the same order as the sample size. Ignoring the estimation errors of RAs may result in serious over-rejection of causal inference under the null hypothesis. To address the issue, we construct a new ATE estimator by optimally linearly combining the estimators with and without RAs. We then develop a unified inference theory for this estimator under CARs. It has two features: (1) the Wald test based on it achieves the exact asymptotic size under the null hypothesis, regardless of whether the number of covariates is fixed or diverges no faster than the sample size; and (2) it guarantees weak efficiency improvement over estimators both with and without RAs. Keywords: Covariate-adaptive randomization, many regressors, regression adjustment. JEL codes: C14, C21, D14, G21

Introduction

This paper studies linear regression adjustments (RAs) for the estimation and inference of the average treatment effect (ATE) under covariate-adaptive randomizations (CARs) when there are many regressors. CARs have recently seen growing use in a wide variety of randomized experiments in economic research.\footnote{See, for example, CCFNT16,greaney2016,jakiela2016,burchardi2019,anderson2021, and etc.} Under CARs, units are first stratified using some baseline covariates, and within each stratum, the treatment status is assigned independently to achieve the balance between the numbers of treated and control units. Given data from CARs, researchers often estimate and infer various treatment effect parameters via regressions with strata dummies and baseline covariates as controls, a practice known as RAs. However, F08b,F081 showed that the usual OLS regression with covariates can actually decrease the precision of the ATE estimator. L13 found that, under complete randomization, for a linear regression with covariates to guarantee efficiency improvement upon the simple difference-in-means estimator (i.e., “no-harm”), it must include a full set of interactions between treatment status and covariates. Under more complicated CARs, the “no-harm” regressions are performed stratum by stratum in a fully saturated fashion, as pointed out by BCS18 and YYS22.

In many economics applications, the “no-harm” linear regressions are usually coupled with high dimensional regressors, as noted by duflo2018machinistas.\footnote{Examples of such experiments include bursztyn2019,banerjee2020lack,dhar2022reshaping, among others.} Moreover, when the regressors are sieve bases with a growing dimension, causal estimators with “no-harm” RAs can potentially achieve the semiparametric efficiency bound, as shown by JLTZ22 and BJRSZ23. However, CJN18_ET,CJN18 demonstrated that the usual heteroskedasticity consistent inference method for linear regressions leads to misleading inference when there are many regressors. CJM18 found similar problems for a class of non-linear settings. Under CARs, this issue of dimensionality is further exacerbated with the “no-harm” RAs stratum by stratum.

In this paper, we consider the “many regressors” regime--an asymptotic regime where the number of regressors can diverge at most as fast as the sample size and discover a new efficiency trade-off of using “no-harm” RAs due to the dimensionality of regressors. On one hand, RAs can improve the estimation efficiency by incorporating information from covariates that are not used in the randomization; on the other hand, they can degrade estimation efficiency due to their estimation errors, which are not asymptotically negligible when the number of regressors grows at the same rate of the sample size. This trade-off poses potentially serious challenges for inference. First, ignoring the cost of RAs in the asymptotic variance estimation may lead to substantial over-rejection under the null. Second, a consistent variance estimator that accounts for the cost of RAs can potentially be larger than that of the simple estimator without RAs, even asymptotically, if the cost outweighs the benefit. Therefore, using a “no-harm” RA that incurs such costs can actually be harmful.

To resolve these issues, we derive the joint asymptotic distribution for estimators both with and without RAs under the “many regressors” asymptotic regime and propose a consistent estimator of the asymptotic covariance matrix, which accounts for both the benefit and cost of RAs. We then use this matrix to construct a new ATE estimator by optimally linearly combining the two estimators. We show that (1) the Wald test based on this new optimal linear combination estimator achieves the exact asymptotic size under the null and (2) the optimal linear combination estimator is weakly more efficient than estimators both with and without RAs. Furthermore, we conduct a local asymptotic power analysis and establish that the Wald test based on the optimal linear combination estimator is asymptotically the uniformly most powerful (UMP) test against two-sided local alternatives over a class of unbiased tests that only depend on estimators with and without RAs. This implies our new estimator is optimal locally among not only linear but also nonlinear combination estimators. These results collectively address the challenge of the efficiency trade-off unearthed in the paper.

We further consider an alternative asymptotic regime where the dimension of regressors is fixed or moderate. Under mild regularity conditions, we show that the same optimal linear combination estimator with the same covariance matrix estimator achieves the same properties (1) and (2) as above. Importantly, these two results hold even when the RAs are not approximately correctly specified.

Relation to the literature. Our results build on the work of CJN18, who studied the inference of linear coefficients in OLS regression with many regressors and independent or cluster-independent observations. We extend their analysis in three new directions. First, we consider observations generated by CARs, which introduce cross-sectional dependence among treatment assignments and outcomes. Second, we estimate the ATE in a two-step procedure by linearly combining intercepts from multiple OLS regressions with many regressors. Because the first step intercept estimators are asymptotically dependent and the second step of the procedure introduces additional estimation errors, the asymptotic distribution of our ATE estimator is not a simple application of the result by CJN18. Instead, we develop a new distributional theory for our ATE estimator using techniques from BCS17, the Yurinskii's coupling,\footnote{We avoid the mistake mentioned in Remark 2.1 of CMU22 by formulating our result such that the Gaussian approximation error $\delta_n$ is explicitly defined as a vanishing sequence with respect to the sample size.} and an anti-concentration inequality from CCK14. Third, we propose a new optimal linear combination estimator and discuss its efficiency improvement under the many regressors framework, which is novel in the literature. CJM18 also considered a two-step procedure, and their knife-edge order of the number of regressors is the square root of the sample size. Our paper differs from theirs because our first-step intercept estimators enter the second step linearly, resulting in a knife-edge rate of the same order as the sample size.

Our covariance matrix estimator builds on cross-fit estimators for both the variance of regression coefficients and the “variance component” with many regressors, as proposed by J22 and KSS2020. To address the dependence among the first-step intercept estimators, we also extend KSS2020 by proposing a new estimator for the “covariance component” with many regressors, involving coefficients from two separate linear regressions. Other recent studies on inference in linear regression with many regressors include AS23 and MS23.

This paper also relates to other works on RAs in randomized experiments. JLTZ22, JPTZ22, LTM20, MTL20, WDTT16, and YYS22 considered RAs for various causal parameters when the covariates are either fixed dimensional or high-dimensional but sparse. In these settings, the estimation errors of RAs are asymptotically negligible. However, as argued by LM21, the sparsity condition (1) may not hold in social science applications as it is unclear why the large majority of control coefficients should be very nearly zero, (2) is not invariant to linear transformations of the controls, and (3) depends on some tuning parameter (e.g., the penalty term in Lasso), which complicates small sample interpretation of the resulting inference. WZ23 further demonstrated that both Lasso and debiased Lasso can exhibit significant omitted variable biases, even when the coefficient vector is sparse and the sample size is sufficiently large compared to the number of controls. In such cases, the “long regression” approach often outperforms both Lasso and debiased Lasso, utilizing the modern high-dimensional OLS-based inference methods from CJN18_ET, CJN18, CJM18. Our approach does not need sparsity conditions, thus avoiding these issues. Under a finite-population framework with complete random sampling, LD21 and CMO23 proposed bias correction for the ATE while allowing the number of regressors to grow at a rate slower than the sample size. More recently, LYW23 introduced a debiased regression-adjusted estimator under complete random sampling, permitting the number of regressors to grow at the same rate as the sample size. In contrast, we adopt a super-population framework with general CARs. A more detailed comparison with LD21, CMO23, and LYW23 is provided in Remark (ref) below. T18 further considered “optimal" stratification under CARs with a pilot experiment.

Recent studies (Bai22, Bai22, C23optimal, C23optimal, and BLST23, BLST23) have highlighted the optimality of “finely stratified” experiments. However, this paper focuses on “coarse” CARs for two main reasons. First, CARs, including simple random sampling and stratified block randomization, are widely used in empirical research as demonstrated by works such as CCFNT16, jakiela2016, burchardi2019, anderson2021. Based on a survey of selected development economists, B09 reported that about 40% of researchers have used such a design at some point. Second, “fine stratifying” continuous covariates at the experimental design stage may not be applicable in some scenarios because (1) sometimes, all relevant covariates are discrete, as seen in dupas2018, where randomization is stratified by gender, occupation, and bank branch-- all discrete variables; (2) researchers may need to analyze either past experiments or those conducted by others using CARs. Our paper thus aligns with the literature on RAs under CARs by taking the randomization scheme as given and aims to develop more efficient estimators using covariate information at the data analysis stage. Therefore, it complements the strategy of “fine stratification” at the experimental design stage because our method applies at the data analysis stage.

The rest of this paper is organized as follows. Section (ref) introduces the setup. Section (ref) identifies the efficiency trade-off in RAs with many regressors. In Section (ref), we present the optimal linear combination estimator for ATE and its asymptotic properties. Section (ref) discusses the properties of the optimal linear combination estimator with fixed or moderate number of regressors. Sections (ref) and (ref) provide simulations and an empirical application, respectively. Proofs and additional figures are given in the Online Appendix.

Notation. For any positive integer $m$, let $0_m$, $1_m$ and $I_m$ be the $m \times 1$ vector of zeros, $m \times 1$ vector of ones, and the $m \times m$ identity matrix, respectively. Let $||\cdot||_2$ and $||\cdot||_{op}$ denote the $\ell_2$-norm for a vector and operator norm for a matrix, respectively. For a symmetric and positive semi-definite matrix $\Upsilon$, $\lambda_{\max}(\Upsilon)$ denotes the maximum eigenvalue of $\Upsilon$. We define $W^{(n)}$ as the sample of $W$'s, i.e., $W^{(n)} = \{W_i\}_{i \in [n]}$, where $[n] = 1,\cdots,n$. We write $U \stackrel{d}{=} V$ for two random variables $U$ and $V$ if they share the same distribution.

Setup

Potential outcomes for treated and control groups are denoted by $Y(1)$ and $Y(0)$, respectively. Treatment status is denoted by $A$, with $A=1$ indicating treated and $A=0$ untreated. The stratum indicator is denoted by $S$, based on which the researcher implements the covariate-adaptive randomization. The support of $S$ is denoted by $\mathcal{S}$, a finite set. After randomization, the researcher can observe the data $\{Y_i,S_i,A_i,X_i\}_{i \in [n]}$ where $Y_i = Y_i(1)A_i + Y_i(0)(1-A_i)$ is the observed outcome, and $X_i$ contains covariates besides $S_i$ in the dataset. The support of $X$ is denoted as $\text{Supp}(X)$. In this paper, we allow $X_i$ and $S_i$ to be dependent. For $s \in S$, let $n_{s} = \sum_{i \in [n]}1\{S_i = s\}$, $n_{1,s} = \sum_{i \in [n]}A_i1\{S_i=s\}$, and $n_{0,s} = n_{s} - n_{1,s}$. Let $\aleph_{a,s} = \{i \in [n]: A_i = a,S_i=s\}$ denote the set of individuals in stratum $s$ with treatment status $a$ and $\aleph_{s} = \aleph_{1,s} \cup \aleph_{0,s} $. Our parameter of interest is the average treatment effect defined as $\tau = \mathbb{E}(Y(1)-Y(0))$.

We make the following assumptions on the data generating process (DGP) and the treatment assignment rule.

ass\begin{enumerate}[label=(\roman*)] • $\{Y_i(1),Y_i(0),S_i,X_i\}_{i \in [n]}$ are independent and identically distributed (i.i.d.). • $\{Y_i(1),Y_i(0),X_i\}_{i \in [n]} \perp\!\!\!\perp \{A_i\}_{i \in [n]}|\{S_i\}_{i \in [n]}$. • Suppose $p_s = \mathbb{P}(S_i = s)$ is fixed with respect to (w.r.t.) $n$ and is positive for every $s \in \mathcal{S}$. • Let $\pi_s$ denote the target fraction of treatment for stratum $s$. Then, $c<\min_{s \in \mathcal{S}}\pi_s \leq \max_{s \in \mathcal{S}}\pi_s<1-c$ for some constant $c \in (0,0.5)$ and $\frac{D_{n,s}}{n_{s}} = o_P(1)$ for $s \in \mathcal{S}$, where $D_{n,s} = \sum_{i \in [n]} (A_i-\pi_s)1\{S_i = s\}$. \end{enumerate}
remSeveral remarks are in order. First, Assumption (ref)(i) assumes $(Y(1),Y(0),S,X)^{(n)}$ are independent. This assumption is essential for all the theoretical results presented in this paper, which implies that our findings primarily apply to cross-sectional data. However, we still allow for $A^{(n)}$, and thus, $Y^{(n)}$ to be cross-sectionally dependent, which will be the case under CARs. The identical distribution assumption can be relaxed by using a set of more complex notations. Second, Assumption (ref)(ii) implies that the treatment assignment $A^{(n)}$ are generated only based on strata indicators. Third, Assumption (ref)(iii) imposes that the number of strata is bounded and the strata sizes are approximately balanced. It is also interesting to explore settings where the number of strata increases with the sample size. For instance, in the matched pairs design (see, e.g., BRS19), the number of strata grows proportionally to $n$. More generally, it could scale as $n^\alpha$ for some $\alpha \in (0,1]$. Investigating these scenarios is an avenue for future research. Fourth, BCS17 show that Assumption (ref)(iv) holds under several specific covariate-adaptive treatment assignment rules such as simple random sampling (SRS), biased-coin design (BCD), adaptive biased-coin design (WEI) and stratified block randomization (SBR). For completeness, we provide brief descriptions below. Note that the requirement $D_{n,s}/n_s=o_P(1)$ is weaker than the assumption imposed by BCS17, but it is the same as that imposed by BCS18 and ZZ20.
ex[SRS] Let $\{A_{i}\}_{i=1}^{n}$ be drawn independently across $i$ and of $\{S_{i}\}_{i=1}^{n}$ as Bernoulli random variables with success rate $\pi_s$, i.e., for $k=1,\ldots,n$, \[ \mathbb{P}\left( A_{k}=1\big|\{S_{i}\}_{i=1}^{n},\{A_{j}\}_{j=1} ^{k-1}\right) =\mathbb{P}(A_{k}=1|S_k)=\pi_{S_k}. \]
ex[WEI] This design was first proposed by W78. Let $n_{k-1}(S_{k}) = \sum_{i=1}^{k-1}1\{S_{i} = S_{k}\}$, $B_{k-1}(S_{k}) = \sum_{i=1}^{k-1}\left( A_{i} - \frac{1}{2} \right) 1\{S_{i} = S_{k}\}$, and \begin{align*} \mathbb{P}\left( A_{k} = 1\big| \{S_{i}\}_{i=1}^{k},\{A_{i}\}_{i=1} ^{k-1}\right) = f\biggl(\frac{2B_{k-1}(S_{k})}{n_{k-1}(S_{k})}\biggr), \end{align*} where $f(\cdot):[-1,1] \mapsto[0,1]$ is a pre-specified non-increasing function satisfying $f(-x) = 1- f(x)$ and $f(x)$ is differentiable at $x=0$. Here, $\frac{B_{0}(S_{1})}{n_{0} (S_{1})}$ and $B_{0}(S_{1})$ are understood to be zero.
ex[BCD] The treatment status is determined sequentially for $1 \leq k \leq n$ as \begin{align*} \mathbb{P}\left( A_{k} = 1| \{S_{i}\}_{i=1}^{k},\{A_{i}\}_{i=1}^{k-1}\right) = \begin{cases} \frac{1}{2} & if B_{k-1}(S_{k}) = 0\\ \lambda & if B_{k-1}(S_{k}) < 0\\ 1-\lambda & if B_{k-1}(S_{k}) > 0, \end{cases} \end{align*} where $B_{k-1}(s)$ is defined as above and $\frac{1}{2}< \lambda\leq1$.
ex[SBR] For each stratum, $\lfloor\pi_s n_s \rfloor$ units are assigned to treatment and the rest are assigned to control at random.
remWe note that SRS and SBR allow for the target faction of treatment to be different for different strata. For WEI and BCD, we have $\pi_s = 1/2$ for $s \in \mathcal{S}$. BCS17 further shows BCD and SBR achieve strong balance in the sense that $D_{n,s} = o_P(n^{1/2})$.

Efficiency Trade-off in RAs with Many Regressors

This section derives the joint asymptotic distribution of the fully saturated adjusted and unadjusted estimators under the assumption that the number of regressors grows no faster than the sample size. We then identify the efficiency trade-off in RAs based on the comparison of two asymptotic variances. The variance-covariance matrix will also be used to construct the optimal linear combination estimator in Section (ref).

The unadjusted estimator, denoted by $\hat \tau^{unadj}$, is the fully saturated estimator proposed by BCS18 and defined as

align[align omitted — 266 chars of source]

where for $s \in S$ and $a = 0,1$, $\hat \pi_s = n_{1,s}/n_s$ and $\hat \tau_{a,s}^{unadj} = \frac{1}{n_{a,s}} \sum_{i \in \aleph_{a,s}}Y_i$.

Following their lead, the fully saturated regression adjusted estimator considered in this paper is denoted by $\hat \tau^{adj}$ and defined as

align*[align* omitted — 102 chars of source]

where $\hat \tau_{a,s}$ is computed as the intercept in the OLS regression of $Y_i$ on $(1,\breve X_i)$ using all observations in $\aleph_{a,s}$, $\hat p_s = n_{s}/n$, and $\breve X_i = X_i - \overline{X}_{S_i}$ with $\overline{X}_s = \frac{1}{n_{s}}\sum_{i \in \aleph_s} X_i$. We further denote $\hat \beta_{a,s}$ as the OLS coefficient of $\breve X_i$ in the OLS regression. We note that $Y_i$ should not be demeaned in the above regression because our key parameter of interest is the intercept rather than the slope coefficient of $\breve X_i$. In fact, by the Frisch-Waugh-Lovell Theorem, the regression coefficient $\hat \beta_{a,s}$ is the same as if $X_i$ is demeaned by the cluster-treatment level mean ($\frac{1}{n_{a,s}}\sum_{i \in \aleph_{a,s}} X_i$) or not demeaned at all. Here, by demeaning $X_i$ with the cluster level mean, we effectively just change the intercept estimator $\hat \tau_{a,s}$ in the linear regression.

remWe consider both adjusted and unadjusted estimators for several reasons. First, BCS18 demonstrated that the unadjusted estimator remains consistent even when the treatment assignment probability, $\pi(s)$, varies across strata, and achieves the semiparametric efficiency bound in datasets without covariates, $X_i$. Second, the adjusted estimator, $\hat \tau^{adj}$, can be expressed as an augmented inverse propensity score weighted (AIPW) estimator: \begin{align} \hat \tau^{adj} & = \frac{1}{n} \sum_{i \in [n]} \frac{A_i(Y_i - X_i^\top \hat \beta_{1,S_i})}{\hat \pi_{S_i}} - \frac{1}{n} \sum_{i \in [n]} \frac{(1-A_i)(Y_i - X_i^\top \hat \beta_{0,S_i})}{1-\hat \pi_{S_i}} + \frac{1}{n}\sum_{i \in [n]}X_i^\top (\hat \beta_{1,S_i} - \hat \beta_{0,S_i}), \end{align} where $\hat \pi_s = n_{1,s}/n_{s}$. It's important to note that if an individual, $i$, belongs to stratum $s$, then $\breve X_i$ is defined as $X_i$ demeaned by the stratum-level mean $\frac{1}{n_s}\sum_{i \in \aleph_s}X_i$, not the stratum-treatment level mean $\frac{1}{n_{a,s}}\sum_{i \in \aleph_{a,s}}X_i$. This distinction is crucial for the AIPW representation to hold. Comparing (ref) with (ref), we see that $\hat \tau^{adj}$ is a natural extension of $\hat \tau^{unadj}$ because the latter also follows the AIPW representation but with an empty set of covariates. This also implies that $\hat \tau^{unadj}$ does not use the information of $X_i$ at all, and therefore, neither benefits nor suffers from RAs. Third, while we follow BCS18 and fully saturate the regression, the violation of the overlapping support condition is less of a concern here because the treatment is assigned by the experimenter, and CARs can force strong balance of treated and control units in each stratum, as discussed in Remark (ref).
remIn empirical applications, it is common to regress the outcome on strata fixed effects (SFEs), treatment status, and potentially additional covariates without full interaction between strata dummies and other regressors. However, we do not consider this regression for several reasons. First, even without additional covariates, BCS18 have shown that the SFE regression is inconsistent when the treatment assignment probability $\pi(s)$ is heterogeneous across strata. Moreover, when it is consistent, it is generally less efficient than the unadjusted estimator $\hat \tau^{unadj}$ unless the CAR achieves strong balance. Second, with a fixed number of covariates, the SFE regression is not always “no-harm,” whereas the adjusted estimator $\hat \tau^{adj}$ is, as demonstrated by YYS22. Last, without full interactions, the SFE regression is unlikely to be (approximately) correctly specified, even when all covariates are discrete, unless the average treatment effects are homogeneous across strata. This introduces additional complexity in our analysis, particularly when the number of covariates is proportional to the sample size.

Asymptotic Properties

Denote the dimension of $X$ as $k$. In the following, we derive the asymptotic properties of $\hat \tau^{adj}$ and $\hat \tau^{unadj}$ jointly in the case that $k=k_n$ increases no faster than the sample size $n$.

To clearly state our assumptions, we need to introduce more notation. Let $\breve X_{\aleph_{a,s}}$ be an $n_{a,s} \times k_n$ matrix which is constructed by stacking $\breve X_i^\top$ for $i \in \aleph_{a,s}$. We define $A_{\aleph_{a,s}} \in \Re^{n_{a,s}}$ similarly. Then, let $P_{a,s} = \breve X_{\aleph_{a,s}} (\breve X_{\aleph_{a,s}}^\top\breve X_{\aleph_{a,s}})^{-1}\breve X_{\aleph_{a,s}}^\top$ be the projection matrix of $\breve X_{\aleph_{a,s}}$, and $M_{a,s} = I_{n_{a,s}} - P_{a,s}$. Let $ M_{a,s, i,j}$ and $ P_{a,s, i,j}$ be the $(i,j)$th entry of $M_{a,s}$ and $ P_{a,s}$, respectively. Define

align*[align* omitted — 513 chars of source]
ass\begin{enumerate}[label=(\roman*)] • $\max_{i \in [n]}\mathbb{E}\left[\varepsilon_{i}^4(a)|X_i,S_i\right] =O_P(1).$ • There exists a constant $b>0$ such that $\min_{a =0,1, s \in \mathcal{S}, i \in [n]}\mathbb{E}\left[\varepsilon_{i}^2(a)|X_i,S_i=s\right] \geq b.$$k_n/n_{a,s} \rightarrow \kappa_{a,s} \in \left[0, 1\right)$ and $\limsup_{n \rightarrow \infty}\max_{a=0,1, s\in \mathcal{S}, i \in [n]}P_{a,s,i,i} \leq 1-\delta$ almost surely for some constant $\delta \in (0,1)$. • For $a=0,1$ and $s \in \mathcal{S}$, we have \begin{align*} \mathbb{E}(Y_i(a)|X_i,S_i=s) = \alpha_{a,s} + X_i^\top \beta_{a,s} + e_{i,s}(a), \end{align*} such that $\mathbb{E}(e_{i,s}^2(a)|S_i=s) = o(n^{-1})$. • $ \max_{a=0,1,s \in \mathcal{S}}\max_{i \in \aleph_{a,s}}\left|\sum_{j \in \aleph_{a,s}} M_{a,s, i,j}\right| = o_P(n^{1/2})$. \end{enumerate}
remAssumption (ref)(i) and (ref)(ii) are mild regularity conditions. Assumption (ref)(iii) implies that we allow the number of covariates to diverge at the rate of the sample size $n$. Because we run the stratum-treatment level regression with an effective sample size of $n_{a,s}$, we require $\kappa_{a,s} < 1$ to avoid multicollinearity. Assumption (ref)(v) is the same as CJN18 and J22,\footnote{In fact, $\hat v_{i,n}$ in both CJN18 and J22 is just $\sum_{j \in \aleph_{a,s}} M_{a,s, i,j}$.} which we recommend readers refer to for more discussion.
remAssumption (ref)(iv) implies that the linear regression is approximately correctly specified, a common assumption in analyses with many regressors, as seen in CJN18 and J22. KSS2020 further require Assumption (ref)(iv) to hold with no approximation error, i.e., $e_{i,s}(a) = 0$. This condition is reasonable because the dimension $k_n$ is allowed to diverge to infinity. For example, if baseline covariates $Z_i$ are fixed-dimensional and continuous, then Assumption (ref)(iv) holds when $X_i$ contains sieve basis functions of $Z_i$, and $\mathbb{E}(Y_i(a)|Z_i=z,S_i=s)$ is sufficiently smooth in $z$.\footnote{In this case, we have $\mathbb E(Y_i(a)|Z_i,S_i=s) = \alpha_{a,s} + X_i^\top \beta_{a,s} + \tilde e_{i,s}(a)$ such that $\mathbb E (\tilde e_{i,s}^2(a)|S_i=s) = o(n^{-1})$. Then, we have $\mathbb E(Y_i(a)|X_i,S_i=s) = \alpha_{a,s} + X_i^\top \beta_{a,s} + e_{i,s}(a)$ where $e_{i,s}(a) = \mathbb E(\tilde e_{i,s}(a)|X_i,S_i=s)$. Then, by Jensen's inequality, we have $\mathbb E (e_{i,s}^2(a)|S_i=s) \leq \mathbb E (\tilde e_{i,s}^2(a)|S_i=s) = o(n^{-1})$.} We further detail the sieve bases and smoothness requirement implied by Assumption (ref)(iv) in the next remark. If all baseline covariates are categorical, Assumption (ref)(iv) holds when $X_i$ contains the fully saturated dummies for all categories. The approximately correct specification is also commonly assumed in the literature on causal inference with ultra-high-dimensional data, where researchers further assume the specification is sparse. See, for example, Assumption 4.2 in the seminal work by BCFH13. While we do not consider the ultra-high dimensionality (the dimension is at most a fraction of the sample size), we do not require sparsity either. In cases when the identity of $X_i$ is predetermined by the researcher and its dimension is fixed, the true specification might not be well approximated by a linear function of $X_i$, thus potentially violating Assumption (ref)(iv). However, in Section (ref), we show that in this case with a fixed or moderately diverging $k$, our estimator and inference methods remain valid even if the linear regression is misspecified and the approximation error is not asymptotically negligible. Remark (ref) provides more discussion on this point.
remHere we provide more details on sieve bases and smoothness requirement implied by Assumption (ref)(iv). Suppose we have a finite $d_z$-dimensional regressor $Z \in \Re^{d_z}$ and $X = (b_{1,n}(Z), \cdots, b_{h_n,n}(Z))^\top$ is a $h_n$-dimensional vector that contains sieve bases of $Z$, where $\{b_{h,n }(\cdot)\}_{h \in [h_n]}$ are $h_n$ basis functions of a linear sieve space, denoted as $\mathbb{B}$. Given that all $d_z$ elements of $Z$ are continuously distributed, the sieve space $\mathbb{B}$ can be constructed as follows. \begin{enumerate} • For each element $Z^{(l)}$ of $Z$, $l=1,\cdots,d_z$, let $\mathcal{B}_l$ be the univariate sieve space of dimension $J_n$. • Let $\mathbb{B}$ be the tensor product of $\{\mathcal{B}_l\}_{l=1}^{d_x}$, which is defined as a linear space spanned by the functions $\prod_{l=1}^{d_x} b_l$, where $b_l \in \mathcal{B}_l$. The dimension of $\mathbb{B}$ is then $k_n \equiv d_z J_n$. \end{enumerate} We provide two examples of sieve space $\mathcal B_l$ below. More examples can be found in Section 2.3 of C07_sieve. \begin{enumerate} • Polynomials. $$\mathbb{B}_l = \biggl\{\sum_{j=0}^{J_n}\alpha_j z^j, z \in \text{Supp}(Z^{(l)}), \alpha_j \in \Re \biggr\};$$ • Splines. $$\mathbb{B}_l = \biggl\{\sum_{t=0}^{r-1}\alpha_t z^t + \sum_{j=1}^{J_n}c_j[\max(z-q_j,0)]^{r-1}, z \in \text{Supp}(Z^{(l)}), \alpha_t, c_j \in \Re \biggr\},$$ where the grid $-\infty=q_0 \leq q_1 \leq \cdots \leq q_{J_n} \leq q_{J_n+1} = \infty$ partitions $\text{Supp}(Z^{(l)})$ into $J_n+1$ subsets $I_j = [q_j,q_{j+1}) \cap \text{Supp}(Z^{(l)})$, $j=1,\cdots,J_n-1$, $I_{0} = (q_{0},q_{1}) \cap \text{Supp}(Z^{(l)})$, and $I_{J_{n}} = (q_{J_n},q_{J_n+1}) \cap \text{Supp}(Z^{(l)})$. \end{enumerate} Suppose the function $f_{a,s}(z) = \mathbb{E}(Y(a) \mid Z=z, S=s)$ is $p$-th order smooth and satisfies other regularity conditions. Then, the approximation error satisfies $\mathbb{E}(e_{i,s}^2(a) \mid S_i=s) = O(k_n^{-2p/d_z})$ (see Section 2.3 of C07_sieve). In the existing literature, the number of sieve bases typically follows $k_n = o(n^{1/2})$. For the approximation error to meet $\mathbb{E}(e_{i,s}^2(a) \mid S_i=s) = o(n^{-1})$, the smoothness order $p$ must satisfy $p > d_z$. In our case, we allow $k_n$ to be proportional to $n$, which relaxes the smoothness requirement to $p > d_z/2$. A similar observation was made by CJN18 in Section 4.
remLD21 and CMO23 consider the inference of ATE under complete randomization in the finite-population setup without assuming approximate correct specification. However, for the validity of their inference methods, they require $k_n = o(n^{2/3})$, and thus, $\kappa_{a,s} = 0$. We provide more detail discussion about the dimensionality of covariates and the correct specification assumption in Remark (ref) in Section (ref).
assSuppose $\gamma_{a,s,n} \stackrel{p}{\longrightarrow} \gamma_{a,s,\infty}>0$, $\gamma_{a,s,n}^{-2}\sigma^2_{a,s,n} \stackrel{p}{\longrightarrow} \omega^2_{a,s,\infty}>0$, and $\gamma_{a,s,n}^{-1}\rho_{a,s,n} \stackrel{p}{\longrightarrow} \varpi_{a,s,\infty}$ for some deterministic constants $(\gamma_{a,s,\infty},\omega_{a,s,\infty},\varpi_{a,s,\infty})$.
remIf $k_n \log k_n = o(n)$ (which means $\kappa_{a,s} = 0$ for all $(a,s)$), then under general conditions on the distribution of $X_i$, it is possible to show that Assumption (ref) holds with $\gamma_{a,s,\infty} = 1$ and $ \omega^2_{a,s,\infty} = \varpi_{a,s,\infty} = \mathbb E (\varepsilon_i^2(a)|S_i=s)$. See belloni2015 and CFF20 for more discussion and examples. If $\kappa_{a,s}>0$, the eigenvalues of Gram matrix $n^{-1}\breve X_{\aleph_{a,s}}^\top\breve X_{\aleph_{a,s}}$ do not converge to those of its expectation. Instead, they will converge to some spectral density which determines the quantities $(\gamma_{a,s,\infty},\omega_{a,s,\infty},\varpi_{a,s,\infty})$. Specifically, in Section (ref) in the Online Supplement, we provide detailed calculation of $\gamma_{a,s,\infty}$ when the $k_n \times 1$ vector $X_i$ given $S_i=s$ is jointly Gaussian with a covariance matrix $\Sigma_{s,n}$. Based on the Mar\v{c}enko-Pastur theorem (MP67, MP67), we can show that \begin{align*} \gamma_{a,s,\infty} = \frac{1}{1+ (a(1-\pi_s) + (1-a)\pi_s)\zeta_{a,s}}< 1, \end{align*} where $\zeta_{a,s} = \int_{\lambda_-}^{\lambda_+} \frac{\sqrt{(\lambda_+ - \lambda)(\lambda - \lambda_-)}}{2\pi\lambda^2} d\lambda$ and $\lambda_{\pm} = (1 \pm \sqrt{\kappa_{a,s}})^2$. If we further assume homoskedasticity in the sense that $\mathbb E (\varepsilon_i^2(a)|X_i,S_i=s) = \mathbb E (\varepsilon_i^2(a)|S_i=s)$, then, we have \begin{align*} \omega^2_{a,s,\infty} = \varpi_{a,s,\infty} = \gamma_{a,s,\infty}^{-1} \mathbb E (\varepsilon_i^2(a)|S_i=s)>\mathbb E (\varepsilon_i^2(a)|S_i=s). \end{align*} We conjecture that Assumption (ref) holds for non-Gaussian distributions of $X_i$ and heteroskedastic errors. However, establishing general preliminary conditions for this assumption requires the use of advanced tools from random matrix theory.\footnote{In random matrix theory, many delicate asymptotic properties of Gaussian ensembles were later shown to hold for much broader classes of random matrices with non-Gaussian entries. For example, see the Mar\v{c}enko-Pastur theorem (MP67), the semicircular law (T12), and bai08 for a comprehensive survey.} Such a discussion is beyond the scope of this paper. Finally, we emphasize that researchers do not need to know the exact values of $(\gamma_{a,s,\infty},\omega^2_{a,s,\infty},\varpi_{a,s,\infty})$ to implement our inference method.
thmSuppose Assumptions (ref)--(ref) hold. Then, we have \begin{align*} \sqrt{n}\begin{pmatrix} \hat \tau^{adj} - \tau \\ \hat \tau^{unadj} - \tau \end{pmatrix} \rightsquigarrow \begin{pmatrix} \mathcal U^{adj} \\ \mathcal U^{unadj} \\ \end{pmatrix} + \begin{pmatrix} \mathcal V^{adj} \\ \mathcal V^{unadj} \\ \end{pmatrix}+\begin{pmatrix} \mathcal W \\ \mathcal W \end{pmatrix}, \end{align*} where \begin{align*} \mathcal U = \begin{pmatrix} \mathcal U^{adj} \\ \mathcal U^{unadj} \\ \end{pmatrix} \stackrel{d}{=} \mathcal{N}\left(\begin{pmatrix} 0 \\ 0 \end{pmatrix}, \Sigma_{\mathcal U} \right), \Sigma_{\mathcal U} = \begin{pmatrix} \mathbb{E}\left(\frac{\omega_{1,S_i,\infty}^2}{\pi_{S_i}}+\frac{\omega_{0,S_i,\infty}^2}{1-\pi_{S_i}}\right) & \mathbb{E}\left(\frac{\varpi_{1,S_i,\infty}}{\pi_{S_i}}+\frac{\varpi_{0,S_i,\infty}}{1-\pi_{S_i}}\right)\\ \mathbb{E}\left(\frac{\varpi_{1,S_i,\infty}}{\pi_{S_i}}+\frac{\varpi_{0,S_i,\infty}}{1-\pi_{S_i}}\right) & \mathbb{E}\left(\frac{\mathbb{E}(\varepsilon_i^2(1)|S_i)}{\pi_{S_i}}+\frac{\mathbb{E}(\varepsilon_i^2(0)|S_i)}{1-\pi_{S_i}}\right) \end{pmatrix}, \end{align*} \begin{align*} \mathcal V = \begin{pmatrix} \mathcal V^{adj} \\ \mathcal V^{unadj} \\ \end{pmatrix} \stackrel{d}{=} \mathcal{N}\left(\begin{pmatrix} 0 \\ 0 \end{pmatrix},\Sigma_{\mathcal V} \right), \Sigma_{\mathcal V} = \begin{pmatrix} \mathbb{E} var(\phi_i(1) - \phi_i(0)|S_i) & \mathbb{E} var(\phi_i(1) - \phi_i(0)|S_i)\\ \mathbb{E} var(\phi_i(1) - \phi_i(0)|S_i) & \mathbb{E}\left[\frac{var(\phi_i(1)|S_i)}{\pi_{S_i}} + \frac{var(\phi_i(0)|S_i)}{(1-\pi_{S_i})}\right] \end{pmatrix}, \end{align*} \begin{align*} \mathcal W \stackrel{d}{=}\mathcal{N}(0, \Sigma_{\mathcal W}), \Sigma_{\mathcal W} = var(\mathbb{E}(Y_i(1) - Y_i(0)|S_i)), \end{align*} $\phi_i(a) = \mathbb{E}(Y_i(a)|X_i,S_i)-\mathbb{E}(Y_i(a)|S_i)$ for $a=0,1$, and $(U,V,W)$ are independent.
remTheorem (ref) decomposes the variance of ATE estimators into $\Sigma_{\mathcal U}$, $\Sigma_{\mathcal V}$, and $\Sigma_{\mathcal W}$, which represent the variation of $Y(a)$ given $X_i$ and $S_i$, the variation of $X_i$ given $S_i$, and the variation of $S_i$, respectively. Denote $\Sigma = \Sigma_{\mathcal U} + \Sigma_{\mathcal V} + \Sigma_{\mathcal W}1_21_2^\top$. We will focus on the variance components of $\Sigma$ to identify the efficiency trade-off in RAs herein. The whole matrix will be used to construct the optimal linear combination estimator in Section (ref).
remWe establish a Berry-Esseen-type bound for the convergence of \(\tilde{\mathcal{U}}_n\) to \(\mathcal{U}\), where \(\tilde{\mathcal{U}}_n\) represents the part of \(\sqrt{n}(\hat{\tau}^{adj} - \tau, \hat{\tau}^{unadj} - \tau)'\) that captures the variation in \((Y(1), Y(0))\) given \((X, S)\). It is also standard to establish a Berry-Esseen-type bound for the convergence of the components $\mathcal V_n$ and $\mathcal W_n$, which accounts for the variation in \(X_i\) given \(S_i\) and the variation in \(S_i\), respectively. By combining these bounds, it is possible to determine the rate of Gaussian approximation for the distribution given in Theorem (ref), which is \(n^{-1/6}\) under standard moment conditions.

Efficiency Trade-off

We note that the $(1,1)$ and $(2,2)$ elements of $\Sigma_{\mathcal U}$ represent the asymptotic variances of $\mathcal U^{adj}$ and $\mathcal U^{unadj}$, respectively, which we denote as $Var(\mathcal U^{adj})$ and $Var(\mathcal U^{unadj})$. We denote $Var(\mathcal V^{adj})$ and $Var(\mathcal V^{unadj})$ in the same manner. Following the argument in Remark (ref), we can show that $Var(\mathcal U^{adj}) = Var(\mathcal U^{unadj})$ if $k_n \log k_n = o(n)$. Moreover, it can be shown that $Var(\mathcal V^{adj}) \leq Var(\mathcal V^{unadj})$, which indicates the benefit of RA from incorporating information of $X_i$. Therefore, when $k_n \log k_n = o(n)$, $\hat \tau^{adj}$ is weakly more efficient than $\hat \tau^{unadj}$, a result that the previous literature has established under more stringent conditions.

However, when $k_n$ is of the same order of $n$, $Var(\mathcal U^{adj})$ can be larger than $Var(\mathcal U^{unadj})$. To illustrate this, let's continue with the Gaussian covariates example mentioned in Remark (ref). Suppose for $a=0,1$ and $s\in \mathcal S$, $\pi_s = 1/2$, $\kappa_{a,s} = \kappa$, and $\varepsilon_i(a)$ is homoskedastic in the sense that $\mathbb E (\varepsilon_i^2(a)|X_i,S_i=s) = \mathbb E (\varepsilon_i^2(a)|S_i=s)$, then we have

align*[align* omitted — 175 chars of source]

where $\zeta = \int_{\lambda_-}^{\lambda_+} \frac{\sqrt{(\lambda_+ - \lambda)(\lambda - \lambda_-)}}{2\pi\lambda^2} d\lambda$ and $\lambda_{\pm} = (1 \pm \sqrt{\kappa})^2$. Figure (ref) plots the values of the variance inflation factor (VIF) as a function of $\kappa$. We can see that the VIF is more than $12.5\%$, $25\%$, $50\%$, and $100\%$ if $\kappa$ is greater than $1/5$, $1/3$, $1/2$, $2/3$, respectively.

figure[figure omitted — 138 chars of source]

Consequently, an efficiency trade-off in RAs between $Var(\mathcal U^{adj})$ and $Var(\mathcal V^{adj})$ can be identified in Theorem (ref). This trade-off can be elucidated by decomposing the difference between the asymptotic variances of $\hat \tau^{adj}$ and $\hat \tau^{unadj}$ as

align*[align* omitted — 115 chars of source]

where the second term is always non-positive but the first term can be positive when $k_n$ is of the same order of the sample size. Under some circumstances, the first term may dominate the second, resulting in the estimator with the theoretically “no-harm” adjustment being even less efficient than the unadjusted estimator. For example, see Model 1 of Panel (b) in Figures (ref) and (ref). This defeats the purpose of using RAs.

This also implies that the asymptotic variance estimator of $\hat \tau^{adj}$ in the literature, e.g., the one proposed by YYS22, tends to under-estimate the true asymptotic variance when there are many regressors, as it neglects the VIF induced by the dimensionality. Therefore, when there are many regressors, the causal inference using such a variance estimator may over-reject under the null hypothesis, as illustrated in Section (ref).

Optimal Linear Combination Estimator

As shown above, ignoring the VIF can result in size distortion in causal inference. When we account for the VIF, however, the adjusted estimator may become even less efficient than the unadjusted one due to the estimation errors incurred in RAs with many regressors. In this section, we propose an optimal linear combination estimator, denoted by $\hat \tau^*$, designed to address both issues. We show that $\hat \tau^*$ is consistent, asymptotically normal, and weakly more efficient than both $\hat \tau^{adj}$ and $\hat \tau^{unadj}$. We also present the local asymptotic power analysis for the standard Wald test based on $\hat \tau^*$. Finally, we provide a consistent estimator $\hat \Sigma$ for $\Sigma = \Sigma_{\mathcal U} + \Sigma_{\mathcal V} + \Sigma_{\mathcal W}1_21_2^\top$ in Section (ref) below.

Asymptotic Properties of $\hat \tau^*$

We construct the optimal linear combination estimator as

align[align omitted — 98 chars of source]

which is a weighted average of $\hat \tau^{adj}$ and $\hat \tau^{unadj}$ with the weight $\hat \omega$ minimizing the asymptotic variance.

Denote $\hat \Sigma =

pmatrix[pmatrix omitted — 94 chars of source]

$ as a consistent estimator for $\Sigma \equiv \Sigma_{\mathcal U} + \Sigma_{\mathcal V} + \Sigma_{\mathcal W}1_21_2^\top =

pmatrix[pmatrix omitted — 73 chars of source]

$ and suppose $\hat \tau^{adj}$ and $\hat \tau^{unadj}$ are not asymptotically equivalent, i.e., $ \Sigma_{1,1} + \Sigma_{2,2} - 2 \Sigma_{1,2} > 0$. Then, the optimal weight is

align[align omitted — 148 chars of source]

and the corresponding estimator of the asymptotic variance for $\hat \tau^*$ is $\hat \sigma^2_* = (\hat w, 1- \hat w) \hat \Sigma (\hat w, 1- \hat w)^\top$.

remWhen $\Sigma_{1,1} - 2\Sigma_{1,2} + \Sigma_{2,2}>0$, the adjusted estimator $\hat \tau^{adj}$ and the unadjusted estimator $\hat \tau^{unadj}$ are not asymptotically equivalent. In this case, $(w,1-w)\Sigma (w,1-w)^\top$ has a unique minimizer $w^* = \frac{\Sigma_{2,2} - \Sigma_{1,2}}{\Sigma_{1,1} - 2\Sigma_{1,2} + \Sigma_{2,2}}$, and our $\hat w$ is a consistent estimator of $w^*$. If the estimation error of the RA is asymptotically negligible and $X_i$ does not contain useful information of $(Y_i(1),Y_i(0))$ in the sense that \begin{align*} \mathbb E(Y_i(a)|X_i,S_i) = \mathbb E(Y_i(a)|S_i), \end{align*} then we have $\Sigma_{1,1} - 2\Sigma_{1,2} + \Sigma_{2,2}=0$ (which implies $\Sigma_{1,1} = \Sigma_{1,2} = \Sigma_{2,2}$). In this case, all linear combinations are asymptotically equivalent. If this case is a realistic concern, then we can always safeguard against the zero denominator by introducing a small positive constant $\lambda$ and constructing the final estimator as $\tilde \tau = \tilde w \hat \tau^{adj} + (1-\tilde w)\hat \tau^{unadj}$ with $ \tilde w = \frac{\hat \Sigma_{2,2} - \hat \Sigma_{1,2}}{\hat \Sigma_{1,1} - 2\hat \Sigma_{1,2} + \hat \Sigma_{2,2} + \lambda}$. It is possible to show that $\tilde \tau$ is always weakly more efficient than $\hat \tau^{unadj}$ as long as $\lambda > 0$, regardless of whether $\Sigma_{1,1} - 2\Sigma_{1,2} + \Sigma_{2,2}=0$ or $\Sigma_{1,1} - 2\Sigma_{1,2} + \Sigma_{2,2}>0$.
thmSuppose Assumptions (ref)--(ref) hold. If $\Sigma_{1,1} - 2\Sigma_{1,2} + \Sigma_{2,2}>0$ and $\hat \Sigma$ is an consistent estimator for $\Sigma$, then we have \begin{align*} \sqrt{n}\left[ (\hat w, 1- \hat w) \hat \Sigma (\hat w, 1- \hat w)^\top\right]^{-1/2}(\hat \tau^* - \tau) \rightsquigarrow \mathcal{N}(0, 1), \end{align*} where $\hat \tau^*$ and $\hat \omega$ are defined in (ref) and (ref), respectively. In this case, $\hat \tau^*$ is asymptotically weakly more efficient than both $\hat \tau^{adj}$ and $\hat \tau^{unadj}$.

Local Power

Suppose we want to test the null hypothesis $H_{0}:\tau = \tau_0$ versus the two-sided alternative $H_{1}:\tau \neq \tau_0$ with level $\alpha \in (0,1)$, and we are under the local alternative in the sense that $\tau = \tau_0 + \Delta/\sqrt{n}$. Then, the hypothesis can be rewritten as $H_0: \Delta = 0$ versus $H_1: \Delta \neq 0$. In addition, by Theorem (ref), we have

align*[align* omitted — 225 chars of source]

where $

pmatrix[pmatrix omitted — 21 chars of source]

= \Sigma^{-1/2}

pmatrix[pmatrix omitted — 20 chars of source]

$. Let us consider a limit experiment in which a researcher observes

align[align omitted — 165 chars of source]

knows the values of $(a,b)$, and wants to test $\Delta = 0$ versus the two-sided alternative. Then, by the factorization criterion, it is easy to see that $N^* = \frac{aN_1+bN_2}{\sqrt{a^2+b^2}} \sim N(\sqrt{a^2+b^2}\Delta,1)$ is a sufficient statistic for $\Delta$. Define the usual two-sided Wald test based on $\hat \tau^*$ as

align[align omitted — 183 chars of source]

where $\mathcal{C}_{\alpha}$ is the $(1-\alpha)$ quantile of the chi-squared distribution with one degree of freedom. Then, the following corollary implies $\mathbb W_n \rightsquigarrow 1\{ (N^*)^2 \geq \mathcal C_\alpha\}$. In addition, $1\{ (N^*)^2 \geq \mathcal C_\alpha\}$ is known as the uniformly most powerful (UMP) unbiased test (see, for example, LR06) in the sense that it is more powerful than any level $\alpha$ unbiased test that is a (potentially nonlinear) combination of $(N_1,N_2)$. Consequently, it means $\mathbb W_n$ is asymptotically the UMP test over a class of level $\alpha$ unbiased tests that only depend on

align[align omitted — 205 chars of source]

This implies $\hat \tau^*$ is optimal among not only linear but also nonlinear combination estimators.

To formalize the statement, we need to introduce the following notation. Suppose $(N_1,N_2)$ follow the joint distribution in (ref) and let

align*[align* omitted — 305 chars of source]

be a class of unbiased tests with level $\alpha$.

corSuppose all conditions in Theorem (ref) hold, and we are under the local alternative in the sense that $\tau = \tau_0 + \Delta/\sqrt{n}$. Then, we have \begin{align*} \sqrt{n}\left[ (\hat w, 1- \hat w) \hat \Sigma (\hat w, 1- \hat w)^\top\right]^{-1/2}(\hat \tau^* - \tau_0) \rightsquigarrow N^* \stackrel{d}{=}\mathcal{N}(\sqrt{a^2+b^2}\Delta,1), \end{align*} where $\begin{pmatrix} a \\ b \end{pmatrix} = \Sigma^{-1/2} \begin{pmatrix} 1\\ 1 \end{pmatrix}$. In addition, suppose $\breve{\psi}_n$ is a generic test such that $\breve{\psi}_n = \psi(\hat N_1,\hat N_2) +o_P(1)$ for some $\psi \in \Psi_{\alpha}^U$ and the sequence $\{\breve{\psi}_n \}_{n \geq 1}$ is uniformly integrable, where $(\hat N_1,\hat N_2)$ are defined in (ref). Then, we have \begin{align*} \lim_{n \rightarrow \infty} \mathbb{E}\mathbb W_n = \sup_{\psi \in \Psi_{\alpha}^U } \lim_{n \rightarrow \infty} \mathbb{E}\psi(\hat N_1,\hat N_2) \geq \lim_{n \rightarrow \infty} \mathbb{E}\breve{\psi}_n. \end{align*}
remIn Corollary 4.1, we show that the two-sided Wald test based on the estimator $\hat \tau^*$, denoted by $\mathbb W_n$, is uniformly most powerful against two-sided local alternatives within the class of tests $\Psi_\alpha^U$. Thus, the optimality of $\mathbb W_n$ is specifically in terms of local power. The class $\Psi_\alpha^U$ consists of level $\alpha$ unbiased tests constructed using both adjusted and unadjusted estimators ($\hat \tau^{adj}$ and $\hat \tau^{unadj}$). Similar methods are used in the weak-identification robust inference literature, where combining Anderson-Rubin and Lagrange multiplier tests yields an unbiased test that maintains size control under weak identification and is uniformly most powerful against two-sided alternatives when identification is strong. For examples, see Andrews(2016) and LWZ24.
remOur inference procedure is “optimal” within the class of unbiased tests constructed by both adjusted and unadjusted estimators ($\hat \tau^{adj}$ and $\hat \tau^{unadj}$). However, further improvement is possible by combining more than two estimators. For instance, researchers may have prior knowledge about a subset of adjustment regressors, denoted as $X_i^{prior}$, and use them to form another regression-adjusted estimator $\hat \tau^{prior}$.\footnote{It can be computed by replacing $X_i$ in our estimation procedure by $X_i^{prior}$.} It is feasible to optimally combine $(\hat \tau^{adj},\hat \tau^{unadj},\hat \tau^{prior})$ in the same manner. Specifically, suppose we are under the same local alternative and have \begin{align*} \sqrt{n} \Sigma^{-1/2} \begin{pmatrix} \hat \tau^{adj} - \tau_0 \\ \hat \tau^{unadj} - \tau_0 \\ \hat \tau^{prior} - \tau_0 \\ \end{pmatrix} \rightsquigarrow \begin{pmatrix} N_1 \\ N_2 \\ N_3 \end{pmatrix} \stackrel{d}{=} \mathcal{N}\left( \begin{pmatrix} a \Delta \\ b \Delta \\ c \Delta \end{pmatrix}, I_3 \right), \end{align*} where $(a,b,c)^\top = \Sigma^{-1/2} 1_3$, then following the same argument before Corollary (ref), the level-$\alpha$ UMP unbiased test in the limit experiment can be written as \begin{align*} 1\left\{ \frac{(aN_1 + bN_2 + cN_3)^2}{a^2+b^2+c^2} \geq \mathcal C_\alpha \right\}. \end{align*} We can then construct a consistent cross-fit estimator $\hat \Sigma$ for the $3 \times 3$ covariance matrix $\Sigma$ following the same strategy proposed in Section (ref) below, which leads to consistent estimators $(\hat a,\hat b, \hat c)$ for $(a,b,c)$. Further denote \begin{align*} \sqrt{n} \hat \Sigma^{-1/2} \begin{pmatrix} \hat \tau^{adj} - \tau_0 \\ \hat \tau^{unadj} - \tau_0 \\ \hat \tau^{prior} - \tau_0 \\ \end{pmatrix} = \begin{pmatrix} \hat N_1 \\ \hat N_2 \\ \hat N_3 \end{pmatrix}. \end{align*} Then, it can be shown that \begin{align*} 1\left\{ \frac{(\hat a \hat N_1 + \hat b \hat N_2 + \hat c \hat N_3)^2}{\hat a^2+ \hat b^2+ \hat c^2} \geq \mathcal C_\alpha \right\} \end{align*} is asymptotically UMP unbiased test, as detailed in Corollary (ref), and thus, is uniformly more powerful than the two-sided t-tests based on $(\hat \tau^{adj}, \hat \tau^{unadj},\hat \tau^{prior})$ and $\hat \tau^*$, which does not use the prior information. Theoretically, the same procedure can extend to optimally combine any fixed number of regression-adjusted estimators. However, two problems arise. Firstly, combining multiple estimators may make the covariance matrix nearly singular and cause numerical issues. This creates another interesting trade-off between the negative effect due to the estimation error of the large covariance matrix and the benefit of including more estimators. Studying the optimal number of estimators and their identities in our estimator combination procedure would be interesting. Secondly, using data-driven methods (e.g., Lasso) to choose significant regressors may cause size distortion in the inference, especially when regressors have weak but dense effects, as in Models 1-3 in our simulation. It means even there is a well-defined globally optimal combination estimator, it may not be achievable. Due to these problems, we focus on an inference procedure that combines $\hat \tau^{adj}$ and $\hat \tau^{unadj}$ only.

Covariance Matrix Estimator

We now propose a consistent estimator $\hat \Sigma$ for $\Sigma =\Sigma_{\mathcal U} + \Sigma_{\mathcal V} + \Sigma_{\mathcal W}1_21_2^\top$. We first note that $$\Sigma_{2,2} = \mathbb E\left[\frac{var(Y_i(1)|S_i)}{\pi_{S_i}} + \frac{var(Y_i(0)|S_i)}{1-\pi_{S_i}}\right] + \Sigma_{\mathcal W}$$ is the asymptotic variance of the unadjusted estimator and does not depend on $X_i$. Now let

align*[align* omitted — 527 chars of source]

This estimator is consistent as long as Assumption (ref) holds. See, for example, BCS18 for details. Therefore, it suffices to construct consistent estimators for the $(1,1)$ and $(1,2)$ elements of $ \Sigma_{\mathcal U}$ and $ \Sigma_{\mathcal V}$, and $ \Sigma_{\mathcal W}$.

Denote the residual of the regression and its leave-one-out version are denoted as $\hat \varepsilon_{a,s,i} = Y_i - \hat \tau_{a,s} - \breve{X}_i' \hat \beta_{a,s}$ and $\acute \varepsilon_{a,s,i} = \hat \varepsilon_{a,s,i}/M_{a,s,i,i}$ for $i \in \aleph_{a,s}$, respectively. Then, we construct our estimator $\hat \Sigma_{\mathcal U}$ following the cross-fit approach developed by J22. It is also possible to construct the estimator based on the sample splitting approach proposed by CJN18. The cross-fit estimator, as shown below, is asymptotically valid as long as $\kappa_{a,s}<1$, but is not guaranteed to be positive definite in finite sample. In contrast, the sample splitting estimator is guaranteed to be positive semidefinite but requires $\kappa_{a,s}<1/2$. When both of them are valid, they are asymptotically equivalent. Interested readers can refer to J22 for more discussions. For the rest of the paper, we focus on cross-fit estimators of the $(1,1)$ and $(1,2)$ elements of $\hat \Sigma_{\mathcal U}$, which is defined as

align*[align* omitted — 347 chars of source]

where

align*[align* omitted — 357 chars of source]
remCJN18_ET pointed out that different numbers of covariates can be used for point estimation and for variance construction when the covariates possess approximation power (such as a series basis). Since $\Sigma_{\mathcal U}$ is analogous to the variance of the intercept in a linear regression with many regressors, this same idea can be applied to the construction of $ \hat \omega_{a,s}^2$ and $ \hat \varpi_{a,s}$. Moreover, if the error term $\varepsilon_i(a)$ is homogeneous within a stratum (i.e., $\mathbb{E} (\varepsilon_i^2(a)|X_i,S_i) = \mathbb{E} (\varepsilon_i^2(a)|S_i)$), then following CJN18_ET, we can define \begin{align*} \hat \Sigma_{\mathcal U}^{HO} = \begin{pmatrix} \sum_{s \in \mathcal{S}} \sum_{a=0,1} \frac{n_s^2}{n n_{a,s}} \gamma_{a,s,n}^{-1} \hat {\mathbb V}_{a,s} & \sum_{s \in \mathcal{S}} \sum_{a=0,1} \frac{n_s^2}{n n_{a,s}}\hat {\mathbb V}_{a,s} \\ \sum_{s \in \mathcal{S}} \sum_{a=0,1} \frac{n_s^2}{n n_{a,s}} \hat {\mathbb V}_{a,s} & \mathpalette\bigcdot@{.5} \end{pmatrix}, \end{align*} where \begin{align*} \hat {\mathbb V}_{a,s} = \frac{1}{n_{a,s}-1 -\kappa_n} \sum_{i \in \aleph_{a,s}} \hat \varepsilon_i^2(a), \end{align*} and show that $\hat \Sigma_{\mathcal U}^{HO} \stackrel{p}{\longrightarrow} \Sigma_{\mathcal U}$.
remWe can also consider the HC3 variant of $\hat \omega_{a,s}^2$, denoted as $\tilde \omega_{a,s}^2$, which is defined as: \begin{align*} \tilde \omega_{a,s}^2 = \frac{1}{n_{a,s}}\gamma_{a,s,n}^{-2} \sum_{i \in \aleph_{a,s}} \left(\sum_{j \in \aleph_{a,s}} M_{a,s,i,j}\right)^2 M_{a,s,i,i}^{-2} \hat \varepsilon^2_{a,s,i}. \end{align*} CJN18 demonstrated that $\tilde \omega_{a,s}^2$ is asymptotically conservative, meaning: \begin{align*} \liminf_{n \rightarrow \infty} \tilde \omega_{a,s}^2 \geq \omega_{a,s,\infty}^2. \end{align*} With this construction, along with the $(1,1)$ elements of $\hat \Sigma_{\mathcal V}$ and $\hat \Sigma_{\mathcal W}$ outlined below, we can develop an asymptotically conservative variance estimator for the adjusted estimator $\hat \tau^{adj}$.

To define $\hat \Sigma_{\mathcal V}$, we note that $\mathbb{E}(Y_i(a)|X_i,S_i)-\mathbb{E}(Y_i(a)|S_i)$ can be approximated by $\breve{X}_i^\top \beta_{a,s}$ for $i \in \aleph_{a,s}$, where $\beta_{a,s}$ is defined in Assumption (ref)(iv). KSS2020 considered the estimation and inference for quadratic functions of the coefficient in one linear regression with many regressors. However, in our setting, $\Sigma_{\mathcal V}$ depends on multiple linear coefficients $\beta_{a,s}$ which are estimated from different strata of observations, and each regression model may only be approximately linear. Therefore, the estimator $\hat \Sigma_{\mathcal V}$ includes both the quadratic and cross-product terms of the estimated coefficients $\hat \beta_{a,s}$. Denote $\Gamma_{a,s} = \sum_{i \in \aleph_{a,s}}\breve{X}_i\breve{X}_i^\top$ and $\Gamma_{s} = \sum_{i \in \aleph_{s}}\breve{X}_i\breve{X}_i^\top$. Following the spirit of KSS2020, our estimator of the $(1,1)$ and $(1,2)$ elements of $\hat \Sigma_{\mathcal V}$ is defined as

align*[align* omitted — 198 chars of source]

where

align*[align* omitted — 343 chars of source]

The estimator of $\Sigma_{\mathcal W}$ is standard:

align*[align* omitted — 142 chars of source]
assSuppose $\max_{a=0,1,s \in \mathcal{S}} \left\Vert \Gamma_s^{1/2} \Gamma_{a,s}^{-1}\Gamma_s^{1/2}\right\Vert_{op} = o_P(n). $
remBy the random matrix theory, under general regularity conditions, one can show that all the eigenvalues of $\Gamma_s/n_s$ and $\Gamma_{a,s}/n_{a,s}$ are bounded and bounded away from zero, even if $\kappa_{a,s}>0$. This then implies $\max_{a=0,1,s \in \mathcal{S}} \left\Vert \Gamma_s^{1/2} \Gamma_{a,s}^{-1}\Gamma_s^{1/2}\right\Vert_{op} = O_P(1)$, and thus, Assumption (ref) holds.
thmSuppose Assumptions (ref)--(ref) hold. Let $$\hat \Sigma = \begin{pmatrix} \sum_{s \in \mathcal{S}} \sum_{a=0,1} \frac{n_s^2}{n n_{a,s}} \hat \omega_{a,s}^2 + \hat \Sigma_{\mathcal V}^{adj} + \hat \Sigma_{\mathcal W} & \sum_{s \in \mathcal{S}}\sum_{a=0,1} \frac{n_s^2}{n n_{a,s}} \hat \varpi_{a,s} + \hat \Sigma_{\mathcal V}^{adj} + \hat \Sigma_{\mathcal W} \\ \sum_{s \in \mathcal{S}}\sum_{a=0,1} \frac{n_s^2}{n n_{a,s}} \hat \varpi_{a,s} + \hat \Sigma_{\mathcal V}^{adj} + \hat \Sigma_{\mathcal W} & \hat \Sigma_{2,2} \end{pmatrix}.$$ Then, we have \begin{align*} \hat \Sigma \stackrel{p}{\longrightarrow} \Sigma. \end{align*}

Indeed, stratum-specific RAs reduce the effective sample size, exacerbating the dimensionality issue. When $k_n$ exceeds the effective sample size $n_{a,s}$, researchers can employ Ridge-regularized linear regression for adjustment. Studying the statistical properties of the corresponding regression-adjusted ATE estimator is an interesting avenue for future research.

Fixed or Moderate Number of Regressors

In this section, we consider the CARs specified in Assumption (ref) with a fixed or moderately diverging dimension of $X_i$, i.e., $k_n$. We then introduce another set of regularity conditions to replace Assumptions (ref)--(ref). Under these new conditions, the Wald test based on the same estimator $\hat \tau^*$ - constructed using the same $\hat \tau^{adj}$, $\hat \tau^{unadj}$, and $\hat \Sigma$ as defined above - maintains exact asymptotic size under the null and is weakly more powerful than the Wald test based on the unadjusted estimator $\hat \tau^{unadj}$.

Particularly, in this dimension regime, there's no need to assume that the RAs are approximately correctly specified, as in Assumption (ref)(iv). So the results here are not merely special cases of those in Section (ref). Additionally, they are also novel to the literature of RAs with fixed number of regressors (e.g., YYS22). This is because the cross-fit estimator of the covariance matrix and the optimal linear combination estimator, motivated by our high-dimensional analysis, are new.

ass\begin{enumerate}[label=(\roman*)] • Denote the dimension of $X_i$ as $k_n$ and suppose $\max_{i \in [n]}||\breve X_i||_\infty = O_P(\xi_n)$ such that $k_n^2 \xi_n^2 \log(k_n) = o(n)$. In addition, there exist constants $c,C$ such that \begin{align*} 0 < c \leq \lambda_{\min}\left(\frac{1}{n_{a,s}}\sum_{i \in \aleph_{a,s}}\breve X_i \breve X_i^\top\right) \leq \lambda_{\max}\left(\frac{1}{n_{a,s}}\sum_{i \in \aleph_{a,s}}\breve X_i \breve X_i^\top\right) \leq C<\infty \end{align*} and \begin{align*} 0 < c \leq \lambda_{\min}\left(Var( X_i |S_i=s)\right) \leq \lambda_{\max}\left(Var( X_i |S_i=s)\right) \leq C<\infty. \end{align*} • Suppose $ \sum_{s \in \mathcal{S}}\frac{p_s}{\pi_s (1-\pi_s)} Var(X_i^\top \overline{\beta}_s^*|S_i=s) \geq c> 0$ for some constant $c$, where $\overline{\beta}_s^* = (1-\pi_s)\beta_{1,s}^* + \pi_s \beta_{0,s}^*$ and $\beta_{a,s}^*= Var(X_i\mid S_i=s)^{-1} Cov(X_i,Y_i(a)|S_i=s).$ \end{enumerate}
remAssumption (ref)(i) allows the dimension of $\breve X_i$ to be either fixed or diverging with the sample size. If $\xi_n$ is bounded,\footnote{For example, the elements of the $k_n \times 1$ vector $X_i$ are independent and bounded.} then the rate requirement boils down to $k_n^2 \log(k_n) = o(n)$ or $k_n = o(n^{1/2})$ up to a logarithmic factor.
remAssumption (ref)(ii) means the covariates have non-negligible prediction power of the outcome in at least one of the strata. If this condition fails, then the adjusted and unadjusted estimators are asymptotically equivalent. The combination estimator will also be equivalent to them asymptotically if we apply the same strategy mentioned in Remark (ref) to safeguard against the degeneracy.
thmSuppose Assumptions (ref) and (ref) holds. Then, we have \begin{align*} \Omega^{-1/2} \begin{pmatrix} \sqrt{n}(\hat \tau^{adj} - \tau) \\ \sqrt{n}(\hat \tau^{unadj} - \tau) \end{pmatrix} \rightsquigarrow \mathcal{N}\left(0_2, I_2 \right), \end{align*} \begin{align*} \Omega & = \left\{ \mathbb{E}\left[\frac{Var(Y_i(1)|X_i,S_i)}{\pi_{S_i}} + \frac{Var(Y_i(0)|X_i,S_i)}{1-\pi_{S_i}}\right] + \mathbb{E}(m_{1}(X_i,S_i) - m_{0}(X_i,S_i)-\tau)^2 \right\}1_2 1_2^\top \\ & + \sum_{s \in \mathcal{S}}\frac{p_s}{\pi_s (1-\pi_s)}\begin{pmatrix} V_s & V_s \\ V_s & V_s' \end{pmatrix}, \end{align*} and \begin{align*} \hat \Sigma^{-1}\Omega \stackrel{p}{\longrightarrow} I_2, \end{align*} where $m_a(x,s) = \mathbb E (Y_i(a)|X_i=x,S_i=s)$, \begin{align*} & V_s = Var((1-\pi_s) m_1(X_i,s) + \pi_s m_0(X_i,s) - X_i^\top \overline{\beta}_s^* \mid S_i=s), \\ & V_s' = Var((1-\pi_s) m_1(X_i,s) + \pi_s m_0(X_i,s) \mid S_i=s), \end{align*} In addition, we have \begin{align*} \sqrt{n} \left[(\hat w, 1-\hat w)\hat \Sigma (\hat w, 1-\hat w)^\top\right]^{-1/2} ( \hat \tau^* - \tau) \rightsquigarrow \mathcal{N}(0,1). \end{align*} In this case, $\hat \tau^*$ is asymptotically equivalent to $\hat \tau^{adj}$ in sense that $\hat \tau^* = \hat \tau^{adj} + o_P(n^{-1/2})$ and weakly more efficient than $\hat \tau^{unadj}$.
remThe limit distribution of $\hat \tau^{adj}$ has already been derived by YYS22 when $k_n$ is fixed. Here, our main contributions are (1) deriving the joint distribution of $\hat \tau^{adj}$ and $\hat \tau^{unadj}$ while allowing the dimension of the covariates to diverge with the sample size and (2) establishing the consistency of our cross-fit covariance matrix estimator $\hat \Sigma$ under the moderate dimension framework. Theorem (ref) shows that the Wald test based on our optimal linear combination estimator $\hat \tau^*$ and the covariance matrix estimator $\hat \Sigma$ proposed in Section (ref) still controls asymptotic size under the null and has the same power as $\hat \tau^{adj}$ under local alternatives with a moderate dimension of $X_i$. In fact, $\hat \tau^*$ is equivalent to $\hat \tau^{adj}$, and YYS22 have shown that, when $k_n$ is fixed, $\hat \tau^{adj}$ (and thus, $\hat \tau^*$) is the optimally linearly adjusted estimator in the sense that it achieves the minimum asymptotic variance among a class of estimators adjusted by linear functions of $X_i$. This optimality result naturally extends to the moderate $k_n$ case considered here as long as the rate requirement in Assumption (ref) is satisfied. Therefore, $\hat \tau^*$ is weakly more efficient that $\hat \tau^{unadj}$. See, for example, LTM20, MTL20, and YYS22 for more discussion.
remWe emphasize that Theorem (ref) holds without requiring the linear RAs to be approximately correctly specified, even when the dimension of covariates diverges. LD21 and CMO23 established similar results for their regression-adjusted ATE estimator under complete randomization and finite-population asymptotics, but they imposed the restriction $k_n = o(n^{1/2})$. Our rate requirement aligns with theirs, differing only by a logarithmic factor. When $k_n$ grows faster than $n^{1/2}$, the regression-adjusted ATE estimator may suffer from asymptotic bias if the linear regressions are not approximately correctly specified. To address this, LD21 and CMO23 proposed bias correction methods, though their approaches permit at most $k_n = o(n^{2/3})$. More recently, LYW23 introduced a debiased regression-adjusted estimator that allows $k_n$ to be of the same order as $n$ without assuming the correct specification. Our work differs from theirs in three key aspects. First, LYW23's (LYW23) regression adjustment follows a specially designed approach distinct from the original YYS proposal, which remains our main focus; indeed, LYW23 highlighted the technical challenges in analyzing the original regression adjusted estimator (i.e., L13's (L13) estimator, which is analogous to YYS in complete random sampling) when $k_n$ is proportional to $n$. Second, their results apply only to complete random sampling under a finite-population framework, whereas we consider general CARs under a superpopulation framework. Third, we propose a linear combination estimator that is guaranteed to be at least as efficient as the unadjusted estimator. Extending similar regression adjustment and bias-correction methods to our setting, which accommodates a more general randomization scheme (i.e., CAR) under a sampling-based superpopulation framework, would be an interesting avenue for future research. However, we consider this beyond the scope of the present paper. Therefore, we view our inference method as a complement rather than a substitute for those proposed by LD21, CMO23, and LYW23. In summary, when treatment is assigned by CARs and either the dimension of covariates is $o(\sqrt{n})$ but the RAs may be misspecified, or the dimension of covariates is a fraction of the sample size and the RAs are approximately correctly specified (as in the cases discussed after Assumption (ref)), researchers can choose our inference method. However, when treatment is assigned by complete randomization, the dimension of the covariates is greater than $n^{1/2}$, and the RAs are not likely to be approximately correctly specified (as in the case where there are many original continuous regressors), researchers should turn to the bias-corrected inference methods proposed by LD21, CMO23, LYW23.

Simulations

We conduct a simulation study to evaluate the finite sample performance of our proposed inference method. The nominal level is $\alpha=5\%$ throughout the section.

Data Generating Processes

For $a\in\{0,1\}$, we generate potential outcomes according to the equation

equation[equation omitted — 105 chars of source]

where $\mu_{a}$, and $m_{a}\left(Z_{i}\right)$ and $\sigma_a(Z_i)$ are specified as follows. In each of the following specifications, $\{Z_i, \varepsilon_{i}(1), \varepsilon_{i}(0)\}$ are i.i.d. We have considered four models following the designs by CJN18. For the first three models, the dimension of $Z_i$ is denoted as $d_n$, and we let $X_i$ be either the full set or the first $k_n$ elements of $Z_i$. For the last model, $Z_i$ is of fixed dimension, and we let $X_i$ be either the full set or the first $k_n$ elements of polynomial series of $Z_i$. The polynomial series will be specified below. By varying the choice of $k_n$, we can illustrate the uniformity of our inference method.

description• The dimension of $Z_i$ is set to $d_n=0.2n/|\mathcal{S}|$. The first entry of $Z_i$ is uniformly distributed in $[-1,1]$, i.e., $Z_{1i}\sim U[-1,1]$. The other entries of $Z_i$ are dummies: $[Z_{2i},Z_{3i},\cdots,Z_{d_n,i}]^\top=\textbf{1}(\textbf{v}_{i}\geq \Phi^{-1}(0.8))$ with $\textbf{v}_{i} \sim \mathcal{N}(0,\textbf{I}_{d_n-1})$. We set $m_a(\cdot)$ and $\sigma_a(\cdot)$ respectively as $$ m_1(Z_i)=m_0(Z_i)=Z_{1i}+2\sum_{j=2}^{d_n}Z_{ji}/\sqrt{d_n-1} $$ and $$\sigma_{0}(Z_{i})=\sigma_{1}(Z_{i})=c_{\varepsilon}\left[1+\left(Z_{1i}+\sum_{j=2}^{d_n}Z_{ji}/\sqrt{d_n-1}\right)^2\right]^{1/2}.$$ Let $(\varepsilon_{i}(1),\varepsilon_{i}(0))\sim \mathcal{N}(0,\mathbf{I}_2)$ be independent of $Z_i$. We set $c_\varepsilon$ as the normalizing constant such that $\mathbb E \sigma_a^2(Z_i) = 1$. • This model is the same as model 1, except that $Z_{ji}$'s are $U[-1,1]$ and $$ m_1(Z_i)=m_0(Z_i)=2\sum_{j=2}^{d_n}Z_{ji}/\sqrt{d_n-1}, $$ where $Z_{1i}$ does not appear in $ m_1(Z_i)$ and $m_0(Z_i)$. • This model is the same as Model 2, except that $[Z_{2i},\cdots,Z_{d_n,i}]^\top=\Sigma_\rho^{1/2}\mathbf{v}_i$, where $\mathbf{v}_i\in \mathbb{R}^{d_n-1}$ and $\Sigma_\rho$ is a Toeplitz matrix with $ [\Sigma_\rho]_{i,j}=\rho^{|i-j|} $ and $\rho=0.6$. We set $\mathbf{v}_i$ to contain i.i.d. $U[-1,1]$ entries. • Let $d_{n}=6$, $Z_{ji}\sim U[-1,1]$ for $j=1,\cdots,6$, $$m_{1}(Z_i)=m_{0}(Z_i)=2\exp\left( \sqrt{\frac{1}{6}\sum_{j=1}^{6}Z_{ji}^2} \right), $$ and $$\sigma_{0}(Z_{i})=\sigma_{1}(Z_{i})=c_{\varepsilon}\left[1+\left(Z_{1i}+\sum_{j=2}^{6}Z_{ji}/\sqrt{5}\right)^2\right]^{1/2}.$$ We use the following polynomials or some of them as regressors: \begin{itemize} • First order terms: $Z_{1i},Z_{2i},Z_{3i},Z_{4i},Z_{5i},Z_{6i}$, • Second order terms: $Z_{1i}^2,Z_{2i}^2,Z_{3i}^2,Z_{4i}^2,Z_{5i}^2,Z_{6i}^2$ and first-order interactions, • Third-order terms: $Z_{1i}^3,Z_{2i}^3,Z_{3i}^3,Z_{4i}^3,Z_{5i}^3,Z_{6i}^3$ and second-order interactions, • Fourth-order terms: $Z_{1i}^4,Z_{2i}^4,Z_{3i}^4,Z_{4i}^4,Z_{5i}^4,Z_{6i}^4$ and third-order interactions. \end{itemize}

For each model, strata are determined by dividing the support of $Z_{1i}$ into $|\mathcal{S}|$ intervals of equal length. Specifically, we have $S_i = \sum_{j = 1}^{|\mathcal{S}|} 1\{Z_{1i} \leq g_j\}, $ where $g_j=2j/|\mathcal{S}|-1$. For all strata, we set $\pi_s=1/2$. The treatment status is determined according to one of the following four CAR schemes:

enumerate• SRS: Treatment assignment is generated as in Example 1, • BCD: Treatment assignment is generated as in Example 2 with $\lambda = 0.75$, • WEI: Treatment assignment is generated as in Example 3 with $\phi(x) = (1-x)/2$, • SBR: Treatment assignment is generated as in Example 4.

Simulation Results

Rejection probabilities are computed using $10,000$ replications. We compare our methods with three existing methods recently introduced by BCS17, YYS22, and LTM20. We list these methods below.

description• The inference method based on the fully saturated regression adjusted estimator introduced in Section (ref) and the variance estimator $\hat{\Sigma}_{1,1}$ as in Theorem (ref). • The inference method based on the optimal linear combination estimator introduced in Section (ref) and Theorem (ref). • The inference method introduced by BCS18. The estimator for $\tau$ is exactly the unadjusted IPW estimator $\hat{\tau}^{unadj}$. • The inference method introduced by YYS22. The estimator for $\tau$ is exactly the same as $\hat{\tau}^{adj}$. However, its variance estimator does not take into account the issue of many covariates. • The inference method introduced by LTM20, which uses Lasso to select relevant regressors in RA. Specifically, we use the `HDM' package in R with the default choice of tuning parameter to obtain the corresponding Lasso estimates.

Tables (ref) reports the size results for $n=400$ and $800$, under $H_{0}:\mu_1=\mu_0=0$ and $S=2$. In the first three models, we include all elements of $Z_i$ as regressors, i.e., $X_i=Z_i$. For the last model, we include all polynomial series of $Z_i$ as regressors. Therefore, the number of covariates used in each regression is approximately $\mathbf{40\%}$ of the effective sample size (i.e., $\kappa_{a,s} = 0.4$). We find that our methods $\hat{\tau}^{adj}$ and $\hat{\tau}^{\ast}$ have good size control under four models, improving as $n$ increases. In contrast, YYS has high rejection rates, over 10%, in all cases, even when $n$ is as large as 800. Our theory in Section (ref) shows this size distortion is caused by ignoring the estimation errors from many regressors. Furthermore, LTM has rejection probabilities over 7% in many cases. In particular, in Model 3 with correlated covariates, LTM has rejection rates over 9% in all randomization schemes, even when $n$ is 800. This is because in this model, the sparsity condition does not hold. Finally, BCS does not use any regressors, and thus, is immune to the size distortion due to the many regressors.

Table (ref) shows the power results under $H_{1}:\mu_1-\mu_0=0.2$. We find that, first, $\hat{\tau}^{\ast}$ always has higher power than $\hat{\tau}^{adj}$ and BCS, as our theory predicts. Second, YYS ignores the cost of RAs, resulting in a smaller variance estimator, and thus, higher rejection rates under both the null and alternative. Third, LTM has lower power than $\hat{\tau}^{\ast}$ in Models 1-3, where the sparsity condition for the regression coefficients fails. In fact, in this case, Lasso excludes many informative covariates in the adjustments. In model 4, LTM has better power than $\hat{\tau}^{\ast}$ since the sparsity condition is satisfied. By exploiting the sparsity, it is possible to show that the ATE estimator with the $\ell_1$ regularized adjustments achieves the semiparametric efficiency bound. However, even in this case that favors the Lasso regression adjustments, the power of our method based on $\hat \tau^*$ is very close to LTM.

\newcolumntype{L}{>{\arraybackslash}X} \newcolumntype{C}{>{\arraybackslash}X}

table[table omitted — 2,672 chars of source]

Figures (ref) and (ref) show how the rejection rates of $\hat{\tau}^{adj}$, $\hat{\tau}^{\ast}$, YYS and LTM vary with the number of regressors under the null and alternative hypotheses. We consider Models 1-4 with $n=800$ and $n=400$, respectively. We set the number of regressors $k_n=0,2,\cdots,80$ ($k_n=0,1,\cdots,40)$ for $n=800$ ($n=400$), corresponding to $\kappa_{a,s} = 0,0.01,\cdots,0.4$. The x-axis is $\kappa_{a,s}$. The y-axis is the rejection probabilities. We display only the figures under the SBR scheme. Similar patterns are found under the other randomization schemes, which are shown in the Online Supplement.

Panels (a) of the figures show that our methods (i.e., $\hat \tau^{adj}$ and $\hat \tau^*$) have uniform size control over $\kappa_{a,s}$. Even when the dimensions of regressors vary from 0 to 80 (40) for $n=800$ ($n=400$), our methods have close-to-nominal rejection rates under $H_{0}$, consistent with our theories. In contrast, YYS has rejection probabilities that increase linearly with $\kappa_{a.s}$ in all models. Similarly, LTM displays this size distortion in Models 2 and 3, in which the sparsity condition fails.

Panels (b) of the figures show the power of the five methods under $H_{1}:\mu_1-\mu_0=0.2$. Several observations emerge. First, BCS's power, our benchmark, does not vary with $\kappa_{a,s}$ because it uses no regressors. Second, for all models, $\hat{\tau}^{\ast}$ is always more powerful than BCS and usually more powerful than $\hat \tau^{adj}$, as our theory predicts. Third, as the number of regressors increases, the misspecification error decreases, and $\hat{\tau}^{\ast}$ becomes more powerful. However, $\hat{\tau}^{adj}$'s power drops even below that of the unadjusted estimator as $k_n$ increases for Model 1. This reflects that many covariates do not always improve estimation accuracy, and the “no-harm” regression adjustments can in fact harm the estimation precision. Fourth, for Models 1-3, $\hat{\tau}^{\ast}$ is generally more powerful than LTM as the dimension of regressors increases. For Model 4, LTM slightly outperforms $\hat{\tau}^{\ast}$ when $\kappa_{a,s}$ is large for $n=800$ due to the sparsity of the model.

table[table omitted — 2,739 chars of source]
figure[figure omitted — 301 chars of source]
figure[figure omitted — 301 chars of source]

Practical Implication of Dimensionality

When the dimension of covariates, $k_n$, is relatively small compared to $n^{1/2}$, our inference method remains valid and "no-harm," even when the linear regression adjustment is misspecified. This also holds for conventional inference methods like that of YYS22.

When $k_n$ exceeds $n^{1/2}$ and the linear regression is approximately correctly specified (i.e., Assumption (ref)(iii)), our inference method remains valid and “no-harm”, even when $k_n$ is smaller but comparable to $n$, whereas the conventional method does not. Approximately correct specification is satisfied if the baseline covariates $Z_i$ are fixed-dimensional and continuous, with $X_i$ containing sieve basis functions of $Z_i$, or if the baseline covariates are categorical (discrete), with $X_i$ including fully saturated dummies for all categories.

When $k_n$ exceeds $n^{1/2}$ and the linear regression adjustment is not approximately correctly specified, the adjusted and linear combination estimators, $\hat{\tau}^{adj}$ and $\hat{\tau}^*$, may exhibit non-negligible biases. These biases can potentially be corrected using the methods developed by LD21 and CMO23, provided $k_n = o(n^{2/3})$. However, the statistical properties of these bias-corrected ATE estimators, and whether they remain 'no-harm' under CARs, have not yet been studied.

When $k_n$ exceeds $n^{2/3}$ and the linear regression adjustment is not approximately correctly specified, there is currently no known method for valid causal inference using regression-adjusted estimators under any randomization scheme, which is left for future research.

Empirical Application

Studying the effects of child health and nutrition on educational outcomes helps us understand the connection between health and economic development in less developed countries (glewwe2007, glewwe2007; dupas2017, dupas2017). To investigate the impact of an iron supplement program on students' schooling attainment, CCFNT16 conducted a randomized experiment in Peru with a CAR framework.

Their experiment involved 215 students from a rural secondary school in Peru during the 2009 academic year. Students were stratified by five grade levels, with each grade having students randomly assigned to one of three groups: two treatment groups and one control group. In the treatments, one group viewed a video where a well-known soccer player endorsed iron supplements, and the other group saw a video with a doctor's endorsement. The control group watched a video that did not mention iron supplements.

In this section, we focus on the impact of iron supplement program on the number of iron pills taken, whether a student is anemic at endline, and the student's cognitive ability. Throughout the analysis, students in the two treatment arms are grouped into the treatment group as in CCFNT16.

We use a fully saturated model, including two dummy covariates (gender and electricity at home) from the regressors in CCFNT16 and their interaction as the third covariate. This ensures that the model is correctly specified. Although the number of regressors is not large, it is still a significant proportion of the sample size given that the total sample size is not large either. $\kappa_{1,s}$ range from approximately 8% to 15%, and $\kappa_{0,s}$ range from about 16% to 30%.\footnote{We left out the strata where the number of observations in either treatment or control group is less than or equal to 4.}

Table (ref) presents the ATEs and the standard errors (in parentheses) estimated by different methods.\footnote{The description of these methods is similar to that in Section (ref).} We make three observations from the results. First, the variance estimates of the YYS method are smaller than those of $\hat{\tau}^{adj}$ in general. For example, the standard error for pills taken is approximately about 17.6% lower with YYS compared to $\hat{\tau}^{adj}$, despite identical ATE estimates. This indicates that YYS method may fail to fully capture estimation errors that arise when using many regressors.

Second, the standard errors of $\hat{\tau}^{\ast}$ are consistently lower than those of both $\hat{\tau}^{adj}$ and BCS for all outcomes, with some differences being substantial. For example, for cognitive ability, the standard error of $\hat{\tau}^{\ast}$ is about 8.2% smaller than that of BCS. This result is expected because $\hat{\tau}^{\ast}$ is a weighted average of $\hat \tau^{adj}$ and the unadjusted estimator (BCS), designed to minimize asymptotic variance. The standard errors of $\hat{\tau}^{\ast}$ are also generally lower than those of LTM, though by a smaller margin.

Third, consistent with CCFNT16, our results indicate that the iron supplement program increases the number of iron pills taken but has no significant effect on anemia or cognitive ability.

\newcolumntype{L}{>{\arraybackslash}X} \newcolumntype{C}{>{\arraybackslash}X}

table[table omitted — 1,053 chars of source]

Conclusion

This paper shows that the estimation error of the “no-harm” regression adjustments can contaminate the ATE estimator and degrade estimation efficiency when the number of regressors is of the same order as the sample size. We then propose a new ATE estimator which is guaranteed to be weakly more efficient than both the estimators with and without RAs. We also propose a consistent estimator of its asymptotic variance and construct the corresponding Wald-statistic.