Sure independence screening ranks predictors by marginal association. See what its retention guarantee requires, why interactions can be missed and where screening belongs in validation.
Sure independence screening
Sure independence screening (SIS) is a fast predictor filter that ranks variables by their separate associations with a response, with a guarantee of retaining every active variable under specified model and signal conditions. In a quant forecasting pipeline, it can shorten a large candidate signal list before a more expensive joint fit. “Sure” refers to an asymptotic probability statement, not certainty that a particular shortlist contains every useful predictor.
A shortlist from four scores
For the original linear correlation screener, centre the response and standardise each nonconstant predictor using training data. Ranking absolute sample correlations gives the same ordering as ranking the absolute componentwise regression scores, since the response scale is common to all predictors. Here “independence” means each predictor is scored separately; it does not require the predictors to be mutually independent. This is the construction in Fan and Lv, §2.1.
The formula requires positive sample variances. Keep the d largest values of ∣rj∣, with a declared rule for ties. In a fictional training fold, suppose the absolute scores for features 1–4 are 0.8, 0.7, 0.1 and 0.6. With d=2, the shortlist is features 1 and 2. Feature 4 ranks third despite its sizeable marginal association.
Illustrative absolute marginal correlations: feature 1 scores 0.8, feature 2 scores 0.7, feature 3 scores 0.1 and feature 4 scores 0.6. Keeping the largest two retains features 1 and 2; the ranking does not establish their joint coefficients.
Original stipulated screening example. Blue bars and explicit labels identify the retained features; the scores are not fitted market evidence.
These four numbers cannot reveal the best two-variable model. Correlated proxies can take several places in the shortlist, while a variable that helps conditionally can score poorly alone. SIS is a filter within feature selection; a subsequent Lasso regression, for example, fits the survivors jointly.
What survives, and under which model?
For a specified sparse linear data-generating model,
Y=X⊤β+ε,E[ε∣X]=0,M∗={j:βj=0},
the sure-screening property is
P(M∗⊆Mdn)⟶1as n⟶∞.
Here p=pn, the support and the retained size may change with sample size. The probability is over training samples from that model. Inclusion permits extra variables: it is weaker than exact support recovery, Mdn=M∗. It supplies no causal identification.
A simple threshold argument exposes the essential marginal-signal requirement. Let rj=Corr(Xj,Y), let qn=minj∈M∗∣rj∣>0, and suppose, with probability tending to one,
1≤j≤pnmax∣rj−rj∣<qn/2.
Then every active feature has ∣rj∣>qn/2. A threshold screen at qn/2 retains them all. This is an explanatory sufficient condition, not a prescription using known qn: the minimum population signal is usually unknown. Nor does it bound the shortlist size. For a top-dn screen, dn must also accommodate all active variables and any competing large scores. Even dn≥∣M∗∣ alone is insufficient.
Obtaining the uniform error bound requires assumptions about sampling, tails and design as dimension grows. Nonzero joint coefficients alone do not suffice: with predictor covariance Σ, the marginal covariance vector is Σβ, whose entries can cancel.
One sufficient regime in Fan and Lv, conditions 1–4 and Theorem 1 takes pn>n, uses population-standardised predictors and assumes IID linear-model observations, independent Gaussian errors, whitened-design spherical symmetry and concentration, and Var(Y)=O(1). It requires
with positive constants, κ,τ≥0, 0<ξ<1−2κ and 2κ+τ<1. Under these sufficient conditions, an appropriately chosen dn<n gives the inclusion property. They are not claimed to be the weakest possible assumptions. Merely having p>n establishes none of them. Dependent financial observations require a justification suited to that dependence.
A joint signal invisible to correlation
Consider an original population example with independent X1,X2∼N(0,1) and
Yet observing both inputs determines Y exactly. Their product has variance 1; a predictor given the product makes zero squared prediction error. Screening only the two raw columns by linear correlation provides no population signal to rank. Finite-sample scores need not equal zero, but that random variation is no reliable rescue.
This nonlinear interaction lies outside the original linear SIS guarantee. It does not refute that theorem. Adding the product as a candidate changes the feature universe: its correlation with Y is 1. Interaction construction itself must be justified and assessed within training data. Also, zero correlation does not establish independence: here the conditional variance of Y given X1 is X12.
Fit the filter inside the training window
Compute scaling, marginal scores and the retained mask separately inside every training fold. Apply that fitted mask to its later validation block. If choosing d or comparing screening variants, repeat the whole fitting process inside inner training splits; keep the final test outside those decisions. Selecting once on all targets leaks held-out outcomes even if the eventual regression is refitted. The official leakage example demonstrates this problem with feature selection.
For return labels, only use outcomes completed and available at the fit cutoff. Time-Ordered Train, Validation and Test Design develops these eligibility and nested-fitting rules; its preview is public and the full lesson requires membership. A retained signal still needs evaluation for predictive usefulness, costs and stability.
Sources
Fan, J. and Lv, J. (2008), Sure independence screening for ultrahigh dimensional feature space, JRSS B 70(5), 849–911. §2.1 defines the correlation screener and inclusion property; §§5.1–5.2 state the sufficient conditions and theorem. The threshold implication, four-score example and interaction calculation above are original explanations.