Šidák correction for t-test explained

One of the application of Student's t-test is to test the location of one sequence of independent and identically distributed random variables. If we want to test the locations of multiple sequences of such variables, Šidák correction should be applied in order to calibrate the level of the Student's t-test. Moreover, if we want to test the locations of nearly infinitely many sequences of variables, then Šidák correction should be used, but with caution. More specifically, the validity of Šidák correction depends on how fast the number of sequences goes to infinity.

Introduction

Suppose we are interested in different hypotheses,

H _{1} ,...,H _{m} , and would like to check if all of them are true. Now the hypothesis test scheme becomesH _{null} : all of H _{i} are true;H _{alternative} : at least one of H _{i} is false.

Let

\alpha be the level of this test (the type-I error), that is, the probability that we falsely reject H _{null} when it is true.

We aim to design a test with certain level

\alpha .

Suppose when testing each hypothesis

H _{i} , the test statistic we use is t _{i} .

If these

t _{i} 's are independent, then a test for H _{null} can be developed by the following procedure, known as Šidák correction.

Step 1, we test each of null hypotheses at level

1- ( 1- \alpha) ^{(1)/(m)} .

Step 2, if any of these null hypotheses is rejected, we reject

H _{null} .

Finite case

For finitely many t-tests,suppose

Y _{ij} = \mu _{i} + \epsilon _{ij} , i =1 ,...,N, j =1 ,...,n, where for each, \epsilon _{i1} ,...,\epsilon _{in} are independently and identically distributed, for each \epsilon _{1j} ,...,\epsilon _{Nj} are independent but not necessarily identically distributed, and \epsilon _{ij} has finite fourth moment.

Our goal is to design a test for

H _{null} : \mu _{i} =0 , \forall i =1 ,...,N with level . This test can be based on the t-statistic of each sequences, that is,t _{i} = (\bar{Y)/(_{i}) },

where:

\bar{Y} _{i} = (1)/(n) \sum ^{n} _{j =1} Y _{ij} , S ^{2} _{i} = (1)/(n) \sum ^{n} _{j =1} (Y _{ij} - \bar{Y} _{i} ) ^{2} .

Using Šidák correction, we reject

H _{null} if any of the t-tests based on the t-statistics above reject at level 1- ( 1- \alpha) ^{(1)/(N)} . More specifically, we reject H _{null} when\exists i \in \{ 1 ,\ldots,N\} : |t _{i} |> \zeta _{\alpha,N} ,

where

P(|Z|>\zeta _{\alpha,N} ) =1- ( 1- \alpha) ^{(1)/(N)} , Z\sim N( 0 , 1 )

The test defined above has asymptotic level, because

\begin{align} level & = P _{null} \left ( reject H _{null} \right) \\ & = P _{null} \left(\exists i \in \{ 1 ,\ldots,N\} : |t _{i} |>\zeta _{\alpha,N} \right ) \\ & = 1- P _{null} \left (\forall i \in \{ 1 ,\ldots,N\} : |t _{i} |\leq\zeta _{\alpha,N} \right ) \\ & =1- \prod ^{N} _{i =1} P _{null} \left (|t _{i} |\leq\zeta _{\alpha,N} \right ) \\ &\to 1- \prod ^{N} _{i =1} P \left (|Z _{i} |\leq\zeta _{\alpha,N} \right ) && Z _{i} \sim N( 0 , 1 ) \\ & = \alpha \end{align}

Infinite case

In some cases, the number of sequences,

N , increase as the data size of each sequences, n , increase. In particular, suppose N(n) → inf ty as n → inf ty . If this is true, then we will need to test a null including infinitely many hypotheses, that is

$$H\_:\; \backslash text\; H\_\; \backslash text\; i=1,2,....$$

To design a test, Šidák correction may be applied, as in the case of finitely many t-test. However, when

N(n) → inf ty as n → inf ty , the Šidák correction for t-test may not achieve the level we want, that is, the true level of the test may not converges to the nominal level \alpha as n goes to infinity. This result is related to high-dimensional statistics and is proven by . Specifically, if we want the true level of the test converges to the nominal level \alpha , then we need a restraint on how fast N(n) → inf ty . Indeed,

• When all of

\epsilon _{ij} have distribution symmetric about zero, then it is sufficient to require log N = o (n ^{1/3} ) to guarantee the true level converges to \alpha .

• When the distributions of

\epsilon _{ij} are asymmetric, then it is necessary to impose log N = o(n ^{1/2} ) to ensure the true level converges to \alpha .

• Actually, if we apply bootstrapping method to the calibration of level, then we will only need

log N = o (n ^{1/3} ) even if \epsilon _{ij} has asymmetric distribution.

The results above are based on Central Limit Theorem. According to Central Limit Theorem, each of our t-statistics

t _{i} possesses asymptotic standard normal distribution, and so the difference between the distribution of each t _{i} and the standard normal distribution is asymptotically negligible. The question is, if we aggregate all the differences between the distribution of each t _{i} and the standard normal distribution, is this aggregation of differences still asymptotically ignorable?

When we have finitely many

t _{i} , the answer is yes. But when we have infinitely many t _{i} , the answer some time becomes no. This is because in the latter case we are summing up infinitely many infinitesimal terms. If the number of the terms goes to infinity too fast, that is, N(n) → inf ty too fast, then the sum may not be zero, the distribution of the t-statistics can not be approximated by the standard normal distribution, the true level does not converges to the nominal level \alpha , and then the Šidák correction fails.

See also

• Šidák correction
• Multiple comparisons
• Bonferroni correction
• Family-wise error rate
• Closed testing procedure