Estimation and Inference with Trees and Forests in High Dimensions
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
On Efficient Estimation of Distributional Treatment Effects under Covariate-Adaptive Randomization
DrSR: LLM based Scientific Equation Discovery with Dual Reasoning from Data and Experience
Active Learning for Manifold Gaussian Process Regression
The kernel of graph indices for vector search
Model-Based Real-Time Pose and Sag Estimation of Overhead Power Lines Using LiDAR for Drone Inspection
Vector Contrastive Learning For Pixel-Wise Pretraining In Medical Vision
토론
이 논문과 연결된 포럼 글이 아직 없습니다.