EconBase
← Back to paper

Orthogonal Series Estimation for the Ratio of Conditional Expectation Functions

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.

97,119 characters · 19 sections · 57 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.

Orthogonal Series Estimation for the Ratio of Conditional Expectation Functions

abstractIn various fields of data science, researchers are often interested in estimating the ratio of conditional expectation functions (CEFR). Specifically in causal inference problems, it is sometimes natural to consider ratio-based treatment effects, such as odds ratios and hazard ratios, and even difference-based treatment effects are identified as CEFR in some empirically relevant settings. This chapter develops the general framework for estimation and inference on CEFR, which allows the use of flexible machine learning for infinite-dimensional nuisance parameters. In the first stage of the framework, the orthogonal signals are constructed using debiased machine learning techniques to mitigate the negative impacts of the regularization bias in the nuisance estimates on the target estimates. The signals are then combined with a novel series estimator tailored for CEFR. We derive the pointwise and uniform asymptotic results for estimation and inference on CEFR, including the validity of the Gaussian bootstrap, and provide low-level sufficient conditions to apply the proposed framework to some specific examples. We demonstrate the finite-sample performance of the series estimator constructed under the proposed framework by numerical simulations. Finally, we apply the proposed method to estimate the causal effect of the 401(k) program on household assets.

Introduction

In various fields of data science, researchers often face problems of estimating the ratio of conditional expectation functions (CEFR). Although CEFR appears not only in causal inference studies, there are several important examples of CEFR in the treatment effect estimation literature. When an outcome of interest is the relapse rate of a specific disease, it is more natural to consider the ratio of the conditional expectation of potential outcomes $E[Y_1|X]/E[Y_0|X]$, rather than the difference $E[Y_1|X]-E[Y_0|X]$, as a measure of causal effects of a medical treatment, where $Y_1$ and $Y_0$ are the potential outcome with and without a treatment, respectively, and $X$ is a vector of baseline covariates. Likewise, ratio-based treatment effects such as the odds ratio and hazard ratio have been widely used especially in clinical settings. Furthermore, in a data combination setting where an outcome and a treatment status are only separately observed, both conditional average treatment effect (CATE) and local average treatment effect (LATE) are identified as in the form of CEFR yamane,shinoda2022estimation, while these effects are defined as the difference of the potential outcomes.

In this article, we start by developing a novel series estimator for CEFR in a very simple setting without selection bias in observed data. This series estimator is itself useful in estimating treatment effects when data can be collected completely at random from the population of interest, but such randomized data are often not available in practice. Technically, when there is selection bias in collected data, we need to estimate potentially infinite-dimensional nuisance parameters to adjust for the bias, but these parameters may be hard to estimate with a “sufficiently high quality” in observational studies on complex systems since they can be very high-dimensional and/or highly nonlinear. The highly complex nuisance parameters do not satisfy the traditional assumptions that limit the complexity of a function class, and therefore the resulting semiparametric estimator fails to be $\sqrt{N}$-consistent. We employ debiased machine learning (DML), a set of techniques to enable the use of flexible machine learning (ML) methods for nuisance estimation, to develop a simple and general framework for constructing a high-quality estimator for CEFR even in the presence of selection bias in observed data.

The major contribution of this study is the development of a novel inference framework for CEFR with theoretical guarantees. We derive the general asymptotic results for estimation and uniform inference on the best linear approximation to the target CEFR under the proposed framework, including the validity of the Gaussian bootstrap. It is worth noting that we do not have to add stronger regularity conditions than the assumptions previously known in the literature to establish the theoretical results in this article. In addition to the general results, we provide a set of low-level sufficient conditions to apply the proposed framework to several specific settings. Besides the asymptotic analysis, we conduct numerical simulations to evaluate the performance of the proposed method on finite samples. We also illustrate the use of the framework in an empirical example.

This study builds upon three important bodies of research within the semiparametric literature: DML, series estimation and CEFR estimation. DML chernozhukov2018,chernozhukov2022locally enables inference on the finite-dimensional parameter in the presence of infinite-dimensional nuisance parameters by using the Neyman orthogonal moment conditions. When the moment condition satisfies the Neyman orthogonality neyman1959optimal, bias in the nuisance estimates has no first-order asymptotic effect on the estimator of the target parameter. DML is powerful enough to allow the use of a broad class of ML estimators ---such as $\ell_1$-penalized methods in sparse models bickel2009simultaneous,buhlmann2011statistics,belloni2011square,belloni2012sparse,belloni2011ell1,belloni2013least, $L_2$-boosting methods in sparse linear models luo2016high, neural nets schmidt2020nonparametric,farrell2021deep,kohler2021on, trees and random forest wager2015adaptive,syrgkanis2020estimation--- under a broad range of data generating processes and for various causal parameters. Moreover, the extensions of DML have been proposed to estimate a function, e.g. CATE or continuous treatment effect, with the existence of complex infinite-dimensional nuisance parameters jacob2019group,zimmert2019nonparametric,colangelo2020double,semenova2021debiased,fan2022estimation. The present study provides a novel method for the orthogonal estimation under a variety of realistic settings that cannot be covered by the previous works, such as ratio-based treatment effects, and treatment effects in the data combination settings.

The second foundation of this study is the least squares series estimation. Series estimation is a type of nonparametric estimation method that approximates a function of interest by a linear combination of multiple basis functions. It is especially useful when the exact functional form of the target function is unknown. Its asymptotic properties have been investigated intensively in the literature van1990estimating,andrews1991asymptotic,eastwood1991adaptive,gallant1991asymptotic,newey1997convergence,van2002m,huang2003local,chen2007large,cattaneo2013optimal,belloni2015some,chen2015optimal, among which we will mainly rely on the results in belloni2015some. This study contributes to the series estimation literature by establishing the asymptotic theory for the CEFR problems rather than the standard regression setting.

This study is also closely related to CEFR estimation in causal inference. A simple yet important example is ratio-based treatment effects such as the odds and hazard ratio. To the best of our knowledge, the previous works on the estimation of the ratio-based treatment effects all impose assumptions on the functional form somewhere in the model dukes2018note,liang2020relative,yadlowsky2021estimation,lee2022survival. For example, liang2020relative supposes that the ratio-based treatment effects can be expressed as the monotone single index model, and yadlowsky2021estimation imposes a stronger condition that the monotone link function is an exponential function. On the other hand, this study considers a fully nonparametric model for treatment effects, imposing no assumptions on the functional form of CEFR.

Furthermore, yamane and shinoda2022estimation show that difference-based CATE and LATE are identified in the form of CEFR in the data combination setting where we cannot observe an outcome and a treatment status simultaneously in a single dataset, and develop estimation methods for CEFR. This study accommodates the generalized version of their problem settings, where each separate dataset contains selection bias. Their estimators cannot handle the selection bias without introducing additional nuisance parameters, but their methods are not orthogonal to the nuisance parameters.

The rest of this article is organized as follows. In Section (ref), we develop a simple series estimator for CEFR. We propose the general framework for estimation and inference of CEFR in Section (ref). The main theoretical results for the asymptotic properties of the series estimator under the proposed framework are presented in Section (ref), and the application of the framework to some specific treatment effects problems is shown in Section (ref). In Section (ref), we illustrate the finite sample performance of the proposed method by numerical simulations. We also apply the proposed method to the empirical example of estimating a causal effect of participation in 401(k) on net financial assets in Section (ref). Finally, we provide further discussion on the limitation and future direction of the present study in Section (ref).

Direct Series Estimator for CEFR

Consider the following model:

gather[gather omitted — 207 chars of source]

where $X\in\mathcal{X}\subset\mathbb{R}^q$ is a $q$-dimensional vector of covariates, and $\zeta_0(x)\neq0$ for all $x\in\mathcal{X}$ is necessary for $\theta_0(x)$ to be well-defined. Now we are interested in estimating $\theta_0(x)$ from separately observed iid samples: $\{u_i,x_i\}_{i=1}^{N_U}$ of $(U,X)$ and $\{t_i,x_i\}_{i=1}^{N_T}$ of $(T,X)$. Suppose $N=N_U=N_T$ without loss of generality. Also, assume that the samples $\{u_i,x_i\}_{i=1}^N$ and $\{t_i,x_i\}_{i=1}^N$ are complete random draws from the population of interest, i.e. there is no selection bias in these separate samples. Then, regarding $U$ and $T$ as outcome variables with and without a treatment, respectively, this problem coincides with the estimation of ratio-based treatment effects ogburn2015,dukes2018note,yadlowsky2021estimation in randomized control trials. Moreover, estimation of difference-based CATE and LATE from separately observed samples yamane,shinoda2022estimation is included in the model ((ref)). Although the estimator developed below primarily aims at estimating $\theta_0(x)$ from the separate samples, it can also be applicable to the estimation from joint samples $\{u_i,t_i,x_i\}_{i=1}^N$ of $(U,T,X)$. Thereafter, we omit arguments of functions if they are obvious from the context.

It follows from the model ((ref)) that $E[U-\zeta_0(X)\theta_0(X)|X]=0$. Then, using this moment condition, we can consider the linear approximation to the target function $\theta_0(x)$ by a vector of $k$ basis functions $p(x):=(p_1(x),\ldots,p_k(x))'$ as $\theta(x)=p(x)'\beta$, where

align[align omitted — 173 chars of source]

However, as the true denominator function $\zeta_0(x)$ is unknown, the above equation cannot be directly applied for estimation. To deal with this issue, shinoda2022estimation proposed to plug-in the estimator $\hat{\zeta}(x)$ of $\zeta_0(x)$, while yamane introduced an auxiliary function and reformulate the problem into minimax optimization. Both of these approaches have problems: the former lacks the theoretical justification to use flexible nonparametric methods for $\hat{\zeta}(x)$ since simply plugging-in nonparametric estimates generally does not ensure $\sqrt{N}$-consistency of the target estimator, and the latter suffers from unreliable hyperparameter selection caused by the minimax objective. In what follows, we develop a simpler one-step estimator for CEFR in the spirit of vapnik1999nature's principle: When solving a given problem, try to avoid solving a more general problem as an intermediate step.

Define $f(x):=\zeta_0(x)p(x)$ and its series estimator

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

Substituting $f$ for ((ref)) gives

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

Then, by replacing $f(x)$ with its estimator $\hat{f}(x)$, we obtain

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

and its sample analog estimator $\hat{\beta}=\hat{Q}^{-1}E_N[p(x_i)u_i]$, where $E_N[g(x_i)]:=N^{-1}\sum_{i=1}^N f(x_i)$ for some function $g$ and $\hat{Q}:=E_N[p(x_i)p(x_i)'t_i]$. The key observation here is that we can compute $\hat{\beta}$ even when $\{u_i,x_i\}_{i=1}^N$ and $\{t_i,x_i\}_{i=1}^N$ are only separately observed. Henceforth, we refer to this estimator as the Direct Series Ratio (DSR) estimator.

remark[Asymptotic Properties of the DSR Estimator] Although the estimator $\hat{f}(x)$ is plugged-in during the derivation process of DSR, there is no actual need to calculate $\hat{f}(x)$. Using the nonparametric estimator of nuisance functions as done in shinoda2022estimation may adversely affect the theoretical and practical properties of a target estimator since nonparametric estimators may have biases due to model selection and regularization. DSR, on the other hand, does not require the estimated value. Consequently, it converges at the same rate as in the general regression setting under mild conditions. The pointwise and uniform asymptotic theory for the DSR estimator immediately follows from the theoretical results shown in (ref).
remark[Regularized Estimation] For practical purposes, the estimation of $\hat{Q}$ can be unstable when the sample size is small or when $\hat{Q}$ is close to a singular matrix. One way to stabilize the estimation is to perform $\ell_2$-regularization (ridge estimation) with $\lambda$ as the regularization parameter: \begin{align} \tilde{\beta}=(\hat{Q}+\lambda I_k)^{-1}E_N[p(x_i)u_i]. \end{align} The impact of $\lambda$ on the performance of DSR is investigated in the simulation study in Section (ref).
remark[Model Selection] To implement the estimators $\hat{\beta}$ and $\tilde{\beta}$, we need to choose the series length $k$ and the regularization parameter $\lambda$. One practical way of selection is to find hyperparameters that minimize a criterion computed based on cross-validation (CV). The Mean Squared Error (MSE) is a general criterion, but it is difficult to evaluate MSE directly in the setting ((ref)). However, in special cases where $\zeta_0(x)>0$ for all $x\in\mathcal{X}$, it is possible to calculate a CV criterion that preserves the rank order of MSE. Expanding MSE gives \begin{align*} E[(U-\zeta_0(X)\hat{\theta}(X))^2]=E[U^2]-2E[U\zeta_0(X)\hat{\theta}(X)]+E[\zeta_0(X)^2\hat{\theta}(X)^2], \end{align*} and we can ignore the first term as it does not involve the estimator $\hat{\theta}$. Moreover, if $\zeta_0(x)$ is positive for all $x\in\mathcal{X}$, \begin{align*} E[\zeta_0(X)\hat{\theta}(X)^2]-2E[U\hat{\theta}(X)] \end{align*} is monotone increasing in MSE. Therefore, we can use the sample analogue as the criterion: \begin{align} E_N[t_i\hat{\theta}(x_i)^2]-2E_N[u_i\hat{\theta}(x_i)]. \end{align} CV in the general situation where $\zeta_0$ can take negative values is a subject for future work. This limitation, however, does not detract significantly from the value of this study since researchers often have a priori knowledge that $\zeta_0(x)$ is positive in many practical situations. Some of these situations are explained in Section (ref).

General Framework for Estimation and Inference of CEFR

In this section, we propose a general framework for the CEFR problems by using DSR developed in the previous section as one of the building blocks. The proposed framework is based on the generalized version of the model ((ref)), and therefore it can accommodate a variety of real-world applications.

Setup

In observational studies of complex systems, possibly high-dimensional covariates $X$ may be necessary for conditional independence to hold, which is one of the critical conditions in many causal inference problems. However, researchers are often not interested in estimating treatment effects as a function of all covariates, but they need to focus on the heterogeneous relationships between treatment effects and only a few important factors. In such a case, estimating the target function on the full vector $X$ is unnecessarily hard due to the curse of dimensionality, and directly estimating a function of a subvector can stabilize the estimation. Therefore, suppose that our parameter of interest $\theta_0$ is now a function of $V\in\mathcal{V}$, a subvector of covariates $X$. Also, suppose that $\nu_0$ and $\zeta_0$ in ((ref)) are defined as

align[align omitted — 105 chars of source]

where the random variables $U$ and $T$ depend on a vector of observed random variables $O$ and a set of infinite-dimensional nuisance parameters $\eta_0(x)$. Note that $\eta_0$ is a function of $X$, reflecting that $X$ is indispensable for adjusting for selection biases. We refer to $U$ and $T$ as signals, following semenova2021debiased, and use the notations $U_0:=U(O,\eta_0)$ and $T_0:=T(O,\eta_0)$.

Among many possible choices of the signals $U$ and $T$ that satisfy ((ref)), we focus on the signals with the Neyman orthogonal property, which is defined later. The Neyman orthogonality is the key property to deliver high-quality inference on the target function $\theta_0(v)$ even when modern ML estimators that do not satisfy Donsker conditions are used for the nuisance functions $\eta_0$. The classic semiparametric theories ensure that the target estimator achieves $\sqrt{N}$-consistency by bounding the complexity of the nuisance space, but estimators in such a restricted class are not suitable for fitting high-dimensional and/or highly nonlinear nuisance functions in data-rich environments. On the other hand, modern ML estimators are so flexible to fit any function that there is no need to specify the functional form of the nuisance parameters in advance. ML estimators also perform well in high-dimensional settings by employing regularization to reduce variance at the cost of regularization bias. These properties are especially important in observational studies in which the distribution of an outcome is a complex mixture of treated and non-treated populations, and there are many confounding factors.

Although ML estimators are effective in predicting the values of nuisance functions, their prediction is inherently biased by model selection and regularization. Therefore, the naive plug-in estimator of the target function fails to be $\sqrt{N}$-consistent. To ensure the desirable theoretical properties of the target estimator while using flexible ML estimators for nuisance functions, we need signals that are locally insensitive to the bias of the nuisance estimators. Formally, the Neyman orthogonality is defined in terms of the pathwise (Gateaux) derivative as follows:

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

for all $v\in\mathcal{V}$, where $\partial$ is the partial derivative operator and $s\in[0,1]$ is a constant.

Examples

We describe some empirically relevant examples for the generalized setting. The detailed discussions on conditions for identification and inference of estimands in each example are given in Section (ref).

example[Local Average Treatment Effect] Let $Y_1$ and $Y_0$ be the potential outcomes realized only when an individual is treated and not treated, respectively. Similarly, let $D_1$ and $D_0$ be the potential treatment status realized only when an individual is assigned to a treatment group or not. We also denote a binary treatment assignment as $Z$. The observable is $O=(Y,D,Z,X)$, where $D=ZD_1+(1-Z)D_0$ is a realized treatment status, and $Y=DY_1+(1-D)Y_0$ is a realized outcome. The parameter of interest is LATE, which is defined as a treatment effect measured for the subpopulation of compliers \begin{align*} \theta_0(v)=E[Y_1-Y_0|D_1>D_0,V=v], \end{align*} where compliers are individuals who always follow the given assignment $Z$. LATE is often used when there is self-selection to receive a treatment (often referred to as noncompliance to treatment assignment), and thus the observed covariates $X$ are insufficient to adjust for selection bias in $D$. A standard identification strategy for LATE is using $Z$ as an instrument to $D$. Under several assumptions including conditions necessary for $Z$ to be a valid instrument, LATE is identified as \begin{align*} \theta_0(v)=\frac{E[E[Y|Z=1,X]-E[Y|Z=0,X]|V=v]}{E[E[D|Z=1,X]-E[D|Z=0,X]|V=v]}. \end{align*} Therefore, we can consider LATE estimation as a problem of CEFR by setting $\nu_0(v)=E[\mu_0(1,X)-\mu_0(0,X)|V=v]$ and $\zeta_0(v)=E[\pi_0(1,X)-\pi_0(0,X)|V=v]$, where $\mu_0(z,x)=E[Y|Z=z,X=x]$ and $\pi_0(z,x)=E[D|Z=z,X=x]$.
example[Ratio-Based Treatment Effects] The observable vector is $O=(Y,D,X)$, where $Y$ is an outcome of interest, and $D$ is a binary treatment status. As in the case of LATE, let $Y_1$ and $Y_0$ be the potential outcomes. The parameter of interest is the ratio-based CATE: \begin{align*} \theta_0(v)=\frac{E[Y_1|V=v]}{E[Y_0|V=v]}, \end{align*} where $E[Y_0|V=v]\neq0$ for all $v\in\mathcal{V}$ is necessary for $\theta_0$ to be well-defined. If unconfoundedness $Y_1,Y_0\protect\mathpalette{\protect\independenT}{\perp} D|X$, and other standard assumptions hold, the ratio-based CATE is identified as: \begin{align*} \theta_0(v)=\frac{E[E[Y|D=1,X]|V=v]}{E[E[Y|D=0,X]|V=v]}. \end{align*} Therefore, we can consider the estimation of ratio-based CATE as a problem of CEFR by setting \begin{align*} \nu_0(v)&=E[\mu_0(1,X)|V=v]=E[E[Y|D=1,X]|V=v],\\ \zeta_0(v)&=E[\mu_0(0,X)|V=v]=E[E[Y|D=0,X]|V=v]. \end{align*}
example[Instrumented Difference-in-Differences] Instrumented difference-in-Differences (IDID) is the method that combines the advantages of instrumental variables (IVs) and difference-in-differences Ye2020InstrumentedD,vo2022structural. IDID allows the identification of treatment effects under conditions milder than required by the instrumental methods or difference-in-differences alone. Suppose that we observe a vector of random variables $O=(Y,D,Z,W,X)$, where $Y$ is an outcome of interest, $D$ is a binary treatment status, $Z$ is a binary treatment assignment, and $W$ is a binary time indicator. Let $D_{zw}$ be the potential treatment status that would be observed if $Z=z$ in time $w$, and $Y_{dw}$ be the potential outcome that would be observed if $D=d$ in time $w$. The parameter of interest is CATE \begin{align*} \theta_0(v)=E[Y_1-Y_0|V=v], \end{align*} where we assume $E[Y_1-Y_0|V]=E[Y_{11}-Y_{01}|V]=E[Y_{10}-Y_{00}|V]$. Under some identification assumptions, CATE is identified as: \begin{align*} \theta_0(v)=\frac{E[\mu_0(1,1,X)-\mu_0(0,1,X)-\mu_0(1,0,X)+\mu_0(0,0,X)|V=v]}{E[\pi_0(1,1,X)-\pi_0(0,1,X)-\pi_0(1,0,X)+\pi_0(0,0,X)|V=v]}, \end{align*} where $\mu_0(w,z,x)=E[Y|W=w,Z=z,X=x]$ and $\pi_0(w,z,x)=E[D|W=w,Z=z,X=x]$. Therefore, we can consider the estimation of CATE in IDID as a problem of CEFR by setting \begin{align*} \nu_0(v)&=\sum_{(w,z)\in\{0,1\}^2}(-1)^{w+z}E[\mu_0(w,z,X)|V=v],\\ \zeta_0(v)&=\sum_{(w,z)\in\{0,1\}^2}(-1)^{w+z}E[\pi_0(w,z,X)|V=v]. \end{align*}
example[Treatment Effects in the Data Combination Setting] We extend the data combination setups studied in yamane and shinoda2022estimation. Suppose that the parameter of interest is CATE or LATE, but we cannot observe an outcome $Y$ and a treatment status $D$ simultaneously. Moreover, binary treatment assignment $Z$ is not observed at all. We refer to a dataset that includes $Y$ as the outcome dataset, and a dataset that includes $D$ as the treatment dataset. According to yamane and shinoda2022estimation, if we have two sets of the outcome and treatment datasets with different treatment regimes, we can identify CATE and LATE, where a treatment regime stands for the conditional treatment assignment probability $P(Z=1|X)$. In summary, we have four different datasets in this setup: the outcome dataset with regime 1, outcome dataset with regime 0, treatment dataset with regime 1 and treatment dataset with regime 0. Let $Y_d$ be the potential outcome that would be observed when $D=d$ and $D_z$ be the potential treatment status that would be observed when $Z=z$. We also consider the potential treatment assignment $Z_w$ that would realize only in a dataset with regime $w=0,1$. Suppose that the observable vector is $O=(HY+(1-H)D,W,H,X)$, where $W$ is a binary regime indicator, and $H$ is a binary dataset indicator. Note that we do not have to observe $Z$ in this setting, but we must be sure that $P(Z_1|X=x)\neq P(Z_0|X=x)$. yamane and shinoda2022estimation simplified the setup by assuming that samples in each dataset are completely random draws from the population of interest, formally \begin{align*} Y_1,Y_0,D_1,D_0,Z_1,Z_0,X\mathpalette{\independenT}{\perp} H,W. \end{align*} However, it is not realistic that the four different datasets share the same joint distribution in observational studies. Thus, we relax the above condition to the following conditional independence \begin{align*} Y_1,Y_0,D_1,D_0,Z_1,Z_0\mathpalette{\independenT}{\perp} H,W|X. \end{align*} Under this condition and other corresponding identification assumptions, CATE and LATE are identified in the same form: \begin{align*} \theta_0(v)=\frac{E[\mu_0(1,X)-\mu_0(0,X)|V=v]}{E[\pi_0(1,X)-\pi_0(0,X)|V=v]}, \end{align*} where $\mu_0(w,x)=E[Y|H=1,W=w,X=x]$ and $\pi_0(w,x)=E[D|H=0,W=w,X=x]$. Therefore, we can consider the estimation of CATE and LATE in the data combination setting as a problem of CEFR by setting $\nu_0(v)=E[\mu_0(1,X)-\mu_0(0,X)|V=v]$ and $\zeta_0(v)=E[\pi_0(1,X)-\pi_0(0,X)|V=v]$.

Overall Inference Procedures

We develop a two-stage estimator using the orthogonal signals and DSR proposed in Section (ref). We refer to this two-stage estimator as the Orthogonal Series Ratio (OSR) estimator. The first stage consists of constructing the orthogonal signals by cross-fitting. Cross-fitting is another important technique to eliminate biases in the orthogonal signals constructed from finite samples. The cross-fitting of the orthogonal signals is implemented as follows:

enumerate• Let $\{J_g\}_{g=1}^G$ denote a $G$-fold random partition of the sample indices $[N]:=\{1,2,\ldots,N\}$, where $G$ is the number of partition. Suppose that the sample size of each fold $n:=N/G$ is an integer without loss of generality. For each partition $g\in[G]$, define $J_g^c:=[N]\backslash J_g$. • For each partition $g\in[G]$, construct a set of estimators $\hat{\eta}_g:=\hat{\eta}(O_{i\in J_g^c})$ by using only the samples in $J_g^c$. For any index $i\in J_g$, construct the orthogonal signals $\hat{U}_i:=U(O_{i\in J_g},\hat{\eta}_g)$ and $\hat{T}_i:=T(O_{i\in J_g},\hat{\eta}_g)$.

Cross-fitting uses different samples for estimating the nuisance functions and constructing the orthogonal signals. Such sample-splitting allows the nuisance estimators to be treated as non-random when constructing the orthogonal signals $\hat{U}$ and $\hat{T}$, which helps the debiasing of the target estimator.

In the second stage, the estimated orthogonal signals $\hat{U}$ and $\hat{T}$ are plugged-in to the DSR estimator:

align[align omitted — 59 chars of source]

where we redefine $Q$ and $\hat{Q}$ as $Q=E[pp'T_0]$ and $\hat{Q}=E_N[p_ip_i'\hat{T}_i]$, respectively. The asymptotic covariance matrix of the OSR estimator is

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

where $\varepsilon_U:=U_0-\nu_0(V)$ and $\varepsilon_T:=T_0-\zeta_0(V)$ are the stochastic errors. The sample analogue of the asymptotic variance is

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

where $\hat{\theta}(v)=p(v)'\hat{\beta}$ is the OSR estimator of the target function $\theta_0$.

For statistical inference, denote the standard deviation of the OSR estimator at $v$ and its sample analogue as $\sigma(v)=\sqrt{p(v)'\Omega p(v)}$ and $\hat{\sigma}(v)=\sqrt{p(v)'\hat{\Omega}p(v)}$, respectively. Then, we can write $t$-statistic as

align[align omitted — 105 chars of source]

and the bootstrapped $t$-statistic as

align[align omitted — 120 chars of source]

where $\mathcal{N}_k^b$ is a bootstrap draw from $N(0,I_k)$. We will show that the Gaussian bootstrap is valid for the OSR estimator in the next section. We can calculate the confidence bands for $\theta_0(v)$ as

align[align omitted — 188 chars of source]

where the critical value $c_N(1-\delta)$ is the $(1-\delta)$-quantile of $N(0,1)$ for the pointwise bands, and the $(1-\delta)$-quantile of $\sup_{v\in\mathcal{V}}|\hat{\tau}_N^b(v)|$ for the uniform bands.

Main Theoretical Results

Here, we present the main theoretical results on the asymptotic properties of the proposed OSR estimator. These results heavily rely on the theoretical analyses in belloni2015some and semenova2021debiased.

First, we set up some additional notations. Define a random variable that takes the value of the stochastic errors with the larger absolute value:

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

and the lower and upper bounds on its second moments:

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

We denote the best linear approximation to the target function $\theta_0(v)$ by $\theta_k(v):=p(v)'\beta_k$, where

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

and the approximation error by $r(v):=\theta_0(v)-\theta_k(v)$. We use the same notation $\|\cdot\|$ for the $\ell_2$-norm of a vector and the operator norm of a matrix. The notation $a\lesssim b$ is used when $a\leq cb$ for some positive constant $c$ which does not depend on $N$, and $a\lesssim_P b$ is used when $a=O_P(b)$. $a\land b$ and $a\lor b$ mean $\min\{a,b\}$ and $\max\{a,b\}$, respectively. The scaled and demeaned sample average for some function $f$ is denoted by

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

Pointwise Limit Theory

The following assumptions are the collection of regularity conditions on the covariates distribution, basis functions, error terms, nuisance estimators, and the target function. We use these assumptions to establish the pointwise asymptotic theory for the orthogonal estimator.

assumption[Identification] All eigenvalues of $E[p(V)p(V)']$ are bounded above and away from zero uniformly over $k$.
assumption[Norm of Basis] The sup-norm of the basis functions $\xi_k:=\sup_{v\in\mathcal{V}}\|p(v)\|$ grows sufficiently slow: \begin{align*} \sqrt{\frac{\xi_k^2\log N}{N}}=o(1). \end{align*}
assumption[Approximation Error] There exists a sequence of finite constants $l_m,r_m$ such that the $L^2$ and sup norms of the approximation error are bounded as follows: \begin{align*} \|r\|_{P,2}:=\sqrt{\int r(v)^2dP(v)}\lesssim r_k,\quad \|r\|_{P,\infty}:=\sup_{v\in\mathcal{V}}|r(v)|\lesssim l_kr_k. \end{align*}
assumption[Stochastic Errors] The second moment of the sampling error conditional on $V$ is bounded from above: $\overline{\varepsilon}^2=O(1)$.
remark[Plausibility of the Regularity Conditions] Assumption (ref) through (ref) are the regularity conditions widely used in the series estimation literature. They are plausible enough to hold in many practical situations and for various basis functions. Indeed, the bounds on $\xi_k$, $r_k$ and $l_k$ have been intensively investigated, and the results show that Assumption (ref) and (ref) are not too restrictive.
assumption[Numerator and Denominator Functions] The numerator function $\nu_0(v)$ and denominator function $\zeta_0(v)$ are bounded uniformly over $v\in\mathcal{V}$. Moreover, $\zeta_0(v)\neq0$ for all $v\in\mathcal{V}$.

The uniform boundedness of the functions $\nu_0$ and $\zeta_0$ is anyway included in the low-level conditions stated in Section (ref). Assumption (ref) therefore imposes virtually no extra restriction on these functions.

assumption[Small Bias in Nuisance Estimators] For all $g\in[G]$, the nuisance estimate $\hat{\eta}_g$, obtained by cross-fitting, belongs to a shrinking neighborhood of $\eta_0$, denoted by $\mathcal{S}_N$. Uniformly over $\mathcal{S}_N$, the following mean square convergence holds: \begin{align*} B_N&:=\sqrt{N}\left(\sup_{\eta\in\mathcal{S}_N}\|E[p(V)(U-U_0)]\|\lor\sup_{\eta\in\mathcal{S}_N}\|E[p(V)(T-T_0)]\|\right)=o(1),\\ \Lambda_N&:=\sup_{\eta\in\mathcal{S}_N}E\left[\|p(V)(U-U_0)\|^2\right]^{1/2}\lor\sup_{\eta\in\mathcal{S}_N}E\left[\|p(V)(T-T_0)\|^2\right]^{1/2}=o(1). \end{align*}
remark[Sufficient Conditions for the Small Bias] The low-level sufficient conditions to satisfy Assumption (ref) in the specific examples are presented in Section (ref). We can use, for example, deep neural nets for regression schmidt2020nonparametric,farrell2021deep,kohler2021on and for classification kim2021fast,bos2022convergence, and random forest for regression wager2015adaptive,syrgkanis2020estimation and for classification gao2022towards,peng2022rates.

The following is the result on the pointwise convergence rate and linearization, which extends the results obtained in the standard regression setting belloni2015some,semenova2021debiased.

lemma[Pointwise Convergence Rate and Linearization] Under Assumption (ref)-(ref), the following statements hold: (a) The $\ell_2$-norm of the estimation error is bounded as: \begin{align*} \|\hat{\beta}-\beta_k\|\lesssim_P\sqrt{\frac{k}{N}}+\left(\sqrt{\frac{k}{N}}l_kr_k\land\frac{\xi_kr_k}{\sqrt{N}}\right), \end{align*} which implies the same bound on MSE of the estimate $\hat{\theta}$ against the pseudo-target function $\theta_k$: \begin{align*} E_N\left[\left(\hat{\theta}(v_i)-\theta_k(v_i)\right)^2\right]^{1/2}\lesssim_P\sqrt{\frac{k}{N}}+\left(\sqrt{\frac{k}{N}}l_kr_k\land\frac{\xi_kr_k}{\sqrt{N}}\right). \end{align*} (b) For any $\alpha\in\mathcal{A}^{k-1}:=\{\alpha\in\mathbb{R}^k:\|\alpha\|=1\}$, the estimator $\hat{\beta}$ is approximately linear: \begin{align*} \sqrt{N}\alpha'(\hat{\beta}-\beta_k)=\alpha'Q^{-1}\mathbb{G}_N[p_i(\varepsilon_{Ui}+\theta_{0i}\varepsilon_{Ti})]+R_{N}(\alpha), \end{align*} where the remainder term $R_{N}(\alpha)$ is bounded as: \begin{align*} R_{N}(\alpha)\lesssim_P B_N+\Lambda_N+l_kr_k+\sqrt{\frac{\xi_k^2\log N}{N}}\left(1+\left(l_kr_k\sqrt{k}\land\xi_kr_k\right)\right). \end{align*}

Lemma (ref) states that the OSR converges to the pseudo-target function at the same rate as in the standard regression setting under mild conditions. However, the linearization result is slightly different from one obtained in semenova2021debiased, where the linearization is possible even when the term $p_ir_i$ is included because $E[pr]=0$. In the CEFR problems, we have the term $p_i\zeta_{0i}r_i$ instead of $p_ir_i$, and $E[p\zeta_0r]\neq0$ in general.

The following theorem establishes the pointwise normality of the OSR estimator with additional conditions to satisfy Lindeberg's condition for the central limit theorem.

theorem[Pointwise Normality of the OSR Estimator] Suppose Assumption (ref)-(ref) hold. In addition, suppose (i) $R_N(\alpha)=o(1)$, (ii) $1\lesssim\underline{\varepsilon}^2$ and (iii) $\sup_{v\in\mathcal{V}}E[\varepsilon^21_{|\varepsilon|>M}|V=v]\rightarrow0$ as $M\rightarrow\infty$. Then, for any $\alpha\in\mathcal{A}^{k-1}$, OSR estimator is asymptotically normal: \begin{align*} \lim_{N\rightarrow\infty}\sup_{e\in\mathbb{R}}\left|P\left(\frac{\alpha'(\hat{\beta}-\beta_k)}{\sqrt{\alpha'\Omega\alpha/N}}<e\right)-\Phi(e)\right|=0. \end{align*} Moreover, for any $v_0=v_{0,N}\in\mathcal{V}$, the estimator $\hat{\theta}(v_0)$ against the pseudo-target value $\theta_k(v_0)$ is asymptotically normal: \begin{align*} \lim_{N\rightarrow\infty}\sup_{e\in\mathbb{R}}\left|P\left(\frac{\hat{\theta}(v_0)-\theta_k(v_0)}{\sigma(v_0)/\sqrt{N}}<e\right)-\Phi(e)\right|=0, \end{align*} and if the approximation error is negligible relative to the estimation error, namely $r(v_0)=o(\sigma(v_0)/\sqrt{N})$, then $\hat{\theta}(v_0)$ is also asymptotically normal around the true value $\theta_0(v_0)$: \begin{align*} \lim_{N\rightarrow\infty}\sup_{e\in\mathbb{R}}\left|P\left(\frac{\hat{\theta}(v_0)-\theta_0(v_0)}{\sigma(v_0)/\sqrt{N}}<e\right)-\Phi(e)\right|=0. \end{align*}

Uniform Limit Theory

Stronger conditions than needed for the pointwise results are required to establish the uniform asymptotic theory for the OSR estimator. The following conditions control the behaviour of the stochastic errors, basis functions and nuisance errors more strictly.

assumption[Tail Bounds] There exists a constant $m>2$ such that the upper bound of the $m$-th moment of $|\varepsilon_U|$ and $|\varepsilon_T|$ is bounded conditional on $V$: \begin{align*} \sup_{v\in\mathcal{V}}E[|\varepsilon|^m|V=v]\lesssim1. \end{align*}

Denote by $\alpha(v):=p(v)/\|p(v)\|$ the normalized value of the basis $p(v)$. Define the Lipschitz constant for $\alpha(v)$ as:

align*[align* omitted — 129 chars of source]
assumption[Well-Behaved Basis] Basis functions are well-behaved, namely (i) $(\xi_k^L)^{2m/(m-2)}\allowbreak\log N/N\lesssim1$ and (ii) $\log\xi_k^L\lesssim\log k$ for the same $m$ as in Assumption (ref).
assumption[Condition for Matrix Estimation] Uniformly over $\mathcal{S}_N$, the following convergence holds: \begin{align*} \kappa_N^1&:=\sup_{\eta\in\mathcal{S}_N}E\left[\max_{1\leq i\leq N}|U_i-U_{0i}|\right]\lor\sup_{\eta\in\mathcal{S}_N}E\left[\max_{1\leq i\leq N}|T_i-T_{0i}|\right]=o(1),\\ \kappa_N&:=\sup_{\eta\in\mathcal{S}_N}E\left[\max_{1\leq i\leq N}(U_i-U_{0i})^2\right]^{1/2}\lor\sup_{\eta\in\mathcal{S}_N}E\left[\max_{1\leq i\leq N}(T_i-T_{0i})^2\right]^{1/2}=o(1). \end{align*}

The following lemma is about the uniform convergence rate and linearization of the OSR estimator.

lemma[Uniform Rate and Uniform Linearization] Suppose Assumption (ref)-(ref) hold. Then, the following statements hold. (a) The OSR estimator is approximately linear uniformly over $\mathcal{V}$: \begin{align*} \sqrt{N}\alpha(v)'(\hat{\beta}-\beta_k)=\alpha(v)'Q^{-1}\mathbb{G}_N[p_i(\varepsilon_{Ui}+\theta_{0i}\varepsilon_{Ti})]+R_N(\alpha(v)), \end{align*} where the remainder term $R_N(\alpha(v))$ obeys \begin{align*} \sup_{v\in\mathcal{V}}R_N(\alpha(v))&\lesssim_P B_N+\Lambda_N+l_kr_k\sqrt{\log N}+\sqrt{\frac{\xi_k^2\log N}{N}}\left(N^{1/m}\sqrt{\log N}+\left[l_kr_k\sqrt{k}\land\xi_kr_k\right]\right)=:\overline{R}_N. \end{align*} (b) The OSR estimator $\hat{\theta}$ of the pseudo-target function $\theta_k$ converges uniformly over $\mathcal{V}$ at the following rate: \begin{align*} \sup_{v\in\mathcal{V}}\left|\hat{\theta}(v)-\theta_k(v)\right|\lesssim_P\frac{\xi_k}{\sqrt{N}}\left(\sqrt{\log N}+\overline{R}_N\right). \end{align*}

Likewise in Lemma (ref), we cannot include the term $p_i\zeta_{0i}r_i$ in the linearization result. However, its impact is negligible when the basis is sufficiently rich so that $l_kr_k=o(\sqrt{\log N})$.

The following theorem establishes a strong approximation of the OSR estimator's series process.

theorem[Strong Approximation by a Gaussian Process] Suppose Assumption (ref)-(ref) hold with $m\geq3$, and let $\overline{a}_N$ be a sequence of positive numbers such that $\overline{a}_N^{-1}=o(1)$. In addition, suppose (i) $\overline{R}_N=o(\overline{a}_N^{-1})$, (ii) $1\lesssim\underline{\sigma}^2$ and (iii) $m^4\overline{a}_N^6\xi_k^2(1+l_k^3r_k^3)^2\log^2N/N=o(1)$. Then, for some $\mathcal{N}_k\sim N(0,I_k)$, \begin{align*} \frac{\hat{\theta}(v)-\theta_k(v)}{\sigma(v)/\sqrt{N}}=_d\frac{p(v)'\Omega^{1/2}}{\sigma(v)}\mathcal{N}_k+o_P(\overline{a}_N^{-1})\ in\ \ \ell^\infty(\mathcal{V}). \end{align*} In addition, if $\sqrt{N}\sup_{v\in\mathcal{V}}|r(v)|/\sigma(v)=o(\overline{a}_N^{-1})$, \begin{align*} \frac{\hat{\theta}(v)-\theta_0(v)}{\sigma(v)/\sqrt{N}}=_d\frac{p(v)'\Omega^{1/2}}{\sigma(v)}\mathcal{N}_k+o_P(\overline{a}_N^{-1})\ in\ \ \ell^\infty(\mathcal{V}). \end{align*}

Theorem (ref) derives the convergence rate of the covariance matrix estimator $\hat{\Omega}$.

theorem[Matrices Estimation] Suppose Assumption (ref)-(ref) hold. In addition, suppose (i) $\overline{R}_N\lesssim\sqrt{\log N}$ and (ii) $(N^{1/m}+l_kr_k)(\sqrt{\xi_k^2\log N/N}+\kappa_N^1)=o(1)$. Then, the covariance matrix estimator $\hat{\Omega}$ converges at the following rate: \begin{align*} \|\hat{\Omega}-\Omega\|\lesssim_P\left(N^{1/m}+l_kr_k\right)\left(\sqrt{\frac{\xi_k^2\log N}{N}}+\kappa_N^1\right)+\kappa_N^2=:a_N. \end{align*} Moreover, the following bound holds: \begin{align*} \sup_{v\in\mathcal{V}}\left|\frac{\hat{\sigma}(v)}{\sigma(v)}-1\right|\lesssim_P\|\hat{\Omega}-\Omega\|\lesssim_P a_N. \end{align*}

Theorem (ref) establishes the validity of Gaussian bootstrap.

theorem[Validity of Gaussian Bootstrap] Suppose the assumptions of Theorem (ref) hold with $\overline{a}_N=\log N$ and the assumptions of Theorem (ref) hold with $a_N=O(N^{-c})$ for some $c>0$. In addition, suppose (i) $1\lesssim\underline{\sigma}^2$ and (ii) there exists a sequence $\xi_N'$ obeying $1\lesssim\xi_N'\lesssim\|p(v)\|$ uniformly for all $v\in\mathcal{V}$ so that $\|p(v)-p(v')\|/\xi_N'\leq L_N\|v-v'\|$, where $\log L_N\lesssim\log N$. Let $\mathcal{N}_k^b$ be a bootstrap draw from $N(0,I_k)$ and $P^*$ be a probability conditional on data $\{V_i\}_{i=1}^N$. Then, the following approximation holds uniformly in $\ell^\infty(\mathcal{V})$: \begin{align*} \frac{p(v)'\hat{\Omega}^{1/2}}{\hat{\sigma}(v)}\mathcal{N}_k^b=_d\frac{p(v)'\Omega^{1/2}}{\sigma(v)}\mathcal{N}_k^b+o_{P^*}(\log^{-1}N). \end{align*}

Theorem (ref) is on the validity of the uniform confidence bands and their width.

theorem[Validity of Uniform Confidence Bands] Let Assumption (ref)-(ref) hold with $m\geq4$. In addition, suppose (i) $\overline{R}_N\lesssim\log^{-1/2}N$, (ii) $\xi_k\log^2N/N^{1/2-1/m}=o(1)$, (iii) $1\lesssim\underline{\sigma}^2$, (iv) $\sup_{v\in\mathcal{V}}\allowbreak\sqrt{N}|r(v)|/\|p(v)\|=o(\log^{-1/2}N)$, and (v) $k^4\xi_k^2(1+l_k^3r_k^3)^2\log^5N/N=o(1)$. Then, \begin{align*} P\left(\sup_{v\in\mathcal{V}}|\tau_N(v)|\leq c_N(1-\delta)\right)=1-\delta+o(1) \end{align*} for $\tau_N$ defined in ((ref)). As a consequence, the confidence bands defined in ((ref)) satisfy \begin{align*} P(\theta_0(v)\in[i_N(v),\overline{i}_N(v)]\ \forall v\in\mathcal{V})=1-\delta+o(1). \end{align*} The width of the confidence bands obeys the following rate: \begin{align*} \sup_{v\in\mathcal{V}}\left(2c_N(1-\delta)\hat{\sigma}(v)/\sqrt{N}\right)\lesssim_P\sigma(v)\sqrt{\frac{\log N}{N}}\lesssim\sqrt{\frac{\xi_k^2\log N}{N}}. \end{align*}

Applications

We apply the general theoretical results presented in the previous section to the examples in Section (ref).

Local Average Treatment Effect

Consider the setting of Example (ref), and recall that the parameter of interest is $\theta_0(v)=E[Y_1-Y_0|D_1>D_0,V=v]$. Below, we provide the identification assumptions for LATE, and the orthogonal signals in this setting.

assumption[Identification Assumptions for LATE] \! \begin{enumerate} • (Instrument Unconfoundedness). $Y_1,Y_0,D_1,D_0\protect\mathpalette{\protect\independenT}{\perp} Z|X$. • (Positivity). $0<P(Z=1|X=x)<1$ for all $x\in\mathcal{X}$. • (Instrument Relevance). $P(D_1|V=v)\neq P(D_0|V=v)$ for all $v\in\mathcal{V}$. • (Monotonicity). $P(D_1\geq D_0)=1$. • (Consistency). $D=ZD_1+(1-Z)D_0$ and $Y=DY_1+(1-D)Y_0$. \end{enumerate}

Assumption (ref).1 states that $Z$ is randomly assigned within a subpopulation sharing the same level of the covariates. Assumption (ref).2 restricts the treatment assignment probability from taking extreme values. Assumption (ref).3 states that the treatment assignment has non-zero effects on the actual treatment status. Assumption (ref).4 excludes defiers, those who never follow the given treatment assignment, from our analysis. Assumption (ref).5 relates the potential variables to their realized counterparts.

Consider the following doubly robust signals:

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

where $\rho_0(x)=P(Z=1|X=x)=E[Z|X=x]$ is a propensity score. The following theorem establishes the identification of LATE and the Neyman orthogonality of the signals.

theoremUnder Assumption (ref), the following statements hold. (a) $\theta_0(v)=\nu_0(v)/\zeta_0(v)$, where $\nu_0(v)$ and $\zeta_0(v)$ are defined in Example (ref). (b) $E[U(O,\eta_0)-\nu_0(V)|V=v]=0$ and $E[T(O,\eta_0)-\zeta_0(V)|V=v]=0$ for all $v\in\mathcal{V}$. (c) The moment equations in (b) satisfy the Neyman orthogonality condition: \begin{align*} \partial_s E[U(O,\eta_0+s(\eta-\eta_0))-\nu_0(V)|V=v]|_{s=0}&=0,\\ \partial_s E[T(O,\eta_0+s(\eta-\eta_0))-\zeta_0(V)|V=v]|_{s=0}&=0. \end{align*}
remark[One-Sided Noncompliance] Some experimental designs do not give individuals with $Z=0$ access to the treatment. This setting is called one-sided noncompliance, and formally expressed as $P(D_0=0|X=x)=1$ for all $x\in\mathcal{X}$ Frolich2013-sk,Donald2014-ca,Kennedy2020-wz. Under Assumption (ref) and one-sided noncompliance, LATE is identified as: \begin{align*} \theta_0(v)=\frac{E[E[Y|Z=1,X]-E[Y|Z=0,X]|V=v]}{E[E[D|Z=1,X]|V=v]}. \end{align*} Obviously, $\zeta_0(v)>0$ for $v\in\mathcal{V}$ in this case, and thus CV based on the criterion ((ref)) is possible.

Then, we give a set of sufficient conditions the nuisance estimators must satisfy so that the general results in Section (ref) hold. Given the true nuisance functions $\eta_0=\{\mu_0,\pi_0,\rho_0\}$ and sequences of shrinking neighborhoods $\mathcal{S}_N^\mu$ of $\mu_0$, $\mathcal{S}_N^\pi$ of $\pi_0$, $\mathcal{S}_N^\rho$ of $\rho_0$, define the following rates:

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

where $q\geq2$ or $q=\infty$.

assumption[First-Stage Rate for LATE] Assume that there exists a sequence of numbers $\epsilon_N=o(1)$ and sequences of neighborhoods $\mathcal{S}_N^\mu$ of $\mu_0$, $\mathcal{S}_N^\pi$ of $\pi_0$ and $\mathcal{S}_N^\rho$ of $\rho_0$ such that the first-stage estimate $\{\hat{\mu},\hat{\pi},\hat{\rho}\}$ belongs to the set $\mathcal{S}_N^\mu\times \mathcal{S}_N^\pi\times \mathcal{S}_N^\rho$ with probability at least $1-\epsilon_N$. Assume that mean square rates $\mathbf{m}_{N,2},\mathbf{p}_{N,2},\mathbf{r}_{N,2}$ decay sufficiently fast: \begin{align*} \xi_k(\mathbf{m}_{N,2}\lor\mathbf{p}_{N,2}\lor\mathbf{r}_{N,2})=o(1), \end{align*} and one of two alternative conditions holds. (i) Bounded basis. There exists $C_p<\infty$ so that $\sup_{v\in\mathcal{V}}\allowbreak\|p(v)\|_\infty\leq C_p$, $\sqrt{kN}\mathbf{m}_{N,2}\mathbf{r}_{N,2}=o(1)$ and $\sqrt{kN}\mathbf{p}_{N,2}\mathbf{r}_{N,2}=o(1)$. (ii) Unbounded basis. There exist $\omega,\psi\in[1,\infty]$, $1/\omega+1/\psi=1$ so that $\sqrt{kN}\mathbf{m}_{N,2\omega}\mathbf{r}_{N,2\psi}=o(1)$, and there exist $\omega',\psi'\in[1,\infty]$, $1/\omega'+1/\psi'=1$ so that $\sqrt{kN}\mathbf{p}_{N,2\omega'}\mathbf{r}_{N,2\psi'}=o(1)$. Finally, the functions in $\mathcal{S}_N^\mu$, $\mathcal{S}_N^\pi$ and $\mathcal{S}_N^\rho$ are bounded uniformly over their domain: \begin{align*} \sup_{\mu\in \mathcal{S}_N^\mu}\sup_{z\in\{0,1\}}\sup_{x\in\mathcal{X}}|\mu(z,x)|\lor\sup_{\pi\in \mathcal{S}_N^\pi}\sup_{z\in\{0,1\}}\sup_{x\in\mathcal{X}}|\pi(z,x)|\lor\sup_{\rho\in\mathcal{S}_N^\rho}\sup_{x\in\mathcal{X}}|\rho^{-1}(x)|<\overline{C}<\infty. \end{align*}
corollarySuppose that Assumption (ref) and (ref) hold. Then, the orthogonal signals $U$ and $T$ satisfy Assumption (ref), and consequently, Theorem (ref)-(ref) hold for LATE if the other assumptions stated in Section (ref) are also satisfied.

Ratio-Based Treatment Effects

Consider the setting of Example (ref), and recall that the parameter of interest is $\theta_0(v)=E[Y_1|V=v]/E[Y_0|V=v]$. Below, we provide the identification assumptions for ratio-based CATE, and the orthogonal signals in this setting.

assumption[Identification Assumptions for ratio-based CATE] \! \begin{enumerate} • (Unconfoundedness). $Y_1,Y_0\protect\mathpalette{\protect\independenT}{\perp} D|X$. • (Positivity). $0<P(D=1|X=x)<1$ for all $x\in\mathcal{X}$. • (Non-Zero Outcome). $E[Y_0|V=v]\neq0$ for all $v\in\mathcal{V}$. • (Consistency). $Y=DY_1+(1-D)Y_0$. \end{enumerate}

Assumption (ref).1 suppose there are no unobserved confounders. Assumption (ref).2 restricts the treatment probability from taking extreme values. Assumption (ref).3 is a necessary condition to ensure that ratio-based CATE is well-defined uniformly over $\mathcal{V}$. Assumption (ref).4 relates the potential outcomes to the observed outcome. Note that when we are interested in the odds ratio or hazard ratio, CV based on the criterion ((ref)) is possible because the outcome $Y$ is positive in these cases.

Consider the following doubly robust signals:

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

where $\pi_0(x)=E[D|X=x]$ is a propensity score. The following theorem establishes the identification of ratio-based CATE and the Neyman orthogonality of the signals.

theoremUnder Assumption (ref), the following statements hold. (a) $\theta_0(v)=\nu_0(v)/\zeta_0(v)$, where $\nu_0(v)$ and $\zeta_0(v)$ are defined in Example (ref). (b) $E[U(O,\eta_0)-\nu_0(V)|V=v]=0$ and $E[T(O,\eta_0)-\zeta_0(V)|V=v]=0$ for all $v\in\mathcal{V}$. (c) The moment equations in (b) satisfy the Neyman orthogonality condition: \begin{align*} \partial_s E[U(O,\eta_0+s(\eta-\eta_0))-\nu_0(V)|V=v]|_{s=0}&=0,\\ \partial_s E[T(O,\eta_0+s(\eta-\eta_0))-\zeta_0(V)|V=v]|_{s=0}&=0. \end{align*}

Then, we give a set of sufficient conditions the nuisance estimators must satisfy so that the general results in Section (ref) hold. Given the true nuisance functions $\eta_0=\{\mu_0,\pi_0\}$ and sequences of shrinking neighborhoods $\mathcal{S}_N^\mu$ of $\mu_0$, $\mathcal{S}_N^\pi$ of $\pi_0$, define the following rates:

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

where $q\geq2$ or $q=\infty$.

assumption[First-Stage Rate for Ratio-Based CATE] Assume that there exists a sequence of numbers $\epsilon_N=o(1)$ and sequences of neighborhoods $\mathcal{S}_N^\mu$ of $\mu_0$ and $\mathcal{S}_N^\pi$ of $\pi_0$ such that the first-stage estimate $\{\hat{\mu},\hat{\pi}\}$ belongs to the set $\mathcal{S}_N^\mu\times \mathcal{S}_N^\pi$ with probability at least $1-\epsilon_N$. Assume that mean square rates $\mathbf{m}_{N,2},\mathbf{p}_{N,2}$ decay sufficiently fast: \begin{align*} \xi_k(\mathbf{m}_{N,2}\lor\mathbf{p}_{N,2})=o(1), \end{align*} and one of two alternative conditions holds. (i) Bounded basis. There exists $C_p<\infty$ so that $\sup_{v\in\mathcal{V}}\allowbreak\|p(v)\|_\infty\leq C_p$, $\sqrt{kN}\mathbf{m}_{N,2}\mathbf{p}_{N,2}=o(1)$. (ii) Unbounded basis. There exists $\omega,\psi\in[1,\infty]$, $1/\omega+1/\psi=1$ so that $\sqrt{kN}\mathbf{m}_{N,2\omega}\mathbf{p}_{N,2\psi}=o(1)$. Finally, the functions in $\mathcal{S}_N^\mu$ and $\mathcal{S}_N^\pi$ are bounded uniformly over their domain: \begin{align*} \sup_{\mu\in \mathcal{S}_N^\mu}\sup_{d\in\{0,1\}}\sup_{x\in\mathcal{X}}|\mu(d,x)|\lor\sup_{\pi\in \mathcal{S}_N^\pi}\sup_{x\in\mathcal{X}}|\pi(x)^{-1}|<\overline{C}<\infty. \end{align*}
corollarySuppose that Assumption (ref) and (ref) hold. Then, the orthogonal signals $U$ and $T$ satisfy Assumption (ref), and consequently, Theorem (ref)-(ref) hold for ratio-based CATE if the other assumptions stated in Section (ref) are also satisfied.

Instrumented Difference-in-Differences

Consider the setting of Example (ref), and recall that the parameter of interest is $\theta_0(v)=E[Y_1-Y_0|V=v]$. Below, we provide the identification assumptions for CATE in the IDID setting, and the orthogonal signals in this setting.

assumption[Identification Assumptions for IDID] \! \begin{enumerate} • (Consistency). $D=D_{zw}$ if $Z=z$ and $W=w$. $Y=Y_{dw}$ if $D=d$ and $W=w$. • (Positivity). $0<P(Z=z,W=w|X=x)<1$ for all $z,w\in\{0,1\}$ and $x\in\mathcal{X}$. • (Random Sampling). $Y_{dw},D_{zw}\protect\mathpalette{\protect\independenT}{\perp} W|Z,X$ for $d,z,w\in\{0,1\}$. • (Trend Relevance). $E[D_{11}-D_{10}|X]\neq E[D_{01}-D_{00}|X]$. • (Trend Unconfoundedness). $D_{zw},Y_{01}-Y_{00},Y_{1w}-Y_{0w}\protect\mathpalette{\protect\independenT}{\perp} Z|X$ for $z,w\in\{0,1\}$. • (No Unmeasured Common Effect Modifier). $Cov(D_{1w}-D_{0w},Y_{1w}-Y_{0w}|X)=0$ for $w\in\{0,1\}$. • (Stable Treatment Effect Over Time). $E[Y_1-Y_0|X]:=E[Y_{11}-Y_{01}|X]=E[Y_{10}-Y_{00}|X]$. \end{enumerate}

Assumption (ref).1 relates the potential variables to their realized counterparts. Assumption (ref).2 restricts the propensity score from taking extreme values. Assumption (ref).3 states that the distributions of the potential variables remain the same over time when conditioned on $Z$ and $X$. Assumption (ref).4, 5 and 6 are weaker than the usual IV assumptions, where $Z$ is correlated with $D$ but independent of every potential variable. Instead, IDID only assumes $Z$ is a valid IV for the difference of the potential variables. Assumption (ref) states that the magnitude of a treatment effect does not change over time.

Consider the following signals

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

where $\rho_0(w,z,x)=P(W=w,Z=z|X=x)$ and $1_A$ is an indicator function that takes 1 if $A$ is true. Note that estimating $\rho$ can be done by constructing a four-class classifier and then obtaining posterior probabilities. The following theorem establishes the identification of CATE in IDID and the Neyman orthogonality of the signals.

theoremUnder Assumption (ref), the following statements hold. (a) $\theta_0(v)=\nu_0(v)/\zeta_0(v)$, where $\nu_0(v)$ and $\zeta_0(v)$ are defined in Example (ref). (b) $E[U(O,\eta_0)-\nu_0(V)|V=v]=0$ and $E[T(O,\eta_0)-\zeta_0(V)|V=v]=0$ for all $v\in\mathcal{V}$. (c) The moment equations in (b) satisfy the Neyman orthogonality condition: \begin{align*} \partial_s E[U(O,\eta_0+s(\eta-\eta_0))-\nu_0(V)|V=v]|_{s=0}&=0,\\ \partial_s E[T(O,\eta_0+s(\eta-\eta_0))-\zeta_0(V)|V=v]|_{s=0}&=0. \end{align*}

Then, we give a set of sufficient conditions the nuisance estimators must satisfy so that the general results in Section (ref) hold. Given the true nuisance functions $\eta_0=\{\mu_0,\pi_0,\rho_0\}$ and sequences of shrinking neighborhoods $\mathcal{S}_N^\mu$ of $\mu_0$, $\mathcal{S}_N^\pi$ of $\pi_0$, $\mathcal{S}_N^\rho$ of $\rho_0$, define the following rates:

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

where $q\geq2$ or $q=\infty$.

assumption[First-Stage Rate for IDID] Assume that there exists a sequence of numbers $\epsilon_N=o(1)$ and sequences of neighborhoods $\mathcal{S}_N^\mu$ of $\mu_0$, $\mathcal{S}_N^\pi$ of $\pi_0$ and $\mathcal{S}_N^\rho$ of $\rho_0$ such that the first-stage estimate $\{\hat{\mu},\hat{\pi},\hat{\rho}\}$ belongs to the set $\mathcal{S}_N^\mu\times \mathcal{S}_N^\pi\times \mathcal{S}_N^\rho$ with probability at least $1-\epsilon_N$. Assume that mean square rates $\mathbf{m}_{N,2},\mathbf{p}_{N,2},\mathbf{r}_{N,2}$ decay sufficiently fast: \begin{align*} \xi_k(\mathbf{m}_{N,2}\lor\mathbf{p}_{N,2}\lor\mathbf{r}_{N,2})=o(1), \end{align*} and one of two alternative conditions holds. (i) Bounded basis. There exists $C_p<\infty$ so that $\sup_{v\in\mathcal{V}}\allowbreak\|p(v)\|_\infty\leq C_p$, $\sqrt{kN}\mathbf{m}_{N,2}\mathbf{r}_{N,2}=o(1)$ and $\sqrt{kN}\mathbf{p}_{N,2}\mathbf{r}_{N,2}=o(1)$. (ii) Unbounded basis. There exist $\omega,\psi\in[1,\infty]$, $1/\omega+1/\psi=1$ so that $\sqrt{kN}\mathbf{m}_{N,2\omega}\mathbf{r}_{N,2\psi}=o(1)$, and there exist $\omega',\psi'\in[1,\infty]$, $1/\omega'+1/\psi'=1$ so that $\sqrt{kN}\mathbf{p}_{N,2\omega'}\mathbf{r}_{N,2\psi'}=o(1)$. Finally, the functions in $\mathcal{S}_N^\mu$, $\mathcal{S}_N^\pi$ and $\mathcal{S}_N^\rho$ are bounded uniformly over their domain: \begin{align*} \sup_{\mu\in \mathcal{S}_N^\mu}\sup_{(w,z)\in\{0,1\}^2}\sup_{x\in\mathcal{X}}|\mu(w,z,x)|&\lor\sup_{\pi\in \mathcal{S}_N^\pi}\sup_{(w,z)\in\{0,1\}^2}\sup_{x\in\mathcal{X}}|\pi(w,z,x)|\\ &\qquad\lor\sup_{\rho\in \mathcal{S}_N^\rho}\sup_{(w,z)\in\{0,1\}^2}\sup_{x\in\mathcal{X}}|\rho^{-1}(w,z,x)|<\overline{C}<\infty. \end{align*}
corollarySuppose that Assumption (ref) and (ref) hold. Then, the orthogonal signals $U$ and $T$ satisfy Assumption (ref), and consequently, Theorem (ref)-(ref) hold for CATE in IDID if the other assumptions stated in Section (ref) are also satisfied.

Treatment Effects in Data Combination Setting

Consider the setting of Example (ref), and recall that the parameter of interest is CATE $\theta_0(v)=E[Y_1-Y_0|V=v]$ or LATE $\theta_0(v)=E[Y_1-Y_0|D_1>D_0,V=v]$. Below, we provide the identification assumptions for CATE and LATE in the data combination setting, and the orthogonal signals in this setting.

assumption[Identification Assumptions for the Data Combination Setting] \! \begin{enumerate} • (Random Sampling). $Y_1,Y_0,D_1,D_0,Z_1,Z_0\protect\mathpalette{\protect\independenT}{\perp} H,W|X$. • (Instrument Unconfoundedness). $Y_1,Y_0,D_1,D_0\protect\mathpalette{\protect\independenT}{\perp} Z_1,Z_0|X$. • (Positivity). $0<P(H=h,W=w|X=x)<1$ for $h,w=0,1$ and all $x\in\mathcal{X}$. • (Different Treatment Regimes and Instrument Relevance). $P(Z_1|V=v)\neq P(Z_0|V=v)$ and $P(D_1|V=v)\neq P(D_0|V=v)$ for all $v\in\mathcal{V}$. • (Consistency). $Z=WZ_1+(1-W)Z_0$, $D=ZD_1+(1-Z)D_0$ and $Y=DY_1+(1-D)Y_0$. \end{enumerate}

Assumption (ref).1 states that $H$ and $W$ are randomly assigned within the subpopulation sharing the same level of covariates. Likewise, Assumption (ref).2 states that $Z$ is randomly assigned within strata defined by $X$. Assumption (ref).3 can be automatically satisfied as long as we have four different datasets. Assumption (ref).4 is the key assumption in this setting, which states that the two treatment regimes are different, and the treatment assignment has some impact on the individual's decision to receive a treatment or not. Assumption (ref).5 relates the potential variables to their realized counterparts. We need $P(D_1\geq D_0|V=v)=1$ for $v\in\mathcal{V}$ when the parameter of interest is LATE, and $P(D_1>D_0|V=v)=1$ for $v\in\mathcal{V}$ when the parameter of interest is CATE.

remark[Facilitating Data Collection] As pointed out in shinoda2022estimation, we do not need a positivity condition on $Z_1$ and $Z_0$ as long as Assumption (ref).4 is satisfied. We can use a dataset with $P(Z_0=1|V=v)=0$ for all $v\in\mathcal{V}$ if $P(Z_1=1|V=v)\neq0$ for all $v\in\mathcal{V}$, which suggests the use of datasets collected from individuals without any intervention. Thus, although we need two different treatment regimes in this setting, a single intervention is sufficient in practice. Datasets without any intervention are available, for example, as government statistics at no cost. Moreover, we can regard this problem setting as the repeated cross-sectional design, where $W=0,1$ represents the time point before and after the intervention is carried out, respectively. In this sense, the structure of this setting is similar to the difference-in-differences. Using a dataset with no intervention also benefits the model selection in CATE estimation and LATE estimation under one-sided noncompliance since CV based on ((ref)) becomes valid. We have that \begin{align*} \zeta_0(v)=E[Z_1D_1|V=v]>0, \end{align*} by $P(Z_0=1|V=v)=0$, $P(D_0=0|V=v)=1$ and Assumption (ref).

Consider the following signals

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

where $\rho_0(h,w,x)=P(H=h,W=w|X=x)$. The same comment for $\rho_0$ in Example (ref) also applies here. The following theorem establishes the identification of CATE and LATE in the data combination setting and the Neyman orthogonality of the signals.

theoremSuppose Assumption (ref) holds. Then, the following statements hold for LATE if $P(D_1\geq D_0|V=v)=1$ holds for all $v\in\mathcal{V}$. The same statements hold for CATE if $P(D_1>D_0|V=v)=1$ holds for all $v\in\mathcal{V}$. (a) $\theta_0(v)=\nu_0(v)/\zeta_0(v)$, where $\nu_0(v)$ and $\zeta_0(v)$ are defined in Example (ref). (b) $E[U(O,\eta_0)-\nu_0(V)|V=v]=0$ and $E[T(O,\eta_0)-\zeta_0(V)|V=v]=0$ for all $v\in\mathcal{V}$. (c) The moment equations in (b) satisfy the Neyman orthogonality condition: \begin{align*} \partial_s E[U(O,\eta_0+s(\eta-\eta_0))-\nu_0(V)|V=v]|_{s=0}&=0,\\ \partial_s E[T(O,\eta_0+s(\eta-\eta_0))-\zeta_0(V)|V=v]|_{s=0}&=0. \end{align*}

Then, we give a set of sufficient conditions the nuisance estimators must satisfy so that the general results in Section (ref) hold. Given the true nuisance functions $\eta_0=\{\mu_0,\pi_0,\rho_0\}$ and sequences of shrinking neighborhoods $\mathcal{S}_N^\mu$ of $\mu_0$, $\mathcal{S}_N^\pi$ of $\pi_0$, $\mathcal{S}_N^\rho$ of $\rho_0$, define the following rates:

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

where $q\geq2$ or $q=\infty$.

assumption[First-Stage Rate for Data Combination Settings] Assume that there exists a sequence of numbers $\epsilon_N=o(1)$ and sequences of neighborhoods $\mathcal{S}_N^\mu$ of $\mu_0$, $\mathcal{S}_N^\pi$ of $\pi_0$ and $\mathcal{S}_N^\rho$ of $\rho_0$ such that the first-stage estimate $\{\hat{\mu},\hat{\pi},\hat{\rho}\}$ belongs to the set $\mathcal{S}_N^\mu\times \mathcal{S}_N^\pi\times \mathcal{S}_N^\rho$ with probability at least $1-\epsilon_N$. Assume that mean square rates $\mathbf{m}_{N,2},\mathbf{p}_{N,2},\mathbf{r}_{N,2}$ decay sufficiently fast: \begin{align*} \xi_k(\mathbf{m}_{N,2}\lor\mathbf{p}_{N,2}\lor\mathbf{r}_{N,2})=o(1), \end{align*} and one of two alternative conditions holds. (i) Bounded basis. There exists $C_p<\infty$ so that $\sup_{v\in\mathcal{V}}\allowbreak\|p(v)\|_\infty\leq C_p$, $\sqrt{kN}\mathbf{m}_{N,2}\mathbf{r}_{N,2}=o(1)$ and $\sqrt{kN}\mathbf{p}_{N,2}\mathbf{r}_{N,2}=o(1)$. (ii) Unbounded basis. There exist $\omega,\psi\in[1,\infty]$, $1/\omega+1/\psi=1$ so that $\sqrt{kN}\mathbf{m}_{N,2\omega}\mathbf{r}_{N,2\psi}=o(1)$, and there exist $\omega',\psi'\in[1,\infty]$, $1/\omega'+1/\psi'=1$ so that $\sqrt{kN}\mathbf{p}_{N,2\omega'}\mathbf{r}_{N,2\psi'}=o(1)$. Finally, the functions in $\mathcal{S}_N^\mu$, $\mathcal{S}_N^\pi$ and $\mathcal{S}_N^\rho$ are bounded uniformly over their domain: \begin{align*} \sup_{\mu\in \mathcal{S}_N^\mu}\sup_{w\in\{0,1\}}\sup_{x\in\mathcal{X}}|\mu(w,x)|&\lor\sup_{\pi\in \mathcal{S}_N^\pi}\sup_{w\in\{0,1\}}\sup_{x\in\mathcal{X}}|\pi(w,x)|\\ &\qquad\lor\sup_{\rho\in \mathcal{S}_N^\rho}\sup_{(h,w)\in\{0,1\}^2}\sup_{x\in\mathcal{X}}|\rho^{-1}(h,w,x)|<\overline{C}<\infty. \end{align*}
corollarySuppose that Assumption (ref) and (ref) hold in addition to the assumptions in Theorem (ref). Then, the orthogonal signals $U$ and $T$ satisfy Assumption (ref), and consequently, Theorem (ref)-(ref) hold for CATE and LATE in the data combination setting if the other assumptions stated in Section (ref) are also satisfied.

Simulations

In this section, we conduct numerical simulations to evaluate the finite-sample performance of the proposed method. We first compare DSR developed in Section (ref) to the existing methods, and then illustrate the performance of OSR and its uniform confidence band.

Direct Series Ratio Estimator

Setting. In this simulation study, we focus on CATE estimation by data combination explained in Example (ref). We generate random samples of $O=(HY+(1-H)D,W,H,X)$ with a sample size $N=500,1000,2000$ using the following two data generating processes (DGPs):

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

where $X_1,X_2,\epsilon$ are mutually independent random variables drawn from $N(0,1)$, and $\varsigma(x)=(1+e^{-x})^{-1}$ is the logistic function. Note that values of $H$ and $W$ are determined completely at random independent of $X$ so that DSR is applicable, which is the original setting considered in yamane. Also, we consider the case where no intervention takes place in regime 0 ($P(D_0=1|X)=0$) since it enables the CV method in Remark (ref) by ensuring the denominator is strictly positive. See Remark (ref) for this point. The number of replication is set $1000$.

We consider the following candidate basis vectors:

gather*[gather* omitted — 146 chars of source]

and regularization parameters $\lambda\in\{0.001,0.01,0.1,1\}$. These hyperparameters are selected based on 5-fold CV in each replication using the criterion ((ref)). For comparison with DSR, we consider a naive separate estimation (SEP), the Direct Least Squares (DLS) proposed in yamane and the Directly Weighted Least Squares (DWLS) proposed in shinoda2022estimation. The estimation of $\pi_0$, when necessary, is implemented by the $\ell_2$-regularized logistic regression with a regularization parameter $\lambda$.

table*[table* omitted — 2,128 chars of source]
table*[table* omitted — 795 chars of source]
table*[table* omitted — 795 chars of source]
table[table omitted — 383 chars of source]

\noindentResults. Table (ref) summarises the hyperparameters most frequently selected by 5-fold CV. SEP1 and SEP2 in the table represent the estimation of the numerator and denominator for the SEP estimator, respectively, while DLS1 and DLS2 represent the estimation of CATE and the auxiliary function, respectively. It can be seen that CV for DSR is working well as a smaller $\lambda$ is chosen as the sample size grows in DGP-L, and the optimal basis is selected in DGP-Q. However, for other estimators, CV sometimes fails to select the small regularization and optimal basis even with the large sample size.

Table (ref) and (ref) are the simulation results for DGP-L and DGP-Q, respectively. Bias and SD in the tables represent the bias and standard deviation of the estimates at $(X_1,X_2)=(1,1)$, respectively, and MSE is calculated on the test samples. In most cases, DSR outperforms the other estimators, while it has a slightly larger bias than DWLS in DGP-Q. However, DSR has a significantly smaller MSE than DWLS as the sample size grows, which implies that the former is more efficient. DSR is also found to have an advantage over other estimators in terms of computational efficiency. As shown in Table (ref), DSR requires the shortest computation time for estimation (without CV), reflecting its simple estimation procedures. Moreover, the computational advantage of DSR becomes even clearer by taking CV into account. For example, since there are 3 possible basis vectors and 4 possible regularization parameters for each function in this simulation, we must repeat CV 24 times for SEP and DWLS and 144 times for DLS, while DSR requires only 12 times as it has no nuisance estimation.

Then, we conduct the sensitivity analysis to evaluate the impact of the hyperparameters $k,\lambda$ on the performance of the estimators. The detailed results for all estimators are summarised in Table (ref) and (ref) in Section (ref) of Appendix. Figure (ref) and (ref) illustrate the change in MSE of DSR with different hyperparameter combinations. It can be seen that smaller $\lambda$ gives smaller MSE as the number of samples increases in both DGPs. However, in DGP-L, MSE changes significantly with the choice of $\lambda$ as the sample size grows, whereas in DGP-Q, MSE does not respond to $\lambda$ to the same extent at a large sample size. Therefore, when the number of samples is more than 1000 in DGP-L, MSE can be small depending on the choice of $\lambda$ even if the model is not optimal ($k=3$), but in DGP-Q, if the model is too simple ($k=3$) or too complex ($k=10$), MSE is considerably larger and the importance of the choice of $k$ is relatively high. Also, by comparing the results of the sensitivity analysis and Table (ref), we can see that the CV method for DSR successfully selected the optimal hyperparameters in all cases except when $N=500$ in DGP-Q.

figure*[figure* omitted — 581 chars of source]
figure*[figure* omitted — 577 chars of source]

Orthogonal Series Ratio Estimator

Setting. As in the previous simulation, we consider CATE estimation by data combination, but now $H$ and $W$ depend on covariates. Therefore, simply applying DSR must result in biased estimation. We generate random samples of $O=(HY+(1-H)D,W,H,X)$ with a sample size $N=1000,2000,3000$ from the following DGP:

gather*[gather* omitted — 220 chars of source]

where $X=(X_1,\ldots,X_5)'$ is a five-dimensional covariate vector with all elements having zero mean, and $\gamma$ is a five-dimensional vector with one in all elements. The covariance matrix of $X$ takes one for diagonal elements, and the absolute value of non-diagonal elements is randomly chosen from $[0.1,0.3]$ except that $X_1$ is independent of all the other covariates. The number of replication is set $1000$.

The estimand is CATE as a function of only the first covariate: $\theta_0(v)=E[Y_1-Y_0|X_1=v]=0.4v$. We use the polynomial basis up to the third order to construct OSR, and the order is selected based on 5-fold CV in each replication. ML estimators used for the nuisance estimation are random forest (RF), gradient boosting trees (GBT) and multi-layer perceptron (MLP). ML estimators are implemented using scikit-learn 1.0.2, and we use the default value for all options and hyperparameters. We use 5-fold cross-fitting to construct the orthogonal signals $\hat{U}$ and $\hat{T}$. Unlike the previous one, regularization is not employed in this simulation.

table[table omitted — 1,179 chars of source]
table[table omitted — 1,191 chars of source]
table[table omitted — 1,208 chars of source]

\noindentResults. Table (ref), (ref) and (ref) present the simulation results when using RF, GBT and MLP for the nuisance estimation, respectively. Bias in the tables denotes the estimation bias evaluated at $v=1$, Width is the largest width of the 95% uniform confidence band, and CVR is the empirical coverage of the 95% uniform confidence band, namely, the proportion of the times out of 1000 replications that the true target function $\theta_0(v)=0.4v$ is included in the estimated confidence band. In addition to mean and standard deviation, we report the $q$-quantiles of MSE, Bias and Width for $q=0.2,0.4,0.6,0.8$ because OSR produces rare but extremely inaccurate estimates. This instability may be due to the structure of the orthogonal signals, where the inverse of the estimated probability is included, and it has been pointed out in the literature singh2019automatic,chernozhukov2022automatic,chernozhukov2022riesz. Further discussion on this point can be found in Section (ref).

The results diverge for the different ML methods when the sample size is small, but it seems that the methods for nuisance estimates have less impact on the performance of OSR as the sample size grows. The mean of MSE and the width of the confidence band get smaller as $N$ gets larger for all ML methods. Although the mean of bias remains almost the same across sample sizes, the standard deviation decreases, which also indicates that an increase in sample size stabilises the estimation. The empirical coverage is reasonably close to the nominal rate of 95% for all the cases with RF and when GBT is used with $N=1000,2000$. However, when using GBT with $N=3000$ and MLP with all the sample sizes, the empirical coverage deviates from the nominal coverage, possibly reflecting the slightly large bias and small width in these cases. The large bias in GBT and MLP may be due to the fixed hyperparameters. Although we used fixed hyperparameters to reduce the computational burden in this simulation, we could select hyperparameters based on CV in practice to lower the bias and obtain the confidence band with the correct coverage.

Empirical Example

In this section, we apply OSR to estimate a causal effect of participation in 401(k) on household assets.

\noindentSetting. In the US, 401(k) is an employer-sponsored personal pension program first implemented in 1978. It is tax-deferred to encourage household savings for their retirement. Data from the US Census Bureau's 1991 Survey of Income and Program Participation (SIPP) has been used in poterba1994401,poterba1995401 and many subsequent studies to examine the effect of 401(k) participation on household savings. The key technical challenge in estimating the causal effect of 401(k) participation is there are not enough covariates available in the SIPP data to explain the self-selected participation among those who are eligible to participate in 401(k). poterba1994401,poterba1995401 argue that eligibility for the 401(k) program can be regarded as exogenous after conditioning on some important variables because whether an employer offered 401(k) would not affect people's job selection at least at the time the program just started, but they would instead make a decision based on other aspects of the job such as salary. Adopting this argument, we can estimate LATE of 401(k) participation in household savings with 401(k) eligibility as IV and other variables related to job choice to control selection bias.

In this empirical example, we use the data analyzed in chernozhukov2004effects and chernozhukov2018, consisting of samples of 9915 households with the reference person of 25-64 years old, and at least one member is employed but no one is self-employed. We use net financial assets ---defined as the sum of IRA (Individual Retirement Account) balances, 401(k) balances, checking accounts, US saving bonds, other interest-earning accounts in financial institutions, other interest-earning assets, stocks, and mutual funds minus non-mortgage debt--- as the outcome $Y$, a binary indicator for 401(k) eligibility as IV $Z$, and a binary indicator for 401(k) participation as the treatment $D$. The covariate vector $X$ used in this analysis includes age, income, family size, years of education, marital status, two-earner status, defined benefit pension status, IRA participation status, and home ownership status.

We conduct analyses based on the usual one-sample LATE estimation as in Example (ref) and two-sample LATE estimation explained in Section (ref). The parameter of interest is LATE as a function of income. For two-sample LATE estimation, we generate a dataset indicator $H$ such that $P(H=1|X=x)=\varsigma(0.1\gamma'\tilde{x})$, where $\tilde{x}$ is a vector of the covariates scaled so that the values fall within $[0,1]$. We use the polynomial basis and the order is selected based on CV from $k=1,2,3$. We use a relatively large number of partitions $G=20$ to mitigate the impact of random sample-splitting on the performance of OSR. GBT is used for nuisance estimation.

figure*[figure* omitted — 518 chars of source]

\noindentResults. Figure (ref)(a) and (b) illustrate the estimated LATE function of income and its 95% uniform confidence band constructed by one-sample estimation and two-sample estimation, respectively. As can be seen, $k=1$ is selected in both one-sample and two-sample estimations. The estimated LATE is linearly increasing in household income and the slope is approximately 0.36 in one-sample estimation and 0.45 in two-sample estimation. Furthermore, the point estimate of LATE for households with annual income \$50000 is \$16225 in one-sample estimation and \$17141 in two-sample estimation, which are consistent with the analysis in ogburn2015 whose estimate is \$14910. Statistically significant positive LATE is indicated for households with annual income \$24000-\$68000 in one-sample estimation, while LATE is significantly positive for households with income \$26000-61000 in two-sample estimation, reflecting the wider confidence band in two-sample estimation.

Discussions

This section discusses the limitation and future direction of the present study. The first topic is model selection in the proposed framework. As explained in Remark (ref), we can perform model selection based on CV using the criterion ((ref)) only when $\zeta_0$ is strictly positive. We explained the several examples where $\zeta_0$ is necessarily positive, and it is shown in the simulation study in Section (ref) that CV using the criterion ((ref)) works well. However, there are also situations where $\zeta_0$ can take both positive and negative values, such as LATE estimation and IDID. Therefore, a model selection method for the general situation is key to increasing the practicality of the proposed framework. Despite its practical importance, little attention has been paid to model selection in the treatment effects estimation schuler2018comparison,caron2020estimating. To the best of our knowledge, there exist only a few attempts in the literature to develop a flexible method for selecting the treatment effect model brookhart2006semiparametric,rolling2014model,saito2020. Although we may be able to extend the ideas of these previous studies for the CEFR problems, further research on model selection is essential to enhance the feasibility of causal inference methods.

One of the drawbacks of the proposed framework is the large variability found in the simulation of Section (ref). It may be due to the structure of the orthogonal signals, in which the inverse of the estimated propensity score is used. Inverse probability weighting (IPW) is known to suffer from unstable estimates especially when the propensity score is close to zero wooldridge2002,Wooldridge2007-vn,robins2007comment,Seaman2013-mw. This problem is especially acute in the data combination settings including two-sample estimation of LATE and IDID, where we have to perform four-class or eight-class classification to estimate propensity scores. Although we can increase stability by trimming small probabilities, determining the optimal threshold is nontrivial lee2011, and trimming can cause additional bias. Recently developed automatic debiased machine learning (Auto-DML) chernozhukov2022automatic can be an effective solution to the problem because it avoids the estimation of propensity scores. Auto-DML directly estimates the Riesz representer of the orthogonal signals rather than constructing it with the inverse of the estimated propensity score. A much smaller variance of Auto-DML compared to the original DML has been empirically verified in numerical experiments singh2019automatic,chernozhukov2022riesz. Thus, extending the procedures and theory of the proposed framework to accommodate signals obtained by Auto-DML is a promising future direction.

The present study proposed a general and flexible framework for the CEFR problems, but more efficient estimation and inference may be possible in some specific settings. For example, the orthogonal moment condition for LATE using the interaction term of $Y$ and $D$ has been proposed in singh2019automatic, while OSR uses $Y$ and $D$ only separately. Comparison of the efficiency of the method in singh2019automatic and OSR is beyond the scope of this study, but intuitively, leveraging information expressed in the form of interaction of $Y$ and $D$ can improve efficiency. However, the contribution of this study for offering the flexible inference framework in the data combination settings is significant, as the method in singh2019automatic is not applicable to situations where $Y$ and $D$ are separately observed.