Tuning parameters in random forests

Abstract

Breiman's (2001) random forests are a very popular class of learning algorithms often able to produce good predictions even in high-dimensional frameworks, with no need to accurately tune its inner parameters. Unfortunately, there are no theoretical findings to support the default values used for these parameters in Breiman's algorithm. The aim of this paper is therefore to present recent theoretical results providing some insights on the role and the tuning of these parameters.