Finding our way in the dark: approximate MCMC for approximate Bayesian methods
From MaRDI portal
Publication:6121616
DOI10.1214/20-ba1250arXiv1905.06680OpenAlexW3112357093MaRDI QIDQ6121616
Publication date: 27 February 2024
Published in: Bayesian Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.06680
Computational methods in Markov chains (60J22) Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15) Monte Carlo methods (65C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Cites Work
- Bayesian Synthetic Likelihood
- Robust Bayesian Synthetic Likelihood via a Semi-Parametric Approach
- The pseudo-marginal approach for efficient Monte Carlo computations
- Approximate Bayesian computational methods
- Strong consistency of nearest neighbor regression function estimators
- Lectures on the nearest neighbor method
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Optimal scaling for various Metropolis-Hastings algorithms.
- Accelerating pseudo-marginal MCMC using Gaussian processes
- Efficient MCMC for Gibbs random fields using pre-computation
- Efficient acquisition rules for model-based approximate Bayesian computation
- Rates of convergence of the Hastings and Metropolis algorithms
- Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
- Of copulas, quantiles, ranks and spectra: an \(L_{1}\)-approach to spectral analysis
- Particle Markov Chain Monte Carlo for Efficient Numerical Simulation
- An overview on Approximate Bayesian computation
- QUANTILE CORRELATIONS: UNCOVERING TEMPORAL DEPENDENCIES IN FINANCIAL TIME SERIES
- Handbook of Markov Chain Monte Carlo
- Multidimensional binary search trees used for associative searching
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Convergence Properties of Perturbed Markov Chains
- VOLATILITY CLUSTERING IN FINANCIAL MARKETS: A MICROSIMULATION OF INTERACTING AGENTS
- Constructing Summary Statistics for Approximate Bayesian Computation: Semi-Automatic Approximate Bayesian Computation
- Gaussian Markov Random Fields
- Likelihood inflating sampling algorithm
- Statistical Analysis of Network Data with R
- Handbook of Approximate Bayesian Computation
- Speeding Up MCMC by Efficient Data Subsampling
- Sequential Monte Carlo without likelihoods
- Sensitivity and convergence of uniformly ergodic Markov chains
- Relevant Statistics for Bayesian Model Choice
- A one-pass sequential Monte Carlo method for Bayesian analysis of massive datasets
This page was built for publication: Finding our way in the dark: approximate MCMC for approximate Bayesian methods
