Interpretable Machines: Constructing Valid Prediction Intervals with Random Forests
Burim Ramosaj

TL;DR
This paper introduces methods for constructing valid, interpretable prediction intervals for Random Forest regression using Out-of-Bag data, with theoretical guarantees and thorough simulation evaluation.
Contribution
It provides the first theoretical and empirical framework for prediction intervals in Random Forests, ensuring correct coverage and robustness.
Findings
Prediction intervals achieve correct coverage rates
Intervals are robust to non-normal residuals
Proposed methods are competitive with existing approaches
Abstract
An important issue when using Machine Learning algorithms in recent research is the lack of interpretability. Although these algorithms provide accurate point predictions for various learning problems, uncertainty estimates connected with point predictions are rather sparse. A contribution to this gap for the Random Forest Regression Learner is presented here. Based on its Out-of-Bag procedure, several parametric and non-parametric prediction intervals are provided for Random Forest point predictions and theoretical guarantees for its correct coverage probability is delivered. In a second part, a thorough investigation through Monte-Carlo simulation is conducted evaluating the performance of the proposed methods from three aspects: (i) Analyzing the correct coverage rate of the proposed prediction intervals, (ii) Inspecting interval width and (iii) Verifying the competitiveness of the…
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
TopicsStatistical Methods and Inference · Machine Learning and Data Classification · Explainable Artificial Intelligence (XAI)
