Continuous-Time Birth-Death MCMC for Bayesian Regression Tree Models

TL;DR

This paper introduces a continuous-time birth-death MCMC algorithm for Bayesian regression trees, improving convergence and mixing over traditional discrete-time methods by always accepting model moves.

Contribution

The paper develops a novel continuous-time birth-death MCMC algorithm for Bayesian regression trees, enhancing sampling efficiency and convergence.

Findings

Algorithm always accepts model moves, improving mixing.

Theoretical support provided for the new method.

Demonstrated superior performance over traditional methods.

Abstract

Decision trees are flexible models that are well suited for many statistical regression problems. In a Bayesian framework for regression trees, Markov Chain Monte Carlo (MCMC) search algorithms are required to generate samples of tree models according to their posterior probabilities. The critical component of such an MCMC algorithm is to construct good Metropolis-Hastings steps for updating the tree topology. However, such algorithms frequently suffering from local mode stickiness and poor mixing. As a result, the algorithms are slow to converge. Hitherto, authors have primarily used discrete-time birth/death mechanisms for Bayesian (sums of) regression tree models to explore the model space. These algorithms are efficient only if the acceptance rate is high which is not always the case. Here we overcome this issue by developing a new search algorithm which is based on a continuous-time birth-death Markov process. This search algorithm explores the model space by jumping between parameter spaces corresponding to different tree structures. In the proposed algorithm, the moves between models are always accepted which can dramatically improve the convergence and mixing properties of the MCMC algorithm. We provide theoretical support of the algorithm for Bayesian regression tree models and demonstrate its performance.