Consistency of adaptive importance sampling and recycling schemes
DOI10.3150/18-BEJ1042zbMath1466.62157OpenAlexW3087402115WikidataQ126914326 ScholiaQ126914326MaRDI QIDQ2419666
Mohammed Sedki, Jean-Michel Marin, Pierre Pudlo
Publication date: 14 June 2019
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.bj/1560326434
importance samplingMonte Carlo methodsadaptive algorithmssequential Monte Carlotriangular arrayspopulation Monte Carlo
Computational methods in Markov chains (60J22) Asymptotic properties of parametric estimators (62F12) Computational methods for problems pertaining to statistics (62-08) Monte Carlo methods (65C05)
Related Items (9)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive pathways to marginal likelihood estimation with prior-sensitivity analysis
- Convergence of adaptive mixtures of importance sampling schemes
- Layered adaptive importance sampling
- Monte Carlo strategies in scientific computing.
- Adaptive Multiple Importance Sampling
- Sequential Monte Carlo Samplers
- The EM Algorithm and Extensions, 2E
- Asymptotic Statistics
- Safe and Effective Importance Sampling
- An Adaptive Population Importance Sampler: Learning From Uncertainty
- Particle Markov Chain Monte Carlo Methods
- Weighted Average Importance Sampling and Defensive Mixture Distributions
- Adaptive multiple importance sampling for Gaussian processes
- Minimum variance importance samplingviaPopulation Monte Carlo
This page was built for publication: Consistency of adaptive importance sampling and recycling schemes