Rates of convergence for random forests via generalized U-statistics

From MaRDI portal
Publication:2136608

DOI10.1214/21-EJS1958zbMATH Open1493.62071arXiv1905.10651OpenAlexW4206811903MaRDI QIDQ2136608FDOQ2136608


Authors: Wei Peng, Tim Coleman, Lucas Mentch Edit this on Wikidata


Publication date: 11 May 2022

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Abstract: Random forests remain among the most popular off-the-shelf supervised learning algorithms. Despite their well-documented empirical success, however, until recently, few theoretical results were available to describe their performance and behavior. In this work we push beyond recent work on consistency and asymptotic normality by establishing rates of convergence for random forests and other supervised learning ensembles. We develop the notion of generalized U-statistics and show that within this framework, random forest predictions can potentially remain asymptotically normal for larger subsample sizes than previously established. We also provide Berry-Esseen bounds in order to quantify the rate at which this convergence occurs, making explicit the roles of the subsample size and the number of trees in determining the distribution of random forest predictions.


Full work available at URL: https://arxiv.org/abs/1905.10651




Recommendations




Cites Work


Cited In (10)





This page was built for publication: Rates of convergence for random forests via generalized U-statistics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136608)