Quantifying Uncertainty in Random Forests via Confidence Intervals and Hypothesis Tests
Lucas Mentch, Giles Hooker

TL;DR
This paper introduces a statistical inference framework for random forests, enabling confidence intervals and hypothesis testing by modeling predictions as U-statistics, with practical estimators and variance estimation methods.
Contribution
It develops a novel inference framework for random forests using U-statistics, allowing confidence intervals and significance tests without extra computational cost.
Findings
Predictions are asymptotically normal, enabling confidence intervals.
The method provides significance testing for features.
Estimators work efficiently with incomplete U-statistics.
Abstract
This work develops formal statistical inference procedures for machine learning ensemble methods. Ensemble methods based on bootstrapping, such as bagging and random forests, have improved the predictive accuracy of individual trees, but fail to provide a framework in which distributional results can be easily determined. Instead of aggregating full bootstrap samples, we consider predicting by averaging over trees built on subsamples of the training set and demonstrate that the resulting estimator takes the form of a U-statistic. As such, predictions for individual feature vectors are asymptotically normal, allowing for confidence intervals to accompany predictions. In practice, a subset of subsamples is used for computational speed; here our estimators take the form of incomplete U-statistics and equivalent results are derived. We further demonstrate that this setup provides a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Data Classification · Machine Learning and Algorithms · Neural Networks and Applications
