EconBase
← Back to paper

Gradient Wild Bootstrap for Instrumental Variable Quantile Regressions with Weak and Few Clusters

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.

128,288 characters · 19 sections · 143 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.

Gradient Wild Bootstrap for Instrumental Variable Quantile Regressions with Weak and Few Clusters

abstractWe study the gradient wild bootstrap-based inference for instrumental variable quantile regressions in the framework of a small number of large clusters in which the number of clusters is viewed as fixed, and the number of observations for each cluster diverges to infinity. For the Wald inference, we show that our wild bootstrap Wald test, with or without studentization using the cluster-robust covariance estimator (CRVE), controls size asymptotically up to a small error as long as the parameter of endogenous variable is strongly identified in at least one of the clusters. We further show that the wild bootstrap Wald test with CRVE studentization is more powerful for distant local alternatives than that without. Last, we develop a wild bootstrap Anderson-Rubin (AR) test for the weak-identification-robust inference. We show it controls size asymptotically up to a small error, even under weak or partial identification for all clusters. We illustrate the good finite-sample performance of the new inference methods using simulations and provide an empirical application to a well-known dataset about US local labor markets.\\ Keywords: Gradient Wild Bootstrap, Weak Instruments, Clustered Data, Randomization Test, Instrumental Variable Quantile Regression. JEL codes: C12, C26, C31

{18pt} {10pt} \belowdisplayskip\abovedisplayskip {5pt} \abovedisplayshortskip \belowdisplayshortskip {8pt} \belowdisplayskip\abovedisplayskip {4pt} \linespread{1.3}

Introduction

The instrumental variable (IV) regression is one of the five most widely used methods for causal inference, as highlighted by Angrist-Pischke(2008), and it is often employed in analyses involving clustered data. For instance, young2022consistency examines 1,359 IV regressions across 31 papers published by the American Economic Association (AEA), with 24 of these papers accounting for the clustering of observations. In the context of quantile regression models, where endogeneity may be present, Chernozhukov-Hansen(2004), Chernozhukov-Hansen(2005), Chernozhukov-Hansen(2006), Chernozhukov-Hansen(2008a) (hereafter referred to as CH) developed an instrumental variables quantile regression (IVQR) method. This approach offers a general IV procedure to address the endogeneity of regressors in quantile regressions, and it has been widely adopted by empirical researchers to capture the distributional effects of endogenous variables.

However, three difficulties arise when running IVQR with clustered data. First, the number of clusters is small in many empirical applications with IVs. For instance, Acemoglu2011 cluster the standard errors at the country/polity level, resulting in 12-19 clusters, Glitz2020 cluster at the sectoral level with 16 sectors, and Rogall2021 clusters at the province (district) level with 11 provinces (30 districts), respectively. ADH2013 study the effects of Chinese imports on local labor markets in the US by clustering at the state level. However, if we focus on the estimation and inference for the effects on specific regions such as the South region designated by the US Census Bureau, there are only 16 states. Furthermore, Bester-Conley-Hansen(2011) and L22 partition spatial and network data into clusters, respectively. Both papers consider the asymptotic setting in which the number of clusters is small and, thus, treated as fixed. When the number of clusters is small, conventional cluster-robust inference procedures may be unreliable for IVQR.

Second, in many applications, the strength of IVs may be relatively heterogeneous across clusters, with a few clusters providing the main identification power. For instance, Figure (ref) reports the estimated first-stage coefficients for each cluster (state) from the South region in ADH2013's (ADH2013) dataset, which suggests that there exists substantial variation in the IV strength among states. Specifically, the first-stage coefficients of some states are relatively large compared with the rest in the region. In contrast, some other states have coefficients that are rather close to zero and, thus, potentially subject to weak identification. Some states even have opposite signs for their first-stage coefficients. However, there is no existing proven-valid inference method for IVQR with few clusters, where identification may be weak in some clusters.

Third, it is also possible that IVs are weak in all clusters, in which case researchers need to use weak-identification-robust inference methods for IVQR Chernozhukov-Hansen(2008a), chernozhukov2009finite,Andrews-Stock-Sun(2019).

figure[figure omitted — 5,790 chars of source]

Motivated by these challenges, this paper investigates inference for IVQR with a small, fixed number of clusters and weak within-cluster error dependence, accommodating significant cluster-level heterogeneity in IV strength. We define clusters where the structural parameter (i.e., for the endogenous variable) is strongly identified as “strong IV clusters.” We propose a gradient wild bootstrap procedure for IVQR with clustered data. Our findings show that a bootstrap Wald test, whether studentized by the cluster-robust variance estimator (CRVE) or not, asymptotically controls size, given at least one strong IV cluster. The gradient wild bootstrap tests demonstrate power against local alternatives at the 10% and 5% significance levels with at least five and six strong IV clusters, respectively. Additionally, the CRVE-based bootstrap Wald test proves more powerful for distant local alternatives. We also develop a gradient wild bootstrap Anderson-Rubin(1949) test for IVQR that controls size regardless of instrument strength. Compared to analytical methods using HAC estimators, all our bootstrap inference methods are agnostic to within-cluster dependence structure, avoiding complex covariance matrix estimation and making it applicable to datasets with various weak dependence structures, such as cross-sectional, serial, network, and spatial dependence.

The contributions in the present paper relate to several strands of literature. First, it is related to the literature on the cluster-robust inference.\footnote{See Cameron(2008), Conley2011inference, Imbens-Kolesar(2016), abadie2022should, Hagemann(2017), Hagemann2019placebo, Hagemann2020inference, Hagemann(2019), Mackinnon-Webb(2017), Djogbenou-Mackinnon-Nielsen(2019), Mackinnon-Nielsen-Webb(2019), Ferman2019inference, Hansen-Lee(2019), Menzel2021bootstrap, Mackinnon2021, among others, and mackinnon2022cluster for a recent survey.} Hagemann(2017), Djogbenou-Mackinnon-Nielsen(2019), Mackinnon-Nielsen-Webb(2019), and Menzel2021bootstrap show bootstrap validity under the asymptotic framework in which the number of clusters diverges to infinity.\footnote{We refer interested readers to mackinnon2022cluster for detailed discussions on this asymptotic framework and the alternative asymptotic framework that treats the number of clusters as fixed.} Ibragimov-Muller(2010), Ibragimov-Muller(2016), Bester-Conley-Hansen(2011), Canay-Romano-Shaikh(2017), Hagemann2019placebo, Hagemann2020inference, Hagemann(2019), hagemann2024, and Hwang(2020) consider an alternative asymptotic framework in which the number of clusters is treated as fixed, while the number of observations in each cluster is relatively large and the within-cluster dependence is sufficiently weak. However, the inference methods proposed by BCH and Hwang(2020) require an (asymptotically) equal cluster-level sample size,\footnote{See Bester-Conley-Hansen(2011) and Hwang(2020) for details.} while those proposed by IM, CRS, and hagemann2024 would require strong identification for all clusters in the IVQR context. In contrast, our gradient bootstrap Wald tests are more flexible as they do not require an equal cluster size. In addition, they only need one strong IV cluster for size control and five to six for local power, thus allowing for substantial cluster heterogeneity in identification strength for the IVQR model. To our knowledge, no alternative method proposed in the literature remains valid in such a context. Furthermore, we provide gradient bootstrap AR tests, which are fully robust to weak identification.

Second, Canay-Santos-Shaikh(2020) and Wang-Zhang(2024) study wild bootstrap procedures with a few large clusters. In particular, Canay-Santos-Shaikh(2020) first investigates the validity of wild bootstrap by innovatively connecting it with a randomization test with sign changes. Our results for IVQR generalize and complement those in Canay-Santos-Shaikh(2020) and Wang-Zhang(2024) in the following aspects. First, Canay-Santos-Shaikh(2020) focus on the linear regression with exogenous regressors and then extend their analysis to a score bootstrap for the GMM estimator. Wang-Zhang(2024) focus on the linear IV regression and show the validity of a modified version of the cluster wild restricted efficient (WRE) bootstrap procedure (e.g., Davidson-Mackinnon(2010), Finlay-Magnusson(2019), and Roodman-Nielsen-MacKinnon-Webb(2019), among others) in the case with few clusters. Instead, we propose gradient wild bootstrap procedures for IVQR inspired by Hagemann(2017) and Jiang-Liu-Phillips-Zhang(2020), which avoid the estimation of the Hessian matrix that involves a nonparametric density component. In addition, we obtain the bootstrap estimator from the profiled optimization procedure for IVQR developed by Chernozhukov-Hansen(2004). These set us apart from the score bootstrap in the GMM setting. Second, we study the local power for our bootstrap Wald tests both with and without studentized by CRVE. In particular, the power analysis of the Wald test with CRVE is unconventional because, under a fixed number of clusters, the CRVE itself has a random limit. Specifically, we carefully design a gradient bootstrap counterpart for CRVE, which mimics well the original CRVE's randomness under the null and further diverges with the local alternative. The first property leads to the size control while the second leads to an interesting fact that the bootstrap Wald test with CRVE studentization is more powerful than that without in detecting sufficiently distant local alternatives. Such a power advantage is confirmed by our simulation experiments and empirical application. In addition, also different from its unstudentized counterpart, the local power of the Wald test with CRVE is established without the assumption that the IVQR first-stage coefficients have the same sign across all clusters, which may not hold in some empirical studies (e.g., see Figure (ref)).

Third, our paper is related to the literature on QR and IVQR. See, for example, Chernozhukov-Hansen(2004), Chernozhukov-Hansen(2005), Chernozhukov-Hansen(2006), Chernozhukov-Hansen(2008a), Hagemann(2017), and KW18. Furthermore, chernozhukov2020 provides a comprehensive overview of IVQR. We differ from them by considering an alternative asymptotic setting with a fixed number of clusters. hagemann2024 recently proposed a randomization test procedure in the spirit of CRS for inference on entire quantile and (exogenous) regression quantile processes under a small number of large clusters. However, as discussed above, a similar randomization test under the current IVQR setting would require strong identification for all clusters to establish validity. In contrast, our gradient wild bootstrap procedures for the Wald inference only need strong identification for at least one of the clusters.

Fourth, our paper is related to the literature on weak-identification-robust inference, in which various normal approximation-based inference approaches are available, among them Stock-Wright(2000), Kleibergen(2005), Andrews-Cheng(2012), Andrews(2016), Andrews-Mikusheva(2016), Moreira-Moreira(2019), and Andrews-Guggenberger(2019). However, these robust inference methods cannot be directly applied in the current context with few clusters. On the other hand, it is found in the literature that when implemented appropriately, bootstrap approaches may substantially improve the inference for linear IV models, including the cases where IVs may be rather weak,\footnote{See, for example, Davidson-Mackinnon(2008), Davidson-Mackinnon(2010), Moreira-Porter-Suarez(2009), Wang-Kaffo(2016), Kaffo-Wang(2017), Wang-Doko(2018), Finlay-Magnusson(2019), young2022consistency, and Wang-Zhang(2024), among others. In addition, tuvaandorj2021robust develops permutation versions of weak-IV-robust tests with (non-clustered) heteroskedastic errors.} although the related literature for IVQR inference remains sparse. The bootstrap AR test developed in this paper is a bootstrap counterpart of the analytical AR test proposed by Chernozhukov-Hansen(2008a). We show that it controls asymptotic size for IVQR under both weak/non-identification and a small number of large clusters.

The remainder of this paper is organized as follows. Section (ref) presents the setup, the IVQR estimation, and our gradient wild bootstrap procedures. Section (ref) presents assumptions and asymptotic results: Section (ref) gives the main assumptions, Section (ref) provides several specific examples related to our assumptions, Section (ref) provides three different methods to construct the IVs, Section (ref) presents the asymptotic results for the Wald inference, while Section (ref) presents those for the weak-identification-robust inference. Simulations in Section (ref) suggest that our procedures have outstanding finite sample size control and, in line with our theoretical analysis, the bootstrap Wald test studentized by CRVE has power advantages compared with the other bootstrap tests. The empirical application with ADH2013's dataset is presented in Section (ref).

Notation. Throughout the paper, we write $0_{d_1 \times d_2}$, $\iota_d$, and $\mathbb{I}_{d}$ as a $d_1 \times d_2$ matrix of zeros, $d$-dimensional vector of ones, and a $d \times d$ identity matrix, respectively. For any positive integer $d$, we denote $[d] = (1,\cdots,d)$. We further denote $||\cdot||_2$ and $||\cdot||_F$ as the $\ell_2$ norm for a vector and the Frobenius norm for a matrix, respectively.

Setup, Estimation, and Inference Procedure

Setup

Throughout the paper, we observe clustered data where the clusters are indexed by $j \in [J]$ and units in the $j$-th cluster are indexed by $i \in I_{n,j} = \{1, ..., n_j \}$. For the $i$-th unit in the $j$-th cluster, we observe $y_{i,j} \in \textbf{R}$, $X_{i,j} \in \textbf{R}$, and $W_{i,j} \in \textbf{R}^{d_w}$ as an outcome of interest, a scalar endogenous regressor, and exogenous regressors, respectively. Furthermore, we let $Z_{i,j} \in \textbf{R}^{d_z}$ be the exogenous variables that are excluded from the outcome equation defined through conditional CDF:

align[align omitted — 150 chars of source]

where $\Upsilon$ is a compact subset of $(0,1)$.

Throughout the paper, we focus on the setting with a single endogenous variable, as it is the most common case in empirical applications involving IVs. For instance, 101 out of 230 specifications in Andrews-Stock-Sun(2019)'s (Andrews-Stock-Sun(2019)) sample and 1,087 out of 1,359 in young2022consistency's (young2022consistency) sample feature one endogenous regressor and one IV. Similarly, lee2021 find that 61 out of 123 IV papers published in AER between 2013 and 2019 use single-IV regressions. While our setting also accommodates multiple IVs, most IVQR applications involve only one endogenous variable and one IV, as seen in studies by Chernozhukov-Hansen(2004), Chernozhukov-Hansen(2006), Chernozhukov-Hansen(2008a), and chernozhukov2013quantile. In our empirical application, we revisit the influential study by ADH2013, which also employs a single endogenous variable and one IV.

We allow the parameter of interest $\beta_n(\tau)$ (and the coefficient $\gamma_n(\tau)$ for the exogenous controls) to shift with respect to (w.r.t.) the sample size, which incorporates the analyses of size and local power in a concise manner: $\beta_n(\tau) = \beta_0(\tau) + \mu_\beta(\tau)/r_n$, and $\gamma_n(\tau) =\gamma_0(\tau) + \mu_\gamma(\tau)/r_n$, where $\mu_{\beta}(\tau) \in \textbf{R}$ and $\mu_{\gamma}(\tau) \in \textbf{R}^{d_w}$ are the local parameters and $r_n$ is the convergence rate of the score defined later. Throughout the paper, for a generic function $g$ of data $D_{i,j} = (y_{i,j},X_{i,j},W_{i,j},Z_{i,j})$, we let $\mathbb{P}_ng(D_{i,j})=\frac{1}{n}\sum_{j \in [J]} \sum_{i \in I_{n,j}} g(D_{i,j})$, $\overline{\mathbb{P}}_ng(D_{i,j})=\frac{1}{n}\sum_{j \in [J]} \sum_{i \in I_{n,j}} \mathbb{E}g(D_{i,j})$, $\mathbb{P}_{n,j}g(D_{i,j})=\frac{1}{n_j}\sum_{i \in I_{n,j}} g(D_{i,j})$, and $\overline{\mathbb{P}}_{n,j}g(D_{i,j})=\frac{1}{n_j}\sum_{i \in I_{n,j}} \mathbb{E}g(D_{i,j})$.

Estimation

Following Chernozhukov-Hansen(2006), we construct instrumental variables $\Phi_{i,j}(\tau) \in \textbf{R}^{d_\phi}$ from $(W_{i,j},Z_{i,j})$, that is, $\Phi_{i,j}(\tau) = \Phi(W_{i,j},Z_{i,j},\tau)$. For the validity of our bootstrap inference with a fixed number of clusters, we further require the instruments to be orthogonal to the control variables in the quantile regression context. Therefore, the function $\Phi(\cdot)$ may be unknown but can be estimated as $\hat{\Phi}(\cdot)$. The corresponding feasible IVs are defined as $\hat{\Phi}_{i,j}(\tau) = \hat{\Phi}(W_{i,j},Z_{i,j},\tau)$. We will provide more details about the construction of $\hat{\Phi}(\cdot)$ in Section (ref). Additionally, a scalar nonnegative weight is defined as $V_{i,j}(\tau)$, which also may be unknown, and its estimator is defined as $\hat{V}_{i,j}(\tau)$. Then, the estimation of $\beta_n(\tau)$ can be implemented via a profiled method described below. For a given value $b$ of $\beta_n(\tau)$, we first compute

align[align omitted — 225 chars of source]

where $\rho_\tau(u) = u(\tau - 1\{u \leq 0\})$. Under appropriate conditions for strong identification, which will be made clear later, we can estimate $\beta_n(\tau)$ by $\hat{\beta}(\tau)$ defined as

align[align omitted — 120 chars of source]

where $ \mathcal{B}$ is a compact subset of $\textbf{R}$, $\hat{A}_1(\tau)$ is some $d_{\phi} \times d_{\phi}$ weighting matrix, and the notation $||u||_{A}$ for a compatible vector $u$ and matrix $A$ means $(u^\top A u)^{1/2}$. Last, we define $\hat{\gamma}(\tau) = \hat{\gamma}(\hat{\beta}(\tau),\tau)$ and $\hat{\theta}(\tau) = \hat{\theta}(\hat{\beta}(\tau),\tau)$. Following the lead of Chernozhukov-Hansen(2006), in practice, we suggest setting $\hat V_{i,j}(\tau) = 1$ and $\hat A_1(\tau) = \mathbb I_{d_\phi}$ or $\hat A_1(\tau) = \mathbb P_n \hat \Phi_{i,j}(\tau)\hat \Phi_{i,j}^\top(\tau)$. When the instrument is a scalar so that the model is just identified, the choice of $\hat A_1(\tau)$ becomes irrelevant. In addition, we note that the case of just identification is always achievable because even if the original IV $Z_{i,j}$ is multi-dimensional, we can construct $\hat \Phi_{i,j}$ as the prediction of $X_{i,j}$ using $Z_{i,j}$ and $W_{i,j}$ from a first-stage linear regression, which is again a scalar (see Section (ref) for further details on the construction of $\hat \Phi_{i,j}(\tau)$).

Gradient Wild Bootstrap Inference

Inference Procedure for Wald Statistics

In this section, we consider the null and local alternative hypotheses defined as

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

which is equivalent to

align[align omitted — 183 chars of source]

where $\Upsilon$ is a compact subset of $(0,1)$.

Consider the test statistic with a normalization factor $\hat{A}_2(\tau)$, and let

align[align omitted — 124 chars of source]

be the test statistic. In the following, we describe the gradient wild bootstrap procedure.

enumerate• We define the null-restricted estimator $\hat{\gamma}^r(\tau) = \hat{\gamma}(\beta_0(\tau),\tau)$. • Let $\textbf{G} = \{-1,1 \}^J$ and for any $g = (g_1,\cdots,g_J) \in \textbf{G}$, \begin{align} (\hat{\gamma}_g^*(b,\tau),\hat{\theta}_g^*(b,\tau)) = & \arg \inf_{r,t} \biggl[\sum_{j \in [J]}\sum_{i \in I_{n,j}}\rho_\tau(y_{i,j} - X_{i,j} b - W_{i,j}^\top r - \hat{\Phi}_{i,j}^\top(\tau) t) \hat{V}_{i,j}(\tau) \notag \\ - & \sum_{j \in [J]} g_j\sum_{i \in I_{n,j}} \hat{f}^\top_\tau(D_{i,j},\beta_0(\tau),\hat{\gamma}^r(\tau),0) \begin{pmatrix} r \\ t \end{pmatrix}\biggr], \notag \\ \hat{\beta}_g^*(\tau) = & \arg \inf_{b \in \mathcal{B}}\left[||\hat{\theta}_g^*(b,\tau)||_{\hat{A}_1(\tau)}\right], \quad and \quad \hat{\gamma}_g^*(\tau) = \hat{\gamma}_g^*(\hat{\beta}_g^*(\tau),\tau), \end{align} where the null-restricted estimator $\hat{\gamma}^r(\tau)$ is defined in the previous step, \begin{align} \hat{f}_{\tau}(D_{i,j},b,r,t) = (\tau - 1\{y_{i,j} - X_{i,j} b - W_{i,j}^\top r - \hat{\Phi}_{i,j}^\top(\tau) t \leq 0\})\hat{\Psi}_{i,j}(\tau) \hat V_{i,j}(\tau), \end{align} and $\hat{\Psi}_{i,j}(\tau) = [W_{i,j}^\top,\hat{\Phi}_{i,j}^\top(\tau)]^\top$. • Let $T_{n}^{*}(g) = \sup_{\tau \in \Upsilon}|| (\hat{\beta}_g^*(\tau) - \hat{\beta}(\tau))||_{\hat{A}^*_{2,g}(\tau)},$ where $\hat{A}^*_{2,g}(\tau)$ is the bootstrap counterpart of the normalization factor $\hat{A}_2(\tau)$. Then, let $\hat{c}_{n}(1-\alpha)$ denote the $1-\alpha$ quantile of $\{ T_{n}^{*}(g) \}_{g \in \textbf{G}}$, and we reject the null hypothesis if $T_{n} > \hat{c}_{n}(1-\alpha).$
remarkSeveral remarks regarding the choice of estimators in the above algorithm are in order. Specifically, in Step 2, we impose the null when implementing sign changes on the cluster-level scores by using $\beta_0(\tau)$ and $\hat{\gamma}^r(\tau)$ in $\hat{f}_{\tau}(D_{i,j},b,r,t)$. In contrast, we use $\hat{\beta}(\tau)$, instead of $\beta_0(\tau)$, in Step 3 to center the bootstrap IVQR estimator when constructing $T_n^*(g)$. Both choices are essential for the validity of our gradient bootstrap procedure under a small number of large clusters. In particular, we note that Canay-Santos-Shaikh(2020) and Wang-Zhang(2024) use null-restricted estimators to center their bootstrap estimators for linear (IV) regressions. Instead, we use $\hat{\beta}(\tau)$ in our Step 3 because they use residual-based bootstrap procedures while we use the gradient bootstrap procedure.

Below, we discuss two cases for the normalization factor $\hat{A}_2(\tau)$: (1) it has a deterministic limit, and (2) it involves the cluster-robust variance estimator (CRVE) for score from IVQR. For case (1), given that $\hat{A}_2(\tau)$ has a deterministic limit, we do not need to bootstrap it and just let $\hat{A}_{2,g}^*(\tau) = \hat{A}_2(\tau)$ in Step 3. By an abuse of notation, the corresponding test statistic, bootstrap statistics, and critical value are still denoted as $T_n$, $T_n^{*}(g)$, and $\hat{c}_n(1-\alpha)$, respectively.

For case (2), we need some extra notation to define the normalization factor formally. Let $\hat G(\tau) \in \Re^{d_\phi}$ have a deterministic limit and

align[align omitted — 306 chars of source]

where $\omega = (0_{d_\phi \times d_w}, \mathbb{I}_{d_\phi})$. Then, we define the normalization factor $\hat{A}_{CR}(\tau)$ in case (2) as

align[align omitted — 124 chars of source]

and the corresponding CRVE-weighted Wald test statistic is defined as $$T_{CR,n} = \sup_{\tau \in \Upsilon}|| \hat{\beta}(\tau) - \beta_0(\tau)||_{\hat{A}_{CR}(\tau)}.$$

The normalization factor $\hat A_{CR}(\tau)$ and the test $T_{CR,n}$ take a cluster-robust form because the form of $\hat \Omega(\tau,\tau)$ preserves all within-cluster dependence. Naturally, for the choice of $\hat G(\tau)$, we would like to use a consistent estimator of the Jacobian $\Gamma(\tau)$ defined in (ref) below. However, this would involve a nonparametric conditional density estimation and parameter tuning. Instead, we suggest using

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

where $\hat {\mathcal E}_{X,\Phi}(\tau) = \mathbb P_n X_{i,j}\hat \Phi_{i,j}^\top (\tau) \hat V_{i,j}(\tau)$ and $\hat {\mathcal E}_{\Phi,\Phi}(\tau) = \mathbb P_n \hat \Phi_{i,j}(\tau) \hat \Phi_{i,j}^\top (\tau) \hat V_{i,j}(\tau)$. When $\hat A_1(\tau)$ is set as $\hat {\mathcal E}_{\Phi,\Phi}(\tau)$, we can further simplify $\hat G(\tau)$ as

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

In addition, even if we use a consistent estimator of the Jacobian $\Gamma(\tau)$ as $\hat G(\tau)$, it will not guarantee the consistency of the CRVE because the number of clusters is fixed in our setting. In fact, $\hat \Omega(\tau,\tau)$, and thus, $\hat A_{CR}(\tau)$ have random limits after a proper normalization. Therefore, in case (2), to construct a valid critical value for $T_{CR,n}$, we also need to bootstrap $\hat A_{CR}(\tau)$ properly to mimic well this randomness in our bootstrap samples.

To define an appropriate gradient bootstrap analogue of $\hat A_{CR}(\tau)$, we let

align[align omitted — 479 chars of source]

Then, we let $\hat{A}_{2,g}^*(\tau)$ in Step 3 of the previous bootstrap algorithm equal $\hat{A}_{CR,g}^*(\tau)$, which is defined as

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

where $\hat{\beta}_g^*(\tau) $ and $\hat{\gamma}_g^*(\tau) $ are defined in (ref). The bootstrap counterpart of $T_{CR,n}$ and the critical value are defined as $$T_{CR,n}^{*}(g) = \sup_{\tau \in \Upsilon}||\hat{\beta}_g^*(\tau) -\hat{\beta}(\tau)||_{\hat{A}_{CR,g}^*(\tau)} \quad \text{and} \quad \hat{c}_{CR,n}(1-\alpha), \quad \text{respectively}.$$

remarkSeveral remarks are in order regarding our design of $\hat{\Omega}_g^*(\tau,\tau')$ in ((ref)). First, when $\mathcal{H}_0$ is true, $\hat{\Omega}_g^*(\tau,\tau')$ has the same limit distribution as $\hat{\Omega}(\tau,\tau')$, which is needed for the asymptotic validity of the bootstrap Wald test with CRVE. Second, we design $\hat{\Omega}_g^*(\tau,\tau')$ in such a way so that under $\mathcal{H}_{1,n}$, the local parameter $\mu_{\beta}(\tau)$ defined in ((ref)) will enter the limit distribution of $\hat{\Omega}_g^*(\tau,\tau')$ in sufficiently many randomization draws. By contrast, $\mu_{\beta}(\tau)$ does not enter the limit distribution of $\hat{\Omega}(\tau,\tau')$ in the original Wald statistic $T_{CR,n}$. This leads to a further power improvement for our bootstrap test studentized by CRVE (more details are given in Theorem (ref) and Remark (ref) below).
remarkWe note that if we are in case (1) and $\Upsilon$ defined in ((ref)) is a singleton, then $\hat A_2(\tau)$ (which has a deterministic limit) shows up in both the test statistic $T_n$ and its bootstrap counterpart $T_n^*(g)$, and thus, the critical value $\hat c_n(1-\alpha)$ so that $\hat A_2(\tau)$ gets canceled out. In this case, our bootstrap test is numerically invariant to the choice of $\hat A_2(\tau)$. In addition, if we use CRVE to studentize the test statistic (i.e., in case (2)), $\Upsilon$ is a singleton, and the instrument $\hat \Phi_{i,j}(\tau)$ is a scalar, then $\hat G(\tau)$ is also a scalar, which shows up in both the test statistic $T_{CR,n}$ and the critical value $\hat c_{CR,n}(1-\alpha)$, and thus, gets canceled out. Therefore, in this scenario, our bootstrap test with the CRVE-weighted Wald statistic $T_{CR,n}$ is numerically invariant to the choice of $\hat G(\tau)$. Such an invariance property is one of the advantages of using the bootstrap tests.

Inference Procedure for Weak-instrument-robust Statistics

This section considers the weak-instrument-robust inference for $\beta_n(\tau)$ when it may be weakly or partially identified. Recall $\beta_n(\tau) = \beta_0(\tau) + \mu_\beta(\tau)/r_n$. Under the null, we have $\mu_\beta(\tau) = 0$, or equivalently, $\beta_n(\tau) = \beta_0(\tau)$. Our test statistic follows the construction by Chernozhukov-Hansen(2008a). Specifically, we let

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

where $\hat{\theta}(b,\tau)$ is defined in (ref) and $\hat{A}_3(\tau)$ is a $d_\phi \times d_\phi$ weighting matrix, which will be specified later. We differentiate the weighting matrix used here (denoted as $\hat A_3(\tau)$) with that used for the estimation of $\beta_n(\tau)$ in (ref) (denoted as $\hat A_1(\tau)$) because of their different usages: the former is for the construction of the weak-instrument-robust test statistic while the later is for the estimation under strong identification. Theoretically, we require $\hat A_3(\tau)$ to have a deterministic limit, same as $\hat A_1(\tau)$.

Next, the bootstrap procedure for the weak-instrument-robust inference is defined as follows.

enumerate• Recall $\textbf{G} = \{-1,1 \}^J$ and for any $g = (g_1,\cdots,g_J) \in \textbf{G}$, the null-imposed bootstrap estimators $(\hat \gamma_g^{*r}(\tau), \hat \theta_g^{*r}(\tau))= (\hat \gamma_g^*(\beta_0(\tau), \tau),\hat \theta_g^*(\beta_0(\tau), \tau))$ for $(\gamma, \theta)$ are defined in (ref). • The bootstrap test statistic is then defined as $AR_{n}^{*}(g) = \sup_{\tau \in \Upsilon}||\hat \theta_g^{*r}(\tau) - \hat{\theta}(\beta_0(\tau),\tau)||_{\hat{A}_3(\tau)}$. • Let $\hat{c}_{AR,n}(1-\alpha)$ denote the $1-\alpha$ quantile of $\{ AR_{n}^{*}(g) \}_{g \in \textbf{G}}$, and we reject the null hypothesis when $AR_{n} > \hat{c}_{AR,n}(1-\alpha)$.

It is also possible to studentize $\hat{\theta}(\beta_0(\tau),\tau)$ by a (null-imposed) CRVE, i.e., replace $\hat{A}_3(\tau)$ with $\tilde {A}_{CR}(\tau)$, where

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

$\hat H(\tau) \in \Re^{d_\phi \times d_\phi}$ is some symmetric matrix, and

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

Note that different from $\hat{\Omega}(\tau, \tau')$ of the Wald test statistic in the previous section, we impose the null hypothesis in the form of $\tilde \Omega(\tau,\tau')$. This is essential for the validity of the test under weak/non-identification for all clusters. Additionally, note that $ \tilde {A}_{CR}(\tau)$ admits a random limit in our setting, which distinguishes it from $\hat A_3(\tau)$ used for $AR_n$.

We define the corresponding test statistic, its bootstrap counterparts, and critical value as

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

and $\hat{c}_{AR,CR,n}(1-\alpha)$, respectively. Naturally, for $\hat H(\tau)$, we want to use a consistent estimator for the Jacobian of $\hat \theta(\beta_0(\tau),\tau)$, which would again involve a kernel density estimation and parameter tuning. Therefore, similar to the bootstrap Wald inference, we instead suggest setting

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

Then, we reject the null hypothesis when $AR_{CR,n} > \hat{c}_{AR,CR,n}(1-\alpha)$. Note that different from the Wald statistic, we do not need to bootstrap $\tilde{A}_{CR}(\tau)$ here because $\tilde \Omega(\tau,\tau)$ is invariant to sign changes. Also, when the IV $\hat \Phi_{i,j}(\tau)$ is a scalar and $\Upsilon$ is a singleton, the choice of $\hat A_3(\tau)$ becomes irrelevant as it gets canceled in both the test statistic and the bootstrap critical value. Therefore, the bootstrap tests based on $AR_n$ and $AR_{CR,n}$ are numerically equivalent in this case.

Computation

Given a value of $b$, we can compute $(\hat \gamma(b,\tau),\hat \theta(b,\tau))$ in (ref) by the standard quantile regression algorithm. Then, we follow the lead of Chernozhukov-Hansen(2006) and implement a one-dimensional grid search to compute $\hat \beta(\tau)$ in (ref).

Furthermore, we note that given a value of $b$, the gradient bootstrap estimator $(\hat{\gamma}_g^*(b,\tau),\hat{\theta}_g^*(b,\tau))$ in (ref) can be formulated as linear programming and solved by well-developed linear optimization solvers. Specifically, we can stack up $y_{i,j} - X_{i,j}b$ and $\hat V_{i,j}$ first within each cluster and then across clusters $j=1,...,J$. Denote them as $\mathcal Y \in \Re^n$ and $\mathcal V \in \Re^n$, respectively. Similarly, we stack up $(W_{i,j}^\top, \hat \Phi_{i,j}^\top(\tau))$ together and construct a $n \times (d_w+d_\phi)$ matrix denoted as $\mathcal X$. Last, denote $\eta^\top = (r^\top,t^\top)$, and

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

By letting $u_i = \max(0,\mathcal Y_i - \mathcal X_i^\top \eta)$ and $v_i = \max(0,-\mathcal Y_i + \mathcal X_i^\top \eta)$, we can rewrite (ref) as

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

subject to

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

where $u = (u_1,\cdots,u_n)^\top$ and $v = (v_1,\cdots,v_n)^\top$. Therefore, the gradient-based wild bootstrap estimator $(\hat{\gamma}_g^*(b,\tau),\hat{\theta}_g^*(b,\tau)) = \hat \eta$, where

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

Assumptions and Asymptotic Results

Main Assumptions

We make the following assumptions to establish the statistical properties of our bootstrap procedures formally.

assumption\begin{enumerate}[label=(\roman*)] • Suppose $\mathbb{P}(y_{i,j} \leq X_{i,j} \beta_n(\tau) + W_{i,j}^\top\gamma_n(\tau)|W_{i,j},Z_{i,j})=\tau$ for $\tau \in \Upsilon$, $\beta_n(\tau) = \beta_0(\tau) + \mu_{\beta}(\tau)/r_n$, and $\gamma_n(\tau) =\gamma_0(\tau) + \mu_\gamma(\tau)/r_n$. • Suppose $\sup_{\tau \in \Upsilon}\left(||\mu_\gamma(\tau)||_2 + ||\mu_\beta(\tau)||_2 + ||\beta_0(\tau)||_2 + ||\gamma_0(\tau)||_2\right)\leq C<\infty$. • For all $\tau \in \Upsilon$, $\beta_n(\tau) \in \text{int}(\mathcal{B})$, where $\mathcal{B}$ is compact and convex. • Suppose $\max_{ i \in [n_j],j \in [J]}\sup_{y \in \textbf{R}}f_{y_{i,j}|W_{i,j},X_{i,j},Z_{i,j}}(y) <C$ for some constant $C \in (0,\infty)$, where $f_{y_{i,j}|W_{i,j},X_{i,j},Z_{i,j}}(\cdot)$ denotes the conditional density of $y_{i,j}$ given $W_{i,j},X_{i,j}$, and $Z_{i,j}$. • Denote the population counterpart of $\hat f_\tau(\cdot)$ as $f_\tau(\cdot)$, which is defined as \begin{align} f_{\tau}(D_{i,j},b,r,t) = (\tau - 1\{y_{i,j} - X_{i,j} b - W_{i,j}^\top r - \Phi_{i,j}^\top(\tau) t \leq 0\})\Psi_{i,j}(\tau) V_{i,j}(\tau), \end{align} where $\Psi_{i,j}(\tau) = [W_{i,j}^\top,\Phi_{i,j}^\top(\tau)]^\top$. Further define $\Pi(b,r,t,\tau) = \overline{\mathbb{P}}_n f_{\tau}(D_{i,j},b,r,t)$. Then, there are compact subsets $\mathcal{R}$ and $\Theta$ of $\textbf{R}^{d_w}$ and $\textbf{R}^{d_\phi}$, respectively, such that Jacobian matrix $\frac{\partial}{\partial(r^\top,t^\top)}\Pi(b,r,t,\tau)$ is continuous and has full column rank, uniformly in $n$ and over $\mathcal{B} \times \mathcal{R} \times \Theta \times \Upsilon$. • $\sup_{i \in [n_j], j \in [J],\tau \in \Upsilon} \mathbb{E}||\Psi_{i,j}(\tau)||^{2+a}<\infty$ for some $a>0$. \end{enumerate}
remarkSeveral remarks are in order. First, Assumption (ref) allows for the case in which $\beta_n(\tau)$ is partially or weakly identified as we do not require the Jacobian matrix w.r.t. $\beta,\gamma$ (i.e., $ \frac{\partial}{\partial(b^\top,r^\top)}\Pi(b,r,0,\tau)$) to be of full rank. Such a condition is assumed later in Assumption (ref) when we do need strong identification for the Wald inference, but is not required for the weak-identification-robust inference based on $AR_n$ and $AR_{CR,n}$. Second, under Assumption (ref), Chernozhukov-Hansen(2006) show that $(\gamma_n^\top(\tau),0_{d_\phi \times 1}^\top)^\top$ is the unique solution to the weighted quantile regression of $y_{i,j} - X_{i,j}\beta_n(\tau)$ on $W_{i,j}$ and $\Phi_{i,j}(\tau)$ at the population level. Again, this condition does not impose strong identification of $\beta_n(\tau)$.
assumption\begin{enumerate}[label=(\roman*)] • Let \begin{align*} \hat{\mathcal Q}_n(b,r,t,\tau) = & \mathbb{P}_n \rho_\tau(y_{i,j} - X_{i,j} b - W_{i,j}^\top r - \hat{\Phi}_{i,j}^\top(\tau) t) \hat{V}_{i,j}(\tau), \\ \mathcal Q_n(b,r,t,\tau) = & \overline{\mathbb{P}}_n\rho_\tau(y_{i,j} - X_{i,j} b - W_{i,j}^\top r - \Phi_{i,j}^\top(\tau) t) V_{i,j}(\tau), \end{align*} and $\mathcal Q_\infty(b,r,t,\tau) = \lim_{n \rightarrow \infty}\mathcal Q_n(b,r,t,\tau)$. Suppose $(\gamma_n(b,\tau),\theta_n(b,\tau))$ and $(\gamma_\infty(b,\tau),\theta_\infty(b,\tau))$ are the unique minimizers of $\mathcal Q_n(b,r,t,\tau)$ and $\mathcal Q_\infty(b,r,t,\tau)$ w.r.t. $(r,t)$, respectively. In addition, suppose $(\gamma_n(b,\tau),\theta_n(b,\tau),\gamma_\infty(b,\tau),\theta_\infty(b,\tau))$ are continuous in $b \in \mathcal{B}$ uniformly over $\tau \in \Upsilon$, $(\gamma_n(b,\tau),\theta_n(b,\tau)) \in \text{int}(\mathcal{R} \times \Theta)$ for all $(b,\tau) \in \mathcal{B} \times \Upsilon$, where $\mathcal{R}$ and $\Theta$ are defined in Assumption (ref). Also, suppose \begin{align*} & \sup_{(b,\tau) \in \mathcal{B} \times \Upsilon}|\mathcal Q_\infty(b,r,t,\tau) -\mathcal Q_n(b,r,t,\tau)| = o(1) \quad and\\ & \sup_{(b,\tau) \in \mathcal{B} \times \Upsilon}|\hat{\mathcal Q}_n(b,r,t,\tau) -\mathcal Q_n(b,r,t,\tau)| = o_p(1). \end{align*} • For any $\varepsilon>0$, \begin{align*} \lim_{\delta \rightarrow 0}\limsup_{n \rightarrow \infty} \mathbb{P}\begin{pmatrix} \sup \biggl\Vert r_n(\mathbb{P}_{n,j}-\overline{\mathbb{P}}_{n,j})\biggl(\hat{f}_{\tau}(D_{i,j},\beta_n(\tau)+v_b,\gamma_n(\tau)+v_r,v_t) \\ - f_{\tau}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0) \biggr)\biggr\Vert_2\geq \varepsilon \end{pmatrix} = 0, \end{align*} where the supremum inside the probability is taken over $\{j \in [J], ||v||_2 \leq \delta,\tau \in \Upsilon\}$ and $v = (v_b^\top,v_r^\top,v_t^\top)^\top$.\footnote{ For any function $g(\cdot)$ and its estimator $\hat g(\cdot)$, $\mathbb{E}\hat{g}(W_{i,j})$ is interpreted as $\mathbb{E}g(W_{i,j})|_{g= \hat{g}}$ following the convention in the empirical processes literature. } • Denote $\varepsilon_{i,j}(\tau) = y_{i,j} - X_{i,j} \beta_n(\tau) - W_{i,j}^\top\gamma_n(\tau)$, $\pi = (\gamma^\top,\theta^\top)^\top$, and $\delta_{i,j}(v,\tau) = X_{i,j} v_b + W_{i,j}^\top v_r + \hat{\Phi}_{i,j}^\top(\tau) v_t$. Then, for any $\varepsilon>0$, we have \begin{align*} & \lim_{\delta \rightarrow 0}\limsup_{n \rightarrow \infty}\mathbb{P}\left[\sup\left\Vert \overline{\mathbb{P}}_{n,j} f_{\varepsilon_{i,j}(\tau)}(\delta_{i,j}(v,\tau)|W_{i,j},Z_{i,j})\hat{\Psi}_{i,j}(\tau)\hat{\Psi}_{i,j}^\top(\tau)\hat V_{i,j}(\tau) - Q_{\Psi,\Psi,j}(\tau) \right\Vert_{op} \geq \varepsilon \right] = 0, \\ & \lim_{\delta \rightarrow 0}\limsup_{n \rightarrow \infty}\mathbb{P}\left[\sup\left\Vert \overline{\mathbb{P}}_{n,j}f_{\varepsilon_{i,j}(\tau)}(\delta_{i,j}(v,\tau)|W_{i,j},Z_{i,j})\hat{\Psi}_{i,j}(\tau)X_{i,j}\hat V_{i,j}(\tau) - Q_{\Psi,X,j}(\tau) \right\Vert_{op} \geq \varepsilon \right] = 0, \end{align*} where the suprema inside the probability are taken over $\{j \in [J],||v||_2 \leq \delta,\tau \in \Upsilon\}$, $v = (v_b^\top,v_r^\top,v_t^\top)^\top$, \begin{align*} & Q_{\Psi,X,j}(\tau) = \lim_{n\rightarrow \infty}\overline{\mathbb{P}}_{n,j} f_{\varepsilon_{i,j}(\tau)}(0|W_{i,j},Z_{i,j})\Psi_{i,j}(\tau)X_{i,j}V_{i,j}(\tau), \quad and\\ & Q_{\Psi,\Psi,j}(\tau) = \lim_{n\rightarrow \infty}\overline{\mathbb{P}}_{n,j} f_{\varepsilon_{i,j}(\tau)}(0|W_{i,j},Z_{i,j})\Psi_{i,j}(\tau)\Psi_{i,j}^\top(\tau)V_{i,j}(\tau). \end{align*} • $\sup_{\tau \in \Upsilon} r_n ||\mathbb{P}_nf_{\tau}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0)||_2 = O_p(1)$ for some $r_n = O(\sqrt n)$. • Let $n_j$ be the sample size of the $j$-th cluster. Then, we treat the number of clusters $J$ as fixed and $ n_j/n\rightarrow \xi_j$ for $\xi_j >0$ and $j \in [J]$. • We further write $Q_{\Psi,\Psi,j}(\tau)$ as $ \begin{pmatrix} Q_{W,W,j}(\tau) & Q_{W,\Phi,j}(\tau) \\ Q_{W,\Phi,j}^\top(\tau) & Q_{\Phi,\Phi,j}(\tau) \end{pmatrix}$, where $ Q_{W,W,j}(\tau)$, $ Q_{W,\Phi,j}(\tau)$, and $ Q_{\Phi,\Phi,j}(\tau)$ are $d_w \times d_w$, $d_w \times d_\phi$, and $d_\phi \times d_\phi$ matrices. Then, there exist constants $(c,C)$ such that $$0<c<\inf_{\tau \in \Upsilon}\lambda_{\min}\left(\sum_{j \in [J]} \xi_j Q_{\Psi,\Psi,j}(\tau)\right)\leq \sup_{\tau \in \Upsilon}\lambda_{\max}\left(\sum_{j \in [J]} \xi_j Q_{\Psi,\Psi,j}(\tau)\right)<C<\infty.$$ \end{enumerate}
remarkFirst, Assumption (ref)(i) ensures $\gamma_n(b,\tau)$ and $\theta_n(b,\tau)$ are uniquely defined in the drifting-parameter setting. Second, Assumption (ref)(ii) is the stochastic equicontinuity of the empirical process \begin{align*} r_n(\mathbb{P}_{n,j}-\overline{\mathbb{P}}_{n,j})\biggl(\hat{f}_{\tau}(D_{i,j},\beta_n(\tau)+v_b,\gamma_n(\tau)+v_r,v_t)- f_{\tau}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0) \biggr) \end{align*} with respect to $v$. Such a condition is verified by Chernozhukov-Hansen(2006) when the data are independent and $\hat{V}_{i,j}(\tau)$ and $\hat{\Phi}_{i,j}(\tau)$ uniformly converge to their population counterparts in probability. Their argument can be extended to data with various forms of weak dependence. Third, Assumption (ref)(iii) requires the uniform consistency of the Jacobian matrices subject to infinitesimal perturbation of parameters, which holds even when observations are dependent. Fourth, Assumption (ref)(iv) requires the convergence rate of the sample mean of the score function to be $r_n$. We provide more details about $r_n$ in three examples in Section (ref) below. Fifth, Assumption (ref)(v) implies that we focus on the case with a small number of large clusters.
assumption\begin{enumerate}[label=(\roman*)] • For $j \in [J]$ and $\tau \in \Upsilon$, $Q_{W,\Phi,j}(\tau) = 0$. • There exist versions of tight Gaussian processes $\{\mathcal{Z}_j(\tau): \tau \in \Upsilon\}_{j \in [J]}$ such that $ \mathcal{Z}_j(\tau) \in \textbf{R}^{d_\phi}$, $\mathcal{Z}_j(\cdot)$ are independent across $j \in [J]$, $\mathbb{E}\mathcal{Z}_j(\tau)\mathcal{Z}^\top_j(\tau') = \Sigma_j(\tau,\tau')$, $$0<c<\inf_{\tau \in \Upsilon, j \in [J]}\lambda_{\min}(\Sigma_j(\tau,\tau))\leq \sup_{\tau \in \Upsilon, j \in [J]}\lambda_{\max}(\Sigma_j(\tau,\tau)) \leq C<\infty$$ for some constants $(c,C)$ independent of $n$, and \begin{align} \sup_{j \in [J],\tau \in \Upsilon}||r_n\mathbb{P}_{n,j}\tilde{f}_{\tau}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0) - \mathcal{Z}_j(\tau)||_2 \stackrel{p}{\longrightarrow} 0, \end{align} where $ \tilde{f}_{\tau}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0) = (\tau - 1\{\varepsilon_{i,j}(\tau)\leq 0\})\Phi_{i,j}(\tau)V_{i,j}(\tau). $ \end{enumerate}
remarkAssumption (ref)(i) introduces Neyman orthogonality between the estimators of the coefficients of the endogenous and control variables, which is the key to connecting the gradient bootstrap with the randomization test with sign changes. This is in line with the results in Canay-Santos-Shaikh(2020) and Wang-Zhang(2024) for their residual-based bootstrap procedures. In Section (ref) below, we propose both parametric and nonparametric approaches to construct IVs that satisfy Assumption (ref)(i) (under some regulatory conditions).
remarkConsistently estimating $\Sigma_j(\cdot)$ in Assumption (ref)(ii) requires further assumptions on the within-cluster dependence structure and potential tuning parameters; see, for example, YG20 and GY23. Instead, the key benefit of our bootstrap inference approach is that it is fully agnostic about the expression of the covariance matrices.
remarkWe notice that (ref) holds if the within-cluster dependence is sufficiently weak for some type of CLT to hold. Below, we provide three examples of data structures (Examples (ref)-(ref)) that satisfy our requirements.

Examples

This section considers several examples and discusses why our assumptions are satisfied or violated in different scenarios.

example[Serial Dependence] We use $i$ and $j$ to index time period and clusters, respectively, so that observations have serial dependence over time and are asymptotically independent across clusters. Such settings were considered in BCH (Lemma 1 and Section 4.1), IM (Section 3.1), and CRS (Section S.1) for time series data and IM (Section 3.2) for panel data,\footnote{Specifically, for time series data, they propose to divide the full sample into $J$ (approximately) equal sized consecutive blocks (clusters). For panel data, assuming independence across individuals, one may treat the observations for each individual as a cluster.} among others. In this setup, we can verify (ref) under different levels of serial dependence. \begin{enumerate} • ($L_q$-Mixingale) Let $\tilde{f}_{\tau}^{(k)}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0)$ denote the $k$-th element of $\tilde{f}_{\tau}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0)$. Suppose there exists a filtration $\mathcal{F}_{i,j}$ that satisfies the following conditions: for some $q\geq 3$ and any $l\geq 0$ and $j \in [J]$, \begin{align*} & \left\Vert \mathbb E (\tilde{f}_{\tau}^{(k)}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0) \mid \mathcal{F}_{i-l,j}) \right\Vert_q \leq c_{n_j,i}\psi_l, \\ & \left\Vert \tilde{f}_{\tau}^{(k)}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0) - \mathbb E (\tilde{f}_{\tau}^{(k)}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0) \mid \mathcal{F}_{i+l,j}) \right\Vert_q \leq c_{n_j,i}\psi_{l+1}, \end{align*} and $\max_{j \in [J]}\max_{i \in I_{n,j}}c_{n_j,i} = o(n^{1/2})$. Then, LL20 implies (ref) holds with $r_n = \sqrt{n}$. In fact, they show that the partial sum process of $$\{\tilde{f}_{\tau}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0)\}_{i \in I_{n,j}}$$ can be approximated by a martingale, and thus, is called a mixingale. It forms a very general class of models, including martingale differences, linear processes, and various types of mixing and near-epoch dependence processes as special cases. • (Long Memory) Suppose $\tilde{f}_{\tau}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0) = \sum_{l=0}^{\infty}\Theta_l a_{i-l,j}$, where the innovations $a_{i,j} = (a_{i,j}^{(1)},\cdots,a_{i,j}^{(d_w + d_\phi)})^\top$ are $(d_w + d_\phi)$-dimensional martingale difference with respect to a filtration $\mathcal{F}_{i,j}$ such that for $k \in [d_w + d_\phi]$, \begin{align*} \max_{i,j,k}\mathbb E (|a_{i,j}^{(k)}|^{2+d}\mid \mathcal{F}_{i-1,j}) < \infty, a.s. \quad and \quad \mathbb E (a_{i,j}a_{i,j}^\top \mid \mathcal{F}_{i-1,j}) = \Sigma_a, a.s. \end{align*} The $(d_w + d_\phi) \times (d_w + d_\phi)$ matrix coefficient $\Psi_l$ can be approximated by \begin{align*} \Theta_l \sim \frac{l^{d-1}}{\Gamma(d)} \Pi, \quad as \quad l \rightarrow \infty, \end{align*} where $\Gamma(\cdot)$ is the gamma function, $\Pi$ is a non-singular $(d_w + d_\phi) \times (d_w + d_\phi)$ matrix of constants that are independent of $l$, and $d \in (0,0.5)$ is the memory parameter. Then, C02 implies ((ref)) holds with $r_n = n^{1/2-d}$. \end{enumerate}
example[Spatial Dependence] This example is proposed by BCH. Suppose we have $n$ individuals indexed by $l$. The location of the $l$-th individual is denoted as $s_l$, an $m$-dimensional integer. The distance between individual $l_1$ and $l_2$ is measured by the maximum coordinatewise metric $\text{dist}(l_1,l_2) = ||s_{l_1}-s_{l_2}||_\infty$. Observation $D$ is indexed by the location so that $D_l = D_{s_l}$ for $l \in [n]$. The clusters $I_{n,j}$ for $j \in [J]$ are defined as disjoint regions ($\Lambda_1,\cdots,\Lambda_J$). Let $\mathcal{F}_{\Lambda}$ be the $\sigma$-field generated by a given random field $D_s$, $s \in \Lambda$ with $\Lambda$ compact and let $|\Lambda|$ be the number of $s \in \Lambda$. Let $\Upsilon_{\Lambda_1,\Lambda_2}$ denote the minimum distance from an element of $\Lambda_1$ to an element of $\Lambda_2$ where the distance is measured by the maximum coordinatewise metric. The mixing coefficient is then \begin{align*} \alpha_{k_1,k_2}(l) & = \sup\{ \mathbb P(A \cap B) - \mathbb P(A)\mathbb P( B) \}, \\ & s.t. \quad A \in \mathcal{F}_{\Lambda_1}, B \in \mathcal{F}_{\Lambda_2}, |\Lambda_1| \leq k_1, \quad |\Lambda_2| \leq k_2, \Upsilon(\Lambda_1,\Lambda_2) \geq l. \end{align*} Bester-Conley-Hansen(2011) assume the mixing coefficients satisfy (1) $\sum_{l = 1}^\infty l^{m-1} \alpha_{1,1}(l)^{\delta_1/(2+\delta_1)}<\infty$, (2) $\sum_{l = 1}^\infty l^{m-1} \alpha_{k_1,k_2}(l)<\infty$ for $k_1+k_2\leq 4$, and (3) $\alpha_{1,\infty}(l) = O(l^{-m-\delta_2})$ for some $\delta_1>0$ and $\delta_2>0$. Under this assumption and other regularity conditions in their Assumptions 1 and 2, Bester-Conley-Hansen(2011) verifies (ref) with a finite number of clusters ($J$ fixed) and $r_n = \sqrt{n}$.
example[Network Dependence] Suppose we observe $n$ units indexed by $\ell \in [n]$ and an adjacency matrix $\mathcal{A} = \{A_{\ell,\ell'}\}$, where $A_{\ell,\ell'} = 1$ means units $\ell$ and $\ell'$ are linked and $A_{\ell,\ell'} = 0$ means otherwise. We extend the linear-in-means social interaction model studied by BDF09 to the IVQR model. Specifically, we have \begin{align} y_\ell = \delta_0(U_\ell) + \beta(U_\ell) \frac{\sum_{\ell': A_{\ell,\ell'}=1}y_{\ell'}}{n_\ell} + \delta_1(U_\ell) B_\ell + \delta_2(U_\ell) \frac{\sum_{\ell': A_{\ell,\ell'}=1}B_{\ell'}}{n_\ell}, \end{align} where $n_\ell = |\ell': A_{\ell,\ell'}=1|$ denotes the $\ell$-th node's number of friends and $B_\ell$ represents the $\ell$-th node's background characteristics, and we assume that $U_\ell$ is independent of $\{B_{\ell'}\}_{\ell' \in [n]}$ and follow the uniform distribution on $(0,1)$. In this setup, we have the endogenous variable $X_\ell = \frac{\sum_{\ell': A_{\ell,\ell'}=1}y_{\ell'}}{n_\ell}$, the control variables $W_\ell = (1, B_\ell, \frac{\sum_{\ell': A_{\ell,\ell'}=1}B_{\ell'}}{n_\ell})^\top$, and $\gamma(U_\ell) = (\delta_0(U_\ell), \delta_1(U_\ell), \delta_2(U_\ell))^\top$. Following the literature, we assume the adjacency matrix is independent of $\{B_\ell,\varepsilon_\ell\}_{\ell \in [n]}$. Further suppose $X_\ell \beta(u) + W_\ell^\top \gamma(u)$ is monotonically increasing in $u$, then we have \begin{align*} \mathbb P\left(y_\ell \leq X_\ell \beta(\tau) + W_\ell^\top \gamma(\tau)| \{B_{\ell}\}_{\ell \in [n]} \right) = \mathbb P\left(U_\ell \leq \tau| \{B_{\ell}\}_{\ell \in [n]} \right) = \tau. \end{align*} BDF09 showed that one can use $Z = \tilde A^2 B$ as the IV, where $\tilde A$ is the $n \times n$ normalized adjacency matrix with a typical entry $\tilde A_{\ell,\ell'} = A_{\ell,\ell'}/n_{\ell}$ and $B$ is a $n \times 1$ vector of $\{B_\ell\}_{\ell \in [n]}$. Then, by the law of iterated expectation, we have \begin{align*} \mathbb P\left(y_\ell \leq X_\ell \beta(\tau) + W_\ell^\top \gamma(\tau)| W_{\ell},Z_\ell \right) = \tau \end{align*} so that (ref) holds. For inference, we can then follow L22 to partition the nodes (i.e., $\{I_{n,j}\}_{j \in [J]}$) in the network and construct clusters. Specifically, for a subset of indexes $S \subset [n]$, define the conductance of $S$ as $\phi_{\mathcal{A}}(S) = \frac{|\partial_{\mathcal{A}}(S)|}{vol_A(S)}$, where $|\partial_{\mathcal{A}}(S)| = \sum_{\ell \in S}\sum_{\ell' \in [n]/S}{\mathcal{A}}_{\ell,\ell'}$ is the number of links involving a unit in $S$ and a unit not in $S$ and $vol_{\mathcal{A}}(S) = \sum_{\ell \in S}\sum_{\ell' \in [n]}\mathcal{A}_{\ell,\ell'}$ is the sum of degrees $\sum_{\ell' \in [n]}{\mathcal{A}}_{\ell,\ell'}$ of units $\ell \in S$. Then, L22 shows (ref) holds with a finite number of clusters ($J$ fixed) and $r_n = \sqrt{n}$ when $\max_{j \in [J]}\phi_\mathcal{A}(I_{n,j}) (\frac{1}{n}\sum_{\ell \in [n]}\sum_{\ell' \in [n]}\mathcal{A}_{\ell,\ell'})\rightarrow 0$ as $n \rightarrow \infty$ and the observations exhibit weak network dependence in the sense of L22.\footnote{To be more specific, L22 shows (ref) holds when $\Upsilon$ contains a finite and fixed number of quantile indexes.Extending his result to cover a continuum of quantile indexes is plausible but outside the scope of this paper. } As the partition $\{I_{n,j}\}_{j \in [J]}$ are unobserved, L22 further showed that it is possible to recover the clusters by spectral clustering, a method that clusters the leading $J$ eigenvectors of network graph Laplacian by the k-means algorithm. We provide more details about the spectral clustering in Section (ref).
example[Factor Structure] As mentioned in the Introduction, our asymptotic framework, which treats the number of clusters as fixed, follows previous studies such as IM, BCH, and CRS. We emphasize that the main restriction of such an asymptotic framework is it requires the within-cluster dependence to be sufficiently weak for some CLT to hold within each cluster (as illustrated in Examples (ref)-(ref)). For example, as pointed out by mackinnon2022cluster, this requirement rules out the case where the error follows a factor structure, i.e., for $\varepsilon_{i,j}(\tau) = y_{i,j} - X_{i,j} \beta_n(\tau) - W_{i,j}^\top \gamma_n(\tau)$ in the current IVQR model, \begin{align} \varepsilon_{i,j}(\tau) = \lambda_{i,j}(\tau) f^s_{j}(\tau) + u_{i,j}(\tau), \end{align} where $u_{i,j}(\cdot)$ denotes the idiosyncratic error, $f^s_j(\cdot)$ denotes the cluster-wide shock, and $\lambda_{i,j}(\cdot)$ is the factor loading. By contrast, such a dependence structure can be handled under the asymptotic framework that lets the number of clusters $J$ diverge to infinity. However, we conjecture that our gradient wild bootstrap procedure is also valid under the alternative asymptotic framework with a large number of small clusters (more discussions are provided in Remark (ref)).
example[Cluster Fixed Effects] If cluster fixed effects exist in the IVQR model, we can add cluster dummies into the control variables $W$. In our setting, the number of clusters is fixed so that even $W$ includes cluster dummies, it still has a fixed dimension, and all our assumptions can still hold. We also note that in the case with linear regressions, adding cluster dummies is equivalent to first projecting out the fixed effects so that $(y_{i,j}, X_{i,j}, W_{i,j}, Z_{i,j})$ is expressed as deviations from cluster means, which is also recommended by Djogbenou-Mackinnon-Nielsen(2019) and mackinnon2022cluster. However, we emphasize that in the current setting with quantile regressions, cluster-level demeaning and adding cluster dummies are not equivalent to each other.
example[Heterogeneous IV Strength Across Clusters] As mentioned in the Introduction, we allow for cluster-level heterogeneity with regard to IV strength. For instance, we can consider the following first-stage regression: \begin{align*} X_{i,j} = Z_{i,j}^\top \Pi_{z,j,n} + W_{i,j}^\top \Pi_{w,j,n} + E_{i,j}, \end{align*} Then, our model (ref) allows for both $\Pi_{z,j,n}$ and $\Pi_{w,j,n}$ to vary across clusters. In this case, the Jacobian $Q_{\Phi, X,j}(\tau)$ for the $j$-th cluster takes the form of \begin{align*} Q_{\Phi, X,j}(\tau) = \lim_{n \rightarrow \infty} \overline{\mathbb{P}}_{n,j}f_{\varepsilon_{i,j}(\tau)}(0|W_{i,j},Z_{i,j})\Phi_{i,j}(\tau)Z_{i,j}^\top \Pi_{z,j,n} V_{i,j}(\tau). \end{align*} In particular, our bootstrap Wald tests (i.e., $T_n$ and $T_{CR,n}$) are still valid even when $\Pi_{z,j,n}$, and thus, $Q_{\Phi, X,j}(\tau)$ decay to or are zero for some of the clusters. Our bootstrap AR tests (i.e., $AR_n$ and $AR_{CR,n}$) control asymptotic size even when $\Pi_{z,j,n}$ decay to or are zero for all clusters.
example[Heterogeneous Slope for the Endogenous Variable] Similar to Canay-Santos-Shaikh(2020), we cannot allow for $\beta_n(\tau)$ in (ref) to be heterogeneous across clusters, denoted as $(\beta_{n,j}(\tau))_{j \in [J]}$. More specifically, in this case, the IVQR estimator based on the full sample will estimate $\tilde \beta(\tau)$, a certain weighted average of $(\beta_{n,j}(\tau))_{j \in [J]}$. Then, in Assumption (ref), we have \begin{align*} \tilde{f}_{\tau}(D_{i,j},\beta_n(\tau),\gamma_n(\tau),0) = (\tau - 1\{X_{i,j}(\beta_j(\tau) - \tilde \beta(\tau))+\varepsilon_{i,j}(\tau)\leq 0\})\Phi_{i,j}(\tau)V_{i,j}(\tau), \end{align*} so that Assumption (ref)(ii) is violated.
example[Cluster-level Endogenous Variable] If $X_{i,j}$ is a cluster-level variable (say, $X_j$), then the within-cluster limiting Jacobian $Q_{\Psi, X,j}(\tau)$ may be random and potentially correlated with the within-cluster score component $\mathcal{Z}_j$ (as $X_{j}$ is endogenous), which violates Assumption (ref)(iii). We notice that similar issues can arise with the approaches of BCH, IM, and CRS. On the other hand, our bootstrap weak-instrument-robust tests remain valid in this case as they do not depend on $Q_{\Psi, X,j}(\tau)$.

Construction of Instruments

In Assumption (ref)(i) above, we require the IVs to satisfy the following condition: for $j \in [J]$,

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

where $\varepsilon_{i,j}(\tau) = y_{i,j} - X_{i,j}\beta_n(\tau) - W_{i,j}^\top \gamma_n(\tau)$ and $f_{\varepsilon_{i,j}(\tau)}(0|W_{i,j},Z_{i,j})$ is the conditional PDF of $\varepsilon_{i,j}(\tau)$ given $(W_{i,j},Z_{i,j})$ and evaluated at $0$. This section proposes three ways to construct IVs that satisfy this requirement.

remark[Parametric Approach] Suppose $Z_{i,j} = G(W_{i,j},\pi) + U_{i,j} \in \Re^{d_z}$ such that $\pi$ is a finite dimensional parameter, $G(\cdot)$ is a known $d_z$-dimensional function (e.g., $G(w,\pi) = w^\top \pi$), and $U_{i,j}$ is a random shock such that $U_{i,j} \perp\!\!\!\perp \varepsilon_{i,j}| W_{i,j}$ and $\mathbb E(U_{i,j}|W_{i,j}) = 0$. Furthermore, let $\hat \lambda$ be the regression coefficient of $Z_{i,j}$ in the linear (first-stage) regression of $X_{i,j}$ on $Z_{i,j}$ and $W_{i,j}$ using the full sample and $\lambda$ be the probability limit of $\hat \lambda$. Then, we can let $\Phi_{i,j} = \lambda^\top U_{i,j} \in \Re$ and its feasible version be \begin{align*} \hat \Phi_{i,j} = \hat \lambda^\top (Z_{i,j} - G(W_{i,j},\hat \pi)), \end{align*} where $\hat \pi$ is a consistent estimator of $\pi$.\footnote{When $G(w,\pi) = w^\top \pi$, we can compute $\hat \pi$ as the coefficient of $W_{i,j}$ in the linear regression of $Z_{i,j}$ on $W_{i,j}$ using observations in the full sample.} We can see that, if $V_{i,j}(\tau) = 1$, then \begin{align*} \overline{\mathbb{P}}_{n,j} f_{\varepsilon_{i,j}(\tau)}(0|W_{i,j}, Z_{i,j})W_{i,j} \Phi_{i,j}^\top & = \overline{\mathbb{P}}_{n,j} f_{\varepsilon_{i,j}(\tau)}(0|W_{i,j},Z_{i,j})W_{i,j} U_{i,j}^\top \lambda \\ & = \overline{\mathbb{P}}_{n,j} f_{\varepsilon_{i,j}(\tau)}(0|W_{i,j}) W_{i,j} \mathbb E(U_{i,j}^\top|W_{i,j}) \lambda = 0. \end{align*} The key benefit of this approach is that it does not require nonparametric estimation of the conditional density and, thus, the tuning parameters. The way to convert the potentially multi-dimensional IVs into one via the least squares estimator $\hat \lambda$ is also recommended by Chernozhukov-Hansen(2006). For example, in their application of IVQR to Angrist-Krueger(1991)'s dataset for the study of returns to schooling, Chernozhukov-Hansen(2006) used the linear projection of years of schooling, the endogenous variable, onto covariates and three quarter-of-birth dummy variables (i.e., three-dimensional IVs). However, efficiency may instead be improved by choosing $\hat \Phi_{i,j}(\tau)$ and $\hat V_{i,j}(\tau)$ appropriately.
remark[Nonparametric Approach] To enforce Neyman-orthogonality between IVs and control variables, we follow CHW20 and partial out the effect of $W_{i,j}$ from $Z_{i,j}$. Specifically, for the current nonparametric approach, we construct $\hat{\Phi}_{i,j}(\tau)$ as $\hat{\Phi}_{i,j}(\tau) = \hat Z_{i,j}- \hat{\chi}^\top(\tau)W_{i,j}$, where $\hat Z_{i,j} = (Z_{i,j}^\top,W_{i,j}^\top) \hat \lambda$ and $\hat \lambda$ contains the regression coefficients of both $Z_{i,j}$ and $W_{i,j}$ in the linear (first-stage) regression of $X_{i,j}$ on $Z_{i,j}$ and $W_{i,j}$ using the full sample. To compute $\hat{\chi}(\tau)$, we first need to compute the residual $\hat{\underline{\varepsilon}}_{i,j}(\tau)$. Specifically, let \begin{align} \hat{\varepsilon}_{i,j}(\tau) = Y_{i,j} - X_{i,j} \beta_0(\tau) - W_{i,j}^\top \hat{\gamma}(\beta_0(\tau),\tau), \end{align} where $\hat{\gamma}(\beta_0(\tau),\tau)$ is defined in (ref) with $\hat \Phi_{i,j}(\tau) = \hat Z_{i,j}$ and $\beta_0(\tau)$ is the null hypothesis. Under the null and local alternative, we have $\sup_{\tau \in \Upsilon}||\hat{\gamma}(\beta_0(\tau),\tau) - \gamma_n(\tau)||_2 = O_p(r_n^{-1})$ so that $\hat{\underline{\varepsilon}}_{i,j}(\tau)$ can approximate the true error $\varepsilon_{i,j}(\tau)$ well. In addition, let $K(\cdot)$ be a symmetric kernel function and $(h_1,h_2)$ be bandwidths. Then, we compute $\hat \chi$ as \begin{align} \hat{\chi}(\tau) = \hat{Q}_{W,W}(\tau) \hat{Q}^{-}_{W,W}(\tau) \hat{Q}^{-}_{W,W}(\tau)\hat{Q}_{W,Z}(\tau) \end{align} where \begin{align} \hat{Q}_{W,W}(\tau) = \mathbb{P}_{n} \left( \frac{1}{h_1}K\left(\frac{\hat{\underline{\varepsilon}}_{i,j}(\tau)}{h_1}\right)V_{i,j}(\tau)W_{i,j}W_{i,j}^\top\right), \quad \text{and} \end{align} \begin{align} \hat{\underline{Q}}_{W,Z}(\tau) = \mathbb{P}_{n} \left( \frac{1}{h_2}K\left(\frac{\hat{\underline{\varepsilon}}_{i,j}(\tau)}{h_2}\right)V_{i,j}(\tau)W_{i,j} \hat Z_{i,j} \right). \end{align} For a symmetric and positive semidefinite matrix $A$, $A^-$ is its generalized inverse. We suggest using the uniform kernel $K(u) = 1\{|u| \leq 1\}/2 $. Kato12 has derived the rule-of-thumb bandwidths for both independent and weakly dependent data: \begin{align*} h_1 & = \hat{s} \left[\frac{4.5 \mathbb P_n \hat V_{i,j}(\tau) ||W_{i,j}||_2^4 }{q(\tau) \left\Vert \mathbb P_n \hat V_{i,j}(\tau) W_{i,j}W_{i,j}^\top \right\Vert_F^2} \right]^{1/5}n^{-1/5}, \\ h_2 & = \hat{s} \left[\frac{4.5 \mathbb P_n \hat V_{i,j}(\tau) ||W_{i,j}||_2^2 \hat Z_{i,j}^2 }{q(\tau) \left\Vert \mathbb P_n \hat V_{i,j}(\tau) W_{i,j}\hat Z_{i,j} \right\Vert_F^2} \right]^{1/5}n^{-1/5}, \end{align*} where $q(\tau) = (1-F_N^{-1}(\tau))^2 f_N(F_N^{-1}(\tau))$, $F_N(\cdot)$ and $f_N(\cdot)$ are the distribution and density functions of the standard normal distribution, respectively, and $\hat{s}$ is the sample standard error of $\{\underline{\hat{\varepsilon}}_{i,j}\}_{i \in I_{n,j}},j\in [J]\}$. This approach is valid given that there exists $\chi_{n,j}(\tau)$ such that \begin{align} Q_{W,Z,j}(\tau) = Q_{W,W,j}(\tau)\chi_{n,j}(\tau) \quad \text{and} \quad \overline{\mathbb{P}}_{n,j}||W_{i,j}^\top(\chi(\tau) - \chi_{n,j}(\tau))||_{op}^2 = o(1), \end{align} where $Q_{W,W,j}(\tau)$ is defined in Assumption (ref)(vi) and $Q_{W,Z,j}(\tau)$ is defined in the same manner, while $Q_{W,W}(\tau)$, $Q_{W,Z}(\tau)$, and $ \chi(\tau) = Q_{W,W}^{-1}(\tau)Q_{W,Z}(\tau)$ are the probability limits of $\hat{\underline{Q}}_{W,W}(\tau)$, $\hat{\underline{Q}}_{W,Z}(\tau)$, and $\hat \chi(\tau)$, respectively. The requirement in (ref) is similar in spirit to Canay-Santos-Shaikh(2020). Canay-Santos-Shaikh(2020) further pointed out that one sufficient but not necessary condition for (ref) is that the distributions of $(Z^{\top}_{i,j}, W^{\top}_{i,j})_{i \in I_{n,j}}$ are the same across clusters. Note this still allows for heterogeneous IV strength in the first stage. In Section (ref) of the Online Supplement, we further provide regularity conditions, which, along with (ref), imply $\hat{\Phi}_{i,j}(\tau)$ satisfies Assumption (ref)(i). Furthermore, we note that the concerns about the presence of tuning parameters are mitigated for two reasons. First, we do not suffer from the curse of dimensionality because $\underline{\hat{\varepsilon}}_{i,j}$ is a scalar. Second, we aim to estimate consistently, rather than make inferences of, $Q_{W,W}(\tau)$ and $Q_{W,Z}(\tau)$, and thus, other automatic bandwidths such as cross validation can be well integrated into our bootstrap method. We also emphasize that unlike the estimation of $\Sigma_j$ defined in Assumption (ref)(ii), the consistency of $\underline{\hat{Q}}_{W,W}(\tau)$ and $\underline{\hat{Q}}_{W,\Phi}(\tau)$ holds under general weak dependence of observations within clusters, and importantly, does not require us to specify this dependence structure.
remark[Cluster-level Estimation] In the two above examples, we estimate the parameters $(\pi,\chi(\tau))$ using all the observations. To allow for the case where the coefficients may be heterogeneous across clusters, we can estimate them at the cluster level instead. Specifically, for the parametric approach, if $G(w,\pi_j) = w^\top \pi_j$, then we can estimate $\pi_j$ by the OLS regression of $Z_{i,j}$ on $W_{i,j}$ using observations in the $j$-th cluster. For the nonparametric approach, we can let $\hat{\Phi}_{i,j}(\tau) = \hat Z_{i,j}- \hat{\chi}_j^\top(\tau)W_{i,j}$, where $\hat \chi_j$ is defined as \begin{align} \hat{\chi}_j(\tau) = \hat{Q}_{W,W,j}(\tau) \hat{Q}^{-}_{W,W,j}(\tau) \hat{Q}^{-}_{W,W,j}(\tau) \hat{Q}_{W,Z,j}(\tau), \end{align} where \begin{align} \hat{Q}_{W,W,j}(\tau) = \mathbb{P}_{n,j} \left( \frac{1}{h_{3,j}}K\left(\frac{\hat{\varepsilon}_{i,j}(\tau)}{h_{3,j}}\right)V_{i,j}(\tau)W_{i,j}W_{i,j}^\top\right), \quad \text{and} \end{align} \begin{align} \hat{\underline{Q}}_{W,Z,j}(\tau) = \mathbb{P}_{n,j} \left( \frac{1}{h_{4,j}}K\left(\frac{\hat{\underline{\varepsilon}}_{i,j}(\tau)}{h_{4,j}}\right)V_{i,j}(\tau)W_{i,j} \hat Z_{i,j}^\top \right). \end{align} This definition allows for $\underline{\hat{Q}}_{W,W,j}(\tau)$ to be non-invertible for some but not all clusters. Then, following Kato12, we can use the uniform kernel $K(u) = 1\{|u| \leq 1\}/2 $ and the rule of thumb bandwidths : \begin{align*} h_{3,j} & = \hat{s}_j \left[\frac{4.5 \mathbb P_{n,j} \hat V_{i,j}(\tau) ||W_{i,j}||_2^4 }{q(\tau) \left\Vert \mathbb P_{n,j} \hat V_{i,j}(\tau) W_{i,j}W_{i,j}^\top \right\Vert_F^2} \right]^{1/5}n_j^{-1/5} \\ h_{4,j} & = \hat{s}_j \left[\frac{4.5 \mathbb P_{n,j} \hat V_{i,j}(\tau) ||W_{i,j}||_2^2 ||\hat Z_{i,j}||_2^2 }{q(\tau) \left\Vert \mathbb P_{n,j} \hat V_{i,j}(\tau) W_{i,j}\hat Z_{i,j}^\top \right\Vert_F^2} \right]^{1/5}n_j^{-1/5}, \end{align*} where $\hat{s}_j$ is the sample standard error of $\{\underline{\hat{\varepsilon}}_{i,j}\}_{i \in I_{n,j}}$. In Section (ref) of the Online Supplement, we also provide the regularity conditions that imply $\hat{\Phi}_{i,j}(\tau)$ constructed from the cluster-level estimation satisfies Assumption (ref)(i). We note that in the dataset, if there exist some clusters with rather few numbers of observations, then the finite-sample performance of the cluster-level estimation may be negatively affected. In this case, we recommend first merging such small clusters into larger ones or using the full-sample estimation approaches described in Remarks (ref) and (ref) instead.

Inference for Wald Statistics

Denote $Q_{\Psi,\Psi}(\tau) = \sum_{j \in [J]}\xi_jQ_{\Psi,\Psi,j}(\tau)$, $Q_{\Psi,X}(\tau) = \sum_{j \in [J]} \xi_j Q_{\Psi,X,j}(\tau)$, $Q_{\Phi,X,j}(\tau) = \omega Q_{\Psi,X,j}(\tau)$, and $Q_{\Phi,X}(\tau) = \sum_{ j \in [J]} \xi_j Q_{\Phi,X,j}(\tau)$, where $\omega = (0_{d_\phi \times d_w}, \mathbb{I}_{d_\phi})$.

assumption\begin{enumerate}[label=(\roman*)] • There are compact subsets $\mathcal{R}$ and $\Theta$ of $\textbf{R}^{d_w}$ and $\textbf{R}^{d_\phi}$, respectively, such that Jacobian matrix $\frac{\partial}{\partial(b^\top,r^\top)}\Pi(b,r,0,\tau)$ is continuous and has full column rank, uniformly in $n$ and over $\mathcal{B} \times \mathcal{R} \times \Theta \times \Upsilon$.\footnote{For a sequence of matrices $A_n(v)$ indexed by $v \in \mathcal{V}$ and $n$, we say that $A_n(v)$ is of full column rank uniformly over $v \in \mathcal{V}$ and $n$ if $\inf_{v \in \mathcal{V}, n \rightarrow \infty}\lambda_{\min}(A_n^\top(v)A_n(v)) \geq \underline{c}>0, $ for some constant $\underline{c}$.} • The image of $\mathcal{B} \times \mathcal{R}$ under the mapping $(b,r) \mapsto \Pi(b,r,0,\tau)$ is simply connected. • Suppose $\sup_{\tau \in \Upsilon}||\hat{A}_1(\tau) - A_1 (\tau)||_{op} = o_p(1)$, where $A_1(\tau)$ is a symmetric $d_\phi \times d_\phi$ deterministic matrix such that $0<c\leq \inf_{\tau \in \Upsilon}\lambda_{\min}(A_1 (\tau)) \leq \sup_{\tau \in \Upsilon}\lambda_{\max}(A_1 (\tau)) \leq C<\infty, \text{and}$ \begin{align*} 0<c\leq & \inf_{\tau \in \Upsilon}\left(Q_{\Phi,X}^\top(\tau) Q_{\Phi,\Phi}^{-1}(\tau) A_1 (\tau) Q_{\Phi,\Phi}^{-1} Q_{\Phi,X}(\tau) \right) \\ \leq & \sup_{\tau \in \Upsilon}\left(Q_{\Phi,X}^\top(\tau) Q_{\Phi,\Phi}^{-1}(\tau) A_1 (\tau) Q_{\Phi,\Phi}^{-1} Q_{\Phi,X}(\tau) \right) \leq C < \infty \end{align*} for some constants $c,C$. \end{enumerate}
remarkAssumptions (ref)(i) and (ref)(ii) are Assumptions R$5^*$ and R$6^*$ in Chernozhukov-Hansen(2008a). They, along with Assumption (ref), imply that $\beta_n(\tau)$ is uniquely defined. Second, by Chernozhukov-Hansen(2006), under Assumptions (ref) and (ref)(i)--(ref)(iii), $(\beta_n(\tau),\gamma_n(\tau))$ uniquely solves the system of equations $\mathbb{E}(\tau - 1\{y_{i,j} \leq X_{i,j} b + W_{i,j}^\top r \})\Psi_{i,j}(\tau)V_{i,j}(\tau) = 0$. Third, Assumption (ref)(iii) implies $Q_{\Phi,X}(\tau)$ is of full column rank, and thus, $\beta_n(\tau)$ is strongly identified. However, it allows for the presence of weak IV clusters. Specifically, let us define \begin{align} a_j(\tau) = \Gamma(\tau) Q_{\Psi,X,j}(\tau) = \tilde \Gamma(\tau)Q_{\Phi,X,j}(\tau), \end{align} and \begin{align} \Gamma(\tau) &= \left[Q_{\Psi,X}^\top(\tau) Q_{\Psi,\Psi}^{-1}(\tau) \omega^\top A_1 (\tau) \omega Q_{\Psi,\Psi}^{-1}(\tau) Q_{\Psi,X}(\tau)\right]^{-1}Q_{\Psi,X}^\top(\tau) Q_{\Psi,\Psi}^{-1}(\tau) \omega^\top A_1 (\tau) \omega Q_{\Psi,\Psi}^{-1}(\tau), \notag \\ \tilde\Gamma(\tau) &= \left[Q_{\Phi,X}^\top(\tau) Q_{\Phi,\Phi}^{-1}(\tau) A_1(\tau) Q_{\Phi,\Phi}^{-1}(\tau) Q_{\Phi,X}(\tau)\right]^{-1}Q_{\Phi,X}^\top(\tau) Q_{\Phi,\Phi}^{-1}(\tau) A_1(\tau) Q_{\Phi,\Phi}^{-1}(\tau). \end{align} Here, $a_j(\tau)$ measures the identification strength of the $j$-th cluster and $\sum_j \xi_j a_j(\tau) = 1$ by construction. We say the $j$-th cluster is a weak IV cluster if $||Q_{\Phi,X,j}(\tau)||_2 = 0$, which implies $a_j(\tau) = 0$. In contrast, the $j$-th cluster is a strong IV cluster if $a_j(\tau) \neq 0$. When there exist $j \in [J]$ such that $a_j(\tau)=0$, the inference procedures that are based on cluster-level IVQR estimators of $\beta_n(\tau)$ (e.g., $\hat{\beta}_{j}(\tau)$ for $j \in [J]$) can become invalid,\footnote{For example, the identification for the $j$-th cluster may be too weak for $\hat{\beta}_j(\tau)$, the IVQR estimator of the $j$-th cluster, to retain consistency. In this case, the inference methods based on cluster-level estimators will become invalid.} while our gradient bootstrap procedure remains valid, provided that the overall identification, captured by $Q_{\Phi,X}(\tau)$, is strong.
assumption\begin{enumerate}[label=(\roman*)] • Suppose $\sup_{\tau \in \Upsilon}|\hat{A}_2(\tau) - A_2(\tau)| = o_p(1)$, where $A_2(\tau)$ is deterministic and $0 < c \leq A_2(\tau) \leq C <\infty,$ for some constants $c,C$. • Suppose there exists a subset $\mathcal J_s$ of $[J]$ such that $\inf_{j \in \mathcal J_s,\tau \in \Upsilon}a_j(\tau)\geq c_0>0$ and $a_{j}(\tau) = 0$ for $(j,\tau) \in ([J] \backslash \mathcal J_s) \times \Upsilon$, where $a_j(\tau)$ is defined in ((ref)). Further denote $J_s = |\mathcal J_s|$, which satisfies $$\lceil |\textbf{G}|(1-\alpha) \rceil \leq |\textbf{G}|-2^{J-J_s+1}.$$ \end{enumerate}
theoremSuppose Assumptions (ref)-(ref) and (ref)(i) hold. Then under $\mathcal{H}_0$ defined in ((ref)), that is, $\mu_{\beta}(\tau) = 0$ for $\tau \in \Upsilon$, \begin{align*} \alpha - \frac{1}{2^{J-1}} \leq \liminf_{n \rightarrow \infty} \mathbb{P}(T_{n} > \hat{c}_{n}(1-\alpha)) \leq \limsup_{n \rightarrow \infty} \mathbb{P}(T_{n} > \hat{c}_{n}(1-\alpha)) \leq \alpha + \frac{1}{2^{J-1}}. \end{align*} In addition, if Assumption (ref)(ii) holds, then under $\mathcal{H}_{1,n}$ defined in ((ref)), \begin{align*} \lim_{\sup_{\tau \in \Upsilon}|\mu_{\beta}(\tau)| \rightarrow \infty} \liminf_{n \rightarrow \infty}\mathbb{P}(T_{n} > \hat{c}_{n}(1-\alpha)) = 1. \end{align*}
remarkTheorem (ref) shows that the $T_n$-based gradient wild bootstrap test controls size asymptotically when at least one of the clusters is strong. The error $1/2^{J-1}$ can be viewed as the upper bound for the asymptotic size distortion, which vanishes exponentially with the total number of clusters rather than the number of strong IV clusters. Intuitively, although the weak IV clusters do not contribute to the identification of $\beta_n$, the scores of such clusters, i.e., $r_n\mathbb{P}_{n,j}\tilde{f}_{\tau}(D,\beta_n(\tau),\gamma_n(\tau),0)$ for $j \in ([J] \backslash \mathcal J_s)$, still contribute to the limiting distribution of the IVQR estimator, which in turn determines the total number of possible sign changes in the bootstrap Wald statistic.
remarkFurthermore, Theorem (ref) shows that the gradient wild bootstrap test has power against $r_n^{-1}$-local alternatives if further Assumption (ref)(ii) holds. To see why Assumption (ref)(ii) is needed, note that our procedure compares the test statistic $T_n$ with the critical value $\hat c_n(1-\alpha)$, where $T_n$ is asymptotically equivalent to $T^*_n (\iota_J)$, i.e., the bootstrap test statistic with $g$ equal to a $J \times 1$ vector of ones, and the critical value $\hat c_n(1-\alpha)$ is just the $\lceil |\textbf{G}|(1-\alpha) \rceil$-th order statistic of $\{T^*_n (g)\}_{ g \in \textbf{G}}$. In the proof of Theorem (ref), we show that when $|\mu_{\beta}(\tau)| \rightarrow \infty$ and the signs of $g_j$ for all strong IV clusters are the same (only weak IV clusters have different signs), $T^*_n (g)$ is equivalent to $T^*_n (\iota_J)$, and thus, $T_n$, even under the alternative. Intuitively, the effect of $|\mu_{\beta}(\tau)|$ on the asymptotic behaviour of $T_n^*(g)$ is only manifested through sign changes on those strong IV clusters (the effect of sign changes from the weak IV clusters becomes negligible). Let us denote the set of $g$'s that only flip the sign of weak IV clusters as $\textbf{G}_w = \{g: g_j = g_{j'}, \forall j, j' \in \mathcal J_s\}$. Given there are $J_s$ strong IV clusters, the cardinality of $\textbf{G}_w$ is $2^{J-J_s+1}$. To establish the power against $\mathcal{H}_{1,n}$ in Theorem (ref), we request that our bootstrap critical value $\hat c_n(1-\alpha)$ does not take values of $T^*_n(g)$ for $g \in \textbf{G}_w$ because otherwise the test statistic $T_n$ and the critical value are asymptotically equivalent even under the alternative. This implies \begin{align*} \lceil |G|(1-\alpha) \rceil \leq |G|-2^{J-J_s+1}. \end{align*} Therefore, we need a sufficient number of strong IV clusters to establish the power result. For instance, the condition $\lceil |\textbf{G}|(1-\alpha) \rceil \leq |\textbf{G}|-2^{J-J_s+1}$ requires that $J_s \geq 5$ and $J_s \geq 6$ for $\alpha=10\%$ and $5\%$, respectively. Theorem (ref) suggests that although the size of the gradient wild bootstrap test is well controlled even with only one strong IV cluster, its power depends on the number of strong IV clusters.
remarkWe conjecture that when $\beta_n(\tau)$ is strongly identified, our gradient wild bootstrap-based Wald inference procedure is also valid for IVQR under the alternative asymptotic framework with a large number of small clusters (e.g., see Hagemann(2017) in the QR context). Specifically, to establish bootstrap validity in this case, we need to impose regularity conditions similar to those in Hagemann(2017) and show that conditional on the data, as the number of small clusters diverges, the distribution of the resampling process for the bootstrap IVQR estimator $r_n(\hat \beta^* (\tau) - \hat \beta (\tau) )$ is approximately the same as that of the sampling process $r_n(\hat \beta (\tau) - \beta_0(\tau))$ under the null. However, such arguments for the consistency of the bootstrap distribution are rather different from the randomization test perspective underlying the proof of Theorem (ref). For the conciseness of the paper, we leave this direction of investigation for future research.

We need the following assumption for the Wald inference of IVQR with CRVE.

assumption\begin{enumerate}[label=(\roman*)] • Suppose \begin{align*} \sup_{\tau \in \Upsilon}|| \hat G(\tau) - G(\tau)||_{op} = o_p(1), \end{align*} where $\inf_{\tau \in \Upsilon}(G^\top(\tau) G(\tau)) \geq c>0$ for some constant $c$ and $\hat G(\tau)$ is defined in (ref). • Let $b_j(\tau) = G^\top (\tau)Q_{\Phi,X,j}(\tau)$ and \begin{align*} v_{j}^\top(\tau) = -[\xi_1,\cdots,\xi_J] \otimes (b_j(\tau) \tilde \Gamma(\tau)) + [0_{d_\phi(j-1)}^\top, G^\top (\tau),0_{d_\phi(J-j)}^\top] \in \Re^{1 \times d_\phi J}, \end{align*} where $\tilde \Gamma(\tau) = \omega \Gamma(\tau)$. Then, the rank of $[v_{1}(\tau),\cdots,v_{J}(\tau)] \in \Re^{(d_\phi J) \times J}$ is strictly greater than 1 uniformly over $\tau \in \Upsilon$. \end{enumerate}
remarkAssumption (ref)(i) guarantees that the CRVE $\hat{A}_{CR}(\tau)$ is invertible and the corresponding test statistic $T_{CR,n}$ does not degenerate. Assumption (ref)(ii) is a rank condition, which holds in general when $J>1$.
theoremSuppose Assumptions (ref)--(ref) and (ref) hold. Then under $\mathcal{H}_0$ defined in ((ref)), that is, $\mu_{\beta}(\tau) = 0$ for $\tau \in \Upsilon$, \begin{align*} \alpha - \frac{1}{2^{J-1}} \leq \liminf_{n \rightarrow \infty} \mathbb{P}(T_{CR,n} > \hat{c}_{CR,n}(1-\alpha)) \leq \limsup_{n \rightarrow \infty} \mathbb{P}(T_{CR,n} > \hat{c}_{CR,n}(1-\alpha)) \leq \alpha + \frac{1}{2^{J-1}}. \end{align*} In addition, suppose there exists a subset $\mathcal J_s$ of $[J]$ such that $\inf_{j \in \mathcal J_s, \tau \in \Upsilon}\min(|a_j(\tau)|,|b_j(\tau)|)\geq c_0>0$, $a_{j}(\tau) = b_{j}(\tau) = 0$ for $(j,\tau) \in [J] \backslash \mathcal J_s \times \Upsilon$, and $\lceil |\textbf{G}|(1-\alpha) \rceil \leq |\textbf{G}|-2^{J-J_s+1}$, where $J_s = |\mathcal J_s|$. Then under $\mathcal{H}_{1,n}$ defined in ((ref)), \begin{align*} \lim_{\sup_{\tau \in \Upsilon}|\mu_{\beta}(\tau)| \rightarrow \infty} \liminf_{n \rightarrow \infty}\mathbb{P}(T_{CR,n} > \hat{c}_{CR,n}(1-\alpha)) = 1. \end{align*}
theoremSuppose the assumptions in Theorem (ref) hold and $\Upsilon$ is a singleton. Let $$\textbf{G}(c_0) = \{ g \in \textbf{G}: |\sum_{j \in [J]} g_j \xi_j a_j(\tau)| \geq c_0\}$$ for some positive constant $c_0$. We assume there exists a constant $c_0>0$ such that $|\textbf{G}(c_0)| > |\textbf{G}| - \lceil |\textbf{G}|(1-\alpha) \rceil$. Then under $\mathcal{H}_{1,n}$ in (ref), for any $\delta>0$, there exists a constant $c_{\mu}>0$ such that when $|\mu_{\beta}(\tau)| >c_\mu$, \begin{align*} \liminf_{n \rightarrow \infty}\mathbb{P}(\phi^{cr}_n \geq \phi_n) \geq 1-\delta, \end{align*} where $\phi^{cr}_n = 1 \{ T_{CR,n} > \hat{c}_{CR,n}(1-\alpha)\}$ and $\phi_n = 1 \{ T_{n} > \hat{c}_{n}(1-\alpha) \}$.
remarkTheorem (ref) shows that similar to the $T_n$-based bootstrap test, the bootstrap test with CRVE controls size asymptotically (with a small error) as long as there exists at least one strong IV cluster, and it has power against $r_n^{-1}$-local alternative if there are a sufficient number of strong IV clusters. However, the power result in Theorem (ref) is derived using arguments very different from those for the one without CRVE. In particular, distinct from the $T_n$-based test, the local power of the $T_{CR,n}$-based test is established without the assumption that the IVQR first-stage coefficients have the same sign for all clusters, which may not hold in some empirical studies (e.g., Figure (ref)). Therefore, the power result for the bootstrap test with CRVE allows for substantially more heterogeneity in the first stage of IVQR. Furthermore, we establish in Theorem (ref) that in the case where $\Upsilon$ is a singleton (i.e., testing $\mathcal{H}_0: \beta_n(\tau)= \beta_0(\tau) \; v.s. \; \mathcal{H}_{1,n}: \beta_n(\tau) \neq \beta_0(\tau)$ for a certain quantile index $\tau$), the power of the $T_{CR,n}$-based bootstrap test dominates that based on $T_n$ with a large probability when the local parameter $\mu_{\beta}(\tau)$ is sufficiently different from zero. Specifically, in this case, we have \begin{align*} 1\{T_n > \hat{c}_{n}(1-\alpha)\} = 1\{T_{CR,n} > \tilde{c}_{CR,n}(1-\alpha)\}, \end{align*} where $\tilde{c}_{CR,n}(1-\alpha)$ denotes the $(1-\alpha)$ quantile of $\left\{ ||\hat{\beta}_g^*(\tau) -\hat{\beta}(\tau)||_{\hat{A}_{CR}(\tau)}: g \in \textbf{G}\right\}$, and $\hat{A}_{CR}(\tau)$ is the inverse of the original CRVE instead of its bootstrap analogue. Then, Theorem (ref) follows because $\tilde{c}_{CR,n}(1-\alpha) > \hat{c}_{CR,n}(1-\alpha)$ with large probability as $|\mu_{\beta}(\tau)|$ becomes sufficiently large. Intuitively, $\hat \Omega(\tau,\tau)$, and thus, $\hat A_{CR}(\tau)$ have random limits under a fixed number of clusters. We show that when $\mathcal{H}_0$ is true, the original $\hat{A}_{CR}(\tau)$ and its bootstrap counterpart $\hat{A}_{CR,g}^*(\tau)$ have the same limit distribution. By contrast, under $\mathcal{H}_{1,n}$, although the local parameter does not enter the limit distribution of $\hat{A}_{CR}(\tau)$, it does enter that of $\hat{A}_{CR,g}^*(\tau)$ because of our design of the formula in ((ref)). Then, when $\mu_{\beta}(\tau)$ is sufficiently different from zero, it becomes dominant in $\hat{A}_{CR,g}^*(\tau)$, helping to “drag down" the value of each $T^*_n(g)$ and, as a consequence, the bootstrap critical value $\hat{c}_{CR,n}(1-\alpha)$. This gives the $T_{CR,n}$-based bootstrap test a power advantage over its $T_n$-based counterpart. The assumption in Theorem (ref) that there exists a constant $c_0>0$ such that $|\textbf{G}(c_0)| > |\textbf{G}| - \lceil |\textbf{G}|(1-\alpha) \rceil$ is also mild. For example, it can hold even with one strong IV cluster as $|\textbf{G}(c_0)|$ is at least as large as the number of all possible sign changes of the weak IV clusters given that $\sum_{j \in [J]}\xi_ja_j(\tau)=\sum_{j \in \mathcal{J}_s}\xi_ja_j(\tau)=1$.

Inference for Weak-instrument-robust Statistics

assumptionSuppose one of the conditions below holds. \begin{enumerate}[label=(\roman*)] • There exists a symmetric $d_\phi \times d_\phi$ matrix $A_3 (\tau)$ such that $\sup_{\tau \in \Upsilon}||\hat{A}_3(\tau) - A_3 (\tau)||_{op} = o_p(1)$, where $A_3(\tau)$ is some deterministic matrix and for some constants $c$ and $C$, $$0<c\leq \inf_{\tau \in \Upsilon}\lambda_{\min}(A_3 (\tau)) \leq \sup_{\tau \in \Upsilon}\lambda_{\max}(A_3 (\tau)) \leq C<\infty.$$ • Suppose $\hat{A}_3(\tau)$ is set as $\tilde {A}_{CR}(\tau) = \left[\hat H (\tau)\tilde \Omega(\tau,\tau)\hat H(\tau)\right]^{-1}$, where $\sup_{\tau \in \Upsilon}||\hat H (\tau) - H(\tau)||_{op} = o_p(1)$ for some deterministic $H(\tau)$ such that $$0<c\leq \inf_{\tau \in \Upsilon}\lambda_{\min}( H^\top (\tau) H(\tau)) \leq \sup_{\tau \in \Upsilon}\lambda_{\max}( H^\top (\tau) H(\tau)) \leq C<\infty.$$ Furthermore, we require $J > d_\phi$ in this case. \end{enumerate}
theoremSuppose Assumptions (ref)--(ref) and (ref) hold and $\beta_n(\tau) = \beta_0(\tau)$ for $\tau \in \Upsilon$. Then, \begin{align*} \alpha - \frac{1}{2^{J-1}} \leq & \liminf_{n \rightarrow \infty} \mathbb{P}(AR_{n}> \hat{c}_{AR,n}(1-\alpha)) \\ & \leq \limsup_{n \rightarrow \infty} \mathbb{P}(AR_{n}> \hat{c}_{AR,n}(1-\alpha)) \leq \alpha + \frac{1}{2^{J-1}}, \,\,and \end{align*} \begin{align*} \alpha - \frac{1}{2^{J-1}} \leq & \liminf_{n \rightarrow \infty} \mathbb{P}(AR_{CR,n}> \hat{c}_{AR,CR,n}(1-\alpha)) \\ & \leq \limsup_{n \rightarrow \infty} \mathbb{P}(AR_{CR,n}> \hat{c}_{AR,CR,n}(1-\alpha)) \leq \alpha + \frac{1}{2^{J-1}}. \end{align*}
remarkTheorem (ref) holds without assuming strong identification (i.e., Assumption (ref)). The asymptotic size of the $AR_{n}$ and $AR_{CR,n}$-based bootstrap inference is therefore controlled up to an error $2^{1-J}$, even when $\beta_n(\tau)$ is weakly or partially identified. This aligns with the robust inference approach proposed by Chernozhukov-Hansen(2008a) for i.i.d. data, which is based on chi-squared critical values.

Monte Carlo Simulation

To examine the performance of the gradient wild bootstrap inference for IVQR, we consider two data-generating processes (DGPs). The first DGP is inspired by those designed by KS17 and KW18 and considers the setting with clustered data and within-cluster dependence. The second DGP is inspired by that designed by BDF09 with network dependence, and then, the clusters are obtained by spectral clustering as proposed by L22. For both designs, we set the number of observations, simulation repetitions, and bootstrap repetitions as 500, 500, and 300, respectively.

Simulation Designs

DGP 1. Let $a_{k,j} = (a_{k,1,j},\cdots,a_{k,n_j,j})^\top$ for $k=1,\cdots,d_z$, where $d_z$ is the dimension of $Z$, and $u_{j} = (u_{l,1,j},\cdots,u_{l,n_j,j})^\top$ for $l=1,2$. Then, $(a_{1,j},\cdots,a_{d_z,j},u_{1,j},u_{2,j})$ are independent, and each of them is independent across $j \in [J]$ and follows an $n_j \times 1$ multivariate normal distribution with mean zero and covariance $\Sigma(\rho_j)$, where $\Sigma(\rho_j)$ is an $n_j \times n_j$ toeplitz matrix with coefficient $\rho_j$ and $\rho_j = 0.2+0.5j/J$ for $j \in [J]$. We define the original instruments as

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

where $F_N(\cdot)$ is the standard normal CDF. Then, the endogenous variable $X_{i,j}$ is generated as

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

where $\Pi_{k,j}$ determines the identification strength. To allow for first-stage heterogeneity in the identification strength across clusters, for all $k \in [d_z]$, we let

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

where $\pi \in (1,1/2,1/4)$.

The outcome $Y_{i,j}$ is generated as

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

where $\underline{W}_{i,j}$ is distributed following $\frac{1}{2}\chi^2_{1}$ and independent of $(a_{1,j},\cdots,a_{d_z,j},u_{1j}, u_{2j})$, and $W_{i,j} = (1,\underline{W}_{i,j})^\top$. We set $\beta(u) = 1 + F_N(u)$, $\gamma = 0$, and the total number of observations $n=500$. The correlation between $X_{i,j}$ and $u_{i,j}$ is about 0.77, indicating the endogeneity level.

To allow for unbalanced clusters, we follow Djogbenou-Mackinnon-Nielsen(2019) and Mackinnon2021 and set the cluster sizes as

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

and $n_J = n - \sum_{j \in [j]} n_j$. We let $r=4$ when $J=9$ and $J=18$ to generate substantial heterogeneity in cluster sizes. The parameter $r$ corresponds to the heterogeneity parameter considered in the simulations of Djogbenou-Mackinnon-Nielsen(2019) and mackinnon2022cluster, and $r=4$ is the most heterogeneous setting considered in those papers. When $J=9$, the cluster sizes are $(5,8,12,19,30,48,75,117,186)$. When $J=18$, the resulting cluster sizes are $(2,2,3,4,5,7,8,10,13,17,21,26,33,41,52,65,81,110)$. We test the following hypothesis for $d_z \in \{1,3\}$ and $\tau \in \{0.1,0.25,0.5,0.75,0.9\}$:

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

DGP 2. We consider the linear-in-mean social interaction model detailed in Example (ref). Specifically, following L22, we generate the network $\mathcal A$ with $n=500$ nodes as $\mathcal A_{\ell,\ell'} = 1\{||\eta_{\ell} - \eta_{\ell'}||_2 \geq (7/(\pi n))^{1/2}\}$, where $\eta_\ell \stackrel{i.i.d.}{\sim} \text{Uniform}[0,1]^2$.

Then, we generate $B_\ell$ in (ref), the $\ell$-th node's background characteristic, as follows:

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

where $\varepsilon_\ell' \stackrel{i.i.d.}{\sim}\mathcal{N}(0,1)$. Then, the control variables $W$ and IV $Z$ can be constructed as in Example (ref).

Further denote $\tilde {\mathcal A}$ a normalized adjacency matrix with a typical entry $\tilde {\mathcal A}_{\ell,\ell'} = \mathcal A_{\ell,\ell'}/d_\ell$, where $d_\ell = \sum_{\ell' \neq \ell} {\mathcal A}_{\ell,\ell'}$ is the degree of node $\ell$. Then, we generate the outcome variable as (ref) in which $U = \{U_\ell\}_{\ell \in [n]}$ is a sequence of i.i.d. uniform (0,1) random variables and

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

where $\text{diag}(v)$ for a $n \times 1$ vector $v$ denotes an $n \times n$ diagonal matrix with $v$ as the diagonal, $y = (y_1,\cdots,y_n)^\top$, $B = (B_1,\cdots,B_n)^\top$, $\beta(U) = (\beta(U_1),\cdots,\beta(U_n))^\top$, and $(\delta_0(U), \delta_1(U), \delta_2(U))$ are similarly defined. In addition, we set $\delta_0(u) = 0.7683+0.25(u-0.5)$, $\beta(u) = 0.4666+0.2(u-0.5)$, $\delta_1(u) = 0.0834+0.1(u-0.5)$, and $\delta_2(u) = 0.1507+0.2(u-0.5)$. For comparison, the values $(\delta_0(0.5),\beta(0.5),\delta_1(0.5),\delta_2(0.5)) = (0.7683,0.4666,0.0834,0.1507)$ are set according to the calibration study by BDF09. Given the outcome variable, we can set the endogenous variable as $X = \tilde{\mathcal A}y$, where $X = (X_1,\cdots,X_n)^\top$. Finally, we note that (ref) holds because coefficients $(\delta_0(\cdot),\beta(\cdot))$ are monotone increasing and their corresponding regressors are positive and $\{U_\ell\}_{\ell \in [n]} \perp\!\!\!\perp \{B_\ell\}_{\ell \in [n]}$. The correlation between $X_\ell$ and $U_\ell$ is about 0.16, which indicates the endogeneity level. As discussed in Example (ref), we let $W = (\iota_n, B, \tilde A B)$ and $Z = \tilde A^2 B$.

We follow the classification procedure proposed by L22 to obtain the clusters.

enumerate• Input: a positive integer $L$ and network $\mathcal A$. • Compute all separated components (no links between two components) of the network denoted as $\{\mathcal V_{h}\}_{h \in \{0\} \cup [H]}$, where $\{\mathcal V_{h}\}_{h \in \{0\} \cup [H]}$ is a partition of $[n]$ (n vertexes) and they are sorted in ascending order according to their sizes. We keep all the components whose sizes are greater than 5. Denote the number of components left as $L'+1$ for some $L' \geq 0$. • Suppose the biggest component $\mathcal V_0$ has size $\tilde n_0$. By permuting labels, we suppose $\mathcal V_0 = [\tilde n_0]$ and denote its adjacency matrix as $\mathcal A_0$. Then, we compute the graph Laplacian as \begin{align*} \mathcal L_0 = \mathbb I_{\tilde n_0} - D_0^{-1/2} \mathcal A_0 D_0^{-1/2}, \end{align*} where $D_0 = \text{diag}(\sum_{i \in [\tilde n_0]} A_{0,1,i},\cdots,\sum_{i \in [\tilde n_0]} A_{0,\tilde n_0,i})$ is an $\tilde n_0 \times \tilde n_0$ diagonal matrix of degrees. • Obtain the top $L$ eigenvector matrix of $\mathcal L_0$ corresponding to its $L$ largest eigenvalues and denote it as $ V = [V_1^\top,\cdots,V_{\tilde n_0}^\top]^\top,$ where $V_{i} \in \Re^{L}$ for $i \in [\tilde n_0]$. • Apply the k-means algorithm to $V$ and divide $\mathcal V_0 = [\tilde n_0]$ into $L$ groups, denoted as $\mathcal V_{0,1},\cdots,\mathcal V_{0,L}$. • Output: we obtain $J = L+L'$ clusters $(\mathcal V_{0,1},\cdots,\mathcal V_{0,L},\mathcal V_{1},\cdots,\mathcal V_{L'})$.

We let $L$ be $(10,20)$. The number of clusters ($J$) depends on $L'$, which varies across simulation replications. Note that different from DGP 1, there is no cluster heterogeneity in the identification strength under DGP 2. We test the following hypothesis for $\tau \in \{0.1,0.25,0.5,0.75,0.9\}$:

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

Inference Procedure

We compare the performance of our three bootstrap inference methods $T_{CR,n}$, $T_n$, and $AR_n$ (denoted as T_CR, T, and AR in Tables (ref)-(ref)) with the conventional asymptotic Wald inference based on CRVE and two alternative methods based on cluster-level IVQR estimators available in the literature.

enumerate• T_STD: This inference method is based on the same test statistic as $T_{CR,n}$ but with the conventional normal critical value. • IM: This inference method is proposed by Ibragimov-Muller(2010), which compares their group-based $t$-test statistic with the critical value of a $t$-distribution with $J-1$ degrees of freedom. The test statistic is constructed by separately running IVQR using the samples in each cluster. • CRS: The approximate randomization inference method proposed by Canay-Romano-Shaikh(2017), which compares IM's group $t$-test statistic with the critical value of the sign changes-based randomization distribution of the statistic.

We construct the instrument using the nonparametric approach outlined in Remark (ref). The tuning parameters are set based on the rule-of-thumb provided in Remark (ref). Because this approach eventually produces a scalar $\hat \Phi_{i,j}(\tau)$ regardless of the dimension of the original IVs $Z_{i,j}$, our $AR_n$ and $AR_{CR,n}$ tests are numerically equivalent. Therefore, we only report the performance of $AR_n$. In addition, because we focus on inference point-wise in $\tau$ and $\hat \Phi_{i,j}(\tau)$ is a scalar, the choices of $\hat A_1(\tau)$ in the estimation of $\hat \beta(\tau)$, $\hat A_2(\tau)$ in the Wald inference based on $T_n(\tau)$, $\hat G(\tau)$ in the Wald inference based on $T_{CR,n}(\tau)$, and $\hat A_3(\tau)$ in the AR inference based on $AR_n(\tau)$ will not affect the performance of corresponding inference methods, and are set to 1 without loss of generality.

Simulation Results

Tables (ref)--(ref) and (ref) collect the simulation results for DGPs 1 and 2, respectively, when the nominal null rejection rate is set at $10\%$.\footnote{The rejection probabilities using $AR_n$ and $AR_{CR,n}$ are numerically the same with one IV.} Several key observations emerge from the results. First, T_CR, T, and AR effectively control size across various settings, while T_STD, IM, and CRS have size distortions, particularly in DGP 1, which includes both weak and strong IV clusters (i.e., there exists substantial cluster heterogeneity in the IV strength under DGP 1). The size distortions of T_STD, IM, and CRS also typically increase when $\pi$ becomes small in Tables (ref)-(ref). Second, for both DGPs, T_CR demonstrates greater power than T across various settings, aligning with our theoretical expectations. Third, we observe that T_STD typically has larger size distortion when the number of clusters is small, while the size distortions of IM and CRS tend to increase with the number of clusters. Fourth, the power of CRS and IM is comparable, and in DGP 2, their power is similar to that of T_CR, although they display slightly higher size distortion. Overall, T_CR has the best size and power performance among the six methods, and is thus our recommended inference procedure.

table[table omitted — 2,374 chars of source]
table[table omitted — 2,375 chars of source]
table[table omitted — 2,373 chars of source]
table[table omitted — 2,377 chars of source]
table[table omitted — 1,665 chars of source]

Empirical Applications

In an influential study, ADH2013 analyzes the effect of rising Chinese import competition on wages and employment in US local labor markets between 1990 and 2007, when the share of total US spending on Chinese goods increased substantially from 0.6% to 4.6%. In this section, we further analyze the region-wise distributional effects of such import exposure by applying IVQR and the proposed gradient wild bootstrap procedures to the Census Bureau-designated South region with 16 states and total number of observations equal to 578.\footnote{We focus on the South region because it has the highest IV strength.}

For the IVQR model, we let the outcome variable $(y_{i,j})$ denote the decadal change in the average individual log weekly wage in a given CZ. The endogenous variable $(X_{i,j})$ is the change in Chinese import exposure per worker in a CZ, which is instrumented by $(Z_{i,j})$ Chinese import growth in other high-income countries.\footnote{See Sections I.B and III.A in ADH2013 for a detailed definition of these variables.} We follow the nonparametric approach in Remark (ref) to construct $\hat \Phi_{i,j}$ used in IVQR. In addition, the exogenous variables $(W_{i,j})$ include the characteristic variables of commuting zones (CZs) and decade specified in ADH2013 as well as state fixed effects. Our IV quantile regressions are based on the CZ samples in the South region, and the samples are clustered at the state level, following ADH2013. Besides the results for the full sample, we also report those for male and female samples separately.

The main results are given in Table (ref). Specifically, for $\tau \in \{0.1, 0.25, 0.5, 0.75, 0.9\}$, we report the point IVQR estimate and the 90% bootstrap confidence sets (CSs) constructed by inverting the corresponding $AR_n$, $T_n$, and $T_{CR,n}$-based tests. The computation of the bootstrap CSs was conducted over the parameter space $[-3,1]$ with a step size of 0.01, and the number of bootstrap draws is set at 300 for each step. We can draw three key observations from the results in Table (ref). First, the impact of Chinese imports on wages shows distributional heterogeneity. Specifically, the three types of bootstrap CSs reveal that the effects are relatively significant at the high quantiles, followed by the median quantile, but not at the lower quantiles, across the full, male, and female samples. Second, the $T_{CR,n}$-based CSs are generally shorter than those of $AR_n$ and $T_n$. This aligns with our theory and simulation results, which suggest that the $T_{CR,n}$-based bootstrap test is more effective at detecting distant local alternatives. Third, the distributional effects of Chinese imports on wages are fairly consistent between males and females. In addition, we observe that the effects of Chinese imports are relatively more substantial for the male samples.

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