高维树与森林的估计与推断
Estimation and Inference with Trees and Forests in High Dimensions
摘要:
我们分析了有限的样本均值平方误差(MSE)性能的回归树和森林在高维政权的二进制功能,稀疏约束下。我们证明,如果只有$r$的$d$功能是相关的平均结果函数,然后浅树建立greenly通过CART经验MSE标准实现MSE率,仅依赖于周围的尺寸$d$的数学。我们证明了上界,其确切的依赖于相关变量$r$的数量取决于功能之间的相关性和相关程度。对于强相关的功能,我们还表明,完全成熟的诚实森林实现快速MSE率和他们的预测也是渐近正常的,使渐近有效的推理,适应稀疏的回归函数。
英文摘要:
We analyze the finite sample mean squared error (MSE) performance of regression trees and forests in the high dimensional regime with binary features, under a sparsity constraint. We prove that if only $r$ of the $d$ features are relevant for the mean outcome function, then shallow trees built greedily via the CART empirical MSE criterion achieve MSE rates that depend only logarithmically on the ambient dimension $d$. We prove upper bounds, whose exact dependence on the number relevant variables $r$ depends on the correlation among the features and on the degree of relevance. For strongly relevant features, we also show that fully grown honest forests achieve fast MSE rates and their predictions are also asymptotically normal, enabling asymptotically valid inference that adapts to the sparsity of the regression function.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。