Tutorials › Multivariate Statistics (Graduate) › Maximum-Coordinate Tests for Sparse Mean Shifts

High-Dimensional Mean Testing · Tutorial 810 of 975

Maximum-Coordinate Tests for Sparse Mean Shifts

Learn how to calibrate a maximum of standardized sample means and assess its power against sparse alternatives.

Advanced 10 min read

What You'll Learn

  • Define the maximum-coordinate statistic for testing a multivariate mean.
  • Calibrate a two-sided test using a Bonferroni threshold that permits dependent coordinates.
  • Derive the marginal power at a signal coordinate and a lower bound on overall power.
  • Relate sample size, signal size, dimension, and target power.
  • Identify why a maximum test can be effective for a few strong signals but less responsive to diffuse shifts.

Why Test the Largest Coordinate?

A multivariate mean test can be designed to respond to different shapes of departure from the null. A quadratic statistic accumulates evidence across coordinates; a maximum-coordinate statistic instead asks whether at least one standardized mean is unusually large in magnitude. That focus can be useful when only a small number of coordinates are expected to shift, since a few strong signals need not be diluted by many near-zero coordinates.

The maximum has a calibration challenge: even when every coordinate follows its null distribution, taking a maximum over many coordinates makes an extreme value more likely. The construction below controls this multiple-coordinate error without assuming that the coordinates are independent. We use an exact Gaussian model and known marginal standard deviations so the test and its size calculation are explicit.

Model and hypotheses: Let \(X_1,\ldots,X_n\) be independent and identically distributed \(p\)-dimensional random vectors with \(X_i\sim N_p(\mu,\Sigma)\). Assume that each marginal variance \(\sigma_j^2=\Sigma_{jj}\) is known and positive. The null and alternative are \(H_0:\mu=0\) and \(H_1:\mu\ne 0\). The off-diagonal entries of \(\Sigma\) may be arbitrary, subject to \(\Sigma\) being a covariance matrix.

Write \(\bar X_j=n^{-1}\sum_{i=1}^n X_{ij}\) for the sample mean in coordinate \(j\). Its standardized value is \(Z_j=\sqrt n\,\bar X_j/\sigma_j\). Under the Gaussian model, \(Z_j\) has a standard normal distribution under \(H_0\), regardless of the dependence between coordinates. The vector of these standardized means can still be dependent.

Definition: The two-sided maximum-coordinate statistic is \(M_p=\max_{1\le j\le p}|Z_j|\). For a chosen type-I error bound \(\alpha\in(0,1)\), define \(c_{\alpha,p}=\Phi^{-1}(1-\alpha/(2p))\), where \(\Phi\) is the standard normal cumulative distribution function. The Bonferroni maximum test rejects \(H_0\) when \(M_p>c_{\alpha,p}\).

Calibration Without Coordinate Independence

The test compares all \(p\) coordinates with a threshold chosen to limit the probability of any false rejection. It does not claim that the maximum has a particular exact distribution when coordinates are dependent. Instead, it combines the marginal normal tail probabilities using the union bound.

Theorem: Under the stated Gaussian model and \(H_0\), the Bonferroni maximum test has size at most \(\alpha\), for any dependence among coordinates. If the standardized coordinates are independent, its null rejection probability is exactly \(1-(1-\alpha/p)^p\).

Proof. Let \(A_j=\{|Z_j|>c_{\alpha,p}\}\) be the rejection event for coordinate \(j\). Under the null, \(Z_j\sim N(0,1)\), so the definition of \(c_{\alpha,p}\) gives \(P(A_j)=2\{1-\Phi(c_{\alpha,p})\}=\alpha/p\). The test rejects on the union of these events. By the union bound,

$$ P_{H_0}(M_p>c_{\alpha,p}) =P\left(\bigcup_{j=1}^p A_j\right) \le \sum_{j=1}^p P(A_j) =p\frac{\alpha}{p} =\alpha. $$

This argument uses only the marginal probabilities, so it remains valid whether the coordinates are independent, positively correlated, or otherwise dependent. If they are independent, the probability of no coordinate rejection is the product \(\prod_{j=1}^p P(A_j^c)=(1-\alpha/p)^p\); taking its complement gives the stated equality. \(\square\)

The bound can be conservative. Under independence, for example, the exact null probability \(1-(1-\alpha/p)^p\) is generally below \(\alpha\). More refined calibration can use information about the joint distribution, but the Bonferroni threshold is a transparent baseline and does not require a dependence model.

Worked Example: Calibrating a Test Across 100 Coordinates

Suppose \(p=100\) and the desired type-I error bound is \(\alpha=0.05\). The two-sided threshold is \(c_{0.05,100}=\Phi^{-1}(1-0.05/200)=\Phi^{-1}(0.99975)\approx3.481\). Thus the test rejects if at least one coordinate satisfies \(|Z_j|>3.481\).

For each coordinate under the null, the two tails beyond this threshold have total probability \(0.05/100=0.0005\). Summing over 100 coordinates gives an upper bound of \(100(0.0005)=0.05\) on the probability of any false rejection.

If the coordinates are also independent, the exact null rejection probability is \(1-(1-0.0005)^{100}=1-(0.9995)^{100}\approx0.0488\). The difference between approximately \(0.0488\) and the upper bound \(0.05\) illustrates the small conservatism of this calibration in this independent example.

Power Against Sparse Mean Shifts

The relevant signal size for coordinate \(j\) is its mean measured in standard errors: \(\delta_j=\sqrt n\,\mu_j/\sigma_j\). Under an alternative, \(Z_j\sim N(\delta_j,1)\), so a signal is easier to detect when its standardized mean is large in absolute value. The cutoff also depends on \(p\): adding coordinates makes the test guard against more opportunities for a null coordinate to exceed the threshold.

Theorem: Under the Gaussian model, the probability that coordinate \(j\) crosses the two-sided threshold is \(q_j=1-\Phi(c_{\alpha,p}-\delta_j)+\Phi(-c_{\alpha,p}-\delta_j)\). The overall rejection probability is at least \(q_j\) for each \(j\). If a set \(S\) of coordinates has mutually independent standardized means, the probability that at least one coordinate in \(S\) crosses the threshold is \(1-\prod_{j\in S}(1-q_j)\); this is also a lower bound on the test's overall power.

Proof. Since \(Z_j\sim N(\delta_j,1)\), the event \(|Z_j|>c_{\alpha,p}\) is the disjoint union of \(Z_j>c_{\alpha,p}\) and \(Z_j<-c_{\alpha,p}\). Standardizing gives

$$ P(|Z_j|>c_{\alpha,p}) =P\{N(0,1)>c_{\alpha,p}-\delta_j\} +P\{N(0,1)<-c_{\alpha,p}-\delta_j\} =1-\Phi(c_{\alpha,p}-\delta_j)+\Phi(-c_{\alpha,p}-\delta_j). $$

A coordinate crossing is one way for the maximum to exceed the cutoff, so the overall rejection event contains each coordinate event and its probability is at least \(q_j\). If the standardized means for coordinates in \(S\) are independent, the probability none of those coordinates crosses is \(\prod_{j\in S}(1-q_j)\). Its complement is the probability at least one crosses. That event is contained in the full rejection event, proving the lower bound. Without the stated independence, the single-coordinate lower bounds still hold, but the product expression need not. \(\square\)

This result makes the sparse-signal advantage precise. A few coordinates with large \(|\delta_j|\) can each have substantial crossing probability, and one such crossing is enough for rejection. The test does not require a large aggregate contribution from many coordinates. Conversely, if all \(|\delta_j|\) remain small relative to the cutoff, the maximum may have limited power even when many coordinates shift. The test's sensitivity is governed directly by the largest standardized shifts, not just by the total size of the mean vector.

Worked Example: Approximate Sample Size for One Signal

Suppose \(p=50\), \(\alpha=0.05\), the marginal standard deviation is known to be \(\sigma=1\), and the alternative has one positive coordinate mean \(\mu=0.2\). The Bonferroni cutoff is \(c_{0.05,50}=\Phi^{-1}(1-0.05/100)=\Phi^{-1}(0.9995)\approx3.2905\).

For that coordinate the noncentrality is \(\delta=\sqrt n(0.2)\). To obtain approximately \(80\%\) marginal crossing probability, the positive-tail contribution should satisfy \(\Phi(\delta-c)\approx0.80\). Since \(\Phi^{-1}(0.80)\approx0.8416\), this requires \(\delta\approx3.2905+0.8416=4.1321\). The other tail, \(\Phi(-c-\delta)\), is negligible at this signal size.

Solving \(\sqrt n(0.2)\ge4.1321\) gives \(n\ge(4.1321/0.2)^2\approx426.9\), so \(n=427\) is the first integer meeting this approximate requirement. At \(n=427\), \(\delta=0.2\sqrt{427}\approx4.1328\), and the marginal power is \(\Phi(4.1328-3.2905)+\Phi(-4.1328-3.2905)\approx\Phi(0.8423)\approx0.800\). The overall test power is at least this marginal power; other coordinates could also cause rejection.

Worked Example: Several Strong Signals

Consider \(p=1000\), \(\alpha=0.05\), and four signal coordinates, each with noncentrality \(\delta_j=4.2\). The cutoff is \(c_{0.05,1000}=\Phi^{-1}(1-0.05/2000)\approx4.0556\). For any one signal coordinate,

$$ q_j =1-\Phi(4.0556-4.2)+\Phi(-4.0556-4.2) \approx\Phi(0.1444) \approx0.5574. $$

Assume the four signal coordinates are independent. The probability that at least one of these four crosses the threshold is \(1-(1-0.5574)^4=1-(0.4426)^4\approx0.9616\), or about \(0.962\). Thus the full test's power is at least \(0.962\); crossings among the other coordinates can only add rejection probability. This calculation uses the unrounded \(q_j\) to the displayed precision and treats the result as a lower bound, not as an exact full-test power.

The example illustrates why the method can work well when only a few coordinates carry pronounced signals: several opportunities for a strong coordinate to exceed the cutoff make rejection likely, even though most coordinates may have zero means.

Interpretation, Assumptions, and a Common Pitfall

The test is most naturally interpreted as a screen for a large coordinate-wise standardized departure. Its choice of scale matters: dividing by \(\sigma_j\) places coordinates with different measurement units or marginal variances on a common scale. The assumption that these standard deviations are known is part of the exact calibration given here. Replacing them with estimates changes the distribution of the statistic and requires a suitable calibration rather than automatically preserving the same cutoff.

A common mistake is to compare each \(|Z_j|\) with the single-coordinate two-sided cutoff \(\Phi^{-1}(1-\alpha/2)\), then claim that the chance of any false rejection is \(\alpha\). That cutoff controls the error probability for one coordinate only. For \(p\) coordinates, the union of the rejection events can have probability greater than \(\alpha\); under independence it is \(1-(1-\alpha)^p\), not \(\alpha\). The correction is to use a multiple-coordinate threshold such as \(c_{\alpha,p}\), for which the union bound proves the desired size control even with dependence.

A second interpretive caution concerns dependence. The Bonferroni size guarantee does not require independent coordinates, but the product power calculation for several signals does. When dependence is unknown, report a valid single-coordinate power lower bound or use a justified joint model; do not multiply marginal non-rejection probabilities as though the coordinates were independent. Likewise, a maximum test is not a universal replacement for other mean tests: it targets unusually large individual standardized shifts, while alternatives spread thinly across many coordinates may call for a different statistic.

Key takeaway: The maximum-coordinate test rejects when at least one standardized sample mean exceeds a multiplicity-adjusted threshold. Bonferroni calibration gives size at most \(\alpha\) under arbitrary coordinate dependence, and power can be high when one or a few standardized mean shifts are sufficiently large.

Check Your Understanding

Use the definitions and results above to answer the following questions.

  1. Why does the Bonferroni size argument remain valid when standardized coordinates are dependent?
  2. For a coordinate with noncentrality \(\delta_j\), write its two-sided threshold-crossing probability and explain what each tail represents.
  3. When can the product formula for the probability of at least one signal-coordinate crossing be used? What can be said without that condition?
  4. How does increasing \(p\) affect the Bonferroni cutoff when \(\alpha\) is fixed, and why?
  5. Explain why using a single-coordinate cutoff independently for all coordinates does not generally control the overall type-I error at \(\alpha\).
Clinical Biostats