mlsanityData to 7 Oct 2026

Understanding overfitting in random forest for probability estimation: a visualization and simulation study

arXiv 2402.18612 ↗First posted 28 Feb 2024stat.ME cs.CY cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Random forests have become popular for clinical risk prediction modelling. In a case study on predicting ovarian malignancy, we observed training c-statistics close to 1. Although this suggests overfitting, performance was competitive on test data. We aimed to understand the behaviour of random forests by (1) visualizing data space in three real world case studies and (2) a simulation study. For the case studies, risk estimates were visualised using heatmaps in a 2-dimensional subspace. The simulation study included 48 logistic data generating mechanisms (DGM), varying the predictor distribution, the number of predictors, the correlation between predictors, the true c-statistic and the strength of true predictors. For each DGM, 1000 training datasets of size 200 or 4000 were simulated and RF models trained with minimum node size 2 or 20 using ranger package, resulting in 192 scenarios in total. The visualizations suggested that the model learned spikes of probability around events in the training set. A cluster of events created a bigger peak, isolated events local peaks. In the simulation study, median training c-statistics were between 0.97 and 1 unless there were 4 or 16 binary predictors with minimum node size 20. Median test c-statistics were higher with higher events per variable, higher minimum node size, and binary predictors. Median training slopes were always above 1, and were not correlated with median test slopes across scenarios (correlation -0.11). Median test slopes were higher with higher true c-statistic, higher minimum node size, and higher sample size. Random forests learn local probability peaks that often yield near perfect training c-statistics without strongly affecting c-statistics on test data. When the aim is probability estimation, the simulation results go against the common recommendation to use fully grown trees in random forest models.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 48 references that are in the map. First posted on arXiv 28 Feb 2024.

Builds on

10 of 48 references.

References · 10

  1. 2015ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and Rcited by 171
  2. 2015A Random Forest Guided Tourcited by 168
  3. 2021Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationcited by 130
  4. 2018Hyperparameters and Tuning Strategies for Random Forestcited by 83
  5. 2017Using simulation studies to evaluate statistical methodscited by 47
  6. 2015Explaining the Success of AdaBoost and Random Forests as Interpolating Classifierscited by 45
  7. 2017To tune or not to tune the number of trees in random forest?cited by 33
  8. 2019Randomization as Regularization: A Degrees of Freedom Explanation for Random Forest Successcited by 30
  9. 2022Stability of clinical prediction models developed using statistical or machine learning methodscited by 12
  10. 2021There is no Double-Descent in Random Forestscited by 4

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.