Answers are grounded in this paper and cite their sources.
Tree ensembles are looked at in distribution space, that is, the limit case of "infinite" sample size. It is shown that the simplest kind of trees is complete in D-dimensional L₂(P) space if the number of terminal nodes T is greater than D. For such trees we show that the AdaBoost algorithm gives an ensemble converging to the Bayes risk.
No takes yet. Share an insight, caveat, or question.
Leo Breiman (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: