.png){kind=icon}
Return
Simplifying Random Forests' Probabilistic Forecasts
.png){kind=icon}
OA
AI
DOI：10.1080/00031305.2025.2552284.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Since their introduction by Breiman, Random Forests (RFs) have proven to be useful for both classification and regression tasks. The RF prediction of a previously unseen observation can be represented as a weighted sum of all training sample observations. This nearest-neighbor-type representation is useful, among other things, for constructing forecast distributions (as in Meinshausen's Quantile Regression Forests). In this article, we consider simplifying RF-based forecast distributions by sparsifying them. That is, we focus on a small subset of k nearest neighbors while setting the remaining weights to zero. This simplification, which we refer to as Topk, greatly improves the interpretability of RF predictions. It can be applied to any forecasting task without re-training existing RF models. In empirical experiments, we document that the simplified predictions can be similar to or exceed the original ones in terms of forecasting performance. We explore the statistical sources of this finding via a stylized analytical model of RFs. The model suggests that simplification is particularly promising if the unknown true forecast distribution contains many small weights that are estimated imprecisely.
Keywords:
Forecast distribution
Random forests
Simplicity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
A
IF:
2.1
Papers:
61
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more