Extended stochastic gradient Markov chain Monte Carlo for large-scale Bayesian variable selection
From MaRDI portal
Abstract: Stochastic gradient Markov chain Monte Carlo (MCMC) algorithms have received much attention in Bayesian computing for big data problems, but they are only applicable to a small class of problems for which the parameter space has a fixed dimension and the log-posterior density is differentiable with respect to the parameters. This paper proposes an extended stochastic gradient MCMC lgoriathm which, by introducing appropriate latent variables, can be applied to more general large-scale Bayesian computing problems, such as those involving dimension jumping and missing data. Numerical studies show that the proposed algorithm is highly scalable and much more efficient than traditional MCMC algorithms. The proposed algorithms have much alleviated the pain of Bayesian methods in big data computing.
Recommendations
- In search of lost mixing time: adaptive Markov chain Monte Carlo schemes for Bayesian variable selection with very large p
- Stochastic gradient Markov chain Monte Carlo
- Scalable Importance Tempering and Bayesian Variable Selection
- Adaptive random neighbourhood informed Markov chain Monte Carlo for high-dimensional Bayesian variable selection
- Hamiltonian Monte Carlo acceleration using surrogate functions with random bases
Cited in
(18)- Hamiltonian Monte Carlo acceleration using surrogate functions with random bases
- Learning sparse deep neural networks with a spike-and-slab prior
- Stochastic variational inference for large-scale discrete choice models using adaptive batch sizes
- Stochastic gradient Markov chain Monte Carlo
- In search of lost mixing time: adaptive Markov chain Monte Carlo schemes for Bayesian variable selection with very large p
- A Stochastic Approximation-Langevinized Ensemble Kalman Filter Algorithm for State Space Models with Unknown Parameters
- Efficient and generalizable tuning strategies for stochastic gradient MCMC
- Reversible Jump PDMP Samplers for Variable Selection
- A langevinized ensemble Kalman filter for large-scale dynamic learning
- Bayesian Robustness: A Nonasymptotic Viewpoint
- A sparse factor model for clustering high-dimensional longitudinal data
- An extended Langevinized ensemble Kalman filter for non-Gaussian dynamic systems
- Extended fiducial inference: toward an automated process of statistical inference
- Extended fiducial inference for individual treatment effects via deep neural networks
- Choosing the number of factors in factor analysis with incomplete data via a novel hierarchical Bayesian information criterion
- A new paradigm for generative adversarial networks based on randomized decision rules
- Bayesian analysis of exponential random graph models using stochastic gradient Markov chain Monte Carlo
- Two-stage Metropolis-Hastings for tall data
This page was built for publication: Extended stochastic gradient Markov chain Monte Carlo for large-scale Bayesian variable selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145711)
