Efficient importance sampling in low dimensions using affine arithmetic
From MaRDI portal
Publication:1695502
DOI10.1007/s00180-017-0729-zzbMath1417.65037OpenAlexW2618227140MaRDI QIDQ1695502
Publication date: 7 February 2018
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-017-0729-z
Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15) Monte Carlo methods (65C05) Interval and finite arithmetic (65G30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The pseudo-marginal approach for efficient Monte Carlo computations
- Bayesian model comparison with un-normalised likelihoods
- Rigorous global search: continuous problems
- The sample size required in importance sampling
- Importance sampling: intrinsic dimension and computational cost
- Automated rejection sampling from product of distributions
- Leave Pima Indians alone: binary regression as a benchmark for Bayesian computation
- Adaptive approximate Bayesian computation for complex models
- On the flexibility of the design of multiple try Metropolis schemes
- Affine arithmetic: concepts and applications
- Sequential Monte Carlo Samplers
- An Efficient Method for Generating Discrete Random Variables with General Distributions
- The Lorenz attractor exists
- Sequential Imputations and Bayesian Missing Data Problems
- Adaptive Rejection Metropolis Sampling within Gibbs Sampling
- Applications of Interval Methods to Phylogenetics
- Bayesian Inference in Econometric Models Using Monte Carlo Integration
This page was built for publication: Efficient importance sampling in low dimensions using affine arithmetic
