Bonferroni-Based Size-Correction for Nonstandard Testing Problems

Size: px
Start display at page:

Download "Bonferroni-Based Size-Correction for Nonstandard Testing Problems"

Transcription

1 Bonferroni-Based Size-Correction for Nonstandard Testing Problems Adam McCloskey Brown University October 2011; Tis Version: July 2012 Abstract We develop powerful new size-correction procedures for nonstandard ypotesis testing environments in wic te asymptotic distribution of a test statistic is discontinuous in a parameter under te null ypotesis. Examples of tis form of testing problem are pervasive in econometrics and complicate inference by making size difficult to control. Tis paper introduces two new size-correction metods tat correspond to two different general ypotesis testing frameworks. Tey are designed to maximize te power of te underlying test wile maintaining correct asymptotic size uniformly over te parameter space specified by te null ypotesis. Te new metods involve te construction of critical values tat make use of reasoning derived from Bonferroni bounds. Te first new metod provides a complementary alternative to existing sizecorrection metods, entailing substantially iger power for many testing problems. Te second new metod provides te first available asymptotically size-correct testing metodology for te general class of testing problems to wic it applies. Tis class includes ypotesis tests on parameters after consistent model selection and tests on super-efficient/ard-tresolding estimators. We detail te construction and performance of te new tests in tree specific examples: testing after conservative model selection, testing wen a nuisance parameter may be on a boundary and testing after consistent model selection. Keywords: Hypotesis testing, uniform inference, asymptotic size, exact size, power, size-correction, model selection, local asymptotics A previous version of tis paper was circulated under te title Powerful Procedures wit Correct Size for Tests Statistics wit Limit Distributions tat are Discontinuous in Some Parameters. Te autor tanks Xu Ceng, Iván Fernández-Val, Patrik Guggenberger, Hiroaki Kaido, Frank Kleibergen, Hannes Leeb, Serena Ng, Pierre Perron, Benedikt Pötscer and Zongjun Qu for elpful comments. I am especially grateful to Don Andrews for suggesting a solution to a mistake in a previous draft. I also wis to tank Bruce Hansen for saring some preliminary results. Department of Economics, Brown University, Box B, 64 Waterman St., Providence, RI, (adam mccloskey@brown.edu, ttp:// mccloskey/home.tml).

2 1 Introduction Nonstandard econometric testing problems ave gained substantial attention in recent years. In tis paper, we focus on a very broad class of tese problems: tose for wic te null limiting distribution of a test statistic is discontinuous in a parameter. Te problems falling into tis class range from tests in te potential presence of identification failure (e.g., Staiger and Stock, 1997 and Andrews and Ceng, 2011) to tests after pretesting or model selection (e.g., Leeb and Pötscer, 2005 and Guggenberger, 2010) to tests wen a parameter may lie on te boundary of its parameter space (e.g., Andrews, 1999, 2001). Toug test statistics tat do not exibit tis type of discontinuity exist for some problems (e.g., Kleibergen, 2002), tey do not for oters. Moreover, suc test statistics may not necessarily be preferred to parameter-discontinuous ones wen good size-correction procedures are available, as tey can ave low power. However, we sidestep te important issue of coosing a test statistic in tis paper, taking it as given. Te usual approximation to te size of a test is te asymptotic probability of rejecting a true null ypotesis (null rejection probability) at a fixed parameter value. For te types of problems studied in tis paper, suc an approximation is grossly misleading. In fact, te discrepancy between tis point-wise null rejection probability (NRP) and te (asymptotic) size of a test can reac unity less te nominal level. Tis problem does not disappear, and often worsens, as te sample size grows. Te inadequacy of point-wise asymptotic approximations and te resulting pitfalls for inference ave been studied extensively in te literature. See, for example, Dufour (1997) in te context of inference on te two-stage least squares estimator, Leeb and Pötscer (2005) in te context of inference after model selection, Stoye (2009) in te context of inference on partially identified parameters and Andrews and Guggenberger (2009a) (AG encefort) in te context of inference on te autoregressive parameter in a first-order autoregressive model. In te parameter-discontinuous testing framework of tis paper, one must examine te maximal NRP uniformly, over te entire parameter space, as te sample size tends to infinity in order to determine te asymptotic size of te test (see e.g., te work of Mikuseva, 2007 and Andrews and Guggenberger, 2009b, 2010b). Wen using te test statistics considered in tis paper, one typically takes a conservative approac to control size, leading to igly non-similar tests, i.e., tests for wic te point-wise NRP differs substantially across parameter values. Tis often results in very poor power. In tis paper, we develop novel size-correction metods wit te goal of minimizing te 1

3 degree of conservativeness of te test, and ence maximizing its power, wile maintaining correct asymptotic size. We do so under two different frameworks tat allow for different null limiting beavior of a given test statistic. For te first, termed te single localized limit distribution framework (SLLD), we adopt te framework studied by AG, as it is quite broad in scope. For te second, termed te multiple localized limit distributions (MLLDs) framework, we generalize te SLLD framework in order to accommodate certain complicated asymptotic beaviors of test statistics. To our knowledge, tis latter, more general framework as not yet been studied. It includes examples of testing after consistent model selection and testing on super-efficient/ard-tresolding estimators. Te basic idea beind te size-corrections we introduce is to adaptively learn from te data ow far te true parameters are from te point tat causes te discontinuity in te asymptotic beavior of te test statistic in order to construct critical values (CVs) tat control te size of te test but are not overly conservative. We do tis under a drifting sequence framework by embedding te true parameter values in a sequence indexed by te sample size and a localization parameter. Witin tis framework, we estimate te corresponding localization parameter to find a set of drifting sequences of parameters relevant to te testing problem at and. We ten examine te CVs corresponding to te null limiting quantiles of te test statistic tat obtain under te drifting sequences witin tis set. Toug te localization parameter cannot be consistently estimated under tese drifting sequences, it is often possible to obtain estimators tat are asymptotically centered about teir true values and ence to construct an asymptotically valid confidence set for te true localization parameter. We may ten searc for te maximal CV over tis confidence set, rater tan te maximal CV over te entire space of localization parameters, to reduce te degree of conservativeness of a given ypotesis test. Inerent in tis construction are two levels of uncertainty: one for te localization parameter and one for te test statistic itself. We use procedures based on Bonferroni bounds to account for bot levels of uncertainty and subsequently find te smallest CV of tose justified by te Bonferroni approac. For testing problems witin te scope of te SLLD framework, our new size-correction metods are eiter uniformly more powerful asymptotically tan existing least-favorable (LF) metods or are more powerful over most of te relevant parameter space. In te latter case, te portions of te parameter space for wic LF metods dominate tend to be very small and suc dominance tends to be nearly undetectable even witin tese portions. Te finitesample power dominance of our new metods can be very pronounced, sometimes reacing nearly 100% over most of te parameter space. Our size-correction procedures are te first 2

4 we are aware of to provide tests wit correct asymptotic size for all testing problems falling witin te MLLDs framework. Since tey are adapted from te size-correction procedures used in te SLLD framework to tis generalized framework, tey also adopt many desirable power properties. We provide detailed applications of our size-correction metodologies to tree nonstandard testing problems. Two of tese examples concern testing after model selection/pretesting. Te first, taken from AG, involves testing after conservative model selection and falls witin te scope of te SLLD framework. Te second, taken from Leeb and Pötscer (2005), considers testing after consistent model selection and falls witin te scope of te MLLDs framework. Te oter example we detail concerns testing wen a nuisance parameter may be on a boundary of its parameter space, taken from Andrews and Guggenberger (2010b). We also briefly discuss a subset of te numerous oter examples for wic our size-corrections can be used. We focus on testing after model selection in te examples because at present, available uniformly valid inference metods tend to be extremely conservative. Inference after model selection is an important issue tat is all too frequently ignored, sometimes being referred to as te quiet scandal of statistics. See, for example, Hansen (2005) for a discussion of te importance of tis issue. Moreover, excluding te results of AG and Kabaila (1998), te literature as been quite negative wit regards to solving tis inference problem (e.g., Andrews and Guggenberger, 2009b, Leeb and Pötscer, 2005, 2006 and 2008), especially wit regards to inference after consistent model selection. Te recently developed metods for uniform inference of AG are closely related to te metods developed ere. AG also study a given test statistic and adjust CVs according to a drifting parameter sequence framework. However, our metods tend to be (oftentimes, muc) less conservative tan teirs. Existing inference procedures tat make use of Bonferroni bounds are also related to tose developed ere altoug we take a distinct approac of minimizing over CVs justified by Bonferroni bounds and subsequently size correcting. Te CVs we employ can also be interpreted as smooted versions of tose based on binary decision rules tat use an inconsistent estimator of te localization parameter. Finally, our CVs are related to tose tat use a transition function approac to interpolate between LF and standard CVs. In contrast to tese approaces, ours do not necessitate an ad oc coice of transition function. Rater, tey use te data and te limiting beavior of te test statistic to adaptively transition between CVs. See Sections 3.1 and 3.2 for details and references on related procedures. Te remainder of tis paper is composed as follows. Section 2 describes te general class 3

5 of nonstandard ypotesis testing problems we study, subsequently detailing te SLLD and MLLDs frameworks and providing examples. Section 3 goes on to specify te size-correction metods of tis paper under te two localized limit distribution frameworks and provides te conditions under wic tese size-corrections yield correct asymptotic size. Specifics on ow to construct some of te size-corrected CVs are provided for tree econometric examples in Sections 4, 5 and 6. Te finite sample performance of two of te examples, corresponding to testing after model selection, is also analyzed tere. Section 7 concludes. Appendix I contains proofs of te main results of tis paper wile Appendix II is composed of derivations used to sow ow te example testing problems fit te assumptions of te paper. All tables and figures are relegated to te end of te document. To simplify notation, we will occasionally abuse it by letting (a 1, a 2 ) denote te vector (a 1, a 2). Te sample size is denoted by n and all limits are taken to mean as n. Let R + = {x R : x 0}, R = {x R : x 0}, R, = R { }, R +, = R + { } and R = R {, }. 1( ) denotes te indicator function. Φ( ) and φ( ) are te usual notation for te distribution and density functions of te standard normal distribution. d and p denote weak convergence and convergence in probability wile O( ), o( ), O p ( ) and o p ( ) denote te usual (stocasitc) orders of magnitude. 2 Parameter-Discontinuous Asymptotic Distributions In tis paper, we are interested in performing ypotesis tests wen te asymptotic distribution of te test statistic is discontinuous in a parameter under te null ypotesis. We take te test statistic as given and examine te tasks of controlling size and maximizing power for te given statistic. Te important separate issue of coosing a test statistic depends on te specific testing problem at and and is not te focus of tis paper. In order to analyze tis problem, we adopt te same general testing framework as AG. Consider some generic test statistic T n (θ 0 ) used for testing H 0 : θ = θ 0 for some finite-dimensional parameter θ R d. Under H 0, T n (θ 0 ) and its asymptotic distribution depend on some parameter γ Γ. Refer to tis limit distribution as F γ. We decompose γ into tree components, viz. γ = (γ 1, γ 2, γ 3 ), depending on ow eac component affects F γ as follows. Te distribution F γ is discontinuous in γ 1, a parameter in Γ 1 R p, wen one or more of te elements of γ 1 is equal to zero. It also depends on γ 2, a parameter in Γ 2 R q, but γ 2 does not affect te distance of γ to te point of discontinuity in F γ. Te tird component γ 3 may be finite- or infinite-dimensional, lying in some general parameter space Γ 3 (γ 1, γ 2 ) tat may depend on γ 1 and γ 2. Te component γ 3 does not affect te limit distribution F γ but may affect te properties of T n (θ 0 ) in finite 4

6 samples. Formally, te parameter space for γ is given by Γ = {(γ 1, γ 2, γ 3 ) : γ 1 Γ 1, γ 2 Γ 2, γ 3 Γ 3 (γ 1, γ 2 )}. (1) To complete te preliminary setup, we impose te following product space assumption on Γ 1. Tis assumption is identical to Assumption A of AG. Let ( ) denote te left (rigt) endpoint of an interval tat may be open or closed. Assumption D. (i) Γ satisfies (1) and (ii) Γ 1 = p m=1 Γ 1,m, were Γ 1,m = γ l 1,m, γ u 1,m for some γ l 1,m < γ u 1,m tat satisfy γ l 1,m 0 γ u 1,m for m = 1,..., p. Tis paper introduces testing metods tat are asymptotically size-controlled. Asymptotic size control requires one to asymptotically bound te NRP uniformly over te parameter space admissible under te null ypotesis. In order to assess te uniform limiting beavior of a test, one must examine its beavior along drifting sequences of parameters (see e.g., Andrews and Guggenberger, 2010b and Andrews et al., 2011). In tis vein, we allow γ to depend on te sample size, and empasize tis dependence by denoting it γ n, = (γ n,,1, γ n,,2, γ n,,3 ), were = ( 1, 2 ) H H 1 H 2 is a localization parameter tat describes te limiting beavior of te sequence. Te sets H 1 and H 2 depend on Γ 1 and Γ 2 as follows: R p +,, if γ1,m l = 0, H 1 = R,, if γ1,m u = 0, m=1 R, if γ1,m l < 0 and γ1,m u > 0, H 2 = cl(γ 2 ), were cl(γ 2 ) is te closure of Γ 2 wit respect to R q. Given r > 0 and H, define {γ n, } as te sequence of parameters in Γ for wic n r γ n,,1 1 and γ n,,2 2. In tis paper, we consider two broad classes of testing problems: one for wic te limiting beavior of te test statistic is fully caracterized by a single distribution function tat is fully caracterized by under any drifting sequence of parameters {γ n, } and te oter for wic tis limiting beavior depends upon bot and te limiting beavior of {γ n,,1 } relative to anoter sequence. 2.1 Single Localized Limit Distribution Framework We begin te analysis wit te simpler of te two cases just described. Tis class of testing problems can be broadly caracterized by Assumption D and te following assumption. 5

7 Assumption S-B.1. Tere exists a single fixed r > 0 suc tat for all H and corresponding sequences {γ n, }, T n (θ 0 ) W under H 0 and {γ n, d }. Denote te limit distribution function for a given as J, i.e., P (W x) = J (x) and te (1 α) t quantile of W by c (1 α). We refer to J as a localized limit distribution as it obtains under a drifting sequence of parameters indexed by te localization parameter. Assumption S-B.1 is identical to Assumption B of AG. For every sequence of parameters {γ n, } indexed by te same localization parameter, te same limiting distribution J obtains, ence te term single in SLLD. We now introduce some new assumptions, noting tat tey are applicable to many of te same econometric applications tat satisfy te assumptions imposed by AG. Assumption S-B.2. Consider some fixed δ (0, 1). (i) As a function in from H into R, c (1 δ) is continuous. (ii) For any H, J ( ) is continuous at c (1 δ). Assumption S-B.2 is a mild continuity assumption. strengten part (i) as follows. To obtain stronger results, we Assumption S-BM.1. For some fixed α (0, 1) and pair, (δ δ) [0, α δ] [0, α ], as δ a function of and δ, c (1 δ) is continuous over H and, α [δ δ]. Te quantity serves as a lower bound and α δ δ serves as an upper bound on te points δ for wic c (1 δ) must be continuous. In many examples of interest, W is a continuous random variable wit infinite support so tat c (1) =. For suc examples can be set δ arbitrarily close, but not equal, to zero. Assumptions D, S-B.1, S-B.2 and S-BM.1 and te oter assumptions for tis framework introduced later in Sections 3.1 and 3.2 old in many nonstandard econometric testing problems of interest. Te following are simple, illustrative examples of suc problems Testing After Conservative Model Selection Various forms of ypotesis tests after model selection exemplify testing problems wit parameter-discontinuous null limit distributions. Conducting a t-test on a parameter of interest after conservative model selection falls witin te framework of Section 2.1, aving a SLLD. Conservative model selection includes, among oters, metods based on te Akaike 6

8 information criterion (AIC) and standard pre-testing tecniques. As an illustrative example, consider te following problem described by AG. We ave a model given by y i = x 1iθ + x 2iβ 2 + x 3iβ 3 + σε i, (2) for i = 1,..., n, were x i (x 1i, x 2i, x 3i) R k, β (θ, β 2, β 3) R k, x 1i, x 2i, θ, β 2, σ, ε i R, x 3i, β 3 R k 2, te observations {(y i, x i )} are i.i.d. and ε i as mean zero and unit variance conditional on x i. We are interested in testing H 0 : θ = θ 0 after determining weter to include x 2i in te regression model (2), tat is, after determining weter to impose te restriction β 2 = 0. Tis decision is based on weter te absolute value of te pretest t-statistic n 1/2 ˆβ2 T n,2 ˆσ(n 1 X2 M [X 1 :X3 ] X2) 1/2 exceeds a pretest CV c > 0, were c is fixed (i.e., does not depend on n), ˆβ 2 is te standard unrestricted OLS estimator of β 2 in te regression (2) and ˆσ 2 (n k) 1 Y M [X 1 :X 2 :X 3 ] Y wit Y (y 1,..., y n ), Xj [x j1 :... : x jn] for j = 1, 2, 3 and M A I A(A A) 1 A for some generic full-rank matrix A and conformable identity matrix I. Te model selection pretest rejects β 2 = 0 wen T n,2 > c and te subsequent t-statistic for testing H 0 is based on te unrestricted version of (2) and is given by ˆT n,1 (θ 0 ) n 1/2 (ˆθ θ 0 ) ˆσ(n 1 X 1 M [X 2 :X 3 ] X 1) 1/2, were ˆθ is te unrestricted OLS estiamtor from regression (2). Conversely, te model selection pretest selects te model witout x 2i, or equivalently restricts β 2 = 0, wen T n,2 c and te resulting t-statistic for H 0 is given by T n,1 (θ 0 ) = n 1/2 ( θ θ 0 ) ˆσ(n 1 X 1 M X 3 X 1) 1/2, were θ is te restricted OLS estimator from regression (2) wit β 2 restricted to equal zero. Hence, for an upper one-sided test, te post-conservative model selection test statistic for testing H 0 is given by T n (θ 0 ) = T n,1 (θ 0 )1( T n,2 c) + ˆT n,1 (θ 0 )1( T n,2 > c). Wit straigtforward modification, te results described below also apply to lower one-sided and two-sided testing for tis problem. See AG and Andrews and Guggenberger (2009c) for 7

9 more details. 1 Results in AG sow ow tis testing problem satisfies Assumptions D and S-B.1. Specifically, let G denote te distribution of (ε i, x i ) and define te following quantities x i = x 1i x 3i(E G x 3ix 3i) 1 x 3ix 1i x 2i x 3i(E G x 3ix 3i) 1 x 3ix 2i Q = E G x i x i, and Q 1 = Q11 Q 12. Q 12 Q 22 Ten for tis example, γ 1 = β 2 /σ(q 22 ) 1/2, γ 2 = Q 12 /(Q 11 Q 22 ) 1/2 and γ 3 = (β 2, β 3, σ, G) and d Z 1 1( Z 2 c) + T n (θ 0 ) Ẑ11( Z 2 > c), if γ 1 = 0 Ẑ 1, if γ 1 0, were Z 1, Ẑ1 and Z 2 are standard normal random variables wit Z 1 independent of Z 2 and Corr(Ẑ1, Z 2 ) = γ 2. Te parameter spaces in (1) are given by Γ 1 = R, Γ 2 = [ 1 + ω, 1 ω] for some ω > 0 and Γ 3 (γ 1, γ 2 ) = {(β 2, β 3, σ, G) : β 2 R, β 3 R k 2, σ (0, ), γ 1 = β 2 /σ(q 22 ) 1/2, γ 2 = Q 12 /(Q 11 Q 22 ) 1/2, λ min (Q) κ, λ min (E G x 3ix 3i) κ, E G x i 2+δ M, E G ε i x i 2+δ M, E G (ε i x i ) = 0 a.s., E G (ε 2 i x i ) = 1 a.s.} for some κ, δ > 0 and M <, were λ min (A) is te smallest eigenvalue of generic matrix A. From tis parameter space, it is clear tat Assumption D olds for tis example. Moreover, Andrews and Guggenberger (2009c) sow tat assumption S-B.1 olds wit r = 1/2 and x ( ( )) J (x) = Φ(x (1 2 2) 1/ t ) ( 1, c) + 1 (1 2 2), c φ(t)dt, 1/2 (1 2 2) 1/2 were (a, b) = Φ(a+b) Φ(a b). As defined, H 1 = R and H 2 = [ 1+ω, 1 ω]. Turning to te new assumptions, te lower bound δ of Assumption S-BM.1 can be set arbitrarily close to zero and δ can be set to any quantity in its admissible range [0, α δ ] since W is a continuous random variable wit support over te entire real line for any H, wic can be seen by examining J ( ). Tis fact similarly implies Assumption S-B.2(ii) olds. An 1 Te testing problem described ere also applies to testing a linear combination of regression coefficients after conservative model selection. Tis involves a reparameterization described in Andrews and Guggenberger (2009c). 8

10 assumption imposed later will necessitate a restriction on δ tat we will discuss in Section 4. Continuity of c (1 δ) in follows from te facts tat c (1 δ) = J 1 (1 δ) and J (x) is continuous in H. Te SLLD framework applies to many more complex examples of testing after conservative model selection. For example, results in Leeb (2006) and Leeb and Pötscer (2008) can be used to verify te assumptions of tis paper for a sequential general-to-specific model selection procedure wit multiple control variables Testing wen a Nuisance Parameter may be on a Boundary We now explore an illustrative example of a testing problem in wic a nuisance parameter may be on te boundary of its parameter space under te null ypotesis and sow ow it also falls witin te framework of Section 2.1. Tis problem is considered by Andrews and Guggenberger (2010b) and can be described as follows. We ave a sample of size n of an i.i.d. bivariate random vector X i = (X i1, X i2 ) wit distribution F. Under F, te first two moments of X i exist and are given by E F (X i ) = θ and Var F (X i ) = µ σ2 1 σ 1 σ 2 ρ σ 1 σ 2 ρ σ2 2 Say we are interested in te null ypotesis H 0 : θ = 0, i.e., θ 0 = 0, and we know tat µ 0. 2 Now suppose we use te Gaussian quasi-maximum likeliood estimator of (θ, µ, σ 1, σ 2, ρ) under te restriction µ 0, denoted by (ˆθ n, ˆµ n, ˆσ n1, ˆσ n2, ˆρ n ), to construct an upper one-sided t-test of H 0. 3 Tat is, T n (θ 0 ) = n 1/2 (ˆθ n θ 0 )/ˆσ n1, were ˆθ n = X n1 (ˆρ nˆσ n1 ) min(0, X n2 /ˆσ n2 ) wit X nj = n 1 n i=1 X ij for j = 1, 2. As in te previous example, results for lower one-sided and two-sided tests are quite similar. Results in Andrews and Guggenberger (2010b) provide tat tis testing problem also satisfies Assumptions D and S-B.1. Here, γ 1 = µ/σ 2, γ 2 = ρ and γ 3 = (σ 1, σ 2, F ) and d Z 1 γ 2 min{0, Z 2 }, if γ 1 = 0 T n (θ 0 ) Z 1, if γ 1 0, were Z 1 and Z 2 are standard normal random variables wit Corr(Z 1, Z 2 ) = γ 2. Te corresponding parameter spaces are Γ 1 = R +, Γ 2 = [ 1 + ω, 1 ω] for some ω > 0 and Γ 3 (γ 1, γ 2 ) = {(σ 1, σ 2, F ) : σ 1, σ 2 (0, ), E f X i 2+δ M, θ = 0, γ 1 = µ/σ 2, γ 2 = ρ} 2 Similar results apply for any coice of θ 0. 3 Te results below also allow for different estimators in tis construction. See Andrews and Guggenberger (2010b) for details. 9.

11 for some M < and δ > 0. 4 From tese definitions, it is immediate tat Assumption D olds. Assumption S-B.1 olds for tis example wit r = 1/2 and W Z 2,1 2 min{0, Z 2,2 + 1 }, were (3) Z 2 = Z 2,1 Z 2,2 d N 0, In order to verify te new assumptions, it is instructive to examine te distribution function J ( ), wic is given by ( ) x + 2 x ( ( )) 1 1 J (x) = Φ 2 z Φ( 1 ) + 1 Φ φ(z)dz (4) (1 2 2) 1/2 (see Appendix II for its derivation). By definition, H 1 = R +, and H 2 = [ 1+ω, 1 ω]. Now, looking at te form of J, we can see tat, as in te previous example, W is a continuous random variable wit support over te entire real line for any H so tat δ of Assumption S-BM.1 can again be set arbitrarily close to zero and δ is left unrestricted over its admissible range. We discuss a restriction imposed later on δ in Section 5. For te same reasons given in te previous example, Assumption S-B.2(ii) olds as well. More complicated testing problems wen a nuisance parameter may be on a boundary can also be sown to fit te SLLD framework and later assumptions of tis paper. example, Andrews (1999, 2001) provides results for more complicated boundary examples tat fit tis framework Oter Examples Tere are many examples in te econometrics literature of testing problems tat fit te SLLD framework. Apart from tose discussed above, tese include, but are not limited to, tests after pretests wit fixed CVs (e.g., Guggenberger, 2010), testing wen te parameter of interest may lie on te boundary of its parameter space (e.g., Andrews and Guggenberger, 2010a), tests on model-averaged estimators (e.g., Hansen, 2007), tests on certain types of srinkage estimators (e.g., Hansen, 2011), tests in autoregressive models tat may contain a unit root (e.g., AG and Mikuseva, 2007), Vuoung tests for nonnested model selection (e.g., 4 For te purposes of tis paper, we make a small departure from te exact setup used by Andrews and Guggenberger (2010b) in our definition of Γ 2, wic tey define as [ 1, 1]. Tat is, we restrict te possible correlation between X i1 and X i2 to be less tan perfect. We do tis in order to employ te size-corrections described later in tis paper. Note tat te analogous assumption is imposed in te above post-conservative model selection example. 10 For

12 Si, 2011) and subvector tests allowing for weak identification (e.g., Guggenberger et al., 2012). On te oter and, te SLLD assumptions rule out certain testing problems wit parameterdiscontinuous null limiting distributions suc as testing in moment inequality models (e.g., Andrews and Soares, 2010) and certain tests allowing for weak identification (e.g., Staiger and Stock, 1997). Neverteless, te SLLD framework of tis paper can likely be modified to incorporate some of tese problems in order to apply te testing metods introduced later to tese problems. For example, Assumption D does not allow for testing in te moment inequality context wen te condition of one moment binding depends upon weter anoter moment binds. Yet te results of Andrews and Soares (2010) and Andrews and Jia (2011) suggest tat tailoring te assumptions to tis context would permit analogous results to tose presented later. 2.2 Multiple Localized Limit Distributions Framework Te MLLDs framework generalizes te SLLD framework. Te motivation for tis generalization comes from an important class of ypotesis testing problems wit parameterdiscontinuous null limiting distributions tat do not satisfy Assumption S-B.1 because under H 0 and a given {γ n, }, te asymptotic beavior of T n (θ 0 ) is not fully caracterized by. In tis more general framework, we retain te description of te parameter space given in Assumption D as well as te description of H following it but weaken Assumption S-B.1 to te following. Assumption M-B.1. Tere is a sequence {k n }, a set K H 1 and a single fixed r > 0 suc tat for all H and corresponding sequences {γ n, }, under H 0 : d (i) if lim γ n,,1 /k n K, T n (θ 0 ) W (1) ; (ii) if lim γ n,,1 /k n L K c d, T n (θ 0 ) W (2) (iii) if lim γ n,,1 /k n L c K c, te asymptotic distribution of T n (θ 0 ) is stocastically dominated by W (1) or W (2). Assumption M-B.1 allows for different -dependent localized limit distributions tat are relevant to te different possible limiting beaviors of γ n,,1 /k n. It collapses to Assumption S-B.1 wen k n = n r and K = H 1 or L = H 1. Te auxiliary sequence {k n } may depend upon te elements of {γ n, } toug tis potential dependence is suppressed in te notation. Denote te limit distributions corresponding to (i) and (ii) as J (1) and J (2), wic are te two localized limit distributions tat obtain under te corresponding sequences of γ n,,1 /k n. 11 ;

13 Similarly, c (1) and c (2) denote te corresponding quantile functions. Finally, we denote te limiting random variable under (iii) as W (3). Tis is a sligt abuse of notation because tere may be MLLDs tat obtain under (iii) alone. Distinction between tese distributions is not necessary ere because of te imposed stocastic dominance. We will also make use of te following definition: ζ({γ n, }) lim γ n,,1 /k n. Te form tat {k n }, K and L take are specific to te testing problem at and. However, we make a few general remarks in order to provide some intuition. Te MLLDs frameowrk incorporates testing problems after a decision rule tat compares some statistic to a samplesize-dependent quantity, say c n, decides te form T n (θ 0 ) takes. Wen using suc a decision rule, under te drifting sequence of parameters {γ n, }, te null limit distribution of T n (θ 0 ) not only depends on te limit of n r γ n,,1 (and γ n,,2 ), it also depends on ow fast n r γ n,,1 grows relative to c n. Te sequence {k n } is tus some (scaled) ratio of c n to n r and te sets K and L describe te limiting beavior of n r γ n,,1 relative to c n. Tis setting can clearly be furter generalized to allow for oter sequences like {γ n,,1 /k n } to also determine te limiting beavior of T n (θ 0 ) under H 0. For example, one additional sequence of tis sort could allow for two additional localized limit distributions tat are not necessarily stocastically dominated by any of te oters. In tis case, bot te space containing te limit of γ n,,1 /k n and te limit of tis additional sequence could determine te null limiting beavior of T n (θ 0 ) under any given {γ n, }. We conjecture tat a more general case like tis obtains for ypotesis tests after more complicated consistent model selection procedures tan tose for wic asymptotic results under drifting sequences of parameters are presently available. (Te intuition for tis is given in Section below). In tis framework, we will also accommodate certain types of discontinuities in te localized limit distribution J. One form of tese discontinuities occurs wen 1 is on te boundary of its parameter space H 1, entailing infinite values. In order to accommodate tis type of discontinuity, define te following subset of H: H int(h1 ) H 2. Ten te set of corresponding to 1 on te boundary of H 1 is equal to H c. Assumption M-B.2. Consider some fixed δ (0, 1). (i) As a function from H into R, c (i) (1 δ) is continuous for i = 1, 2. (ii) For i = 1, 2 and any H, tere is some finite ε i 0 for wic J (i) ( ) is continuous at c (i) (1 δ) + ε i. Assumption M-B.2 is a continuity assumption tat is a relaxed version of a direct adaptation of Assumption S-B.2 to te MLLDs framework. For te problems in tis class, te 12

14 localized quantiles can be infinite for H c. Tis is wy (i) is only required as a function from H. Similarly, te localized distribution functions can be discontinuous at te teir localized quantiles but continuous in a neigborood near tem. Part (ii) provides te flexibility to allow for tis feature. A sufficient condition for Assumption M-B.2 to old for i = 1 or 2 is tat te W (i) is a continuous random variable wit infinite support and a distribution function tat is continuous in. In tis case ε i = 0. As in te previous framework, we strengten part (i) of tis assumption to obtain stronger results. Assumption M-BM.1. For some fixed α (0, 1) and pairs (δ (i), δ (i) ) [0, α δ (i) ] [0, α δ (i) ] for i = 1, 2, as a function of and δ, c (i) (1 δ) is continuous over H and [δ (i), α δ (i) ]. Analogous remarks to tose on Assumption S-BM.1 can be made ere wit te exception tat continuity in is no longer required at H c Testing After Consistent Model Selection Unlike ypotesis testing after conservative model selection, testing after consistent model selection entails substantially more complicated limiting beavior of a test statistic under te null ypotesis. Te essential difference between conservative and consistent model selection in te context of our examples is tat in consistent model selection, te comparison/critical value used in te model selection criterion grows wit te sample size. Tis is te case for example, wit te popular Bayesian information criterion (BIC) and te Hannan-Quinn information criterion. Te simple post-consistent model selection testing framework provided by Leeb and Pötscer (2005) provides an illustrative example of a testing problem tat fits te MLLDs framework. Hence, we sall consider it ere. We now consider te regression model y i = θx 1i + β 2 x 2i + ɛ i (5) for i = 1,..., n, were ɛ i d i.i.d.n(0, σ 2 ) wit σ 2 > 0, X (x 1,..., x n) wit x i (x 1i, x 2i ) is nonstocastic, full-rank and satisfies X X/n Q > 0. For simplicity, assume tat σ 2 is known toug te unknown σ 2 case can be andled similarly. We are interested in testing H 0 : θ = θ 0 after deciding weter or not to include x 2i in te regression model (5) via a consistent model selection rule. As in te conservative model selection framework of Section 2.1.1, tis decision is based on comparing te t-statistic for β 2 wit some CV except now 13

15 tis CV c n grows in te sample size suc tat c n but c n / n 0. Formally, let σ 2 (X X/n) 1 = σ2 θ,n σ θ,β2,n σ θ,β2,n σβ 2 2,n and ρ n = σ θ,β2,n/(σ θ,n σ β2,n). Ten te model selection procedure cooses to include x 2i in te regression if n ˆβ 2 /σ β2,n > c n, were ˆβ 2 is te (unrestricted) OLS estimator of β 2 in te regression (5), and cooses to restrict β 2 = 0 oterwise. For tis example, we will test H 0 by examining te non-studentized quantity n( θ θ 0 ), were θ is equal to te unrestricted OLS estimator of θ in regression (5) wen n ˆβ 2 /σ β2,n > c n and te restricted OLS estimator of θ in (5) wit β 2 restricted to equal zero wen n ˆβ 2 /σ β2,n c n. 5 Tat is for an upper one-sided test, te post-consistent model selection test statistic for testing H 0 is given by T n (θ 0 ) = n( θ θ 0 )1( n ˆβ 2 /σ β2,n c n ) + n(ˆθ θ 0 )1( n ˆβ 2 /σ β2,n > c n ), were θ and ˆθ are te restricted and unrestricted estimators. Examining T n (θ 0 ) and T n (θ 0 ) and teir corresponding localized null limit distributions would allow us to perform te same analysis for lower one-sided and two-sided tests of H 0. Let te limits of all finite sample quantities be denoted by a subscript, e.g., σ 2 θ,. Ten for tis example, γ 1 = β 2 ρ /σ β2,, γ 2 = (γ 2,1, γ 2,2 ) = (σ θ,, ρ ) and γ 3 = (β 2, σ 2, σ 2 θ,n, σ2 β 2,n, ρ n) and T n (θ 0 ) d N(0, (1 γ 2 2,2)γ 2 2,1), if γ 1 = 0 N(0, γ 2 2,1), if γ 1 0. Te parameter spaces in (1) are given by Γ 1 = R, Γ 2 = [η, M] [ 1 + ω, 1 ω] for some η (0, M], ω (0, 1] and M (0, ) and Γ 3 (γ 1, γ 2 ) = {(β 2, σ 2, σ 2 θ,n, σ 2 β 2,n, ρ n ) : β 2 R, σ 2 (0, ), γ 1 = β 2 ρ /σ β2,, γ 2 = (σ θ,, ρ ) lim σ2 θ,n = γ 2,1, lim σβ 2 2,n = β 2 γ 2,2 /γ 1, lim ρ n = γ 2,2 }. Clearly, Γ satisfies Assumption D. Using te results of Proposition A.2 in Leeb and Pötscer (2005), we can establis tat Assumption M-B.1 is satisfied wit k n = c n ρ n / n, r = 1/2, 5 Following Leeb and Pötscer (2005), we examine te non-studentized quantity rater tan te t-statistic because use of te latter will not satisfy Assumption D and is terefore not amenable to te procedures put fort in tis paper. Note tat altoug te studentized quantity does not display a parameter-discontinuous null limit distribution, it suffers te same size-distortion problem wen standard CVs are used. 14

16 K = ( 1, 1), J (1) (x) = Φ((1 2 2,2) 1/2 (x/ 2,1 + 1 )), L = [, 1) (1, ] and J (2) (x) = Φ(x/ 2,1 ). See Appendix II for details. Te intuition for wy different null limit distributions for T n (θ 0 ) obtain under {γ n, } depending on ow γ n,,1 = β 2,n ρ n /σ β2,n beaves relative to k n = c n ρ n / n as te sample size grows lies in te fact tat wen γ n,,1 /k n = nβ 2,n /σ β2,nc n < 1, T n (θ 0 ) equals n( θ θ 0 ) asymptotically. Conversely, wen γ n,,1 /k n = nβ 2,n /σ β2,nc n > 1, T n (θ 0 ) equals n(ˆθ θ 0 ) asymptotically. Under H 0 and te drifting sequence {γ n, }, te statistics n( θ θ 0 ) and n(ˆθ θ0 ) ave different limit distributions, corresponding to J (1) and J (2), respectively. In te knife-edge case for wic lim γ n,,1 /k n = 1, te limit of T n (θ 0 ) ten also depends on te limiting beavior of c n ± nβ 2,n /σ β2,n (see Leeb and Pötscer, 2005). However, no matter te limit of tis latter quantity, te limit of T n (θ 0 ) in tis case is always stocastically dominated by te limit tat pertains under eiter lim γ n,,1 /k n < 1 or lim γ n,,1 /k n > 1 (see Appendix II). Hence, under a given drifting sequence {γ n, }, te limiting beavior of T n (θ 0 ) is not fully caracterized by, in violation of Assumption S-B.1. By definition, H 1 = R and H 2 = [η, M] [ 1 + ω, 1 ω]. Turning now to Assumption M-BM.1, δ (1) can be set arbitrarily close to, but strictly greater tan, zero. Since c (1) (1 δ) is te (1 δ) t quantile of a normal distribution wit mean 1 2,1 and variance 2 2,1(1 2 2,2) and H = R [η, M] [ 1 + ξ, 1 ξ], c (1) (1 δ) is continuous in over H for any δ (0, 1). Continuity in δ over [δ (1), α δ (1) ] also follows for any δ (1) [0, α δ (1) ]. Similar reasoning sows tat, δ (2) can be set arbitrarily close to zero and δ (2) can be anywere in its admissible range for Assumption M-BM.1 to old (we discuss restriction imposed on δ (i) for i = 1, 2 by later assumptions in Section 6). For H and i = 1, 2, J (i) is te distribution function of a continuous random variable so tat Assumption M-B.2(ii) olds wit ε i = 0. As wit te oter examples studied in tis paper, tis simple illustrative example is not te most general of its kind to fall into tis framework. Many of te assumptions in te above example can be relaxed. However, uniform asymptotic distributional results for more complex consistent model selection procedures are not readily available in te literature. Tis may be in part due to te very negative results put fort regarding attempts to conduct inference after even te simplest of suc procedures (e.g., Leeb and Pötscer, 2005 and Andrews and Guggenberger, 2009b). As alluded to above, more complicated procedures, suc as a consistent version of te sequential general-to-specific model selection approac of Leeb (2006) and Leeb and Pötscer (2008) or standard BIC approaces to more complicated models, likely require a straigtforward extension of te MLLDs framework and te corresponding CVs introduced below. Te intuition for tis essentially follows from te 15

17 same intuition as tat used for te simple post-consistent model selection example provided above. As a simplification, suppose now tat anoter regressor enters te potential model (5) wit associated coefficient β 3. Using te obvious notation, we may also wis to determine weter β 3 sould enter te model prior to testing H 0 by comparing n ˆβ 3 /σ β3 to c n. In tis case T n (θ 0 ) would take one of four, rater tan two, possible values depending on bot te value of n ˆβ 3 /σ β3 and n ˆβ 2 /σ β2 relative to c n (ignoring knife-edge cases) Oter Examples Te class of super-efficient/ard-tresolding estimators studied by Andrews and Guggenberger (2009b) and Pötscer and Leeb (2009), including Hodges estimator, also fit te MLLDs framework. A certain subclass of tese estimators in fact requires ε i > 0 for i = 1 or 2, unlike te problem considered immediately above. Te related problems of testing after pretests using pretest CVs tat grow in te sample size fit te MLLDs framework as well. Toug some very recent work as explored te properties of uniformly valid confidence intervals for some of te problems tat fall into tis framework (e.g., Pötscer and Scneider, 2010), to te autor s knowledge, tis is te first time suc a framework and corresponding uniformly valid inference procedure as been presented at tis level of generality. 3 Bonferroni-Based Critical Values For test statistics wit parameter-discontinuous null limit distributions, te asymptotic NRP of te test, evaluated at a given parameter value permissible under H 0 can provide a very poor approximation to te true NRP and size of te test, even for large samples. In order to be more precise about tis terminology, we introduce te following definitions for a test of H 0 : θ = θ 0, working under te framework described in Section 2. Let κ n be te (possibly random or sample-size-dependent) CV being used. Te NRP evaluated at γ Γ is given by P θ0,γ(t n (θ 0 ) > κ n ), were P θ0,γ(e) denotes te probability of event E given tat (θ 0, γ) are te true parameters describing te DGP. Te asymptotic NRP evaluated at γ Γ is given by lim sup P θ0,γ(t n (θ 0 ) > κ n ). Note tat, wen evaluated at a fixed γ Γ, bot te NRP and asymptotic NRP are point-wise quantities (in γ). Te exact and asymptotic sizes are defined as ExSZ n (θ 0, κ n ) sup P θ0,γ(t n (θ 0 ) > κ n ) γ Γ AsySz(θ 0, κ n ) lim sup ExSZ n (θ 0, κ n ). 16

18 Note tat te exact and asymptotic sizes of a test ave te concept of uniformity built into teir definitions in tat ExSZ n (θ 0, κ n ) is te largest NRP uniformly over te parameter space Γ and AsySz(θ 0, κ n ) is its limit. In standard (continuous) ypotesis testing contexts, inf γ Γ lim sup P θ0,γ(t n (θ 0 ) > κ n ) = sup γ Γ lim sup P θ0,γ(t n (θ 0 ) > κ n ) = AsySz(θ 0, κ n ) so tat for any γ Γ, lim sup P θ0,γ(t n (θ 0 ) > κ n ) provides a good approximation to ExSZ n (θ 0, κ n ). Tis is not te case in te context of tis paper. In order to ave a test wit approximately controlled exact size, and terefore controlled NRP at any γ Γ, we need to control AsySz(θ 0, κ n ). Under te frameworks of tis paper, te primary teoretical step in controlling te asymptotic size of a test is to control te asymptotic NRP under all drifting sequences of parameters {γ n, }. Tat is, if we can find a (sequence of) CV(s) { κ n } suc tat lim sup P θ0,γ n, (T n (θ 0 ) > κ n ) α for all {γ n, } described in Section 2, we can construct a ypotesis test wose asymptotic size is bounded by α (see te subsequencing arguments used in Appendix I for details). Since c (1 α) (or c (i) (1 α), i = 1, 2) is te (1 α)t CV of te limit distribution of T n (θ 0 ) under H 0 and te drifting sequence of parameters {γ n, }, we would ideally like to use a CV tat is equal to c (1 α) wenever {γ n, } caracterizes te true data-generating process (DGP) in order to maximize te power of te resulting test wile controlling its asymptotic size. Unfortunately, cannot be consistently estimated under all drifting sequence DGPs. Tis as led to te construction of te so-called LF CV sup H c (1 α) and variants tereof (e.g., AG). Guarding against te worst-case drifting sequence DGP, tis CV is often quite large, substantially reducing te power of te resulting test. Toug cannot be consistently estimated under {γ n, }, in typical applications, one can find an estimator of tat converges in distribution to a random variable centered around te true value under H 0 and tis drifting sequence DGP. Tis allows one to form asymptotically valid confidence sets for and subsequently restrict attention to a data-dependent region inside of H tat is relevant to te testing problem at and, rater tan guarding against te worst-case scenario. Te goal of restricting te region of values under scrutiny is to be able to construct smaller CVs and resulting tests wit iger power. However, te additional uncertainty associated wit te estimation of must be taken into account for one to control te asymptotic NRP under all drifting sequences. Tis is were Bonferroni bounds become useful. 17

19 3.1 S-Bonf Robust Critical Values We begin by examining Bonferroni-based CVs for problems tat are caracterized by a SLLD, as described in Section 2.1. Te first, most conservative but most computationally simple Bonferroni-based CV is defined as follows: c S B(α, δ, ĥn) sup c (1 δ), I α δ (ĥn) were δ [0, α], ĥn is some random vector taking value in an auxiliary space H and I α δ ( ) is a correspondence from H into H. In applications, te space H will typically be equal to H or a space containing H but tis is not necessary for te ensuing assumptions to old. Te random vector ĥn is an estimator of under H 0 and te DGP caracterized by {γ n, } and I α δ (ĥn) serves as a (α δ)-level confidence set for. Construction of an estimator of is typically apparent from te context of te testing problem, given tat 1 = n r γ n,,1 + o(1) and 2 = γ n,,2 +o(1). Te S-Bonf CV generalizes te LF CV: wen I 0 (x) = H for all x H, c S B (α, α, ĥn) = c LF (α) sup H c (1 α). Te tuning parameter δ can be used to direct te power of te test towards different regions of te parameter space H. Te use of procedures tat make use of Bonferroni bounds in inference problems involving nuisance parameters and/or composite ypoteses as appeared in various contexts trougout te econometrics and statistics literature. Examples include Lo (1985), Stock (1991), Berger and Boos (1994), Silvapulle (1996), Staiger and Stock (1997), Hansen (2003) Moon and Scorfeide (2009) and Cauduri and Zivot (2011). Te metods of Lo (1985) and Hansen (2003) are analogous to letting δ α as n, asymptotically leading to c LF (α). We now impose furter assumptions to ensure tat tests utilizing c S B in te current context exibit asymptotic size control. Assumption S-B.3. Consider some fixed β [0, 1]. Under H 0 and wen te drifting sequence of parameters {γ n, } caracterizes te true DGP for any fixed H, tere exists an estimator ĥn taking values in some space H and a (nonrandom) continuous, compactvalued correspondence I β : H H suc tat ĥn d, a random vector taking values in H for wic P ( I β ( )) 1 β. Assumption S-B.3 assures tat ĥn is a well-beaved estimator of under H 0 and {γ n, } and imposes basic continuity assumptions on te correspondence I β ( ) used to construct te confidence set for. It allows I β ( ) to take a variety of forms depending upon te context of te testing problem. For a given β = α δ, tis flexibility can be used to direct te 18

20 power of te test towards different regions of H. In a typical testing problem, under H 0 and {γ n, }, ĥn,1 converges weakly to a normally distributed random variable wit mean 1, te true localization parameter, making te construction of I β very straigtforward. Similarly, depending upon te testing problem, different coices of ĥn may lead to tests wit different power properties. For example, it may be advantageous to use ĥn wit divergent elements under some alternative ypoteses if tis leads to smaller CVs. Assumption S-B.4. Under H 0 and wen te drifting sequence of parameters {γ n, } caracterizes te true DGP, (T n (θ 0 ), ĥn) d (W, ) for all H. d Assumptions S-B.1 and S-B.3 already provide tat T n (θ 0 ) W and ĥn d under H 0 and {γ n, } so tat Assumption S-B.4 only ensures tat tis weak convergence occurs jointly. Assumptions S-B.3 and S-B.4 also allow for muc flexibility in te estimation of. Since weak convergence is only required under H 0, ĥn may be constructed to be an asymptotically biased estimator of under some alternatives. Tis may allow one to increase te power of te test by, for example, constructing te CV using ĥn wit divergent elements so tat c S B (α, δ, ĥn) under some alternatives. We may now state te first result. Teorem S-B. Under Assumptions D and S-B.1 troug S-B.4 for β = α δ, δ AsySz(θ 0, c S B(α, δ, ĥn)) α. Teorem S-B establises te asymptotic size control of tests using S-Bonf CVs as well as providing a lower bound for te asymptotic size. If a consistent estimator of γ 2 is available, we can plug it into te CV to reduce its magnitude and increase te power of te test. Define te plug-in (PI) S-Bonf CV c S B P I (α, δ, ĥn) as above but wit I α δ (ĥn) j = {ˆγ n,2,j p } for j = p + 1,..., p + q. Tis generalizes te PI LF CV (e.g., AG): wen I 0 (x) = H 1 {(x p+1,..., x p+q )} for all x H, c S B P I (α, α, ĥn) = c LF P I (α, γ n,2 ˆ ) sup 1 H 1 c (1,ˆγ n,2 )(1 α). Similar comments to tose regarding te coice of δ, ĥn and I α δ ( ) apply to tis CV as well. We impose te following consistency assumption ten state te analogous result for tests using PI S-Bonf CVs. Assumption PI. ˆγ n,2 γ n,2 p 0 for all sequences {γ n } wit γ n Γ for all n. Corollary S-B-PI. Under Assumptions D, S-B.1 troug S-B.4 and PI for β = α δ, δ AsySz(θ 0, c S B P I(α, δ, ĥn) α. 19

21 3.2 S-Bonf-Min Robust Critical Values Toug tey are size-controlled, te S-Bonf CVs may be conservative, even in a uniform sense. Tis can be seen from te fact tat we can only establis a lower bound of δ α on te asymptotic size of tests using tese CVs. Moreover, a good coice for δ is not always apparent. In order to overcome tese problems and increase te power of te test, we introduce te following CV tat minimizes over a set of S-Bonf CVs in order to maximize power, wile retaining correct asymptotic size: were c S BM(α, ĥn) c min B (α, ĥn) +, { c min B (α, ĥn) = min c LF (α), and = sup H () wit () 0 solving inf δ [δ,α δ] P (W c min B (α, ) + ()) = α } c S B(α, δ, ĥn) or () = 0 if P (W c min B (α, )) < α. Te size-correction factor (SCF) automatically adapts to te user s coices of confidence set correspondence I α δ, localization parameter estimate ĥn and parameters δ and δ (see te following paragrap for more details on tese) since it is constructed so tat te test as correct asymptotic size under H 0 for te given coice of tese objects. Given te conservativeness already built into te Bonferroni approac, will typically be quite small, often being numerically indistinguisable from zero, so tat c S BM (α, ĥn) c LF (α), c S B (α, δ, ĥn) for δ [δ, α δ], resulting in tests wit iger power. In fact, in many contexts, simply setting = 0 will result in a test witout perfect (asymptotic) size control, but very little size distortion and necessarily iger power. For some testing problems, size-control can be attained wit set exactly equal to zero. See Corollary SCF for a sufficient condition for tis to occur. Inerent in te construction of c S BM (α, ĥn) are te parameters δ and δ. It sould be empasized tat tese parameters are not tuning parameters. Tey serve te role of restricting te localized quantile function c ( ) and te confidence set I α δ to regions of continuity (see te discussion following Assumptions S-BM.1 and S-BM.2). Given tat te aim of using S-Bonf-Min CVs is to maximize power, te minimization space [δ, α δ] sould be set as large as possible in order to obtain te smallest CV. Tis means tat δ and δ sould be set close to zero wile satisfying Assumptions S-BM.1 and S-BM.2. 20

Bonferroni-Based Size-Correction for Nonstandard Testing Problems

Bonferroni-Based Size-Correction for Nonstandard Testing Problems Bonferroni-Based Size-Correction for Nonstandard Testing Problems Adam McCloskey Brown University October 2011; Tis Version: September 2012 Abstract We develop powerful new size-correction procedures for

More information

econstor Make Your Publications Visible.

econstor Make Your Publications Visible. econstor Make Your Publications Visible. A Service of Wirtscaft Centre zbwleibniz-informationszentrum Economics McCloskey, Adam Working Paper Bonferroni-based size-correction for non standard testing problems

More information

Financial Econometrics Prof. Massimo Guidolin

Financial Econometrics Prof. Massimo Guidolin CLEFIN A.A. 2010/2011 Financial Econometrics Prof. Massimo Guidolin A Quick Review of Basic Estimation Metods 1. Were te OLS World Ends... Consider two time series 1: = { 1 2 } and 1: = { 1 2 }. At tis

More information

Volume 29, Issue 3. Existence of competitive equilibrium in economies with multi-member households

Volume 29, Issue 3. Existence of competitive equilibrium in economies with multi-member households Volume 29, Issue 3 Existence of competitive equilibrium in economies wit multi-member ouseolds Noriisa Sato Graduate Scool of Economics, Waseda University Abstract Tis paper focuses on te existence of

More information

The derivative function

The derivative function Roberto s Notes on Differential Calculus Capter : Definition of derivative Section Te derivative function Wat you need to know already: f is at a point on its grap and ow to compute it. Wat te derivative

More information

7 Semiparametric Methods and Partially Linear Regression

7 Semiparametric Methods and Partially Linear Regression 7 Semiparametric Metods and Partially Linear Regression 7. Overview A model is called semiparametric if it is described by and were is nite-dimensional (e.g. parametric) and is in nite-dimensional (nonparametric).

More information

lecture 26: Richardson extrapolation

lecture 26: Richardson extrapolation 43 lecture 26: Ricardson extrapolation 35 Ricardson extrapolation, Romberg integration Trougout numerical analysis, one encounters procedures tat apply some simple approximation (eg, linear interpolation)

More information

Consider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx.

Consider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx. Capter 2 Integrals as sums and derivatives as differences We now switc to te simplest metods for integrating or differentiating a function from its function samples. A careful study of Taylor expansions

More information

SECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY

SECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY (Section 3.2: Derivative Functions and Differentiability) 3.2.1 SECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY LEARNING OBJECTIVES Know, understand, and apply te Limit Definition of te Derivative

More information

Stationary Gaussian Markov Processes As Limits of Stationary Autoregressive Time Series

Stationary Gaussian Markov Processes As Limits of Stationary Autoregressive Time Series Stationary Gaussian Markov Processes As Limits of Stationary Autoregressive Time Series Lawrence D. Brown, Pilip A. Ernst, Larry Sepp, and Robert Wolpert August 27, 2015 Abstract We consider te class,

More information

ch (for some fixed positive number c) reaching c

ch (for some fixed positive number c) reaching c GSTF Journal of Matematics Statistics and Operations Researc (JMSOR) Vol. No. September 05 DOI 0.60/s4086-05-000-z Nonlinear Piecewise-defined Difference Equations wit Reciprocal and Cubic Terms Ramadan

More information

1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point

1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point MA00 Capter 6 Calculus and Basic Linear Algebra I Limits, Continuity and Differentiability Te concept of its (p.7 p.9, p.4 p.49, p.55 p.56). Limits Consider te function determined by te formula f Note

More information

EFFICIENCY OF MODEL-ASSISTED REGRESSION ESTIMATORS IN SAMPLE SURVEYS

EFFICIENCY OF MODEL-ASSISTED REGRESSION ESTIMATORS IN SAMPLE SURVEYS Statistica Sinica 24 2014, 395-414 doi:ttp://dx.doi.org/10.5705/ss.2012.064 EFFICIENCY OF MODEL-ASSISTED REGRESSION ESTIMATORS IN SAMPLE SURVEYS Jun Sao 1,2 and Seng Wang 3 1 East Cina Normal University,

More information

Regularized Regression

Regularized Regression Regularized Regression David M. Blei Columbia University December 5, 205 Modern regression problems are ig dimensional, wic means tat te number of covariates p is large. In practice statisticians regularize

More information

A = h w (1) Error Analysis Physics 141

A = h w (1) Error Analysis Physics 141 Introduction In all brances of pysical science and engineering one deals constantly wit numbers wic results more or less directly from experimental observations. Experimental observations always ave inaccuracies.

More information

Differential Calculus (The basics) Prepared by Mr. C. Hull

Differential Calculus (The basics) Prepared by Mr. C. Hull Differential Calculus Te basics) A : Limits In tis work on limits, we will deal only wit functions i.e. tose relationsips in wic an input variable ) defines a unique output variable y). Wen we work wit

More information

Model Specification Testing in Nonparametric and Semiparametric Time Series Econometrics 1

Model Specification Testing in Nonparametric and Semiparametric Time Series Econometrics 1 Model Specification Testing in Nonparametric and Semiparametric Time Series Econometrics 1 By Jiti Gao 2 and Maxwell King 3 Abstract We propose a simultaneous model specification procedure for te conditional

More information

Chapter 2 Limits and Continuity

Chapter 2 Limits and Continuity 4 Section. Capter Limits and Continuity Section. Rates of Cange and Limits (pp. 6) Quick Review.. f () ( ) () 4 0. f () 4( ) 4. f () sin sin 0 4. f (). 4 4 4 6. c c c 7. 8. c d d c d d c d c 9. 8 ( )(

More information

LIMITATIONS OF EULER S METHOD FOR NUMERICAL INTEGRATION

LIMITATIONS OF EULER S METHOD FOR NUMERICAL INTEGRATION LIMITATIONS OF EULER S METHOD FOR NUMERICAL INTEGRATION LAURA EVANS.. Introduction Not all differential equations can be explicitly solved for y. Tis can be problematic if we need to know te value of y

More information

Continuous Stochastic Processes

Continuous Stochastic Processes Continuous Stocastic Processes Te term stocastic is often applied to penomena tat vary in time, wile te word random is reserved for penomena tat vary in space. Apart from tis distinction, te modelling

More information

New families of estimators and test statistics in log-linear models

New families of estimators and test statistics in log-linear models Journal of Multivariate Analysis 99 008 1590 1609 www.elsevier.com/locate/jmva ew families of estimators and test statistics in log-linear models irian Martín a,, Leandro Pardo b a Department of Statistics

More information

Online Learning: Bandit Setting

Online Learning: Bandit Setting Online Learning: Bandit Setting Daniel asabi Summer 04 Last Update: October 0, 06 Introduction [TODO Bandits. Stocastic setting Suppose tere exists unknown distributions ν,..., ν, suc tat te loss at eac

More information

Math 161 (33) - Final exam

Math 161 (33) - Final exam Name: Id #: Mat 161 (33) - Final exam Fall Quarter 2015 Wednesday December 9, 2015-10:30am to 12:30am Instructions: Prob. Points Score possible 1 25 2 25 3 25 4 25 TOTAL 75 (BEST 3) Read eac problem carefully.

More information

Efficient algorithms for for clone items detection

Efficient algorithms for for clone items detection Efficient algoritms for for clone items detection Raoul Medina, Caroline Noyer, and Olivier Raynaud Raoul Medina, Caroline Noyer and Olivier Raynaud LIMOS - Université Blaise Pascal, Campus universitaire

More information

Numerical Differentiation

Numerical Differentiation Numerical Differentiation Finite Difference Formulas for te first derivative (Using Taylor Expansion tecnique) (section 8.3.) Suppose tat f() = g() is a function of te variable, and tat as 0 te function

More information

NUMERICAL DIFFERENTIATION. James T. Smith San Francisco State University. In calculus classes, you compute derivatives algebraically: for example,

NUMERICAL DIFFERENTIATION. James T. Smith San Francisco State University. In calculus classes, you compute derivatives algebraically: for example, NUMERICAL DIFFERENTIATION James T Smit San Francisco State University In calculus classes, you compute derivatives algebraically: for example, f( x) = x + x f ( x) = x x Tis tecnique requires your knowing

More information

4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these.

4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these. Mat 11. Test Form N Fall 016 Name. Instructions. Te first eleven problems are wort points eac. Te last six problems are wort 5 points eac. For te last six problems, you must use relevant metods of algebra

More information

SECTION 1.10: DIFFERENCE QUOTIENTS LEARNING OBJECTIVES

SECTION 1.10: DIFFERENCE QUOTIENTS LEARNING OBJECTIVES (Section.0: Difference Quotients).0. SECTION.0: DIFFERENCE QUOTIENTS LEARNING OBJECTIVES Define average rate of cange (and average velocity) algebraically and grapically. Be able to identify, construct,

More information

New Distribution Theory for the Estimation of Structural Break Point in Mean

New Distribution Theory for the Estimation of Structural Break Point in Mean New Distribution Teory for te Estimation of Structural Break Point in Mean Liang Jiang Singapore Management University Xiaou Wang Te Cinese University of Hong Kong Jun Yu Singapore Management University

More information

Lecture 15. Interpolation II. 2 Piecewise polynomial interpolation Hermite splines

Lecture 15. Interpolation II. 2 Piecewise polynomial interpolation Hermite splines Lecture 5 Interpolation II Introduction In te previous lecture we focused primarily on polynomial interpolation of a set of n points. A difficulty we observed is tat wen n is large, our polynomial as to

More information

Bandwidth Selection in Nonparametric Kernel Testing

Bandwidth Selection in Nonparametric Kernel Testing Te University of Adelaide Scool of Economics Researc Paper No. 2009-0 January 2009 Bandwidt Selection in Nonparametric ernel Testing Jiti Gao and Irene Gijbels Bandwidt Selection in Nonparametric ernel

More information

MVT and Rolle s Theorem

MVT and Rolle s Theorem AP Calculus CHAPTER 4 WORKSHEET APPLICATIONS OF DIFFERENTIATION MVT and Rolle s Teorem Name Seat # Date UNLESS INDICATED, DO NOT USE YOUR CALCULATOR FOR ANY OF THESE QUESTIONS In problems 1 and, state

More information

Polynomial Interpolation

Polynomial Interpolation Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximatinga function fx, wose values at a set of distinct points x, x, x,, x n are known, by a polynomial P x suc

More information

Click here to see an animation of the derivative

Click here to see an animation of the derivative Differentiation Massoud Malek Derivative Te concept of derivative is at te core of Calculus; It is a very powerful tool for understanding te beavior of matematical functions. It allows us to optimize functions,

More information

REVIEW LAB ANSWER KEY

REVIEW LAB ANSWER KEY REVIEW LAB ANSWER KEY. Witout using SN, find te derivative of eac of te following (you do not need to simplify your answers): a. f x 3x 3 5x x 6 f x 3 3x 5 x 0 b. g x 4 x x x notice te trick ere! x x g

More information

A SHORT INTRODUCTION TO BANACH LATTICES AND

A SHORT INTRODUCTION TO BANACH LATTICES AND CHAPTER A SHORT INTRODUCTION TO BANACH LATTICES AND POSITIVE OPERATORS In tis capter we give a brief introduction to Banac lattices and positive operators. Most results of tis capter can be found, e.g.,

More information

Copyright c 2008 Kevin Long

Copyright c 2008 Kevin Long Lecture 4 Numerical solution of initial value problems Te metods you ve learned so far ave obtained closed-form solutions to initial value problems. A closedform solution is an explicit algebriac formula

More information

1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x)

1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x) Calculus. Gradients and te Derivative Q f(x+) δy P T δx R f(x) 0 x x+ Let P (x, f(x)) and Q(x+, f(x+)) denote two points on te curve of te function y = f(x) and let R denote te point of intersection of

More information

Preface. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Preface. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. Preface Here are my online notes for my course tat I teac ere at Lamar University. Despite te fact tat tese are my class notes, tey sould be accessible to anyone wanting to learn or needing a refreser

More information

Polynomial Interpolation

Polynomial Interpolation Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximating a function f(x, wose values at a set of distinct points x, x, x 2,,x n are known, by a polynomial P (x

More information

Notes on wavefunctions II: momentum wavefunctions

Notes on wavefunctions II: momentum wavefunctions Notes on wavefunctions II: momentum wavefunctions and uncertainty Te state of a particle at any time is described by a wavefunction ψ(x). Tese wavefunction must cange wit time, since we know tat particles

More information

Poisson Equation in Sobolev Spaces

Poisson Equation in Sobolev Spaces Poisson Equation in Sobolev Spaces OcMountain Dayligt Time. 6, 011 Today we discuss te Poisson equation in Sobolev spaces. It s existence, uniqueness, and regularity. Weak Solution. u = f in, u = g on

More information

The Priestley-Chao Estimator

The Priestley-Chao Estimator Te Priestley-Cao Estimator In tis section we will consider te Pristley-Cao estimator of te unknown regression function. It is assumed tat we ave a sample of observations (Y i, x i ), i = 1,..., n wic are

More information

ERROR BOUNDS FOR THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BRADLEY J. LUCIER*

ERROR BOUNDS FOR THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BRADLEY J. LUCIER* EO BOUNDS FO THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BADLEY J. LUCIE* Abstract. Te expected error in L ) attimet for Glimm s sceme wen applied to a scalar conservation law is bounded by + 2 ) ) /2 T

More information

Notes on Neural Networks

Notes on Neural Networks Artificial neurons otes on eural etwors Paulo Eduardo Rauber 205 Consider te data set D {(x i y i ) i { n} x i R m y i R d } Te tas of supervised learning consists on finding a function f : R m R d tat

More information

3.4 Worksheet: Proof of the Chain Rule NAME

3.4 Worksheet: Proof of the Chain Rule NAME Mat 1170 3.4 Workseet: Proof of te Cain Rule NAME Te Cain Rule So far we are able to differentiate all types of functions. For example: polynomials, rational, root, and trigonometric functions. We are

More information

Should We Go One Step Further? An Accurate Comparison of One-Step and Two-Step Procedures in a Generalized Method of Moments Framework

Should We Go One Step Further? An Accurate Comparison of One-Step and Two-Step Procedures in a Generalized Method of Moments Framework Sould We Go One Step Furter? An Accurate Comparison of One-Step and wo-step Procedures in a Generalized Metod of Moments Framework Jungbin Hwang and Yixiao Sun Department of Economics, University of California,

More information

Basic Nonparametric Estimation Spring 2002

Basic Nonparametric Estimation Spring 2002 Basic Nonparametric Estimation Spring 2002 Te following topics are covered today: Basic Nonparametric Regression. Tere are four books tat you can find reference: Silverman986, Wand and Jones995, Hardle990,

More information

Generic maximum nullity of a graph

Generic maximum nullity of a graph Generic maximum nullity of a grap Leslie Hogben Bryan Sader Marc 5, 2008 Abstract For a grap G of order n, te maximum nullity of G is defined to be te largest possible nullity over all real symmetric n

More information

MA455 Manifolds Solutions 1 May 2008

MA455 Manifolds Solutions 1 May 2008 MA455 Manifolds Solutions 1 May 2008 1. (i) Given real numbers a < b, find a diffeomorpism (a, b) R. Solution: For example first map (a, b) to (0, π/2) and ten map (0, π/2) diffeomorpically to R using

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL IFFERENTIATION FIRST ERIVATIVES Te simplest difference formulas are based on using a straigt line to interpolate te given data; tey use two data pints to estimate te derivative. We assume tat

More information

3.1 Extreme Values of a Function

3.1 Extreme Values of a Function .1 Etreme Values of a Function Section.1 Notes Page 1 One application of te derivative is finding minimum and maimum values off a grap. In precalculus we were only able to do tis wit quadratics by find

More information

IEOR 165 Lecture 10 Distribution Estimation

IEOR 165 Lecture 10 Distribution Estimation IEOR 165 Lecture 10 Distribution Estimation 1 Motivating Problem Consider a situation were we ave iid data x i from some unknown distribution. One problem of interest is estimating te distribution tat

More information

Combining functions: algebraic methods

Combining functions: algebraic methods Combining functions: algebraic metods Functions can be added, subtracted, multiplied, divided, and raised to a power, just like numbers or algebra expressions. If f(x) = x 2 and g(x) = x + 2, clearly f(x)

More information

Differentiation in higher dimensions

Differentiation in higher dimensions Capter 2 Differentiation in iger dimensions 2.1 Te Total Derivative Recall tat if f : R R is a 1-variable function, and a R, we say tat f is differentiable at x = a if and only if te ratio f(a+) f(a) tends

More information

Kernel Density Based Linear Regression Estimate

Kernel Density Based Linear Regression Estimate Kernel Density Based Linear Regression Estimate Weixin Yao and Zibiao Zao Abstract For linear regression models wit non-normally distributed errors, te least squares estimate (LSE will lose some efficiency

More information

Bootstrap confidence intervals in nonparametric regression without an additive model

Bootstrap confidence intervals in nonparametric regression without an additive model Bootstrap confidence intervals in nonparametric regression witout an additive model Dimitris N. Politis Abstract Te problem of confidence interval construction in nonparametric regression via te bootstrap

More information

Calculus I Practice Exam 1A

Calculus I Practice Exam 1A Calculus I Practice Exam A Calculus I Practice Exam A Tis practice exam empasizes conceptual connections and understanding to a greater degree tan te exams tat are usually administered in introductory

More information

. If lim. x 2 x 1. f(x+h) f(x)

. If lim. x 2 x 1. f(x+h) f(x) Review of Differential Calculus Wen te value of one variable y is uniquely determined by te value of anoter variable x, ten te relationsip between x and y is described by a function f tat assigns a value

More information

Chapter 2. Limits and Continuity 16( ) 16( 9) = = 001. Section 2.1 Rates of Change and Limits (pp ) Quick Review 2.1

Chapter 2. Limits and Continuity 16( ) 16( 9) = = 001. Section 2.1 Rates of Change and Limits (pp ) Quick Review 2.1 Capter Limits and Continuity Section. Rates of Cange and Limits (pp. 969) Quick Review..... f ( ) ( ) ( ) 0 ( ) f ( ) f ( ) sin π sin π 0 f ( ). < < < 6. < c c < < c 7. < < < < < 8. 9. 0. c < d d < c

More information

Bounds on the Moments for an Ensemble of Random Decision Trees

Bounds on the Moments for an Ensemble of Random Decision Trees Noname manuscript No. (will be inserted by te editor) Bounds on te Moments for an Ensemble of Random Decision Trees Amit Durandar Received: Sep. 17, 2013 / Revised: Mar. 04, 2014 / Accepted: Jun. 30, 2014

More information

A Bootstrap Procedure for Inference in Nonparametric Instrumental Variables

A Bootstrap Procedure for Inference in Nonparametric Instrumental Variables A Bootstrap Procedure for Inference in Nonparametric Instrumental Variables Andres Santos Department of Economics University of California, San Diego e-mail: asantos@ucsd.edu May 3, 8 Abstract Tis paper

More information

HOMEWORK HELP 2 FOR MATH 151

HOMEWORK HELP 2 FOR MATH 151 HOMEWORK HELP 2 FOR MATH 151 Here we go; te second round of omework elp. If tere are oters you would like to see, let me know! 2.4, 43 and 44 At wat points are te functions f(x) and g(x) = xf(x)continuous,

More information

EFFICIENT REPLICATION VARIANCE ESTIMATION FOR TWO-PHASE SAMPLING

EFFICIENT REPLICATION VARIANCE ESTIMATION FOR TWO-PHASE SAMPLING Statistica Sinica 13(2003), 641-653 EFFICIENT REPLICATION VARIANCE ESTIMATION FOR TWO-PHASE SAMPLING J. K. Kim and R. R. Sitter Hankuk University of Foreign Studies and Simon Fraser University Abstract:

More information

Symmetry Labeling of Molecular Energies

Symmetry Labeling of Molecular Energies Capter 7. Symmetry Labeling of Molecular Energies Notes: Most of te material presented in tis capter is taken from Bunker and Jensen 1998, Cap. 6, and Bunker and Jensen 2005, Cap. 7. 7.1 Hamiltonian Symmetry

More information

A New Diagnostic Test for Cross Section Independence in Nonparametric Panel Data Model

A New Diagnostic Test for Cross Section Independence in Nonparametric Panel Data Model e University of Adelaide Scool of Economics Researc Paper No. 2009-6 October 2009 A New Diagnostic est for Cross Section Independence in Nonparametric Panel Data Model Jia Cen, Jiti Gao and Degui Li e

More information

Chapter 1. Density Estimation

Chapter 1. Density Estimation Capter 1 Density Estimation Let X 1, X,..., X n be observations from a density f X x. Te aim is to use only tis data to obtain an estimate ˆf X x of f X x. Properties of f f X x x, Parametric metods f

More information

5 Ordinary Differential Equations: Finite Difference Methods for Boundary Problems

5 Ordinary Differential Equations: Finite Difference Methods for Boundary Problems 5 Ordinary Differential Equations: Finite Difference Metods for Boundary Problems Read sections 10.1, 10.2, 10.4 Review questions 10.1 10.4, 10.8 10.9, 10.13 5.1 Introduction In te previous capters we

More information

Continuity and Differentiability Worksheet

Continuity and Differentiability Worksheet Continuity and Differentiability Workseet (Be sure tat you can also do te grapical eercises from te tet- Tese were not included below! Typical problems are like problems -3, p. 6; -3, p. 7; 33-34, p. 7;

More information

University Mathematics 2

University Mathematics 2 University Matematics 2 1 Differentiability In tis section, we discuss te differentiability of functions. Definition 1.1 Differentiable function). Let f) be a function. We say tat f is differentiable at

More information

The Complexity of Computing the MCD-Estimator

The Complexity of Computing the MCD-Estimator Te Complexity of Computing te MCD-Estimator Torsten Bernolt Lerstul Informatik 2 Universität Dortmund, Germany torstenbernolt@uni-dortmundde Paul Fiscer IMM, Danisc Tecnical University Kongens Lyngby,

More information

Material for Difference Quotient

Material for Difference Quotient Material for Difference Quotient Prepared by Stepanie Quintal, graduate student and Marvin Stick, professor Dept. of Matematical Sciences, UMass Lowell Summer 05 Preface Te following difference quotient

More information

Analytic Functions. Differentiable Functions of a Complex Variable

Analytic Functions. Differentiable Functions of a Complex Variable Analytic Functions Differentiable Functions of a Complex Variable In tis capter, we sall generalize te ideas for polynomials power series of a complex variable we developed in te previous capter to general

More information

Flavius Guiaş. X(t + h) = X(t) + F (X(s)) ds.

Flavius Guiaş. X(t + h) = X(t) + F (X(s)) ds. Numerical solvers for large systems of ordinary differential equations based on te stocastic direct simulation metod improved by te and Runge Kutta principles Flavius Guiaş Abstract We present a numerical

More information

HOW TO DEAL WITH FFT SAMPLING INFLUENCES ON ADEV CALCULATIONS

HOW TO DEAL WITH FFT SAMPLING INFLUENCES ON ADEV CALCULATIONS HOW TO DEAL WITH FFT SAMPLING INFLUENCES ON ADEV CALCULATIONS Po-Ceng Cang National Standard Time & Frequency Lab., TL, Taiwan 1, Lane 551, Min-Tsu Road, Sec. 5, Yang-Mei, Taoyuan, Taiwan 36 Tel: 886 3

More information

Function Composition and Chain Rules

Function Composition and Chain Rules Function Composition and s James K. Peterson Department of Biological Sciences and Department of Matematical Sciences Clemson University Marc 8, 2017 Outline 1 Function Composition and Continuity 2 Function

More information

INFINITE ORDER CROSS-VALIDATED LOCAL POLYNOMIAL REGRESSION. 1. Introduction

INFINITE ORDER CROSS-VALIDATED LOCAL POLYNOMIAL REGRESSION. 1. Introduction INFINITE ORDER CROSS-VALIDATED LOCAL POLYNOMIAL REGRESSION PETER G. HALL AND JEFFREY S. RACINE Abstract. Many practical problems require nonparametric estimates of regression functions, and local polynomial

More information

Pre-Calculus Review Preemptive Strike

Pre-Calculus Review Preemptive Strike Pre-Calculus Review Preemptive Strike Attaced are some notes and one assignment wit tree parts. Tese are due on te day tat we start te pre-calculus review. I strongly suggest reading troug te notes torougly

More information

Bootstrap prediction intervals for Markov processes

Bootstrap prediction intervals for Markov processes arxiv: arxiv:0000.0000 Bootstrap prediction intervals for Markov processes Li Pan and Dimitris N. Politis Li Pan Department of Matematics University of California San Diego La Jolla, CA 92093-0112, USA

More information

Functions of the Complex Variable z

Functions of the Complex Variable z Capter 2 Functions of te Complex Variable z Introduction We wis to examine te notion of a function of z were z is a complex variable. To be sure, a complex variable can be viewed as noting but a pair of

More information

Fundamentals of Concept Learning

Fundamentals of Concept Learning Aims 09s: COMP947 Macine Learning and Data Mining Fundamentals of Concept Learning Marc, 009 Acknowledgement: Material derived from slides for te book Macine Learning, Tom Mitcell, McGraw-Hill, 997 ttp://www-.cs.cmu.edu/~tom/mlbook.tml

More information

A MONTE CARLO ANALYSIS OF THE EFFECTS OF COVARIANCE ON PROPAGATED UNCERTAINTIES

A MONTE CARLO ANALYSIS OF THE EFFECTS OF COVARIANCE ON PROPAGATED UNCERTAINTIES A MONTE CARLO ANALYSIS OF THE EFFECTS OF COVARIANCE ON PROPAGATED UNCERTAINTIES Ronald Ainswort Hart Scientific, American Fork UT, USA ABSTRACT Reports of calibration typically provide total combined uncertainties

More information

Applied Linear Statistical Models. Simultaneous Inference Topics. Simultaneous Estimation of β 0 and β 1 Issues. Simultaneous Inference. Dr.

Applied Linear Statistical Models. Simultaneous Inference Topics. Simultaneous Estimation of β 0 and β 1 Issues. Simultaneous Inference. Dr. Applied Linear Statistical Models Simultaneous Inference Dr. DH Jones Simultaneous Inference Topics Simultaneous estimation of β 0 and β 1 Bonferroni Metod Simultaneous estimation of several mean responses

More information

EDML: A Method for Learning Parameters in Bayesian Networks

EDML: A Method for Learning Parameters in Bayesian Networks : A Metod for Learning Parameters in Bayesian Networks Artur Coi, Kaled S. Refaat and Adnan Darwice Computer Science Department University of California, Los Angeles {aycoi, krefaat, darwice}@cs.ucla.edu

More information

On stochastic orderings of the Wilcoxon Rank Sum test statistic with applications to reproducibility probability estimation testing

On stochastic orderings of the Wilcoxon Rank Sum test statistic with applications to reproducibility probability estimation testing On stocastic orderings of te Wilcoxon Rank Sum test statistic wit applications to reproducibility probability estimation testing L. De Capitani, D. De Martini To cite tis version: L. De Capitani, D. De

More information

232 Calculus and Structures

232 Calculus and Structures 3 Calculus and Structures CHAPTER 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS FOR EVALUATING BEAMS Calculus and Structures 33 Copyrigt Capter 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS 17.1 THE

More information

Math Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim

Math Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim Mat 311 - Spring 013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, 013 Question 1. [p 56, #10 (a)] 4z Use te teorem of Sec. 17 to sow tat z (z 1) = 4. We ave z 4z (z 1) = z 0 4 (1/z) (1/z

More information

arxiv: v1 [math.pr] 28 Dec 2018

arxiv: v1 [math.pr] 28 Dec 2018 Approximating Sepp s constants for te Slepian process Jack Noonan a, Anatoly Zigljavsky a, a Scool of Matematics, Cardiff University, Cardiff, CF4 4AG, UK arxiv:8.0v [mat.pr] 8 Dec 08 Abstract Slepian

More information

2.8 The Derivative as a Function

2.8 The Derivative as a Function .8 Te Derivative as a Function Typically, we can find te derivative of a function f at many points of its domain: Definition. Suppose tat f is a function wic is differentiable at every point of an open

More information

How to Find the Derivative of a Function: Calculus 1

How to Find the Derivative of a Function: Calculus 1 Introduction How to Find te Derivative of a Function: Calculus 1 Calculus is not an easy matematics course Te fact tat you ave enrolled in suc a difficult subject indicates tat you are interested in te

More information

A Reconsideration of Matter Waves

A Reconsideration of Matter Waves A Reconsideration of Matter Waves by Roger Ellman Abstract Matter waves were discovered in te early 20t century from teir wavelengt, predicted by DeBroglie, Planck's constant divided by te particle's momentum,

More information

A Goodness-of-fit test for GARCH innovation density. Hira L. Koul 1 and Nao Mimoto Michigan State University. Abstract

A Goodness-of-fit test for GARCH innovation density. Hira L. Koul 1 and Nao Mimoto Michigan State University. Abstract A Goodness-of-fit test for GARCH innovation density Hira L. Koul and Nao Mimoto Micigan State University Abstract We prove asymptotic normality of a suitably standardized integrated square difference between

More information

Yishay Mansour. AT&T Labs and Tel-Aviv University. design special-purpose planning algorithms that exploit. this structure.

Yishay Mansour. AT&T Labs and Tel-Aviv University. design special-purpose planning algorithms that exploit. this structure. A Sparse Sampling Algoritm for Near-Optimal Planning in Large Markov Decision Processes Micael Kearns AT&T Labs mkearns@researc.att.com Yisay Mansour AT&T Labs and Tel-Aviv University mansour@researc.att.com

More information

Journal of Computational and Applied Mathematics

Journal of Computational and Applied Mathematics Journal of Computational and Applied Matematics 94 (6) 75 96 Contents lists available at ScienceDirect Journal of Computational and Applied Matematics journal omepage: www.elsevier.com/locate/cam Smootness-Increasing

More information

INFERENCE ON DISTRIBUTION FUNCTIONS UNDER MEASUREMENT ERROR

INFERENCE ON DISTRIBUTION FUNCTIONS UNDER MEASUREMENT ERROR INFERENCE ON DISTRIBUTION FUNCTIONS UNDER MEASUREMENT ERROR KARUN ADUSUMILLI, TAISUKE OTSU, AND YOON-JAE WHANG Abstract. Tis paper is concerned wit inference on te cumulative distribution function (cdf)

More information

arxiv: v2 [math.na] 5 Jul 2017

arxiv: v2 [math.na] 5 Jul 2017 Trace Finite Element Metods for PDEs on Surfaces Maxim A. Olsanskii and Arnold Reusken arxiv:1612.00054v2 [mat.na] 5 Jul 2017 Abstract In tis paper we consider a class of unfitted finite element metods

More information

MAT244 - Ordinary Di erential Equations - Summer 2016 Assignment 2 Due: July 20, 2016

MAT244 - Ordinary Di erential Equations - Summer 2016 Assignment 2 Due: July 20, 2016 MAT244 - Ordinary Di erential Equations - Summer 206 Assignment 2 Due: July 20, 206 Full Name: Student #: Last First Indicate wic Tutorial Section you attend by filling in te appropriate circle: Tut 0

More information

MAT 145. Type of Calculator Used TI-89 Titanium 100 points Score 100 possible points

MAT 145. Type of Calculator Used TI-89 Titanium 100 points Score 100 possible points MAT 15 Test #2 Name Solution Guide Type of Calculator Used TI-89 Titanium 100 points Score 100 possible points Use te grap of a function sown ere as you respond to questions 1 to 8. 1. lim f (x) 0 2. lim

More information

Exam 1 Review Solutions

Exam 1 Review Solutions Exam Review Solutions Please also review te old quizzes, and be sure tat you understand te omework problems. General notes: () Always give an algebraic reason for your answer (graps are not sufficient),

More information

Math 102 TEST CHAPTERS 3 & 4 Solutions & Comments Fall 2006

Math 102 TEST CHAPTERS 3 & 4 Solutions & Comments Fall 2006 Mat 102 TEST CHAPTERS 3 & 4 Solutions & Comments Fall 2006 f(x+) f(x) 10 1. For f(x) = x 2 + 2x 5, find ))))))))) and simplify completely. NOTE: **f(x+) is NOT f(x)+! f(x+) f(x) (x+) 2 + 2(x+) 5 ( x 2

More information