Journal
ANNALS OF STATISTICS
Volume 43, Issue 4, Pages 1716-1741Publisher
INST MATHEMATICAL STATISTICS-IMS
DOI: 10.1214/15-AOS1321
Keywords
Random forests; randomization; consistency; additive model; sparsity; dimension reduction
Categories
Funding
- European Research Council [SMAC-ERC-280032]
Ask authors/readers for more resources
Random forests are a learning algorithm proposed by Breiman [Mach. Leant. 45 (2001) 5-32] that combines several randomized decision trees and aggregates their predictions by averaging. Despite its wide usage and outstanding practical performance, little is known about the mathematical properties of the procedure. This disparity between theory and practice originates in the difficulty to simultaneously analyze both the randomization process and the highly data-dependent tree structure. In the present paper, we take a step forward in forest exploration by proving a consistency result for Breiman's [Mach. Learn. 45 (2001) 5-32] original algorithm in the context of additive regression models. Our analysis also sheds an interesting light on how random forests can nicely adapt to sparsity.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available