Efficient MCMC sampling with dimension-free convergence rate using ADMM-type splitting
Performing exact Bayesian inference for complex models is computationally intractable. Markov chain Monte Carlo (MCMC) algorithms can provide reliable approximations of the posterior distribution but are expensive for large data sets and high-dimensional models. A standard approach to mitigate this...
Main Authors: | Vono, M, Paulin, D, Doucet, A |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Journal of Machine Learning Research
2022
|
Similar Items
-
Convergence Rate of Distributed ADMM over Networks
by: Makhdoumi Kakhaki, Ali, et al.
Published: (2019) -
Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates
by: Deligiannidis, G, et al.
Published: (2021) -
Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates
by: Deligiannidis, G, et al.
Published: (2020) -
Clone MCMC: Parallel high-dimensional Gaussian gibbs sampling
by: Bǎrbos, A, et al.
Published: (2018) -
Dimension-independent likelihood-informed MCMC
by: Law, Kody J.H., et al.
Published: (2018)