Strobl 2008 - Correlated Predictor Selection in Tree Ensembles
Summary
This note covers the first mechanism behind inflated importance for correlated predictors. Tree splits are chosen greedily, one variable at a time and conditional only on the current branch. At the root split each variable is judged only by its marginal association with , so a predictor that is merely correlated with a strong driver looks almost as good as the driver. The paper’s simulation has 12 Gaussian predictors, – block-correlated at 0.9, and coefficients . With
mtry = 1, the correlated and are chosen for first splits as often as the true drivers. Asmtrygrows they are chosen less often than but more often than the equally strong uncorrelated drivers . Over all splits the advantage mostly disappears, but some preference for correlated variables with small or zero coefficients remains (§2.2, Fig. 1).
Overview
Section 2 opens with a short account of ensembles. Bagging fits a tree to each bootstrap sample or subsample and averages their votes. Individual trees are unstable but right on average. Several empirical studies support this view: Breiman’s bagging and arcing papers, Bauer & Kohavi, and Dietterich (refs. [23-26]). In particular, Bühlmann & Yu showed that the gain comes from smoothing hard decision boundaries, which lowers variance. Random forests add diversity by restricting each split to a random subset of mtry candidate variables. That lets variables “that were otherwise outplayed by their competitors” enter the ensemble. Such a variable may not be optimal for the current split, but its selection “may reveal interaction effects with other variables that otherwise would have been missed and thus work towards the global optimality of the ensemble” (§2, para. 2). This is a claim about the ensemble as a whole and is separate from the later point (§2.2, ref. [33]) about global optimality of individual trees.
Main Content
Why greedy splitting prefers correlated predictors (§2, para. 3)
Locally optimal recursive split selection (§2, para. 3)
At each node, CART-style trees pick the next split variable by optimizing a criterion (e.g. Gini gain) within the current node. The node is defined by all previous splits on the same branch. So split selection is
- conditional on variables already used higher up the same branch, and
- unconditional with respect to every other predictor.
The first split depends only on the univariate association between each candidate and . A predictor with little or no association with of its own, but highly correlated with an influential predictor, “may appear equally well suited for splitting as the truly influential predictor variable.”
The authors leave this property alone on purpose. Local search keeps trees computationally feasible, and globally optimal partitions are currently limited to low-dimensional problems (§2.2, final para.).
Simulation design (§2.1, Table 1)
Simulation design, Strobl et al. 2008 §2.1
Data-generating process.
The paper writes the error as and does not say whether 0.5 is the variance or the standard deviation.
Predictors. with unit variances . The first four are block-correlated, for . All other covariances are 0.
Coefficients (Table 1, “Regression coefficients of the data generating process”):
⋯ 5 5 2 0 −5 −5 −2 0 ⋯ 0 Six of the twelve predictors are influential. The design is a matched pair. – and – have the same coefficient pattern (in absolute value), but only – are correlated. Any difference in importance between, say, and is therefore an artefact of correlation. is the key test case: it has a zero coefficient but correlates 0.9 with three non-null predictors. – are independent noise.
Fitting. Forests are grown with
cforestfrom the R packageparty(unbiased conditional-inference trees), using several values ofmtry. The stated reason for varyingmtryis “to be able to investigate the mechanisms responsible for the results of Nicodemus and Shugart”, whose preliminary study found that permutation importance depends strongly onmtry(§2.1, final sentences). All other settings are package defaults.Replications. 500 (stated in §3).
mtrygrid. The text does not list it. The figure panels showmtry∈ {1, 3, 8} in both Fig. 1 and Fig. 3 (Strobl 2008 - Digitized Figure Data for Selection Rates and Importance).Not stated anywhere: the sample size per data set.
The covariance structure follows Archer & Kimes. Their goal was to identify one influential predictor in a correlated set. This paper adds the comparison of correlated with uncorrelated predictors that have the same effect size.
Selection-rate findings (§2.2, Figure 1)
Figure 1 (“Selection rates”): relative selection rates of the twelve variables in the first splits (left panel) and in all splits (right panel) of all trees, for forests with different mtry.
Finding: selection pattern for correlated predictors (§2.2, Fig. 1)
First splits (marginal association only):
mtry = 1(no competition): and are chosen as often as the strong drivers . They act as stand-ins for the influential variables they correlate with. Noise variables – are also chosen almost as often. The authors attribute this to the “lax choice of the stop criterion”, not to signal.- Larger
mtry(strong competitors sometimes available): are chosen less often than but more often than the equally strong uncorrelated .All splits (conditional on the branch): 3. Correlated predictors lose most of their advantage, because lower splits are conditional on variables already used, which may include the true correlated drivers. 4. A preference remains for correlated variables with small or zero coefficients ( over ), with a similar dependence on
mtry. This is because selection is still not conditional on all correlated variables.
Digitized values. Figure 1 is transcribed in ^ex-fig1-first and ^ex-fig1-all. Root-split shares at mtry = 3: ≈ 0.22; ≈ 0.17; () ≈ 0.15; () ≈ 0.08. At mtry = 8: ≈ 0.41, ≈ 0.13, ≈ 0.05, and – ≈ 0. Over all splits at mtry = 8, (≈0.95) slightly exceed (≈0.90), while (0.61) and (0.38) far exceed (0.21) and (0.05).
Why it matters for importance. A variable chosen near the root affects more observations and therefore receives more permutation importance. Early-split preference passes straight into the importance score. This is “part of this artefact”, and the other part is the permutation scheme (Strobl 2008 - Permutation Importance Null Hypotheses).
Examples
Two-variable intuition (illustrative derivation, not in the paper)
Let , with , unit variances. Then . At the root, a single best split on reduces squared error by about times as much as the best split on (exact for a linear projection, approximate for a single cut). When
mtry = 1and only is drawn, a cut on is the best split available at that node. That is why proxies are picked at the root.
Marketing analogue (illustrative)
A forest is fit to per-segment weekly KPI data where display and paid-social spend are flighted together. With a small
mtry, many trees split first on whichever of the two is drawn, so both get high root-split shares even if only one moves the KPI. Selection frequency is not evidence of an effect.
Connections
- Strobl et al 2007 - Bias in RF Variable Importance - Overview covers a separate split-selection bias: variables with more cutpoints win by chance.
cforestremoves that bias, which is why it is used here. The correlation preference shown here survives even with unbiased trees. - The design is a clean example of a matched-contrast simulation. Compare Designing Simulated-Data Experiments and Morris White Crowther 2019 - Simulation Studies (ADEMP) - Overview. The text does not report or Monte Carlo standard errors.
- Randomized split candidates are also used in Honest Trees and Causal Forests.
See Also
- Strobl 2008 - Simulation Results for Conditional Importance: the importance scores for this design.
- Strobl et al 2008 - Conditional Variable Importance - Overview