Skip to content

Storey q-value

Storey q-values adapt a multiple-testing shortlist by estimating the true-null fraction. A fixed-lambda example shows six selections versus four for ordinary BH.

A Storey q-value measures the smallest positive false discovery rate associated with a nested rejection region that includes a given test result. Its practical estimate turns a family of p-values into a ranked discovery shortlist while estimating the fraction of true null hypotheses. For a quant screening many prespecified candidate signals, that adaptation can select more candidates than ordinary Benjamini–Hochberg, with additional estimation assumptions to justify. The population quantity and its estimate should be distinguished.

Which false discovery rate?

Let VV be the number of false rejections and RR the total number of rejections. The false discovery rate is FDR⁡=E[V/max⁡(R,1)]\operatorname{FDR}=\mathbb E[V/\max(R,1)]. The positive false discovery rate conditions on making at least one discovery:
pFDR⁡=E ⁣[VR | R>0].\operatorname{pFDR}=\mathbb E\!\left[\frac{V}{R}\,\middle|\,R>0\right].

For p-value threshold regions, Storey's population definition is

q(p)=inf⁡t≥ppFDR⁡(t),q(p)=\inf_{t\ge p}\operatorname{pFDR}(t),
where the infimum is over thresholds in [p,1][p,1] for which the conditional expectation is defined. Every such region includes the observed result. This is a property of rejection regions under a probability model, not an observed count of mistakes. Storey (2003), Definition 2, gives the nested-region definition.

Estimate the null fraction, then work backwards

Write π0=m0/m\pi_0=m_0/m for the unknown proportion of true nulls among mm tests. Under a continuous uniform null-p-value model, a true null lands above a fixed tuning threshold λ\lambda with probability 1−λ1-\lambda. Counting that upper tail therefore gives a way to estimate π0\pi_0. Alternative hypotheses can also produce large p-values: tail membership does not identify which hypotheses are null. A high λ\lambda leaves fewer observations and can make the estimate unstable. The official qvalue documentation discusses the null-p-value assumption and estimation choices.
For the hand calculation below, use this fixed-λ\lambda, finite-sample plus-one convention:
π^0+(λ)=min⁡ ⁣(1,1+#{i:pi>λ}m(1−λ)).\widehat\pi_0^{+}(\lambda) =\min\!\left(1,\frac{1+\#\{i:p_i>\lambda\}}{m(1-\lambda)}\right).

The added one and the cap at one are explicit choices. Sort the p-values in increasing order, retaining their hypothesis identifiers, and calculate the practical estimates

aj=π^0+mp(j)j,q^(i)=min⁡ ⁣(1,min⁡j≥iaj).a_j=\widehat\pi_0^{+}\frac{mp_{(j)}}{j}, \qquad \widehat q_{(i)}=\min\!\left(1,\min_{j\ge i}a_j\right).
Start at the largest rank and take a running minimum backwards. This makes the estimated q-values nondecreasing with the sorted p-values; a more significant test cannot receive a larger value than a less significant one. Setting the multiplier π^0\widehat\pi_0 to one gives the usual BH adjusted p-values. The authors' qvalue source implements the backward cumulative-minimum principle.

Ten hypothetical signal tests

Suppose the ten p-values below come from a prespecified family of correctly calibrated tests. They are stipulated numbers, with no known truth labels. Fix λ=0.5\lambda=0.5 before inspecting them. Only 0.60.6 and 0.80.8 exceed λ\lambda, so

π^0+=min⁡ ⁣(1,1+210(1−0.5))=0.6.\widehat\pi_0^{+}=\min\!\left(1,\frac{1+2}{10(1-0.5)}\right)=0.6.
Sorted rankObserved p-valueEstimated q-valueBH adjusted p-value
10.0010.0060.010
20.0050.0150.025
30.0100.0200.033333
40.0200.0300.050
50.0300.0360.060
60.0400.0400.066667
70.0800.0685710.114286
80.2000.1500.250
90.6000.4000.666667
100.8000.4800.800
Values are rounded for display; decisions use unrounded values. In this example the raw aja_j are already increasing, so the backward minimum leaves them unchanged.
At a selection level of 0.050.05, the rule q^≤0.05\widehat q\le0.05 selects the first six tests. The sixth has q^=0.6×10×0.04/6=0.04\widehat q=0.6\times10\times0.04/6=0.04; the seventh has q^=12/175≈0.068571\widehat q=12/175\approx0.068571. Ordinary BH at 0.050.05 selects four, including the boundary adjusted value 0.050.05. The adaptive shortlist ends at p-value 0.040.04, below the fixed λ\lambda.
Ten hypothetical tests with a fixed lambda of 0.5. Two p-values exceed lambda, giving the plus-one null-fraction estimate 0.6. Estimated q-values select six tests at 0.05; ordinary BH selects four. Both plotted quantities are dimensionless, with a logarithmic vertical axis.
Ten hypothetical tests with a fixed lambda of 0.5. Two p-values exceed lambda, giving the plus-one null-fraction estimate 0.6. Estimated q-values select six tests at 0.05; ordinary BH selects four. Both plotted quantities are dimensionless, with a logarithmic vertical axis.
Original fixed-lambda arithmetic illustration. Solid circles show estimated q-values and dashed squares show BH adjusted p-values. The two additional selections have unknown truth labels.

What the shortlist does not certify

An estimated q-value of 0.040.04 does not assign that individual hypothesis a 4% posterior probability of being null. Local FDR estimates address the null probability conditional on a particular result under a fitted mixture model; q-values concern nested rejection regions. Storey's Bayesian interpretation likewise conditions on membership in a region, which is a different event. The qvalue vignette, §§5.3.4–5.3.5, separates q-values from local FDR.

Nor does selecting at 0.050.05 cap the realised false-discovery proportion at 5%. FDR control, when its assumptions hold, concerns an expectation across repeated studies. The arithmetic above establishes the selections, not their truth or an FDR theorem for this plug-in rule at every level.

This small example is not a reproduction of a default software run. The package uses smoothing by default to estimate π0\pi_0, offers a bootstrap method and an optional pFDR adjustment, and its single-λ\lambda estimator does not use the plus-one numerator shown here. Record the estimator, tuning choices and software options when reporting results.
Adaptive FDR guarantees require the conditions of the particular procedure. Arbitrary plug-in estimates, data-driven tuning and arbitrary dependence are not automatically covered. Shared market histories can create dependence between tests; invalid individual p-values or an undisclosed strategy search are separate problems. For an arbitrary-dependence FDR procedure with valid null p-values, see Benjamini–Yekutieli.
For the outcome table, FDR definition and ordinary BH baseline, use Multiple Testing and the False Discovery Rate (public preview; full lesson requires membership).

Practice: why take a running minimum?

Four hypothetical sorted p-values are 0.01,0.04,0.045,0.80.01,0.04,0.045,0.8. Fix λ=0.5\lambda=0.5 and use the same plus-one convention. A colleague computes raw values 0.04,0.08,0.06,0.80.04,0.08,0.06,0.8 and drops the second test at selection level 0.070.07. Is that the q-value rule?

Answer. No. One p-value exceeds 0.50.5, so π^0+=min⁡(1,2/(4×0.5))=1\widehat\pi_0^{+}=\min(1,2/(4\times0.5))=1. Taking the backwards running minimum gives 0.04,0.06,0.06,0.80.04,0.06,0.06,0.8. All first three tests are selected at 0.070.07. The third-rank region includes the second test too, so assigning the second a larger q-value would ignore that qualifying region.

Sources

Last updated
  • multiple testing
  • q values
  • false discovery rate
  • null fraction estimation
← Back to the glossaryBack to top ↑