Parallel computations for Metropolis Markov chains with Picard maps
From MaRDI portal
Cites work
- A ``parareal in time discretization of PDE's
- Consensus‐based sampling
- Derivative-Free Bayesian Inversion Using Multiscale Dynamics
- Discontinuous Hamiltonian Monte Carlo for discrete parameters and discontinuous likelihoods
- Equation of state calculations by fast computing machines
- Explicit convergence bounds for Metropolis Markov chains: isoperimetry, spectral gaps and profiles
- Exponential convergence of Langevin distributions and their discrete approximations
- General state space Markov chains and MCMC algorithms
- scientific article; zbMATH DE number 3523369 (Why is no real title available?)
- scientific article; zbMATH DE number 1082719 (Why is no real title available?)
- scientific article; zbMATH DE number 1843488 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Log-concave sampling: Metropolis-Hastings algorithms are fast
- On sampling from a log-concave density using kinetic Langevin diffusions
- Parallel MCMC algorithms: theoretical foundations, algorithm design, case studies
- Random gradient-free minimization of convex functions
- Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms
- Stochastic Parareal: An Application of Probabilistic Methods to Time-Parallelization
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- The pseudo-marginal approach for efficient Monte Carlo computations
- Weak convergence and optimal scaling of random walk Metropolis algorithms
This page was built for publication: Parallel computations for Metropolis Markov chains with Picard maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7286311)
