Pith. sign in

REVIEW 1 cited by

Regression-Enhanced Random Forests

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1904.10416 v1 pith:ORXK4APF submitted 2019-04-23 stat.ML cs.LGstat.ME

classification stat.MLcs.LGstat.ME
keywords randomrerfsforestsdescribedimprovelearningmachineparametric
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Steering Neural Network Training through Interpretable Constraints Based on Partial Dependence

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Constraining neural network partial dependence to match domain-knowledge functional forms during training improves predictive accuracy, data efficiency, and explanation faithfulness on regression problems.

Pith tools