Piecewise Deterministic Markov Processes for Scalable Monte Carlo on Restricted Domains
arXiv:1701.04244 · doi:10.1016/j.spl.2018.02.021
Abstract
Piecewise Deterministic Monte Carlo algorithms enable simulation from a posterior distribution, whilst only needing to access a sub-sample of data at each iteration. We show how they can be implemented in settings where the parameters live on a restricted domain.
References in corpus (1)
Cited by in corpus (19)
- Non-Reversible Parallel Tempering: a Scalable Highly Parallel MCMC Scheme
- Discontinuous Hamiltonian Monte Carlo for discrete parameters and discontinuous likelihoods
- Event-chain Monte Carlo: foundations, applications, and prospects
- On explicit -convergence rate estimate for piecewise deterministic Markov processes in MCMC algorithms
- JeLLyFysh-Version1.0 -- a Python application for all-atom event-chain Monte Carlo
- Event-chain Monte Carlo with factor fields
- Computing Bayes: From Then 'Til Now'
- Large-scale dynamics of event-chain Monte Carlo
- Zig-zag sampling for discrete structures and non-reversible phylogenetic MCMC
- Large-scale inference of correlation among mixed-type biological traits with phylogenetic multivariate probit models
- Direction-sweep Markov chains
- Binary Bouncy Particle Sampler
- The Coordinate Sampler: A Non-Reversible Gibbs-like MCMC Sampler
- Parallelising MCMC via Random Forests
- Non-reversible, tuning- and rejection-free Markov chain Monte Carlo via iterated random functions
- Reversible and non-reversible Markov Chain Monte Carlo algorithms for reservoir simulation problems
- Piecewise deterministic sampling with splitting schemes
- Accelerating MCMC Algorithms
- The Application of Zig-Zag Sampler in Sequential Markov Chain Monte Carlo