Estimating a sharp convergence bound for randomized ensembles
Abstract
When randomized ensembles such as bagging or random forests are used for binary classification, the prediction error of the ensemble tends to decrease and stabilize as the number of classifiers increases. However, the precise relationship between prediction error and ensemble size is unknown in practice. In the standard case when classifiers are aggregated by majority vote, the present work offers a way to quantify this convergence in terms of "algorithmic variance," i.e. the variance of prediction error due only to the randomized training algorithm. Specifically, we study a theoretical upper bound on this variance, and show that it is sharp --- in the sense that it is attained by a specific family of randomized classifiers. Next, we address the problem of estimating the unknown value of the bound, which leads to a unique twist on the classical problem of non-parametric density estimation. In particular, we develop an estimator for the bound and show that its MSE matches optimal non-parametric rates under certain conditions. (Concurrent with this work, some closely related results have also been considered in Cannings and Samworth (2017) and Lopes (2019).)
Cite
@article{arxiv.1303.0727,
title = {Estimating a sharp convergence bound for randomized ensembles},
author = {Miles E. Lopes},
journal= {arXiv preprint arXiv:1303.0727},
year = {2019}
}
Comments
This paper extends the earlier work, "The Convergence Rate of Majority Vote under Exchangeability" from 2013, as well as "A Sharp Bound on the Computation-Accuracy Tradeoff for Majority Voting Ensembles" from 2016