Improved Regression Tree Models Using Generalization Error‐Based Splitting Criteria
针对回归树模型在小样本下因仅用训练误差导致过拟合的问题，提出了两种基于泛化误差的新分裂准则，实验表明留一交叉验证准则显著提升了预测精度和鲁棒性。
ABSTRACT Despite the widespread application of machine learning (ML) approaches such as the regression tree (RT) in the field of data‐driven optimization, overfitting may impair the effectiveness of ML models and thus hinder the deployment of ML for decision‐making. In particular, we address the overfitting issue of the traditional RT splitting criterion with a limited sample size, which considers only the training mean squared error, and we accurately specify the mathematical formula for the generalization error. We introduce two novel splitting criteria based on generalization error, which offer higher‐quality approximations of the generalization error than the traditional training error does. One criterion is formulated through a mathematical derivation based on the RT model, and the second is established through leave‐one‐out cross‐validation (LOOCV). We construct RT models using our proposed generalization error‐based splitting criteria from extensive ML benchmark instances and report the experimental results, including the models' computational efficiency, prediction accuracy, and robustness. Our findings endorse the superior efficacy and robustness of the RT model based on the refined LOOCV‐informed splitting criterion, marking substantial improvements over those of the traditional RT model. Additionally, our tree structure analysis provides insights into how our proposed LOOCV‐informed splitting criterion guides the model in striking a balance between a complex tree structure and accurate predictions.