scientific article
From MaRDI portal
Publication:3405572
zbMath1186.62038MaRDI QIDQ3405572
Cristian Pasarica, Andrew Gelman
Publication date: 10 February 2010
Full work available at URL: http://www3.stat.sinica.edu.tw/statistica/J20N1/J20N113/J20N113.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markov chain Monte CarloBayesian computationacceptance ratesmultiple importance samplingiterative simulation
Related Items
An extended sparse max-linear moving model with application to high-frequency financial data, Asymptotic analysis of the random walk metropolis algorithm on ridged densities, Designing simple and efficient Markov chain Monte Carlo proposal kernels, Adaptive Metropolis-Hastings sampling using reversible dependent mixture proposals, A Bayesian hierarchical model for spatial extremes with multiple durations, Optimal scaling of random-walk Metropolis algorithms on general target distributions, Automatically adapting the number of state particles in \(\text{SMC}^2\), Adaptive tuning of Hamiltonian Monte Carlo within sequential Monte Carlo, Optimal tuning of the hybrid Monte Carlo algorithm, Maximum Conditional Entropy Hamiltonian Monte Carlo Sampler, Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms, Optimal scaling of Metropolis algorithms: Heading toward general target distributions, Efficiency of delayed-acceptance random walk metropolis algorithms, Accelerating sequential Monte Carlo with surrogate likelihoods, Adaptive random neighbourhood informed Markov chain Monte Carlo for high-dimensional Bayesian variable selection, On the efficiency of pseudo-marginal random walk Metropolis algorithms, On the empirical efficiency of local MCMC algorithms with pools of proposals, Estimation of realized stochastic volatility models using Hamiltonian Monte Carlo-based methods
