Federal Reserve Bank of New York Staff Reports

Size: px
Start display at page:

Download "Federal Reserve Bank of New York Staff Reports"

Transcription

1 Federal Reserve Bank of New York Staff Reports Bootstrapping Density-Weighted Average Derivatives Matias D. Cattaneo Richard K. Crup Michael Jansson Staff Report no. 45 May 00 This paper presents preliinary findings and is being distributed to econoists and other interested readers solely to stiulate discussion and elicit coents. The views expressed in this paper are those of the authors and are not necessarily reflective of views the Federal Reserve Bank of New York or the Federal Reserve Syste. Any errors or oissions are the responsibility of the authors.

2 Bootstrapping Density-Weighted Average Derivatives Matias D. Cattaneo, Richard K. Crup, and Michael Jansson Federal Reserve Bank of New York Staff Reports, no. 45 May 00 JEL classification: C, C4, C, C4 Abstract Eploying the sall-bandwidth asyptotic fraework of Cattaneo, Crup, and Jansson (009), this paper studies the properties of several bootstrap-based inference procedures associated with a kernel-based estiator of density-weighted average derivatives proposed by Powell, Stock, and Stoker (989). In any cases, the validity of bootstrap-based inference procedures is found to depend crucially on whether the bandwidth sequence satisfies a particular (asyptotic linearity) condition. An exception to this rule occurs for inference procedures involving a studentized estiator that eploys a robust variance estiator derived fro the sall-bandwidth asyptotic fraework. The results of a sall-scale Monte Carlo experient are found to be consistent with the theory and indicate in particular that sensitivity with respect to the bandwidth choice can be aeliorated by using the robust variance estiator. Key words: averaged derivatives, bootstrap, sall-bandwidth asyptotics Cattaneo: University of Michigan (e-ail: cattaneo@uich.edu). Crup: Federal Reserve Bank of New York (e-ail: richard.crup@ny.frb.org). Jansson: University of California at Berkeley and Center for Research in Econoetric Analysis of Tie Series (e-ail: jansson@econ.berkeley.edu). The authors are grateful for coents fro Joel Horowitz, Lutz Kilian, Deian Pouzo, Rocio Titiunik, and seinar participants at Duke University, Harvard University, the University of Michigan, Northwestern University, and the University of Rochester. Cattaneo thanks the National Science Foundation for financial support (SES 09505). Jansson gratefully acknowledges financial support fro the National Science Foundation (SES ) and research support fro the Center for Research in Econoetric Analysis of Tie Series, funded by the Danish National Research Foundation. The views expressed in this paper are those of the authors and do not necessarily reflect the position of the Federal Reserve Bank of New York or the Federal Reserve Syste.

3 Bootstrapping Density-Weighted Average Derivatives. Introduction Seiparaetric estiators involving functionals of nonparaetric estiators have been studied widely in econoetrics. In particular, considerable e ort has been devoted to characterizing conditions under which such estiators are asyptotically linear (see, e.g., Newey and McFadden (994), Chen (007), and the references therein). Moreover, although the asyptotic variance of an asyptotically linear seiparaetric estiator can in principle be obtained by eans of the pathwise derivative forula of Newey (994a), it is desirable fro a practical point of view to be able to base inference procedures on easures of dispersion that are autoatic in the sense that they can be constructed without knowledge (or derivation) of the in uence function (e.g., Newey (994b)). Perhaps the ost natural candidates for such easures of dispersion are variances and/or percentiles obtained using the bootstrap. Consistency of the nonparaetric bootstrap has been established for a large class of seiparaetric estiators by Chen, Linton, and van Keilego (003). Moreover, in the iportant special case of the density-weighted average derivative estiator of Powell, Stock, and Stoker (989, henceforth PSS), a suitably ipleented version of the nonparaetric bootstrap was shown by Nishiyaa and Robinson (005, henceforth NR) to provide asyptotic re neents. The analysis in NR is conducted within the asyptotic fraework of Nishiyaa and Robinson (000, 00). Using the alternative asyptotic fraework of Cattaneo, Crup, and Jansson (009, henceforth CCJ), this paper revisits the large saple behavior of bootstrap-based inference procedures for density-weighted average derivatives and obtains (analytical and Monte Carlo) results that could be interpreted as a cautionary tale regarding the ease with which one ight realize the potential for bootstrap-based inference to (...) provide iproveents in oderate-sized saples (NR, p. 97). Because the in uence function of an asyptotically linear seiparaetric estiator is invariant with respect to the nonparaetric estiator upon which it is based (e.g., Newey (994a, Proposition )), looking beyond the in uence function is iportant if the sensitivity of the distributional properties of an estiator or test statistic with respect to user chosen objects such as kernels or bandwidths is a concern. This can be accoplished in various ways, the traditional approach being to work under assuptions that iply asyptotic linearity and then develop asyptotic expansions (of the Edgeworth or Nagar variety) intended to Another autoatic easure of dispersion is the variance estiator of Newey (994b). When applied to the density-weighted average derivative estiator studied in this paper, the variance estiator of Newey (994b) coincides with Powell, Stock, and Stoker s (989) variance estiator whose salient properties are characterized in Lea below.

4 Bootstrapping Density-Weighted Average Derivatives elucidate the role of higher-order ters (e.g., Linton (995)). Siilarly to the Edgeworth expansions eployed by Nishiyaa and Robinson (000, 00, 005), CCJ s asyptotic distribution theory for PSS s estiator (and its studentized version) is obtained by retaining ters that are asyptotically negligible when the estiator is asyptotically linear. Unlike the traditional approach, the sall bandwidth approach taken by CCJ accoodates, but does not require, certain departures fro asyptotic linearity, naely those that occur when the bandwidth of the nonparaetric estiator vanishes too rapidly for asyptotic linearity to hold. Although siilar in spirit to the Edgeworth expansion approach to iproved asyptotic approxiations, the sall bandwidth approach of CCJ is conceptually distinct fro the approach taken by Nishiyaa and Robinson (000, 00, 005) and it is therefore of interest to explore whether the sall bandwidth approach gives rise to ethodological prescriptions that di er fro those obtained using the traditional approach. The rst ain result, Theore below, studies the validity of bootstrap-based approxiations to the distribution of PSS s estiator as well as its studentized version in the case where PSS s variance estiator is used for studentization purposes. It is shown that a necessary condition for bootstrap consistency is that the bandwidth vanishes slowly enough for asyptotic linearity to hold. Unlike NR, Theore therefore suggests that in saples of oderate size even the bootstrap approxiations to the distributions of PSS s estiator and test statistic(s) ay fail to adequately capture the extent to which these distributions are a ected by the choice of the bandwidth, a prediction which is borne out in a sall scale Monte Carlo experient reported in Section 4. The second ain result, Theore, establishes consistency of the bootstrap approxiation to the distribution of PSS s estiator studentized by eans of a variance estiator proposed by CCJ. As a consequence, Theore suggests that the fragility with respect to bandwidth choice uncovered by Theore is a property which should be attributed to PSS s variance estiator rather than the bootstrap distribution estiator. Another prediction of Theore, naely that the bootstrap approxiation to the distribution of an appropriately studentized estiator perfors well across a wide range of bandwidths, is borne out in the Monte Carlo experient of Section 4. Indeed, the range of bandwidths across which the bootstrap is found to perfor well is wider than the range across which the standard noral approxiation is found to perfor well, indicating that there is an iportant sense in which bootstrap-based inference is capable of providing iproveents in oderate-sized saples. The variance estiator used for studentization purposes in Theore is one for which the studentized estiator is asyptotically standard noral across the entire range of bandwidth

5 Bootstrapping Density-Weighted Average Derivatives 3 sequences considered in CCJ s approach. The nal ain result, Theore 3, studies the bootstrap approxiation to the distribution of PSS s estiator studentized by eans of an alternative variance estiator also proposed by CCJ and nds, perhaps surprisingly, that although the associated studentized estiator is asyptotically standard noral across the entire range of bandwidth sequences considered in CCJ s approach, consistency of the bootstrap requires that the bandwidth vanishes slowly enough for asyptotic linearity to hold. In addition to NR, whose relation to the present work was discussed in soe detail above, the list of papers related to this paper includes Abadie and Ibens (008) and Gonçalves and Vogelsang (00). Abadie and Ibens (008) study a nearest-neighbor atching estiator of a popular estiand in the progra evaluation literature (the e ect of treatent on the treated) and deonstrate by exaple that the nonparaetric bootstrap variance estiator can be inconsistent in that case. Although the nature of the nonparaetric estiator eployed by Abadie and Ibens (008) di ers fro the kernel estiator studied herein, their inconsistency result would appear to be siilar to the equivalence between (i) and (ii) in Theore (a) below. Coparing the results of this paper with those obtained by Abadie and Ibens (008), one apparent attraction of kernel estiators (relative to nearest-neighbor estiators) is their tractability which allows to develop fairly detailed characterizations of the large-saple behavior of bootstrap procedures, including an array of (constructive) results on how to achieve bootstrap consistency even under departures fro asyptotic linearity. Gonçalves and Vogelsang (00) are concerned with autocorrelation robust inference in stationary regression odels and establish consistency of the bootstrap under the xed-b asyptotics of Kiefer and Vogelsang (005). Although the xed-b approach of Kiefer and Vogelsang (005) is very siilar in spirit to the sall bandwidth approach of CCJ, the fact that soe of the results of this paper are invalidity results about the bootstrap is indicative of an iportant di erence between the nature of the functionals being studied in Kiefer and Vogelsang (005) and CCJ, respectively. The reainder of the paper is organized as follows. Section introduces the odel, presents the statistics under consideration, and suarizes soe results available in the literature. Section 3 studies the bootstrap and obtains the ain results of the paper. Section 4 suarizes the results of a siulation study. Section 5 concludes. The Appendix contains proofs of the theoretical results.

6 Bootstrapping Density-Weighted Average Derivatives 4. Model and Existing Results Let Z n = fz i = (y i ; x 0 i) 0 : i = ; : : : ; ng be a rando saple of the rando vector z = (y; x 0 ) 0, where y R is a dependent variable and x R d is a continuous explanatory variable with a density f (). The density-weighted average derivative is given by = E g (x), g (x) = E [yjx]. It follows fro (regularity conditions and) integration by parts that = Noting this, PSS proposed the kernel-based estiator ^n = n nx i= ^f n;i (x i ), ^fn;i (x) = n nx K h d j=;j6=i n xj E where ^f n;i () is a leave-one-out estiator of f (), with K : R d! R a kernel function and h n a positive (bandwidth) sequence. To analyze inference procedures based on ^ n, soe assuptions on the distribution of z and the properties of the user-chosen ingredients K and h n are needed. Regarding the odel and kernel function, the following assuptions will be ade. Assuption M. (a) E[y 4 ] <, E [ (x) f (x)] > 0 and V [@e (x) =@x positive de nite, where (x) = V [yjx] and e (x) = f (x) g (x). h n x, y@f (x) =@x] is (b) f is (Q + ) ties di erentiable, and f and its rst (Q + ) derivatives are bounded, for soe Q. (c) g is twice di erentiable, and e and its rst two derivatives are bounded. (d) v is di erentiable, and vf and its rst derivative are bounded, where v (x) = E[y jx]. (e) li kxk! [f (x) + je (x)j] = 0, where kk is the Euclidean nor. Assuption K. (a) K is even and di erentiable, and K and its rst derivative are bounded. (b) R K _ (u) K _ (u) 0 du is positive de nite, where K _ (u) (u) =@u. R d (c) For soe P, R R d jk (u)j ( + kuk P )du + R R d k _ K (u) k( + kuk )du <, and Z R d u l u l d d K (u) du = ( ; if l = = l d = 0; 0; if (l ; : : : ; l d ) 0 Z d + and l + + l d < P. The following conditions on the bandwidth sequence h n will play a crucial role in the sequel. (Here, and elsewhere in the paper, liits are taken as n! unless otherwise noted.)

7 Bootstrapping Density-Weighted Average Derivatives 5 Condition B. (Bias) in nh d+ n ; nh n in(p;q)! 0. Condition AL. (Asyptotic Linearity) nh d+ n!. Condition AN. (Asyptotic Norality) n h d n!. PSS studied the large saple properties of ^ n and showed that if Assuptions M and K hold and if Conditions B and AL are satis ed, then ^ n is asyptotically linear with (e cient) in uence function L (z) = [@e ]; that is, where p n(^n ) = p n nx L (z i ) + o p () N (0; ), = E L (z) L (z) 0, () i= denotes weak convergence. PSS s derivation of this result exploits the fact that the estiator ^ n adits the (n-varying) U-statistic representation ^ n = ^ n (h n ) with ^n (h) = n Xn nx i= j=i+ U (z i ; z j ; h), U (z i ; z j ; h) = h (d+) _K xi h x j (y i y j ), which leads to the Hoe ding decoposition ^ n = B n + L n + W n, where with nx B n = (h n ), Ln = n L (z i ; h n ), Wn = i= n Xn nx i= j=i+ (h) = E [U (z i ; z j ; h)], L (z i ; h) = [E[U (z i ; z j ; h) jz i ] (h)], W (z i ; z j ; h) = U (z i ; z j ; h) (L (z i; h) + L (z j ; h)) (h). W (z i ; z j ; h n ), The purpose of Conditions B and AL is to ensure that the ters B n and W n in the Hoe ding decoposition are asyptotically negligible. Speci cally, because B n = O(h in(p;q) n ) under Assuptions M and K, Condition B ensures that the bias of ^ n is asyptotically negligible. Condition AL, on the other hand, ensures that the quadratic ter W n in the Hoe ding decoposition is asyptotically negligible because p nw n = O p (= p nh d+ n ) under Assuptions M and K. In other words, and as the notation suggests, Condition AL is crucial for asyptotic linearity of ^ n. While asyptotic linearity is a desirable feature fro the point of view of asyptotic e - ciency, a potential concern about distributional approxiations for ^ n based on assuptions

8 Bootstrapping Density-Weighted Average Derivatives 6 which iply asyptotic linearity is that such approxiations ignore the variability in the reainder ter W n. Thus, classical rst-order, asyptotically linear, large saple theory ay not accurately capture the nite saple behavior of ^ n in general. It therefore sees desirable to eploy inference procedures that are robust in the sense that they reain asyptotically valid at least under certain departures fro asyptotic linearity. In an attept to construct such inference procedures, CCJ generalized () and showed that if Assuptions M and K hold and if Conditions B and AN are satis ed, then where V n = n + V = n (^ n ) N (0; I d ), () n h n (d+), = E (x) f (x) Z _K (u) K _ (u) 0 du. R d Siilarly to the asyptotic linearity result of PSS, the derivation of () is based on the Hoe ding decoposition of ^ n. Instead of requiring asyptotic linearity of the estiator, this result provides an alternative rst-order asyptotic theory under weaker assuptions, which siultaneously accounts for both the linear and quadratic ters in the expansion of ^ n. A key di erence between () and () is the presence of the ter n h (d+) n in V n, which captures the variability of Wn. In particular, result () shows that while failure of Condition AL leads to a failure of asyptotic linearity, asyptotic norality of ^ n holds under the signi cantly weaker Condition AN. The result () suggests that asyptotic standard norality of studentized estiators ight be achievable also when Condition AL is replaced by Condition AN. As an estiator of the variance of ^ n, PSS considered ^V 0;n = n ^n, where ^ n = ^ n (h n ), ^ n (h) = n " nx ^L n;i (h)^l n;i (h) 0, ^Ln;i (h) = n i= nx j=;j6=i CCJ showed that this estiator adits the stochastic expansion U(z i ; z j ; h) n ^V 0;n = n [ + o p ()] + h n (d+) [ + o p ()], ^n (h) Condition AN perits failure not only of asyptotic linearity, but also of p n-consistency (when nh d+ 0). Indeed, ^ n can be inconsistent (when li n! n h d+ n < ) under Condition AN. #. n!

9 Bootstrapping Density-Weighted Average Derivatives 7 iplying in particular that it is consistent only when Condition AL is satis ed. Recognizing this lack of robustness of ^V 0;n with respect to h n, CCJ proposed and studied the two alternative estiators ^V ;n = ^V n 0;n h n (d+) ^ n (h n ) and ^V;n = n ^n ( =(d+) h n ), where ^ n (h) = h d+ n ^W n;ij (h) = U(z i ; z j ; h) n X nx i= j=i+ ^W n;ij (h) ^W n;ij (h) 0, ^Ln;i (h) + ^L n;j (h) ^n (h). The following result is adapted fro CCJ and forulated in a anner that facilitates coparison with the ain theores given below. Lea. Suppose Assuptions M and K hold and suppose Conditions B and AN are satis ed. (a) The following are equivalent: i. Condition AL is satis ed. ii. Vn ^V 0;n! p I d. iii. ^V = 0;n (^ n ) N (0; I d ). (b) If nh d+ n is convergent in R + = [0; ], then ^V = 0;n (^ n ) N (0; 0 ), where 0 = li n! (nh d+ n + 4) = (nh d+ n + )(nh d+ n + 4) =. (c) For k f; g, Vn ^V k;n! p I d and ^V = k;n (^ n ) N (0; I d ). Part (a) is a qualitative result highlighting the crucial role played by Condition AL in connection with asyptotic validity of inference procedures based on ^V 0;n : The equivalence between (i) and (iii) shows that Condition AL is necessary and su cient for the test statistic ^V = 0;n (^ n ) proposed by PSS to be asyptotically pivotal. In turn, this equivalence is a special case of part (b), which is a quantitative result that can furtherore be used to characterize the consequences of relaxing Condition AL. Speci cally, part (b) shows that

10 Bootstrapping Density-Weighted Average Derivatives 8 = also under departures fro Condition AL the statistic ^V 0;n (^ n ) can be asyptotically noral with ean zero, but with a variance atrix 0 whose value depends on the liiting value of nh d+ n. This atrix satis es I d = 0 I d (in a positive seide nite sense), and takes on the liiting values I d = and I d when li n! nh d+ n equals 0 and, respectively. By iplication, part (b) suggests that inference procedures based on the test statistic proposed by PSS will be conservative across a nontrivial range of bandwidths. In contrast, part (c) shows that studentization by eans of ^V ;n and ^V ;n achieves asyptotic pivotality across the full range of bandwidth sequences allowed by Condition AN, suggesting in particular that coverage probabilities of con dence intervals constructed using these variance estiators will be close to their noinal level across a nontrivial range of bandwidths. Monte Carlo evidence consistent with these conjectures was presented by CCJ. Notably absent fro consideration in Lea and the Monte Carlo work of CCJ are inference procedures based on resapling. In an iportant contribution, NR studied the behavior of the standard (nonparaetric) bootstrap approxiation to the distribution of PSS s test statistic and found that under bandwidth conditions slightly stronger than Condition AL bootstrap procedures are not erely valid, but actually capable of achieving asyptotic re neents. This nding leaves open the possibility that bootstrap validity, at least to rstorder, ight hold also under departures fro Condition AL. The rst ain result presented here (Theore below) shows that, although the bootstrap approxiation to the distribution of ^V 0;n (^ n ) is ore accurate than the standard noral approxiation across the = full range of bandwidth sequences allowed by Condition AN, Condition AL is necessary and su cient for rst-order validity of the standard nonparaetric bootstrap approxiation to the distribution of PSS s test statistic. This equivalence can be viewed as a bootstrap analog of Lea (a) and it therefore sees natural to ask whether bootstrap analogs of Lea (c) are available for the inference procedures proposed by CCJ. Theore establishes a partial bootstrap analog of Lea (c), naely validity of the nonparaetric bootstrap approxiation to the distribution of ^V = ;n (^ n ) across the full range of bandwidth sequences allowed by Condition AN. That this result is not erely a consequence of the asyptotic pivotality result reported in Lea (c) is deonstrated by Theore 3, which shows that notwithstanding the asyptotic pivotality = of ^V ;n (^ n ); the nonparaetric bootstrap approxiation to the distribution of the latter statistic is valid only when Condition AL holds.

11 Bootstrapping Density-Weighted Average Derivatives 9 3. The Bootstrap 3.. Setup. This paper studies two variants of the -out-of-n replaceent bootstrap with = (n)!, naely the standard nonparaetric bootstrap ((n) = n) and (replaceent) subsapling ((n)=n! 0). 3 To describe the bootstrap procedure(s), let Z n = fzi = (yi ; x 0 i ) 0 : i = ; : : : ; (n)g be a rando saple with replaceent fro the observed saple Z n. The bootstrap analogue of the estiator ^ n is given by ^ (n) = ^ (n)(h (n) ) with ^ (h) = X X i= j=i+ x U(zi ; zj ; h), U(zi ; zj ; h) = h (d+) i _K h x j (y i y j ), while the bootstrap analogues of the estiators ^ n and ^ n are ^ (n) = ^ (n) (h (n)) and ^ (n) = ^ (n) (h (n)), respectively, where ^ (h) = " X ^L ;i(h)^l ;i(h) 0, ^L ;i (h) = i= X j=;j6=i U(z i ; z j ; h) ^ (h) #, and ^ (h) = X h d+ ^W ;ij(h) = U(z i ; z j ; h) X i= j=i+ ^W ;ij(h) ^W ;ij(h) 0, ^L ;i(h) + ^L ;j(h) ^ (h). 3.. Preliinary Lea. The ain results of this paper follow fro Lea and the following lea, which will be used to characterize the large saple properties of bootstrap = analogues of the test statistics ^V k;n (^ n ), k f0; ; g. Let superscript on P, E, or V denote a probability or oent coputed under the bootstrap distribution conditional on Z n, and let p denote weak convergence in probability (e.g., Gine and Zinn (990)). Lea. Suppose Assuptions M and K hold, suppose h n! 0 and Condition AN is satis ed, and suppose (n)! and li n! (n)=n <. (a) V (n) V [^ (n)]! p I d, where V = + + n h (d+). 3 This paper eploys the terinology introduced in Horowitz (00). See also Politis, Roano, and Wolf (999).

12 Bootstrapping Density-Weighted Average Derivatives 0 (b) (n) ^ (n)! p I d and ^ (n)! p I d, where = + + n h (d+). (c) V = (n) (^ (n) (n)) p N (0; I d ). The (conditional on Z n ) Hoe ding decoposition gives ^ = L + W, where with where and X = (h ), L = L (zi ; h ), W = i= X X i= j=i+ W (z i ; z j ; h ), (h) = E [U(z i ; z j ; h)], L (z i ; h) = [E [U(z i ; z j ; h)jz i ] (h)], W (z i ; z j ; h) = U(z i ; z j ; h) Part (a) of Lea is obtained by noting that V [^ ] = V [L (z i ; h )] + V [L (z i ; h)] ^ n (h) + n L (z i ; h) + L (z j ; h) (h). V [W (zi ; zj ; h )], h (d+), V [W (zi ; zj ; h)] h (d+) ^ n (h) h (d+). The fact that V [W (zi ; zj ; h)] h (d+) iplies that the bootstrap consistently estiates the variability of the quadratic ter in the Hoe ding decoposition. On the other hand, the fact that V [^ n] > n V [L (z i ; h n )] n ^n (h n ) = ^V 0;n iplies that the bootstrap variance estiator exhibits an upward bias even greater than that of ^V 0;n, so the bootstrap variance estiator is inconsistent whenever PSS s estiator is. In their exaple of bootstrap failure for a nearest-neighbor atching estiator, Abadie and Ibens (008) found that the (average) bootstrap variance can overestiate as well as underestiate the asyptotic variance of interest. No such abiguity occurs here, as Lea (a) shows that in the present case the bootstrap variance systeatically exceeds the asyptotic variance (when Condition AL fails).

13 Bootstrapping Density-Weighted Average Derivatives The proof of Lea (b) shows that ^ ^ n (h ) + h (d+) ^ n (h ), iplying that the asyptotic behavior of ^ di ers fro that of ^ n (h ) whenever Condition AL fails. By continuity of the d-variate standard noral cdf d () and Polya s theore for weak convergence in probability (e.g., Xiong and Li (008, Theore 3.5)), Lea (c) is equivalent to the stateent that h sup P tr d V = (n) (^ (n) i (n)) t d (t)! p 0. (3) By arguing along subsequences, it can be shown that a su cient condition for (3) is given by the following (unifor) Craér-Wold-type condition: sup sup d tr d P (^ (n) (n)) t5 (t) q 0 V (n)! p 0, (4) where d = f R d : 0 = g denotes the unit sphere in R d. 4 uses the theore of Heyde and Brown (970) to verify (4). The proof of Lea (c) 3.3. Bootstrapping PSS. Theore below is concerned with the ability of the bootstrap to approxiate the distributional properties of PSS s test statistic. To anticipate the ain ndings, notice that Lea gives V[^ n ] n + n h n (d+) and ^V0;n = n ^n n + n h (d+) n, 4 In contrast to the case of unconditional joint weak convergence, it would appear to be an open question whether a pointwise Craér-Wold condition such as 3 sup 4 0 (^ (n) (n)) t5 (t) tr q d 0 V (n)! p 0, 8 d, P iplies weak convergence in probability of V = (n) (^ (n) (n)).

14 Bootstrapping Density-Weighted Average Derivatives while, in contrast, in the case of the standard nonparaetric bootstrap (when (n) = n) Lea gives V [^ n n] n + 3 h (d+) n and ^V 0;n = n ^ n n + 4 n h (d+) n, strongly indicating that Condition AL is crucial for consistency of the bootstrap. On the other hand, in the case of subsapling (when (n) =n! 0), Lea gives V [^ ] + h (d+) and ^V 0; = ^ + h (d+), suggesting that consistency of subsapling ight hold even if Condition AL fails, at least ^V = in those cases where 0;n (^ n ) converges in distribution. (By Lea (b), convergence = in distribution of ^V 0;n (^ n ) occurs when nh d+ n is convergent in R +.) The following result, which is an iediate consequence of Leas and the continuous apping theore for weak convergence in probability (e.g., Xiong and Li (008, Theore 3.)), akes the preceding heuristics precise. Theore. Suppose the assuptions of Lea hold. (a) The following are equivalent: i. Condition AL is satis ed. ii. Vn V [^ n]! p I d. iii. sup tr d P [V = n (^ n n) t] P[V = n (^ n ) t]! p 0. iv. sup tr d P = [ ^V 0;n (^ n = n) t] P[ ^V 0;n (^ n ) t]! p 0. (b) If nh d+ n is convergent in R +, then ^V = 0;n (^ n n) p N (0; 0), where 0 = li n! (nh d+ n + 8) = (nh d+ n + 6)(nh d+ n + 8) =. (c) If (n)! and (n)=n! 0 and if nh d+ n is convergent in R +, then ^V = 0;(n)(^ (n) (n)) p N (0; 0 ).

15 Bootstrapping Density-Weighted Average Derivatives 3 In an obvious way, Theore (a)-(b) can be viewed as a standard nonparaetric bootstrap analogue of Lea (a)-(b). In particular, Theore (a) shows that Condition AL is necessary and su cient for consistency of the bootstrap. This result shows that the nonparaetric bootstrap is inconsistent whenever the estiator is not asyptotically linear (when li n! nh d+ n < ), including in particular the knife-edge case nh d+ n! (0; ) where the estiator is p n-consistent and asyptotically noral. The iplication (i) ) (iv) in Theore (a) is essentially due to NR. 5 On the other hand, the result that Condition AL is necessary for bootstrap consistency would appear to be new. In Section 4, the nite saple relevance of this sensitivity with respect to bandwidth choice suggested by Theore (a) will be explored in a Monte Carlo experient. Theore (b) can be used to quantify the severity of the bootstrap inconsistency under departures fro Condition AL. The extent of the failure of the bootstrap to approxiate the asyptotic distribution of the test statistic is captured by the variance atrix 0, which satis es 3I d =4 0 I d and takes on the liiting values 3I d =4 and I d when li n! nh d+ n equals 0 and, respectively. Interestingly, coparing Theore (b) with Lea (b), the = nonparaetric bootstrap approxiation to the distribution of ^V 0;n (^ n ) is seen to be superior to the standard noral approxiation because 0 0 I d. As a consequence, there is a sense in which the bootstrap o ers re neents even when Condition AL fails. Theore (c) shows that a su cient condition for consistency of subsapling is convergence of nh d+ n in R +. To illustrate what can happen when the latter condition fails, suppose nh d+ n is large when n is even and sall when n is odd. Speci cally, suppose that nh d+ n! and nh d+ n+! 0. Then, if (n) is even for every n, it follows fro Theore (c) that ^V 0;(n)(^ = (n) (n)) p N (0; I d ), whereas, by Lea (b), ^V = 0;n+(^ n+ ) N (0; I d =). This exaple is intentionally extree, but the qualitative essage that consistency of subsapling can fail when li n! nh d+ n does not exist is valid ore generally. Indeed, Theore (c) adits the following partial converse: If nh d+ n is not convergent in R +, then there exists 5 The results of NR are obtained under slightly stronger assuptions than those of Lea and require nh d+3 n =(log n) 9! :

16 Bootstrapping Density-Weighted Average Derivatives 4 a sequence (n) such that ((n)!, (n)=n! 0, and) sup tr d P = [ ^V 0;(n)(^ (n) = (n)) t] P[ ^V 0;n (^ n ) t] 9 p 0. In other words, eploying critical values obtained by eans of subsapling does not autoatically robustify an inference procedure based on PSS s statistic. = = 3.4. Bootstrapping CCJ. Because both ^V ;n (^ n ) and ^V ;n (^ n ) are asyptotically standard noral under the assuptions of Lea, folklore suggests that the bootstrap should be capable of consistently estiating their distributions. In the case of the statistic studentized by eans of ^V ;n, this conjecture turns out to be correct, essentially because it follows fro Lea that ^V ; = ^ h (d+) ^ + + n h (d+) V [^ ]. More precisely, an application of Lea and the continuous apping theore for weak convergence in probability yields the following result. Theore. If the assuptions of Lea hold, (n)!, and if li n! (n) =n <, = then ^V ;(n) (^ (n) (n)) p N (0; I d ). Theore deonstrates by exaple that even if Condition AL fails it is possible, by proper choice of variance estiator, to achieve consistency of the nonparaetric bootstrap estiator of the distribution of a studentized version of PSS s estiator. The theory presented here does not allow to deterine whether the bootstrap approxiation enjoys any advantages over the standard noral approxiation, but Monte Carlo evidence reported in Section 4 suggests that bootstrap-based inference does have attractive sall saple properties. In the case of subsapling, consistency of the approxiation to the distribution of ^V = ;n (^ n ) is unsurprising in light of its asyptotic pivotality, and it is natural to expect = an analogous result holds for ^V ;n (^ n ). On the other hand, it follows fro Lea that ^V ;n = n ^ n =(d+) h n n + n h (d+) n V [^ n] n h n (d+),

17 Bootstrapping Density-Weighted Average Derivatives 5 suggesting that Condition AL will be of crucial iportance for bootstrap consistency in the = case of ^V ;n (^ n ). Theore 3. Suppose the assuptions of Lea hold. (a) If nh d+ n is convergent in R +, then ^V = ;n (^ n n) p N (0; ), where = li n! (nh d+ n + 4) = (nh d+ n + 6)(nh d+ n + 4) =. In particular, ^V = ;n (^ n n) p N (0; I d ) if and only if Condition AL is satis ed. (b) If (n)! and (n)=n! 0, then ^V = ;(n) (^ (n) (n)) p N (0; I d ). Theore 3 and the arguents on which it is based is of interest for at least two reasons. First, while there is no shortage of exaples of bootstrap failure in the literature, it sees surprising that the bootstrap fails to approxiate the distribution of the asyptotically = pivotal statistic ^V ;n (^ n ) whenever Condition AL is violated. 6 Second, a variation on the idea underlying the construction of ^V ;n can be used to construct a test statistic whose bootstrap distribution validly approxiates the distribution of PSS s statistic under the assuptions of Lea. Speci cally, because it follows fro Leas that V [^ n(3 =(d+) h n )] n + n h (d+) n V[^ n ] and ^V ;n ^V 0;n, it can be shown that if the assuptions of Lea hold, then sup P = [ ^V ;n (^ n(3 =(d+) h n ) n(3 =(d+) = h n )) t] P[ ^V 0;n (^ n ) t]! p 0, tr d even if nh d+ n does not converge. Adittedly, this construction is ainly of theoretical interest, but it does see noteworthy that this resapling procedure works even in the case where subsapling ight fail Suary of Results. The ain results of this paper are suarized in Table. This table describes the liiting distributions of the test statistics proposed by PSS and CCJ, as well as the liiting distributions (in probability) of their bootstrap analogues. (CCJ k 6 The severity of the bootstrap failure is characterized in Theore 3(a) and easured by the variance atrix, which satis es I d 3I d =, iplying that inference based on the bootstrap approxiation = to the distribution of ^V ;n (^ n ) will be asyptotically conservative.

18 Bootstrapping Density-Weighted Average Derivatives 6 with k f; g refers to the test statistics in Lea (c).) Each panel corresponds to one test statistic, and includes 3 rows corresponding to each approxiation used (large saple distribution, standard bootstrap, and replaceent subsapling, respectively). Each colun analyzes a subset of possible bandwidth sequences, which leads to di erent approxiations in general. As shown in the table, the robust studentized test statistic using ^V ;n, denoted CCJ, is the only statistic that reains valid in all cases. For the studentized test statistic of PSS ( rst panel), both the standard bootstrap and replaceent subsapling are invalid in general, while for the robust studentized test statistic using ^V ;n, denoted CCJ, only replaceent subsapling is valid. As discussed above, the extent of the failure of the bootstrap and the direction of its bias are described in the extree case of = 0. Table also highlights that when nh d+ n is not convergent in R +, weak convergence (in probability) of any asyptotically non-pivotal test statistic (under the bootstrap distribution) is not guaranteed in general. 4. Siulations In an attept to explore whether the theory-based predictions presented above are borne out in saples of oderate size, this section reports the ain results fro a Monte Carlo experient. The siulation study uses a Tobit odel y i = ~y i (~y i > 0) with ~y i = x 0 i + " i, " i s N (0; ) independent of the vector of regressors x i R d, and () representing the indicator function. The diension of the covariates is set to d = and both coponents of are set equal to unity. The vector of regressors is generated using independent rando variables with the second coponent set to x i s N (0; ). Two data generating processes are considered for the rst coponent of x i : Model iposes x i s N (0; ) and Model iposes x i s ( 4 4)= p 8, with p a chi-squared rando variable with p degrees of freedo. For siplicity only results for the rst coponent of = ( ; ) 0 are reported. The population paraeters of interest are = =8 and 0:03906 for Model and Model, respectively. Note that Model corresponds to the one analyzed in Nishiyaa and Robinson (000, 005), while both odels were also considered in CCJ and Cattaneo, Crup, and Jansson (00). The nuber of siulations is set to S = 3; 000, the saple size for each siulation is set to n = ; 000, and the nuber of bootstrap replications for each siulation is set to B = ; 000. (See Andrews and Buchinsky (000) for a discussion of the latter choice.) The Monte Carlo experient is very coputationally deanding: each design, with a grid of 5

19 Bootstrapping Density-Weighted Average Derivatives 7 bandwidths, requires approxiately 6 days to coplete, when using a C code (with wrapper in R) parallelized in 50 CPUs (:33 Ghz). The coputer code is available upon request. The siulation study presents evidence on the perforance of the standard nonparaetric bootstrap across an appropriate grid of possible bandwidth choices. Three test statistics are considered for the bootstrap procedure: PSS = 0 (^ n q n), NR = 0 (^ n q n 0 ^V 0 ^V 0;n 0;n ^B n ), CCJ = 0 (^ n q n), 0 ^V with = (; 0) 0, and where ^B n is a bias-correction estiate. The rst test statistic (PSS ) corresponds to the bootstrap analogue of the classical, asyptotically linear, test statistic proposed by PSS. The second test statistic (NR ) corresponds to the bias-corrected statistic proposed by NR. The third test statistic (CCJ ) corresponds to the bootstrap analogue of the robust, asyptotically noral, test statistic proposed by CCJ. For ipleentation, a standard Gaussian product kernel is used for P =, and a Gaussian density-based ultiplicative kernel is used for P = 4. The bias-correction estiate ^B n is constructed using a plug-in estiator for the population bias with an initial bandwidth choice of b n = :h n, as discussed in Nishiyaa and Robinson (000, 005).. The results are suarized in Figure (P = ) and Figure (P = 4). These gures plot the epirical coverage for the three copeting 95% con dence intervals as a function of the choice of bandwidth. To facilitate the analysis two additional horizontal lines at 0:90 and at the noinal coverage rate 0:95 are included for reference. In each gure, the rst and second rows correspond to Models and, respectively. Also, for each gure, the rst colun depicts the results for the copeting con dence intervals using the standard nonparaetric bootstrap to approxiate the quantiles of interest, while the second colun does the sae but using the large saple distribution quantiles (e.g., (0:975) :96). Finally, each plot also includes three population bandwidth selectors available in the literature for density-weighted average derivatives as vertical lines. Speci cally, h P S, h NR and h CCJ denote the population optial bandwidth choices described in Powell and Stoker (996), NR and Cattaneo, Crup, and Jansson (00), respectively. The bandwidths di er in general, although h P S = h NR when d = and P =. (For a detailed discussion and coparison of these bandwidth selectors, see Cattaneo, Crup, and Jansson (00).) The ain results are consistent across all designs considered. First, it is seen that bootstrapping PSS induces a bias in the distributional approxiation for sall bandwidths, ;n

20 Bootstrapping Density-Weighted Average Derivatives 8 as predicted in Theore. Second, bootstrapping CCJ (which uses ^V ;n ) provides a closeto-correct approxiation for a range of sall bandwidth choices, as predicted by Theore. Third, by coparing these results across coluns (bootstrapping vs. Gaussian approxiations), it is seen that the bias in the distributional approxiation of PSS for sall bandwidths is saller (leading to shorter con dence intervals) than the corresponding bias introduced fro using the Gaussian approxiation (longer con dence intervals), as predicted by Theore. In addition, it is found that the range of bandwidths with close-to-correct coverage has been enlarged for both PSS and CCJ when using the bootstrap approxiation instead of the Gaussian approxiation. The bias correction proposed by Nishiyaa and Robinson (000, 005) does not see to work well when P = (Figure ), but works soewhat better when P = 4 (Figure ). 7 Based on the theoretical results developed in this paper, and the siulation evidence presented, it appears that con dence intervals based on the bootstrap distribution of CCJ perfor the best, as they are valid under quite weak conditions. In ters of bandwidth selection, the Monte Carlo experient shows that h CCJ falls clearly inside the robust range of bandwidths in all cases. Interestingly, and because bootstrapping CCJ sees to enlarge the robust range of bandwidths, the bandwidth selectors h P S and h NR also appear to be valid when coupled with the bootstrapped con dence intervals based on CCJ. 5. Conclusion Eploying the sall bandwidth asyptotic fraework of CCJ, this paper has developed theory-based predictions of nite saple behavior of a variety of bootstrap-based inference procedures associated with the kernel-based density-weighted averaged derivative estiator proposed by PSS. In iportant respects, the predictions and ethodological prescriptions eerging fro the analysis presented here di er fro those obtained using Edgeworth expansions by NR. The results of a sall-scale Monte Carlo experient were found to be consistent with the theory developed here, indicating in particular that while the properties of inference procedures eploying the variance estiator of PSS are very sensitive to bandwidth choice, this sensitivity can be aeliorated by using a robust variance estiator proposed in CCJ. 7 It sees plausible that these conclusions are sensitive to the choice of initial bandwidth b n for the construction of the estiator ^B n, but we have ade no attept to iprove on the initial bandwidth choice advocated by Nishiyaa and Robinson (000, 005).

21 Bootstrapping Density-Weighted Average Derivatives 9 For any R d ; let ~ U ij;n () = 0 [U (z i ; z j ; h n ) T ;n () = T 3;n () = T 4;n () = n n 3 n 4 X i<jn X i<j<kn X i<j<k<ln as well as their bootstrap analogues T ;() = T 3;() = T 4;() = 3 4 X i<j X i<j<k X i<j<k<l 6. Appendix ~U ij;n (), T ;n () = (h n )] and de ne the n-varying U-statistics n X i<jn ~U ij;n (), ~U ij;n () U ~ ik;n () + U ~ ij;n () U ~ jk;n () + U ~ ik;n () U ~ jk;n (), 3 ~U ij;n () U ~ kl;n () + U ~ ik;n () U ~ jl;n () + U ~ il;n () U ~ jk;n (), 3 ~U ij;(), T ;() = X i<j ~U ij;(), ~U ij;() U ~ ik; () + U ~ ij;() U ~ jk; () + U ~ ik; () U ~ jk; (), 3 ~U ij;() U ~ kl; () + U ~ ik; () U ~ jl; () + U ~ il; () U ~ jk; (), 3 where ~ U ij;() = 0 [U(z i ; z j ; h ) (h )]. (Here, and elsewhere in the Appendix, the dependence of (n) on n has been suppressed.) The proof of Lea uses four technical leas, proofs of which are available upon request. The rst lea is a siple algebraic result relating ^ n and ^ n (and their bootstrap analogues) to T ;n ; T ;n ; T 3;n ; and T 4;n (and their bootstrap analogues). Lea A-. If the assuptions of Lea hold and if R d, then (a) 0 ^n (h n ) = 4 [ + o ()] n T ;n () + 4[ + o ()]T 3;n () 4T ;n (), (b) h (d+) n 0 ^n (h n ) = [ + o ()]T ;n () T ;n () [ + o ()]T 3;n () + [ + o ()]T 4;n (), (c) 0 ^ (h ) = 4 [ + o ()] T ;() + 4[ + o ()]T 3;() 4T ;(), (d) h (d+) 0 ^ (h ) = [+o ()]T ;() T ;() [+o ()]T 3;()+[+o ()]T 4;(). The next lea, which follows by standard properties of (n-varying) U-statistics (e.g., NR and CCJ), gives soe asyptotic properties of T ;n ; T ;n ; T 3;n ; and T 4;n (and their boot-

22 Bootstrapping Density-Weighted Average Derivatives 0 strap analogues). Let n = = in ; nh d+ n. Lea A-. If the assuptions of Lea hold and if R d, then (a) T ;n () = o p ( p n ), (b) T ;n () = E[ ~ U ij;n () ] + o p (h (d+) n ), (c) T 3;n () = E[(E[ ~ U ij;n ()jz i ]) ] + o p ( n ), (d) T 4;n () = o p ( n ), (e) h d+ n E[ U ~ ij;n () ]! 0 and E[(E[ U ~ ij;n ()jz i ]) ]! 0 =4, (f) T;() = o p ( p ), (g) T;() = E [ U ~ ij;() ] + o p (h (d+) ), (h) T 3;() = E [(E[ ~ U ij;()jz n ; z i ]) ] + o p ( ), (i) T 4;() = o p ( ), (j) h d+ E [ ~ U ij;() ]! p 0 and E [(E[ ~ U ij; () jz n ; z i ]) ] 0 ^n (h )=4! p 0. The next lea, which can be established by expanding sus and using siple bounding arguents, is used to establish a pointwise version of (4). Lea A-3. If the assuptions of Lea hold and if R d, then (a) E[(E[ U ~ ij;()jz n ; zi ]) 4 ] = O( + h 3 ), (b) E[ U ~ ij;() 4 ] = O(h (3d+4) ), (c) E[(E[ U ~ ij;() jz n ; zi ]) ] = O( h (3d+4) + h (d+4) ), (d) E[(E[ ~ U ij;() ~ U ik; ()jz n; z j ; z k ]) ] = O(h (d+4) + h (3d+4) ), (e) E[(E[E[ ~ U ij;()jz n ; z i ] ~ U ij;()jz n ; z j ]) ] = O( + h (d+4) + 3 h (3d+4) ). Finally, the following lea about quadratic fors is used to deduce (4) fro its pointwise counterpart. Lea A-4. There exist constants C and J (only dependent on d) and a collection l ; : : : ; l J d such that, for every d d atrix M, sup d ( 0 M) C JX j= l 0 jml j. Proof of Lea. By the properties of the (conditional on Z n ) Hoe ding decopo-

23 Bootstrapping Density-Weighted Average Derivatives sition, E[L (z i ; h)jz n ] = 0 and E[W (z i ; z j ; h)jz n ; z i ] = 0, so V [^ ] = V [L (z i ; h )] + where, using Leas A- and A-, n V [L (zi ; h )] = n Also, for any R d ; it can be shown that ^n (h ) = + n V [W (zi ; zj ; h )], h (d+) + o p ( ). 0 V [W (z i ; z j ; h )] = h (d+) n h 0 ^n (h ) + o p ()i n 3 n 0 ^n (h ). n Therefore, using Leas A- and A-, copleting the proof of part (a). Next, using Leas A- and A-, V [W (z i ; z j ; h )] = h (d+) + o p ( ), 0 ^ (h ) = 4[ + o ()] T ;() + 4[ + o ()]T 3;() 4T ;() establishing part (b). = 0 ^n (h ) + 4 h (d+) 0 + o p ( ) = 0 + o p ( ), Finally, to establish part (c), the theore of Heyde and Brown (970) is eployed to prove the following condition, which is equivalent to (4) in view of part (a): sup sup d tr d P 4 0 (^ ) q 0 V [^ ] 3 t5 (t)! p 0. For any d, 0^ q 0 0 V [^ ] = X i= Y i; (),

24 Bootstrapping Density-Weighted Average Derivatives where, de ning L i; () = 0 L (z i ; h ) and W ij; () = 0 W (z j ; z i ; h ); Y i; () = " Xi q L 0 V [^ i; () + j= ] # Wij; (). For any n; Y i; () ; F i;n is a artingale di erence sequence, where F i;n = (Z n ; z ; : : : ; z i ) : Therefore, by the theore of Heyde and Brown (970), there exists a constant C such that 3 sup sup d tr d P 4 0 (^ q ) t5 (t) 0 V [^ ] 8 < X C sup E Yi; () 4 X + E 4 E Yi; () F : i d i= i= ;n! 39 = 5 ; =5. Moreover, by Lea A-4, 8 < X sup E Yi; () 4 + E 4 : d i= X i= E Y i; () F i ;n! 39 = 5 ;! p 0 if (and only if) the following hold for every d : X i= E Y i; () 4! p 0 (5) and E 4 X i= E Y i; () F i ;n! 3 5! p 0. (6) The proof of part (c) will be copleted by xing d and verifying (5) (6) : First, using ( 0 V [^ ]) = O p ( ) and basic inequalities, it can be shown that (5) holds if R ; = X E L i; () 4! 0 i=

25 Bootstrapping Density-Weighted Average Derivatives 3 and R ; = 6 X E 4 i=! Xi 4 3 Wij; () 5! 0. j= Both conditions are satis ed because, using Lea A-3, R ; = O E[(E[ U ~ ij; () jz n ; zi ]) 4 ] = O + h = O + h d! 0 and h R ; = O 4 E ~U ij; () 4i + 3 E[(E[ U ~ ij; () jz n ; zi ]) ] = O 4 h (3d+4) + 3 h (d+4) = O h d +! 0. Next, consider (6). Because ( 0 V [^ ]) = " X X i= it su ces to show that R 3; = 6 i= 0 E Yi; () Fi 4 + E 4 R 4; = 6 E R 5; = 4 i=! Xi Wij; () j= X Xi j= i= j= # X Xi E W ij; () F i 4 E i= j= k= 3 F i 5 ;n Xi E Wij; () A j= E L i; () W ij; () jf i ;n, ;n E! 3 Wij; () 5! 0, X Xi j X E Wij; () Wik; () Fi ;n! 3 5! 0, 4 X Xi E! 3 L i; () Wij; () jz n ; zj 5! 0. i= j=

26 Bootstrapping Density-Weighted Average Derivatives 4 By siple calculations and Lea A-3, R 5; = O R 3; = O 4 E[Wij; () 4 ] = O = O 4 h (3d+4) 4 E[ U ~ ij; () 4 ] = O h d! 0, h R 4; = O E E[Wij; () Wik; () jz n ; zj ; zk] i = O E E[ U ~ ij; () U ~ ik; () jz n ; zj ; zk] = O = O h (d+4) + 4 h (3d+4) h E E E E i L i; () Wij; () jz n ; zj h = O h d + h d! 0, i E[ U ~ ij; () jz n ; zi ] U ~ ij; () jz n ; zj = O + h d + h d! 0, = O + h (d+4) + 4 h (3d+4) as was to be shown.

27 Bootstrapping Density-Weighted Average Derivatives 5 References Abadie, A., and G. W. Ibens (008): On the Failure of the Bootstrap for Matching Estiators, Econoetrica, 76(6), Andrews, D. W. K., and M. Buchinsky (000): A Three-Step Method for Choosing the Nuber of Bootstrap Repetitions, Econoetrica, 68(), 3 5. Cattaneo, M. D., R. K. Crup, and M. Jansson (009): Sall Bandwidth Asyptotics for Density-Weighted Average Derivatives, working paper. (00): Robust Data-Driven Inference for Density-Weighted Average Derivatives, forthcoing in Journal of the Aerican Statistical Association. Chen, X. (007): Large Saple Sieve Estiation of Sei-Nonparaetric Models, in Handbook of Econoetrics, Volue VI, ed. by J. J. Heckan, and E. Leaer, pp Elsevier Science B.V., New York. Chen, X., O. Linton, and van Keilego (003): Estiation of Seiparaetric Models when The Criterion Function Is Not Sooth, Econoetrica, 7(5), Gine, E., and J. Zinn (990): Bootstrapping General Epirical Measures, Annals of Probability, 8(), Gonçalves, S., and T. J. Vogelsang (00): Block Bootstrap HAC Robust Tests: The Sophistication of the Naive Bootstrap, forthcoing in Econoetric Theory. Heyde, C. C., and B. M. Brown (970): On the Departure fro Norality of a Certain Class of Martingales, Annals of Matheatical Statistics, 4(6), Horowitz, J. (00): The Bootstrap, in Handbook of Econoetrics, Volue V, ed. by J. Heckan, and E. Leaer, pp Elsevier Science B.V., New York. Kiefer, N. M., and T. J. Vogelsang (005): A New Asyptotic Theory for Heteroskedasticity-Autocorrelation Robust Tests, Econoetric Theory, (6), Linton, O. (995): Second Order Approxiation in the Partialy Linear Regression Model, Econoetrica, 63(5), 079. Newey, W. K. (994a): The Asyptotic Variance of Seiparaetric Estiators, Econoetrica, 6(6), (994b): Kernel Estiation of Partial Means and a General Variance Estiator, Econoetric Theory, 0(),

28 Bootstrapping Density-Weighted Average Derivatives 6 Newey, W. K., and D. L. McFadden (994): Large Saple Estiation and Hypothesis Testing, in Handbook of Econoetrics, Volue IV, ed. by R. F. Engle, and D. L. McFadden, pp. 45. Elsevier Science B.V., New York. Nishiyaa, Y., and P. M. Robinson (000): Edgeworth Expansions for Seiparaetric Averaged Derivatives, Econoetrica, 68(4), (00): Studentization in Edgeworth Expansions for Estiates of Seiparaetric Index Models, in Nonlinear Statistical Modeling: Essays in Honor of Takeshi Aeiya, ed. by C. Hsiao, K. Moriune, and J. L. Powell, pp Cabridge University Press, New York. (005): The Bootstrap and the Edgeworth Correction for Seiparaetric Averaged Derivatives, Econoetrica, 73(3), Politis, D., J. Roano, and M. Wolf (999): Subsapling. Springer, New York. Powell, J. L., J. H. Stock, and T. M. Stoker (989): Seiparaetric Estiation of Index Coe cients, Econoetrica, 57(6), Powell, J. L., and T. M. Stoker (996): Optial Bandwidth Choice for Density- Weighted Averages, Journal of Econoetrics, 75(), Xiong, S., and G. Li (008): Soe Results on the Convergence of Conditional Distributions, Statistics and Probability Letters, 78(8),

Bootstrapping Density-Weighted Average Derivatives. May 17, 2010

Bootstrapping Density-Weighted Average Derivatives. May 17, 2010 Bootstrapping Density-Weighted Average Derivatives M D. C D E, U M R K. C F R B N Y M J D E, UC B CREATES May 17, 010 A. Eploying the sall bandwidth asyptotic fraework of Cattaneo, Crup, and Jansson (009),

More information

The proofs of Theorem 1-3 are along the lines of Wied and Galeano (2013).

The proofs of Theorem 1-3 are along the lines of Wied and Galeano (2013). A Appendix: Proofs The proofs of Theore 1-3 are along the lines of Wied and Galeano (2013) Proof of Theore 1 Let D[d 1, d 2 ] be the space of càdlàg functions on the interval [d 1, d 2 ] equipped with

More information

Bootstrapping Dependent Data

Bootstrapping Dependent Data Bootstrapping Dependent Data One of the key issues confronting bootstrap resapling approxiations is how to deal with dependent data. Consider a sequence fx t g n t= of dependent rando variables. Clearly

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

Testing equality of variances for multiple univariate normal populations

Testing equality of variances for multiple univariate normal populations University of Wollongong Research Online Centre for Statistical & Survey Methodology Working Paper Series Faculty of Engineering and Inforation Sciences 0 esting equality of variances for ultiple univariate

More information

A Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

More information

DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS

DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS ISSN 1440-771X AUSTRALIA DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS An Iproved Method for Bandwidth Selection When Estiating ROC Curves Peter G Hall and Rob J Hyndan Working Paper 11/00 An iproved

More information

arxiv: v1 [math.pr] 17 May 2009

arxiv: v1 [math.pr] 17 May 2009 A strong law of large nubers for artingale arrays Yves F. Atchadé arxiv:0905.2761v1 [ath.pr] 17 May 2009 March 2009 Abstract: We prove a artingale triangular array generalization of the Chow-Birnbau- Marshall

More information

Keywords: Estimator, Bias, Mean-squared error, normality, generalized Pareto distribution

Keywords: Estimator, Bias, Mean-squared error, normality, generalized Pareto distribution Testing approxiate norality of an estiator using the estiated MSE and bias with an application to the shape paraeter of the generalized Pareto distribution J. Martin van Zyl Abstract In this work the norality

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

Testing the lag length of vector autoregressive models: A power comparison between portmanteau and Lagrange multiplier tests

Testing the lag length of vector autoregressive models: A power comparison between portmanteau and Lagrange multiplier tests Working Papers 2017-03 Testing the lag length of vector autoregressive odels: A power coparison between portanteau and Lagrange ultiplier tests Raja Ben Hajria National Engineering School, University of

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer

More information

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents

More information

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,

More information

Multi-Dimensional Hegselmann-Krause Dynamics

Multi-Dimensional Hegselmann-Krause Dynamics Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory

More information

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

Supplement to: Subsampling Methods for Persistent Homology

Supplement to: Subsampling Methods for Persistent Homology Suppleent to: Subsapling Methods for Persistent Hoology A. Technical results In this section, we present soe technical results that will be used to prove the ain theores. First, we expand the notation

More information

Optimal Jackknife for Discrete Time and Continuous Time Unit Root Models

Optimal Jackknife for Discrete Time and Continuous Time Unit Root Models Optial Jackknife for Discrete Tie and Continuous Tie Unit Root Models Ye Chen and Jun Yu Singapore Manageent University January 6, Abstract Maxiu likelihood estiation of the persistence paraeter in the

More information

Nonlinear Log-Periodogram Regression for Perturbed Fractional Processes

Nonlinear Log-Periodogram Regression for Perturbed Fractional Processes Nonlinear Log-Periodogra Regression for Perturbed Fractional Processes Yixiao Sun Departent of Econoics Yale University Peter C. B. Phillips Cowles Foundation for Research in Econoics Yale University First

More information

Sharp Time Data Tradeoffs for Linear Inverse Problems

Sharp Time Data Tradeoffs for Linear Inverse Problems Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used

More information

3.8 Three Types of Convergence

3.8 Three Types of Convergence 3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to

More information

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique

More information

are equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are,

are equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are, Page of 8 Suppleentary Materials: A ultiple testing procedure for ulti-diensional pairwise coparisons with application to gene expression studies Anjana Grandhi, Wenge Guo, Shyaal D. Peddada S Notations

More information

Some Proofs: This section provides proofs of some theoretical results in section 3.

Some Proofs: This section provides proofs of some theoretical results in section 3. Testing Jups via False Discovery Rate Control Yu-Min Yen. Institute of Econoics, Acadeia Sinica, Taipei, Taiwan. E-ail: YMYEN@econ.sinica.edu.tw. SUPPLEMENTARY MATERIALS Suppleentary Materials contain

More information

A Jackknife Correction to a Test for Cointegration Rank

A Jackknife Correction to a Test for Cointegration Rank Econoetrics 205, 3, 355-375; doi:0.3390/econoetrics3020355 OPEN ACCESS econoetrics ISSN 2225-46 www.dpi.co/journal/econoetrics Article A Jackknife Correction to a Test for Cointegration Rank Marcus J.

More information

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns

More information

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter

More information

AN OPTIMAL SHRINKAGE FACTOR IN PREDICTION OF ORDERED RANDOM EFFECTS

AN OPTIMAL SHRINKAGE FACTOR IN PREDICTION OF ORDERED RANDOM EFFECTS Statistica Sinica 6 016, 1709-178 doi:http://dx.doi.org/10.5705/ss.0014.0034 AN OPTIMAL SHRINKAGE FACTOR IN PREDICTION OF ORDERED RANDOM EFFECTS Nilabja Guha 1, Anindya Roy, Yaakov Malinovsky and Gauri

More information

Testing Properties of Collections of Distributions

Testing Properties of Collections of Distributions Testing Properties of Collections of Distributions Reut Levi Dana Ron Ronitt Rubinfeld April 9, 0 Abstract We propose a fraework for studying property testing of collections of distributions, where the

More information

Testing for a Break in the Memory Parameter

Testing for a Break in the Memory Parameter Testing for a Break in the Meory Paraeter Fabrizio Iacone Econoics Departent London School of Econoics Houghton Street London WCA AE April 5, 005 Abstract It is often of interest in the applied analysis

More information

Physics 139B Solutions to Homework Set 3 Fall 2009

Physics 139B Solutions to Homework Set 3 Fall 2009 Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about

More information

A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax:

A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax: A general forulation of the cross-nested logit odel Michel Bierlaire, EPFL Conference paper STRC 2001 Session: Choices A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics,

More information

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany. New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing

More information

On Conditions for Linearity of Optimal Estimation

On Conditions for Linearity of Optimal Estimation On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at

More information

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,

More information

A Small-Sample Estimator for the Sample-Selection Model

A Small-Sample Estimator for the Sample-Selection Model A Sall-Saple Estiator for the Saple-Selection Model by Aos Golan, Enrico Moretti, and Jeffrey M. Perloff October 2000 ABSTRACT A seiparaetric estiator for evaluating the paraeters of data generated under

More information

Smooth Test for Testing Equality of Two Densities 1

Smooth Test for Testing Equality of Two Densities 1 Sooth Test for Testing Equality of Two Densities Anil K. Bera University of Illinois. E-ail:abera@uiuc.edu. Phone: 7-333-4596. Aurobindo Ghosh Singapore Manageent University. E-ail:aurobindo@su.edu.sg.

More information

Meta-Analytic Interval Estimation for Bivariate Correlations

Meta-Analytic Interval Estimation for Bivariate Correlations Psychological Methods 2008, Vol. 13, No. 3, 173 181 Copyright 2008 by the Aerican Psychological Association 1082-989X/08/$12.00 DOI: 10.1037/a0012868 Meta-Analytic Interval Estiation for Bivariate Correlations

More information

Biostatistics Department Technical Report

Biostatistics Department Technical Report Biostatistics Departent Technical Report BST006-00 Estiation of Prevalence by Pool Screening With Equal Sized Pools and a egative Binoial Sapling Model Charles R. Katholi, Ph.D. Eeritus Professor Departent

More information

Simultaneous critical values for t-tests in very high dimensions

Simultaneous critical values for t-tests in very high dimensions Bernoulli 17(1, 2011, 347 394 DOI: 10.3150/10-BEJ272 Siultaneous critical values for t-tests in very high diensions HONGYUAN CAO 1 and MICHAEL R. KOSOROK 2 1 Departent of Health Studies, 5841 South Maryland

More information

In this chapter, we consider several graph-theoretic and probabilistic models

In this chapter, we consider several graph-theoretic and probabilistic models THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

SPECTRUM sensing is a core concept of cognitive radio

SPECTRUM sensing is a core concept of cognitive radio World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile

More information

A Powerful Portmanteau Test of Lack of Fit for Time Series

A Powerful Portmanteau Test of Lack of Fit for Time Series A Powerful Portanteau Test of Lack of Fit for Tie Series Daniel Peña and Julio Rodríguez A new portanteau test for tie series, ore powerful than the tests of Ljung and Box and Monti, is proposed. The test

More information

Estimation of the Population Mean Based on Extremes Ranked Set Sampling

Estimation of the Population Mean Based on Extremes Ranked Set Sampling Aerican Journal of Matheatics Statistics 05, 5(: 3-3 DOI: 0.593/j.ajs.05050.05 Estiation of the Population Mean Based on Extrees Ranked Set Sapling B. S. Biradar,*, Santosha C. D. Departent of Studies

More information

Inference about Realized Volatility using In ll Subsampling

Inference about Realized Volatility using In ll Subsampling Inference about Realized Volatility using In ll Subsapling Ilze Kalnina y and Oliver Linton z The London School of Econoics (PRELIMINARY AND INCOMPLETE) April 16, 7 Abstract We investigate the use of subsapling,

More information

Distributed Subgradient Methods for Multi-agent Optimization

Distributed Subgradient Methods for Multi-agent Optimization 1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions

More information

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science A Better Algorith For an Ancient Scheduling Proble David R. Karger Steven J. Phillips Eric Torng Departent of Coputer Science Stanford University Stanford, CA 9435-4 Abstract One of the oldest and siplest

More information

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna

More information

Physics 215 Winter The Density Matrix

Physics 215 Winter The Density Matrix Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it

More information

Detection and Estimation Theory

Detection and Estimation Theory ESE 54 Detection and Estiation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electronic Systes and Signals Research Laboratory Electrical and Systes Engineering Washington University 11 Urbauer

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

Computable Shell Decomposition Bounds

Computable Shell Decomposition Bounds Coputable Shell Decoposition Bounds John Langford TTI-Chicago jcl@cs.cu.edu David McAllester TTI-Chicago dac@autoreason.co Editor: Leslie Pack Kaelbling and David Cohn Abstract Haussler, Kearns, Seung

More information

3.3 Variational Characterization of Singular Values

3.3 Variational Characterization of Singular Values 3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and

More information

arxiv: v1 [cs.ds] 3 Feb 2014

arxiv: v1 [cs.ds] 3 Feb 2014 arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/

More information

arxiv: v1 [stat.ot] 7 Jul 2010

arxiv: v1 [stat.ot] 7 Jul 2010 Hotelling s test for highly correlated data P. Bubeliny e-ail: bubeliny@karlin.ff.cuni.cz Charles University, Faculty of Matheatics and Physics, KPMS, Sokolovska 83, Prague, Czech Republic, 8675. arxiv:007.094v

More information

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

OBJECTIVES INTRODUCTION

OBJECTIVES INTRODUCTION M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and

More information

The Hilbert Schmidt version of the commutator theorem for zero trace matrices

The Hilbert Schmidt version of the commutator theorem for zero trace matrices The Hilbert Schidt version of the coutator theore for zero trace atrices Oer Angel Gideon Schechtan March 205 Abstract Let A be a coplex atrix with zero trace. Then there are atrices B and C such that

More information

COS 424: Interacting with Data. Written Exercises

COS 424: Interacting with Data. Written Exercises COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well

More information

A Note on the Applied Use of MDL Approximations

A Note on the Applied Use of MDL Approximations A Note on the Applied Use of MDL Approxiations Daniel J. Navarro Departent of Psychology Ohio State University Abstract An applied proble is discussed in which two nested psychological odels of retention

More information

Necessity of low effective dimension

Necessity of low effective dimension Necessity of low effective diension Art B. Owen Stanford University October 2002, Orig: July 2002 Abstract Practitioners have long noticed that quasi-monte Carlo ethods work very well on functions that

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

The degree of a typical vertex in generalized random intersection graph models

The degree of a typical vertex in generalized random intersection graph models Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent

More information

Interactive Markov Models of Evolutionary Algorithms

Interactive Markov Models of Evolutionary Algorithms Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Journal of Marine Science and Technology, Vol 19, No 5, pp 509-513 (2011) 509 LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Ming-Tao Chou* Key words: fuzzy tie series, fuzzy forecasting,

More information

Constrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008

Constrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008 LIDS Report 2779 1 Constrained Consensus and Optiization in Multi-Agent Networks arxiv:0802.3922v2 [ath.oc] 17 Dec 2008 Angelia Nedić, Asuan Ozdaglar, and Pablo A. Parrilo February 15, 2013 Abstract We

More information

A Bernstein-Markov Theorem for Normed Spaces

A Bernstein-Markov Theorem for Normed Spaces A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :

More information

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period An Approxiate Model for the Theoretical Prediction of the Velocity... 77 Central European Journal of Energetic Materials, 205, 2(), 77-88 ISSN 2353-843 An Approxiate Model for the Theoretical Prediction

More information

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint. 59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far

More information

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co

More information

A method to determine relative stroke detection efficiencies from multiplicity distributions

A method to determine relative stroke detection efficiencies from multiplicity distributions A ethod to deterine relative stroke detection eiciencies ro ultiplicity distributions Schulz W. and Cuins K. 2. Austrian Lightning Detection and Inoration Syste (ALDIS), Kahlenberger Str.2A, 90 Vienna,

More information

Multi-Scale/Multi-Resolution: Wavelet Transform

Multi-Scale/Multi-Resolution: Wavelet Transform Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the

More information

The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters

The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters journal of ultivariate analysis 58, 96106 (1996) article no. 0041 The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Paraeters H. S. Steyn

More information

Inference in the Presence of Likelihood Monotonicity for Polytomous and Logistic Regression

Inference in the Presence of Likelihood Monotonicity for Polytomous and Logistic Regression Advances in Pure Matheatics, 206, 6, 33-34 Published Online April 206 in SciRes. http://www.scirp.org/journal/ap http://dx.doi.org/0.4236/ap.206.65024 Inference in the Presence of Likelihood Monotonicity

More information

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either

More information

Forecasting Financial Indices: The Baltic Dry Indices

Forecasting Financial Indices: The Baltic Dry Indices International Journal of Maritie, Trade & Econoic Issues pp. 109-130 Volue I, Issue (1), 2013 Forecasting Financial Indices: The Baltic Dry Indices Eleftherios I. Thalassinos 1, Mike P. Hanias 2, Panayiotis

More information

PAC-Bayes Analysis Of Maximum Entropy Learning

PAC-Bayes Analysis Of Maximum Entropy Learning PAC-Bayes Analysis Of Maxiu Entropy Learning John Shawe-Taylor and David R. Hardoon Centre for Coputational Statistics and Machine Learning Departent of Coputer Science University College London, UK, WC1E

More information

Moments of the product and ratio of two correlated chi-square variables

Moments of the product and ratio of two correlated chi-square variables Stat Papers 009 50:581 59 DOI 10.1007/s0036-007-0105-0 REGULAR ARTICLE Moents of the product and ratio of two correlated chi-square variables Anwar H. Joarder Received: June 006 / Revised: 8 October 007

More information

SEISMIC FRAGILITY ANALYSIS

SEISMIC FRAGILITY ANALYSIS 9 th ASCE Specialty Conference on Probabilistic Mechanics and Structural Reliability PMC24 SEISMIC FRAGILITY ANALYSIS C. Kafali, Student M. ASCE Cornell University, Ithaca, NY 483 ck22@cornell.edu M. Grigoriu,

More information

Revealed Preference with Stochastic Demand Correspondence

Revealed Preference with Stochastic Demand Correspondence Revealed Preference with Stochastic Deand Correspondence Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk Prasanta K. Pattanaik

More information

Local asymptotic powers of nonparametric and semiparametric tests for fractional integration

Local asymptotic powers of nonparametric and semiparametric tests for fractional integration Stochastic Processes and their Applications 117 (2007) 251 261 www.elsevier.co/locate/spa Local asyptotic powers of nonparaetric and seiparaetric tests for fractional integration Xiaofeng Shao, Wei Biao

More information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub

More information

A Semi-Parametric Approach to Account for Complex. Designs in Multiple Imputation

A Semi-Parametric Approach to Account for Complex. Designs in Multiple Imputation A Sei-Paraetric Approach to Account for Coplex Designs in ultiple Iputation Hanzhi Zhou, Trivellore E. Raghunathan and ichael R. Elliott Progra in Survey ethodology, University of ichigan Departent of

More information

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL

More information

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with

More information

Málaga Economic Theory Research Center Working Papers

Málaga Economic Theory Research Center Working Papers Málaga Econoic Theory Research Center Working Papers Unequivocal Majority and Maskin-Monotonicity Pablo Aorós WP 2008-3 March 2008 Departaento de Teoría e Historia Econóica Facultad de Ciencias Econóicas

More information

An Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control

An Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control An Extension to the Tactical Planning Model for a Job Shop: Continuous-Tie Control Chee Chong. Teo, Rohit Bhatnagar, and Stephen C. Graves Singapore-MIT Alliance, Nanyang Technological Univ., and Massachusetts

More information

Statistics and Probability Letters

Statistics and Probability Letters Statistics and Probability Letters 79 2009 223 233 Contents lists available at ScienceDirect Statistics and Probability Letters journal hoepage: www.elsevier.co/locate/stapro A CLT for a one-diensional

More information

Covariance-based orthogonality tests for regressors with unknown persistence

Covariance-based orthogonality tests for regressors with unknown persistence Covariance-based orthogonality tests for regressors with unknown persistence Alex Maynard and Katsui Shiotsu Departent of Econoics, University of Toronto and Departent of Econoics, Queen s University April

More information

Computable Shell Decomposition Bounds

Computable Shell Decomposition Bounds Journal of Machine Learning Research 5 (2004) 529-547 Subitted 1/03; Revised 8/03; Published 5/04 Coputable Shell Decoposition Bounds John Langford David McAllester Toyota Technology Institute at Chicago

More information

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal

More information

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation

More information

THE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n

THE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n THE POLYNOMIAL REPRESENTATION OF THE TYPE A n RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n SHEELA DEVADAS AND YI SUN Abstract. We study the polynoial representation of the rational Cherednik algebra

More information

Machine Learning Basics: Estimators, Bias and Variance

Machine Learning Basics: Estimators, Bias and Variance Machine Learning Basics: Estiators, Bias and Variance Sargur N. srihari@cedar.buffalo.edu This is part of lecture slides on Deep Learning: http://www.cedar.buffalo.edu/~srihari/cse676 1 Topics in Basics

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I Contents 1. Preliinaries 2. The ain result 3. The Rieann integral 4. The integral of a nonnegative

More information