No CrossRef data available.
Published online by Cambridge University Press: 09 February 2006
This paper considers an empirical likelihood method to estimate the parameters of the quantile regression (QR) models and to construct confidence regions that are accurate in finite samples. To achieve the higher order refinements, we smooth the estimating equations for the empirical likelihood. We show that the smoothed empirical likelihood estimator is first-order asymptotically equivalent to the standard QR estimator and establish that confidence regions based on the smoothed empirical likelihood ratio have coverage errors of order n−1 and may be Bartlett corrected to produce regions with errors of order n−2, where n denotes the sample size. Our result is an extension of the previous result of Chen and Hall (1993, Annals of Statistics 21, 1166–1181) to the regression context. Monte Carlo experiments suggest that the smoothed empirical likelihood confidence regions may be more accurate in small samples than the confidence regions that can be constructed from the smoothed bootstrap method recently suggested by Horowitz (1998, Econometrica 66, 1327–1351).I thank the co-editor Bruce Hansen and anonymous referees for valuable suggestions and comments. I also thank Song X. Chen, Joel Horowitz, Yuichi Kitamura, Oliver Linton, Whitney Newey, Peter Phillips, and Richard Smith for helpful comments. Parts of this paper were written while I was visiting the Cowles Foundation at Yale University, whose hospitality is gratefully acknowledged. Young-Hyun Cho has provided excellent research assistance. This work was supported by the Korea Research Foundation grant KRF 2003-041-B00072.
The quantile regression models, originally introduced by Koenker and Bassett (1978, 1982), have recently been very popular in both theoretical and applied econometrics literature, particularly as a result of their usefulness in characterizing the entire conditional distribution of a dependent variable given regressors and the robustness property of the quantile regression estimators to outlier observations. See Buchinsky (2000) and Koenker (2005) for a recent survey.
Koenker and Bassett (1978, 1982) give conditions under which their quantile regression (QR) estimator is n1/2-consistent and asymptotically normal. This result enables one to construct a standard asymptotic confidence region on the true parameters. However, the first-order approximation might be inaccurate with samples of the sizes encountered in many applications, and hence it might yield a substantial gap between the true and the nominal coverage probabilities in practice. On the other hand, it is well known that bootstrap generally provides asymptotic refinements to the coverage probabilities of confidence regions under regularity conditions (see Beran, 1988; Hall, 1986, 1992; Horowitz, 1997, 2001). However, the standard theory of the bootstrap cannot be directly applied to the confidence regions based on the QR estimator because the statistic of interest is not a smooth function of sample moments that has an Edgeworth expansion.1
For a first-order consistency result of bootstrap estimators in (nonsmooth) QR models, see Hahn (1995).
This paper considers an empirical likelihood (EL) method (originally proposed by Owen, 1988, 1990) to estimate the parameters of the QR models and to construct confidence regions for the parameters, which are expected to be more accurate in finite samples than the confidence regions that can be constructed from the SLAD/bootstrap approach.2
Qin and Lawless (1994) link EL to general estimating equations for many interesting estimators. Recent econometric applications of the EL method include Bravo (2002, 2004), Donald, Imbens, and Newey (2003), Guggenberger and Smith (2003), Imbens, Spady, and Johnson (1998), Kitamura (1997, 2001), Kitamura and Stutzer (1997), Moon and Schorfheide (2003), Newey and Smith (2004), and Su and White (2003).
We do not claim here that EL is the only way of achieving such higher order refinements. An alternative method such as double bootstrap (initially suggested by Hall, 1986, and Beran, 1987) is known to enable further refinements over the standard bootstrap and hence might also yield results analogous to those obtained in this paper. However, the latter procedure can be computationally very expensive. On the other hand, in certain regular cases, it is known that EL is the only member of the Cressie–Read family that admits a Bartlett correction (see Jing and Wood, 1996; Baggerly, 1998). We expect that the same result will hold in our context under suitable assumptions.
There are a number of papers in the literature that are related to this paper. Chen and Hall (1993) show that smoothed confidence intervals for quantiles with no covariates are Bartlett correctable, and our paper is an extension of the latter paper to the QR context, which perhaps should be of more interest to econometricians. On the other hand, contrary to De Angelis, Hall, and Young (1993), we do not assume that the error terms in the QRs are independent of regressors (X), and hence they may have an unknown form of conditional heteroskedasticity. Finally, we should note that Otsu (2003), independently of our work, has recently obtained a result similar to ours, assuming independence of the errors and regressors. However, the main focus of the latter paper is on the relative efficiency (over other competing estimators) of smoothed conditional EL estimators in the first-order approximations, whereas our main focus is on the higher order properties of smoothed unconditional EL confidence regions.
The remainder of this paper is organized as follows. Section 2 defines the SEL estimator and confidence region in QR models and discusses their asymptotic properties. Section 3 reports some Monte Carlo results. Section 4 makes concluding remarks and suggests some possible extensions. An Appendix contains proofs of the results.
Consider the linear QR model given by

where

is an observed dependent variable, Xi is an observed K × 1 vector of regressors, β0 is a K × 1 vector of constant parameters, and Ui is an unobserved error that satisfies P[Ui ≤ 0|Xi] = q a.s. ∀i ≥ 1 for 0 < q < 1. For simplicity, we assume that {(Yi,Xi) : i = 1,…,n} are independent and identically distributed (i.i.d.).
4The linearity assumption in (1) is not essential for our results. We expect that a similar result to ours will hold in nonlinear QR models with some additional work.
To motivate our estimator, consider the following estimating equations:

where

and 1(·) denotes the indicator function.5
We note that the assumption of just-identification is important for our higher order results (especially Bartlett correction). The case of overidentification needs separate treatment and is beyond the scope of this paper; see Chen and Cui (2003) for an interesting result related to this issue. On the other hand, the first-order results in Theorem 1 can easily be shown to hold even under the overidentified case.
For this purpose, let K(·) denote a kernel function that is bounded, compactly supported on [−1,1], and integrated to one. Additional assumptions on K(·) are given later. Define G(x) = ∫u<x K(u) du and Gh(x) = G(x/h). Then, a smoothed version of g in (3) may be given by

Let p = (p1,…,pn)′ be a vector of nonnegative numbers adding to unity. Then, the smoothed empirical log likelihood ratio is defined by

Given β, using the standard Lagrange multiplier arguments, the optimal value for pi solving (5) can be shown to be

where t(β) is a K × 1 vector of Lagrange multipliers satisfying

This gives the (profile) smoothed empirical log likelihood ratio statistic

where t(β) satisfies (7). By definition, the SEL estimator

of β0 solves

where B is the parameter space. Using the just-identification assumption in (2), it can be shown that

satisfies

see Lemma 3 in the Appendix.
We now compare the SEL estimator with the standard QR estimator. The standard QR estimator

of β0 solves

where ρq(x) = [q − 1(x ≤ 0)]x is the check function. When q = ½, the estimator is the standard LAD estimator. Koenker and Bassett (1978, 1982) show that

is n1/2-consistent and asymptotically normal. Intuitively, it is reasonable to expect that

are asymptotically equivalent if h goes to zero sufficiently fast as n → ∞. This is because, under regularity conditions,

satisfies the first-order condition (FOC)

which approximately equals to the unsmoothed version (i.e., h = 0) of the estimating equations [sum ] pi Zi(β) = 0 for the smoothed EL (5). Under the regularity conditions given later, we shall show that the two estimators are (first-order) asymptotically equivalent in the sense that

This result implies that the asymptotic distribution of the SEL estimator is given by that of the usual QR estimator, i.e.,



and f (u|x) denote the conditional density of U given X = x. On the other hand, when q = ½, the result (13) and Theorem 2.1 of Horowitz (1998) imply that

is also asymptotically equivalent to the SLAD estimator of Horowitz (1998) in the first-order approximation.
Now, we define the SEL confidence regions. Consider the smoothed empirical log likelihood ratio statistic given in (8). The SEL confidence region for

is defined by

where c > 0 is a constant that determines the coverage probability αhc of Ihc:

The coverage accuracy of Ihc depends on the asymptotic distribution of the lh(β0) statistic. As we shall see subsequently, under suitable regularity conditions, lh(β0) has an asymptotic χK2 distribution, and hence c might be chosen using this result.6
In practice, the contours of Ihc can be computed using a multivariate Newton's algorithm as in Hall and LaScalar (1990). In our simulation experiments, we used the modified Newton algorithm written in Gauss codes by Bruce Hansen (available at http://www.ssc.wisc.edu/∼bhansen/progs/elike.prc).
Now we comment on the main features of the SEL confidence regions. First, because they are based on the likelihood function, they do not depend on any explicit estimate of Λ0. This is an advantage over the confidence regions that are based on Wald-type statistics (such as (36), (37), and (39) defined in Section 3.1), which depend on explicit estimates of Λ0 and might subsequently create problems regarding the quality of the estimates. Second, the shapes of the SEL confidence regions are not restricted a priori to be elliptical or rectangular and are allowed to be determined by the likelihood or, equivalently, by the data.7
This feature is also shared by bootstrap confidence regions constructed by multivariate kernel density estimation applied to the resampled data (viz. Hall, 1987) or by constructing polygons to the resampled data (viz. Owen, 1990), but these methods do not seem to be very satisfactory (see Owen, 2001, Ch. 1).
In this section, we derive the asymptotic distribution of the SEL estimator and establish asymptotic equivalence of the SEL and QR estimators. We also discuss asymptotic coverage accuracy of the SEL confidence regions.
Let r ≥ 2 be an integer. We denote F(·|x) to be the cumulative distribution function of Ui conditional on Xi = x and define f (·|x) to be the conditional density of Ui with respect to the Lebesgue measure whenever it exists. We need the following assumptions for our main results.
Assumption 1. {(Yi,Xi) : i = 1,…,n} are i.i.d. random vectors.
Assumption 2. The parameter vector β0 is an interior point of the compact parameter space B in

.
Assumption 3. Xi has bounded support, and S0 and D0 are nonsingular.
Assumption 4. (a) F(0|x) = q for almost every x. (b) For all u in a neighborhood of 0 and almost every x, f (u|x) exists, is bounded away from zero, and is r times continuously differentiable with respect to u.
Assumption 5.
(a) K(·) is bounded and compactly supported on [−1,1].
(b) For some constant CK ≠ 0, K(·) is an rth-order kernel, i.e., ∫ujK(u) du = 1 if j = 0; 0 if 1 ≤ j ≤ r − 1;CK if j = r.
(c) Let

for some L ≥ 1, where G(u) = ∫v<u K(v) dv. For any

satisfying ∥θ∥ = 1, there is a partition of [−1,1], −1 = a0 < a1 < ··· < aL+1 = 1 such that

is either strictly positive or strictly negative on (al−1,al) for l = 1,…,L + 1.
Assumption 6. h satisfies (a) nh2r → 0 and (b) nh/log n → ∞ as n → ∞.
Assumptions 1–5 are similar to Assumptions 1–5 of Horowitz (1998, p. 1333), which were used to establish asymptotic refinement of the SLAD-estimator-based t and χ2 tests through bootstrap. Assumptions 1–5(b) are used to establish the asymptotic normality of

and to justify a Taylor expansion for the EL ratio statistic that in turn is used to calculate the coverage probabilities of our SEL confidence regions. The boundedness assumption for Xi (Assumption 3) is made to simplify the proofs in the Appendix. It can be removed at the cost of more complicated proofs. Also, although the distribution Ui given Xi is assumed to be continuous, the distribution of Xi can be discrete unless it is identically zero with probability 1, which is excluded by Assumption 3. Note that the discrete regressors are important for applications with dummy variables. Assumption 5(c) is used to verify a version of Cramér's condition (Lemma 4 in the Appendix) that is necessary to justify a formal Edgeworth expansion for the distribution of lh(β0).
Assumption 6 requires that h goes to zero as n → ∞ at a suitable rate. It is satisfied if h ∝ n−κ for 1/(2r) < κ < 1, where r ≥ 2. Part (a) of Assumption 6 ensures that the smoothing has an asymptotically negligible effect on the distribution of lh(β0). On the other hand, part (b) of Assumption 6 requires that h not be too small. It is needed to ensure a minimum level of smoothness of lh(β0) that is necessary to derive Cramér's condition for the Edgeworth analysis. Intuitively this assumption makes sense, because Cramér's condition is mainly intended to ensure distributions of statistics to have an absolutely continuous component, but the latter might be hard to attain for lh(β0) if h is chosen too small (for a general interpretation of Cramér's condition, see Hall, 1992, p. 57).
We now derive the asymptotic distribution of the SEL estimator and establish asymptotic equivalence of the SEL and QR estimators.
THEOREM 1. Under Assumptions 1–5(b) and 6(a), we have

where Λ0 is defined in (15).
The asymptotic covariance matrix Λ0 can be estimated, e.g., by


which is suggested by Powell (1984, 1986). Under the assumptions of Theorem 1, it is not difficult to show that the estimator is consistent for Λ0. Another way to estimate Λ0 is to use a bootstrap estimator as in Buchinsky (1995, 2000), e.g., (38) in Section 3.1. The bootstrap estimator has an advantage in the sense that it does not require a choice of h, but its computation can be more demanding than the kernel-based estimators.8
Another estimator of Λ0 one might consider would be the negative of the second derivative of the log empirical likelihood, which should exist as a result of smoothing of the estimating equations.
We now discuss coverage properties of the SEL confidence regions. To this end, it is convenient to write the empirical log likelihood ratio statistic lh(β) (given by (8) and (7)) at β = β0 in terms of standardized variables. That is, we let

for i = 1,…,n, where t = t(β0), Zi = Zi(β0), and Vn = EZi Zi′. Then, in terms of the standardized variables λ and Wi, lh(β0) can be rewritten as

where λ satisfies

We need to introduce additional notation. We let Wij denote the jth component of Wi and define

In particular, αjk = δjk, where δjk is the Kronecker delta.9
This α-A notation was originally used by DiCiccio, Hall, and Romano (1991). For example, for

, we define αj = EWj,αjj = E(Wj)2, αjjkk = E(Wj)2(Wk)2, etc., for 1 ≤ j,k ≤ K.
Under the regularity conditions, we first establish that lh(β0) has an asymptotic χK2 distribution.
THEOREM 2. Suppose Assumptions 1–5(b) and 6(a) hold. Then, we have, as n → ∞,

Remarks.
1. Theorem 2 is a nonparametric version of Wilks' theorem (1938), which has first been proved by Owen (1991) in the standard linear regression models. Chen and Hall (1993, Thm. 3.1) have also established a similar result for the quantiles (with no covariates).
2. From the expansion (A.6) and Lemma 1(a) in the Appendix, we can see that n1/2EZi → 0 if nh2r → 0 and, if E [Xi f(r−1)(0|Xi)] ≠ 0, n1/2EZi → 0 implies nh2r → 0. Therefore, if E [Xi f(r−1)(0|Xi)] ≠ 0, the bandwidth condition 6(a) is in fact a necessary and sufficient condition for lh(β0) to have an asymptotic χK2 distribution.
If c = cα is chosen such that

then Theorem 2 implies that the asymptotic coverage of the SEL confidence region Ihc will be α, i.e., P(β0 ∈ Ihc) = P(lh(β0) ≤ cα) = α + o(1) as n → ∞.
We now discuss the higher order properties of the SEL confidence regions. Using an Edgeworth expansion of the distribution of lh(β0), we can show that the asymptotic coverage accuracy of Ihc is in fact of order O(n−1).
THEOREM 3. Define c = cα by (25). Suppose Assumptions 1–6 hold. If we further assume that supn nhr < ∞, then we have, as n → ∞,

Remarks.
1. The expansion (A.23) in the Appendix implies that the bandwidth condition supn nhr < ∞ is not only sufficient but also necessary for the asymptotic coverage error to be of order O(n−1) if E [Xi f(r−1)(0|Xi)] ≠ 0. If E [Xi f(r−1)(0|Xi)] = 0, then the result of Theorem 3 still holds even if nhr diverges as long as nh2r → 0 and nh/log n → ∞, i.e., Assumption 6 holds.
2. When nhr → C (< ∞), the expansion (A.23) and the results (A.20)–(A.22) in the Appendix may be used to derive the “optimal” value of C that minimizes the O(n−1) term on the right-hand side of (26). However, this possibility is not practical of interest because of the availability of the Bartlett correction, which is discussed in the next section.
In the previous section, the coverage error of the EL confidence region Ihc is of order O(n−1). This error might be partly explained by the fact that the mean of the distribution of lh(β0) does not agree with that of the χK2 distribution, i.e., E [lh(β0)] ≠ K. Therefore, one might suspect that this discrepancy might be diminished by rescaling lh(β0) so that it has the correct mean. This idea is known as the Bartlett correction in the literature. In this section we show that, provided h is chosen suitably, the Bartlett correction reduces the coverage error to O(n−2).
From expansion (A.5), we can show that if nhr → 0

Here and throughout this paper, we use the convention that terms with repeated superscripts are to be summed over. The result (27) suggests that we might consider a confidence region corrected with the Bartlett factor b:

In practice, b is not observed and has to be estimated. Let

denote any n1/2-consistent estimator of β0 such as the SEL estimator

or the usual QR estimator

. Define the estimated Bartlett factor to be

and

is the ith row of

. With some calculation, one can show that

The confidence region corrected with

is now defined to be

Theorem 4, which follows, shows that the coverage error of the SEL confidence region is of order O(n−2) if it is Bartlett corrected by either b or

.
On the other hand, from (A.21) and (A.22) in the Appendix, we have
where si−1/2 denotes the ith row of S0−1/2. This suggests that one might also consider a confidence region

with the Bartlett factor given by
where

. Note that

is computationally simpler than

because it does not depend on the bandwidth parameter h. However, if

is used instead of b, we will not have the same asymptotic accuracy as

because of the relatively large estimation error of

. This is because we have

and hence, with Bartlett factor

, the coverage error is of order O(n−1h) instead of O(n−2).
10The Bartlett factor

is derived in the same spirit (i.e., to remove the dependence on h) as β0 in Chen and Hall (1993, Thm. 4.1). However, it is interesting to note that, in our case,

depends not just on q but also on the covariates {Xi : i ≥ 1}, in the regression framework.
The following theorem formally states the preceding results.
THEOREM 4. Define c = cα by (25). Suppose Assumptions 1–6 hold. If we further assume that supn n3h2r < ∞, then we have, as n → ∞,

Remarks.
1. The result (A.30) in the Appendix implies that the condition supn n3h2r < ∞ is also necessary for the asymptotic coverage error of

to be of order O(n−2) if E [Xi f(r−1)(0|Xi)] ≠ 0.
2. The Edgeworth expansion for the distribution of lh(β0) (i.e., eqn. (A.18) in the Appendix) implies that we have, for any c > 0,

where

is a polynomial of degree 1: i.e.,

, where C0 = [K2K/2Γ(K/2)]−1tr(Δ) is a constant. This property of

is essential for our Bartlett correction result, because it enables us to remove the term of order n−1 from the right-hand side of (35) by a simple adjustment for the expected value of lh(β0). On the other hand, the Edgeworth expansions of Horowitz (1998, Thm. 4.2) for the t- and Wald statistics and their bootstrap analogues have (odd) polynomials (i.e., q(νn,·) on p. 1349 of the latter paper) with nonvanishing terms of degrees 3 and 5. The existence of the latter terms, in general, is the main reason why Bartlett correction is not available for bootstrap (for a general discussion of this phenomenon, see DiCiccio, Hall, and Romano, 1991, Sec. 2.3).
3. Bertail (2003) makes an ingenious use of convex duality and LAN (locally asymptotic normality) properties of the EL ratio to show that empirical likelihoods for Hadamard differentiable functionals are Bartlett correctable in a general setting.
11See, e.g., van der Vaart and Wellner (1996, pp. 372–373) for the definition of Hadamard differentiability.

is crucial to verify Cramér's condition (or more specifically to verify the inequality (A.11)). Furthermore, contrary to our result, Bertail (2003) considers only an infeasible Bartlett corrected confidence region and does not suggest any explicit estimator of the Bartlett factor.
We consider a linear median regression model

where Xi = (1,X2i)′, β0 = (β01,β02)′ is a 2 × 1 parameter vector whose true value is β0 = (1,1)′, the regressor X2i is generated from a uniform distribution U [1,5], and error satisfies P[Ui ≤ 0|X2i] = 0.5. We consider three different distributions for the error Ui: (i) Student t distribution with 3 degrees of freedom rescaled to have variance 2 (DGP1), (ii) Ui = 0.25(1 + X2i)Vi, where Vi ∼ N(0,1) (DGP2), and (iii) chi-square distribution with 3 degrees of freedom recentered to have median zero (DGP3). In DGP2, Ui is heteroskedastic, and in DGP3 the distribution is skewed. DGP1 and DGP2 are the same as the simulation designs of Horowitz (1998), and DGP3 is considered by Chen and Hall (1993).
We consider confidence regions for the parameter vector β0. We smooth the EL using a second-order kernel (i.e., r = 2) K(u) = (¾)(1 − u2)1(|u| ≤ 1), which is the so-called Bartlett or Epanečnikov kernel. The SEL confidence regions considered are

, which are defined in (17), (33), and (32), respectively. In the simulation results given subsequently, we denote them by SEL1, SEL2, and SEL3, respectively. The confidence region corrected with the true Bartlett factor b (i.e., Ihcb defined in (28)) is not considered because it is not of practical interest. To evaluate the effect of smoothing the estimating equations, we also consider unsmoothed EL confidence regions (i.e., the case h = 0), and we denote this by EL.
As another benchmark of our simulation experiments, we consider the confidence regions based on the unsmoothed LAD and SLAD estimators. The former is defined to be

where

is the LAD estimator of β0, cα is the α-quantile of the χ22 distribution, and

is defined by (19) with the kernel function given by the second-order kernel

, which was also used by Horowitz (1998). We also consider a confidence region

where Λ* is a bootstrap estimator of Λ0. The latter is computed by

where

are the B bootstrap estimates for β0, for the B samples (each of size n) drawn from the empirical joint distribution of original data {(Yi,Xi) : i = 1,…,n}. The estimate Λ* is based on the original idea of Efron (1979, 1982) and is also used by Buchinsky (1995) in the QR models.
On the other hand, the confidence region based on the SLAD estimator is given by

Here,

is the SLAD estimator of β0 that solves

and its variance is estimated by

is the integral of a fourth-order kernel given by

and

. The constant

is computed from the following bootstrap procedure. (i) Generate a bootstrap sample {(Yi*,Xi*) : i = 1,…,n} by sampling the original data {(Yi,Xi) : i = 1,…,n} randomly with replacement. (ii) Using the bootstrap sample, compute the SLAD estimate

and its variance estimate

and get

. (iii) Estimate the bootstrap distribution of Sn* by the empirical distribution that is obtained by repeating steps (i) and (ii) many (B) times. (iv) Take

to be the α-quantile of this empirical distribution.
Computing the LAD, SLAD, and SEL confidence regions requires choosing a bandwidth h for each. Existing theories suggest the following rules for choosing h. Hall and Horowitz (1990) show that the bandwidth that minimizes the asymptotic mean squared error of the LAD standard error is of order n−1/5, so this rule might be useful for the LAD confidence regions. Also, using the duality of confidence region and hypothesis testing and Assumption 6 of Horowitz (1998), the bandwidth that is compatible with the SLAD confidence region based on the fourth-order kernel (40) is of order n−κ, where

. On the other hand, our Theorems 3 and 4 show that when the kernel order r = 2 the uncorrected and Bartlett corrected SEL confidence regions have coverage errors of order O(n−1) and O(n−2) if h is of order smaller than n−1/2 and n−3/4, respectively. However, all of the preceding rules are justified in an asymptotic sense, and hence they provide little practical guidance in how to choose h in finite samples. We consider a rule of thumb h = c0 nγ in our simulations and take γ ∈ [−1.0,−0.9,….,−0.1]. We take c0 = 1.0 in our experiments, but, as will be seen, the coverage probabilities of the SEL confidence regions vary little over a wide range of c0 and γ values.
The number of simulation repetitions used is 40,000 for the LAD, EL, and SEL confidence regions. This yields simulation standard errors of approximately 0.0015 and 0.0010 for the simulated coverage probabilities of nominal 90% and 95% confidence regions, respectively. For the BLAD and SLAD confidence regions, however, the number of repetitions is merely 1,000 because of the very long computing times required for simulations with bootstrapping. In this case, the simulation standard errors are approximately 0.0094 and 0.0068 for nominal 90% and 95% levels, respectively. The number of bootstrap repetitions used is also restricted to B = 100 because of heavy computational cost. We consider eight different sample sizes n ∈ [15,20,…,50].
Tables 1, 2, and 3 summarize results for simulated coverage probabilities of confidence regions. Figure 1 shows coverage errors of SLAD and SEL3 (i.e., Bartlett corrected with

) confidence regions for different values of γ values (which determine bandwidth h). The dotted lines surrounding the solid lines are Bonferroni uniform 95% confidence bands for the coverage errors, which were computed by connecting (1 − 0.05/m) pointwise confidence intervals where m (= 10) is the number of points at which the coverage error was estimated. Figure 2 shows coverage errors of SLAD and SEL1 (i.e., no Bartlett correction) and SEL3 confidence regions for varying sample sizes n. Here we draw the Bonferroni uniform confidence band only for the SLAD case to make the picture less complicated. (The simulation standard errors for SEL1 and SEL3 are virtually negligible because of the large number of repetitions, i.e., 40,000.)
Estimated true coverage probabilities of α-level confidence regions (DGP1)
Estimated true coverage probabilities of α-level confidence regions (DGP2)
Estimated true coverage probabilities of α-level confidence regions (DGP3)
Sensitivity of coverage errors with respect to bandwidth parameters (α = 0.95).
Coverage errors with varying sample sizes (α = 0.95, γ = −0.1(SLAD), −0.9(SEL1, SEL3)).
Our simulation results can be summarized as follows.


In this paper, we have used smoothed EL methods to obtain asymptotically valid point estimators and confidence regions about the parameters of QR models that allow for unknown form of heteroskedasticity. We further have shown that, if a simple correction is made, the smoothed EL confidence region can achieve higher order refinements, which are better than the refinements that might be obtained through the (smoothed) bootstrap approach.
The results of this paper can be extended in the following directions. First, this paper considers only the confidence region for the full parameter vector. If one is interested in a subvector

of β0 = (β10′,β20′)′, he or she may consider a confidence region after profiling out β2, i.e.,

where

minimizes lh(β1,β2) with respect to β2 holding β1 fixed. Under suitable assumptions and using an argument analogous to the proof of Theorem 2, it is not difficult to show that

, so that Ihc,1 has asymptotically correct coverage (in a first-order approximation) if c is chosen from the χK12 distribution. On the other hand, Bartlett correctability of Ihc,1 is a more challenging issue. Because the profiling requires an additional optimization step (which was not needed in the full parameter case), the Lagrange multiplier λ should now satisfy a first-order equation for this optimization problem, in addition to the first-order equation corresponding to (A.2). This implies that a new Edgeworth expansion for the distribution of

is needed to take into account the influence of the latter step. However, a systematic investigation of this expansion is beyond the scope of this paper and will be left to a future work.
12See Chen and Cui (2002, 2003) for some interesting results related to this issue in parametric models with no smoothing.
The idea of using a bootstrap procedure for Bartlett correction is originally due to Hall and LaScalar (1990). We extend their idea to account for the presence of nuisance parameters.
In a context different from ours, Monti (1997) shows that a Bartlett correction via bootstrapping might still yield asymptotic refinements in finite samples, even if it does not reduce the coverage error to O(n−2).
Finally, extensions to other econometric models with discontinuous estimating equations such as censored QR models and discrete choice models would be interesting future topics.
Here we sketch the proof of the theorems in the main text. Some of the details of the proofs are available in our working paper version.
LEMMA 1. Under Assumptions 1–5(b) and 6(a), we have, as n → ∞,
Proof of Lemma 1. The results of Lemma 1 hold using a standard technique to obtain biases and variances of kernel density estimators. █
LEMMA 2. Suppose Assumptions 1–5(b) and 6(a) hold. Then, as n → ∞, we have (a)

, (b)

, and (c) t(β) = O(dn) a.s. uniformly in β ∈ Bn ≡ {β : ∥β − β0∥ ≤ dn}, where t(β) satisfies (7),

.
Proof of Lemma 2. The proof is similar to Owen (1990, proof of Thm. 1) and Qin and Lawless (1994, proof of Lem. 1). █
LEMMA 3. Suppose Assumptions 1–5(b) and 6(a) hold. Then, with probability 1 as n → ∞, (a) there exists a K × 1 vector

such that lh(β) attains its minimum value at

and (b)

satisfies

, where

.
Proof of Lemma 3. This lemma is a slight modification of Lemma 1 of Qin and Lawless (1994) and can be proved using a similar argument to theirs and Lemma 2. █
Proof of Theorem 1. By Lemma 1 and the weak law of large numbers, we have

. Letting Gni ≡ [G(−Ui /h) − 1(Ui ≤ 0)] and rearranging terms, we rewrite

as

The second term on the right-hand side of (A.1) is Op(h1/2) and hence op(1) because, for each ε > 0,

which is o(1), using Assumptions 3, 4(b), and 5(a). Also, the last term in (A.1) is also o(1) using Assumption 6(a) because

. Now, by expanding

, we have the desired result. █
Proof of Theorem 2. Let λ ≡ λ(β0) denote the solution of the equation

Then, we have

using the same arguments as in the proof of Lemma 2(c) after noting that we now have

by a weak law of large numbers, n−1 [sum ] Wi = Op(n−1/2 + hr), and maxi∥Wi∥ = Op(1) by Assumption 3.
Next we develop a Taylor expansion for λ and lh(β0). By (A.2), we have
By Lemma 1(a), we have αj = O(hr). Also, observe that

. Solving for λ and then recursive substitutions in equation (A.4) give, for each L ≥ 1,
where Ril denotes a sum of the products of terms of the form Aj,Ajk, and Aj1···jm for m ∈ {3,…,l + 1} so that Ril = Op((n−1/2 + hr)l) for i = 1,2.
Similarly, we have
Therefore, for any k > 1,
Because

, and nh2r → 0 as n → ∞, lh(β0) has an asymptotic central chi-square distribution with K degrees of freedom if n1/2EZi → 0. The latter holds by Lemma 1(a) and Assumption 6. █
Let

denote a vector of all distinct first L + 1 order multivariate centered moments of Wi = Vn−1/2Zi. Note that Qi consists of elements of the form

where |ν| = ν1 + ··· + νk. We first establish the following modified version of Cramér's condition for the Edgeworth expansion, which will be needed later.
LEMMA 4. Let

be a vector and I(t,h) = E {exp[it′Q]}, where Q (= Qi) is given by (A.7) and i = (−1)1/2. Under Assumptions 1–6, we have, for each ε > 0, that there exists some C(ε) > 0 such that

Proof of Lemma 4. The proof of Lemma 4 is analogous to those of Horowitz (1998, Lem. 9) and Hall (1992, Lem. 5.6). First, collect terms with the same polynomial order, so that we have
where gr(X) is a vector of the products of elements of X that correspond to the rth-order polynomial [G(−U/h)]r in the expansion of t′Q and τr(t) denotes the corresponding subvector of

. For h sufficiently small, by a two-term Taylor expansion, we have

Furthermore, given ε > 0, there exists δ(ε) > 0 such that

Take η > 0 and γ1 < 1 such that ∫∥x∥≤η f (0|x) dP(x) = γ1 Ef (0|X). Then, by a change of variables and triangle inequality, we have

where

. By partitioning of [−1,1] into subsets {(al−1,al) : l = 1,…,L + 1} as in Assumption 5(c) and using a change of variables argument similar to Horowitz (1998, pp. 1346–1347), we can show that

Now, by combining (A.9)–(A.11), we have, for each ε > 0,

for all h > 0 sufficiently small. Note that C(ε) > 0 ∀ε > 0 because [γ1 + (1 − γ1)C1(ε)] < 1 and δ(ε) can be made arbitrarily small by choosing h sufficiently small. This completes the proof of Lemma 4. █
Proof of Theorem 3. We first derive the signed root of lh(β0) in (A.5), which is a K-dimensional vector n1/2S0L = n1/2(S0L1,…,S0LK)′ such that lh(β0) = (n1/2S0L)′(n1/2S0L). Consider the expansion

where Tl = Op((n−1/2 + hr)l) and U1L = Op((n−1/2 + hr)L+1). Some calculations yield
Also, by choosing L sufficiently large, we can ensure that

Hence, for c > 0, we have

and so

We now develop an Edgeworth expansion for the distribution of SnL = n1/2SL.We first derive the (multivariate) cumulants of SnL. By very tedious and lengthy calculations, we may show that the cumulants satisfy the following results:

Let

be a class of Borel sets satisfying

where (∂B)ε denotes the set of all points distant at most ε from the boundary of B and φ0,I is the density function of the standard K-dimensional normal distribution. A formal Edgeworth expansion for the distribution of n1/2SL is given as follows: assuming nh2r → 0,

where

and Δ = (Δij) is a K × K matrix with

Accepting that the Edgeworth expansion (A.15) is justified, we now develop an Edgeworth expansion for the distribution of lh(β0). From (A.12), we have, for any c > 0,
where gK(·) denotes the density of the χK2 distribution, the second equality holds by the symmetry of φ0,I(·) and oddness of the polynomial p2(x), and the third equality holds by the symmetry of φ0,I(·). It is straightforward to see that

Let ζ ≡ E [Xf(r−1)(0|X)]. Then, using (A.12) and Lemma 1, we have

Similarly, we have

and

where vni−1/2 and si−1/2 denote the ith row of Vn−1/2 and S−1/2, respectively.
Therefore, (A.18)–(A.22) give

It now follows that, because supn nhr < ∞, we have P(lh(β0) ≤ cα) = α + O(n−1), as desired.
It remains to check that the formal expansion (A.15) is valid. For this purpose, we first need the following formal Edgeworth expansion for the distribution of n1/2Q: for each m ≥ 1,

where

denote a class of Borel sets

for d = dim(Q) that satisfy

as ε ↓ 0, Σ = Var(n1/2Q), and qk(x)φ0,Σ(x) is the density of the finite-signed measure whose Fourier–Stieltjes transform is exp(−t′Σt/2)Pk(t). Here, the polynomial Pk(t) is defined by the expansion

where

denotes a vector of nonnegative integers,

. The result (A.24) holds by an argument very similar to the proof of Theorem 19.2 of Bhattacharya and Rao (1976), provided we establish an analogue of Cramér's condition (i.e., their eqn. (19.25) on p. 193). Because the latter is already established in Lemma 4, we have the result (A.24).
Next, write n1/2SL = gn(n1/2Q), where

is a mapping. Then, because gn(·) is continuous, we have

uniformly over

, using (A.24) and the result of Bhattacharya and Ghosh (1978, eqns. (2.16)–(2.19), pp. 444–445). By Lemma 2.1 of the latter paper, there exists a polynomial

such that

uniformly over

. Therefore, it remains to identify

. Using the cumulants in (A.13), we can approximate (by a Taylor expansion) the characteristic function Ψn(t) of n1/2SL up to order O(n−2) uniformly over {t : ∥t∥ ≤ 1} and then take an inverse Fourier transformation of the approximation to get the desired result (A.15). This completes the proof of Theorem 3. █
Proof of Theorem 4. By (A.18), we have for all c > 0

Note that because gK is the density of the χK2 distribution,


By substituting (A.28) and (A.29) into (A.27), we have
where the second equality follows from (A.20). Therefore, supn n3h2r < ∞ implies that

for all c > 0. The proof of Theorem 3 is complete by taking c = cα in (A.31).
The case where b is replaced by

may be treated in a similar way using the fact that

and the parity properties of polynomials in Edgeworth expansions such as (A.16). █
Estimated true coverage probabilities of α-level confidence regions (DGP1)
Estimated true coverage probabilities of α-level confidence regions (DGP2)
Estimated true coverage probabilities of α-level confidence regions (DGP3)
Sensitivity of coverage errors with respect to bandwidth parameters (α = 0.95).
Coverage errors with varying sample sizes (α = 0.95, γ = −0.1(SLAD), −0.9(SEL1, SEL3)).