Smoothing and adaptation of shifted P\'olya Tree ensembles

Abstract

Recently, S. Arlot and R. Genuer have shown that a model of random forests outperforms its single-tree counterpart in the estimation of α-H\"older functions, α≤2. This backs up the idea that ensembles of tree estimators are smoother estimators than single trees. On the other hand, most positive optimality results on Bayesian tree-based methods assume that α≤1. Naturally, one wonders whether Bayesian counterparts of forest estimators are optimal on smoother classes, just like it has been observed for frequentist estimators for α≤ 2. We dwell on the problem of density estimation and introduce an ensemble estimator from the classical (truncated) P\'olya tree construction in Bayesian nonparametrics. The resulting Bayesian forest estimator is shown to lead to optimal posterior contraction rates, up to logarithmic terms, for the Hellinger and L1 distances on probability density functions on [0;1) for arbitrary H\"older regularity α>0. This improves upon previous results for constructions related to the P\'olya tree prior whose optimality was only proven in the case α≤ 1. Also, we introduce an adaptive version of this new prior in the sense that it does not require the knowledge of α to be defined and attain optimality.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…