Adaptive multiple importance sampling
From MaRDI portal
Abstract: The Adaptive Multiple Importance Sampling (AMIS) algorithm is aimed at an optimal recycling of past simulations in an iterated importance sampling scheme. The difference with earlier adaptive importance sampling implementations like Population Monte Carlo is that the importance weights of all simulated values, past as well as present, are recomputed at each iteration, following the technique of the deterministic multiple mixture estimator of Owen and Zhou (2000). Although the convergence properties of the algorithm cannot be fully investigated, we demonstrate through a challenging banana shape target distribution and a population genetics example that the improvement brought by this technique is substantial.
Recommendations
Cites work
- scientific article; zbMATH DE number 3992765 (Why is no real title available?)
- scientific article; zbMATH DE number 2117227 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- A Simplex Method for Function Minimization
- A Theory for Dynamic Weighting in Monte Carlo Computation
- A note on the accuracy of PAC-likelihood inference with microsatellite data
- A sequential particle filter method for static models
- Adaptive proposal distribution for random walk Metropolis algorithm
- An adaptive Metropolis algorithm
- Convergence of adaptive mixtures of importance sampling schemes
- Estimating and Projecting Trends in HIV/AIDS Generalized Epidemics Using Incremental Mixture Importance Sampling
- Inference in Molecular Population Genetics
- Limit theorems for weighted samples with applications to sequential Monte Carlo methods
- Minimum variance importance samplingviaPopulation Monte Carlo
- Model-based cluster and discriminant analysis with the MIXMOD software
- Monte Carlo strategies in scientific computing
- Safe and Effective Importance Sampling
- Sequential Monte Carlo Methods in Practice
- Sequential Monte Carlo Samplers
- Weighted Average Importance Sampling and Defensive Mixture Distributions
Cited in
(67)- Persistent sampling: enhancing the efficiency of sequential Monte Carlo
- Improved approximate Bayesian computation methods via empirical likelihood
- Recursive pathways to marginal likelihood estimation with prior-sensitivity analysis
- Adaptive Importance Sampling Based on Fault Tree Analysis for Piecewise Deterministic Markov Process
- Importance sampling the union of rare events with an application to power systems analysis
- Layered adaptive importance sampling
- Annealing strategies for variance reduction in balance heuristic estimators
- A principled stopping rule for importance sampling
- Multifidelity importance sampling
- Rao–Blackwellisation in the Markov Chain Monte Carlo Era
- Issues in the multiple try Metropolis mixing
- Sequential Monte Carlo with adaptive weights for approximate Bayesian computation
- Distilling Importance Sampling for Likelihood Free Inference
- A survey of Monte Carlo methods for noisy and costly densities with application to reinforcement learning and ABC
- Generalized multiple importance sampling
- Importance Sampling with the Integrated Nested Laplace Approximation
- Moderate deviations for the optimal values of sample average approximation with adaptive multiple importance sampling
- Incremental Mixture Importance Sampling With Shotgun Optimization
- Efficient Bayes inference in neural networks through adaptive importance sampling
- A derivative-free trust-region algorithm for the optimization of functions smoothed via Gaussian convolution using adaptive multiple importance sampling
- A class of adaptive importance sampling weighted EM algorithms for efficient and robust posterior and predictive simulation
- Convergence rates for optimised adaptive importance samplers
- Gradient-based adaptive importance samplers
- Sequential ensemble transform for Bayesian inverse problems
- An approximate likelihood perspective on ABC methods
- Daisee: Adaptive importance sampling by balancing exploration and exploitation
- The square root rule for adaptive importance sampling
- Adaptive posterior distributions for uncertainty analysis of covariance matrices in Bayesian inversion problems for multioutput signals
- Forecasting pathogen dynamics with Bayesian model-averaging: application to \textit{Xylella fastidiosa}
- Adaptive multiple importance sampling for Gaussian processes
- Convergence and efficiency of adaptive importance sampling techniques with partial biasing
- Proposal adaptation in simulated annealing for continuous optimization problems
- Implicitly adaptive importance sampling
- MCMC-driven importance samplers
- Combining multiple surrogate models to accelerate failure probability estimation with expensive high-fidelity models
- Doubly Adaptive Importance Sampling
- Adaptive radial-based direction sampling: some flexible and robust Monte Carlo integration methods
- Target-aware Bayesian inference: how to beat optimal conventional estimators
- Safe adaptive importance sampling: a mixture approach
- Convergence of adaptive direction sampling
- Speeding up Monte Carlo simulations for the adaptive sum of powered score test with importance sampling
- MCMC-driven adaptive multiple importance sampling
- Adaptive importance sampling for extreme quantile estimation with stochastic black box computer models
- Moment matching adaptive importance sampling with skew-Student proposals
- Consistency of adaptive importance sampling and recycling schemes
- Bayesian multiple quantile regression for linear models using a score likelihood
- Efficient multifidelity likelihood-free Bayesian inference with adaptive computational resource allocation
- The importance Markov chain
- Composite likelihood inference for the Poisson log-normal model
- Fitting double hierarchical models with the integrated nested Laplace approximation
- An adaptive importance sampling algorithm for Bayesian inversion with multimodal distributions
- Large Deviation Theory-based Adaptive Importance Sampling for Rare Events in High Dimensions
- The lifebelt particle filter for robust estimation from low-valued count data
- Regularized Rényi divergence minimization through Bregman proximal gradient algorithms
- A Defensive Marginal Particle Filtering Method for Data Assimilation
- Asymptotics of the optimal value of SAA with AMIS on minimax stochastic programs
- Ensemble transport adaptive importance sampling
- Transport map accelerated adaptive importance sampling, and application to inverse problems arising from multiscale stochastic reaction networks
- Stochastic adaptation of importance sampler
- Dating and localizing an invasion from post-introduction data and a coupled reaction-diffusion-absorption model
- Marginal Likelihood Computation for Model Selection and Hypothesis Testing: An Extensive Review
- Bayesian penalized empirical likelihood and Markov chain Monte Carlo sampling
- Integrating geostatistical maps and infectious disease transmission models using adaptive multiple importance sampling
- Efficient estimation of multiple expectations with the same sample by adaptive importance sampling and control variates
- Importance sampling and its optimality for stochastic simulation models
- Markov Chain Importance Sampling—A Highly Efficient Estimator for MCMC
- Modern Monte Carlo methods for efficient uncertainty quantification and propagation: a survey
This page was built for publication: Adaptive multiple importance sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3145570)
