The taxicab sampler: MCMC for discrete spaces with application to tree models
From MaRDI portal
Publication:6074155
Abstract: Motivated by the problem of exploring discrete but very complex state spaces in Bayesian models, we propose a novel Markov Chain Monte Carlo search algorithm: the taxicab sampler. We describe the construction of this sampler and discuss how its interpretation and usage differs from that of standard Metropolis-Hastings as well as the related Hamming ball sampler. The proposed sampling algorithm is then shown to demonstrate substantial improvement in computation time without any loss of efficiency relative to a na"ive Metropolis-Hastings search in a motivating Bayesian regression tree count model, in which we leverage the discrete state space assumption to construct a novel likelihood function that allows for flexibly describing different mean-variance relationships while preserving parameter interpretability compared to existing likelihood functions for count data.
Recommendations
- Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models
- Efficient MCMC estimation of discrete distributions
- Random sparse sampling in a Gibbs weighted tree and phase transitions
- Miscellanea. Peskun's theorem and a modified discrete-state Gibbs sampler
- Approximating discrete probability distributions with dependence trees
- scientific article; zbMATH DE number 1932866
- Advanced MCMC methods for sampling on diffusion pathspace
- An Invitation to Sequential Monte Carlo Samplers
Cites work
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 7306891 (Why is no real title available?)
- A Bayesian CART algorithm
- A flexible regression model for count data
- BART: Bayesian additive regression trees
- Bayesian Analysis of Binary and Polychotomous Response Data
- Bayesian analysis of zero-inflated regression models
- Bayesian zero-inflated negative binomial regression based on Pólya-gamma mixtures
- Double Exponential Families and Their Use in Generalized Linear Regression
- Efficient Metropolis-Hastings proposal mechanisms for Bayesian regression tree models
- Handbook of Markov Chain Monte Carlo
- Informed proposals for local MCMC in discrete spaces
- Log-linear Bayesian additive regression trees for multinomial logistic and count regression models
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
This page was built for publication: The taxicab sampler: MCMC for discrete spaces with application to tree models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074155)