Minimax optimal rates for Mondrian trees and forests
Jaouad Mourtada, St\'ephane Ga\"iffas, Erwan Scornet

TL;DR
This paper provides a theoretical analysis of Mondrian Forests, demonstrating they achieve minimax optimal rates for certain function classes, and introduces an adaptive procedure for unknown smoothness levels.
Contribution
It establishes the first minimax optimal convergence rates for Mondrian Trees and Forests in arbitrary dimensions, including an adaptive method for unknown smoothness.
Findings
Mondrian Forests achieve minimax optimal rates for s-Hölder functions.
An adaptive procedure combining Mondrian Forests with model aggregation is proposed.
Results demonstrate the theoretical soundness of Mondrian Forests in a batch setting.
Abstract
Introduced by Breiman, Random Forests are widely used classification and regression algorithms. While being initially designed as batch algorithms, several variants have been proposed to handle online learning. One particular instance of such forests is the \emph{Mondrian Forest}, whose trees are built using the so-called Mondrian process, therefore allowing to easily update their construction in a streaming fashion. In this paper, we provide a thorough theoretical study of Mondrian Forests in a batch learning setting, based on new results about Mondrian partitions. Our results include consistency and convergence rates for Mondrian Trees and Forests, that turn out to be minimax optimal on the set of -H\"older function with (for trees and forests) and (for forests only), assuming a proper tuning of their complexity parameter in both cases. Furthermore, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
