Constraining neural network partial dependence to match domain-knowledge functional forms during training improves predictive accuracy, data efficiency, and explanation faithfulness on regression problems.
Regression-Enhanced Random Forests
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Steering Neural Network Training through Interpretable Constraints Based on Partial Dependence
Constraining neural network partial dependence to match domain-knowledge functional forms during training improves predictive accuracy, data efficiency, and explanation faithfulness on regression problems.