Popular decision tree algorithms are provably noise tolerant. (arXiv:2206.08899v1 [cs.LG])

Web: http://arxiv.org/abs/2206.08899

Using the framework of boosting, we prove that all impurity-based decision
tree learning algorithms, including the classic ID3, C4.5, and CART, are highly
noise tolerant. Our guarantees hold under the strongest noise model of nasty
noise, and we provide near-matching upper and lower bounds on the allowable
noise rate. We further show that these algorithms, which are simple and have
long been central to everyday machine learning, enjoy provable guarantees in
the noisy setting that are unmatched by existing algorithms …

algorithms arxiv decision lg noise popular tree