University of Cambridge > Talks.cam > Statistics > Posterior concentration for Bayesian regression trees and their ensembles

Posterior concentration for Bayesian regression trees and their ensembles

Add to your list(s) Download to your calendar using vCal

  • UserStephanie van der Pas, University of Leiden
  • ClockFriday 23 November 2018, 16:00-17:00
  • HouseMR12.

If you have a question about this talk, please contact Dr Sergio Bacallado.

Since their inception in the 1980’s, regression trees have been one of the more widely used nonparametric prediction methods. Tree-structured methods yield a histogram reconstruction of the regression surface, where the bins correspond to terminal nodes of recursive partitioning. Trees are powerful, yet susceptible to overfitting. Strategies against overfitting have traditionally relied on pruning greedily grown trees. The Bayesian framework offers an alternative remedy against overfitting through priors. Roughly speaking, a good prior charges smaller trees where overfitting does not occur. In this paper, we take a step towards understanding why/when do Bayesian trees and their ensembles not overfit. We study the speed at which the posterior concentrates around the true smooth regression function. We propose a spike-and-tree variant of the popular Bayesian CART prior and establish new theoretical results showing that regression trees (and their ensembles) a) are capable of recovering smooth regression surfaces, achieving optimal rates up to a log factor, b) can adapt to the unknown level of smoothness and c) can perform effective dimension reduction. These results provide a piece of missing theoretical evidence explaining why Bayesian trees (and additive variants thereof) have worked so well in practice.

This talk is part of the Statistics series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity