Regression-Enhanced Random Forests
This incremental improvement addresses prediction problems in machine learning, particularly for extrapolation and incorporating known relationships.
The authors tackled cases where random forests may underperform by proposing regression-enhanced random forests (RERFs), which combine random forests with penalized parametric regression, resulting in better predictive performance in simulations and real data examples.
Random forest (RF) methodology is one of the most popular machine learning techniques for prediction problems. In this article, we discuss some cases where random forests may suffer and propose a novel generalized RF method, namely regression-enhanced random forests (RERFs), that can improve on RFs by borrowing the strength of penalized parametric regression. The algorithm for constructing RERFs and selecting its tuning parameters is described. Both simulation study and real data examples show that RERFs have better predictive performance than RFs in important situations often encountered in practice. Moreover, RERFs may incorporate known relationships between the response and the predictors, and may give reliable predictions in extrapolation problems where predictions are required at points out of the domain of the training dataset. Strategies analogous to those described here can be used to improve other machine learning methods via combination with penalized parametric regression techniques.