Efficient importance sampling in low dimensions using affine arithmetic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1595639 (Why is no real title available?)
- scientific article; zbMATH DE number 1408651 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 2212178 (Why is no real title available?)
- Adaptive Rejection Metropolis Sampling within Gibbs Sampling
- Adaptive approximate Bayesian computation for complex models
- Affine arithmetic: concepts and applications
- An Efficient Method for Generating Discrete Random Variables with General Distributions
- Applications of Interval Methods to Phylogenetics
- Automated rejection sampling from product of distributions
- Bayesian Inference in Econometric Models Using Monte Carlo Integration
- Bayesian model comparison with un-normalised likelihoods
- Importance sampling: intrinsic dimension and computational cost
- Leave Pima Indians alone: binary regression as a benchmark for Bayesian computation
- On the flexibility of the design of multiple try Metropolis schemes
- Rigorous global search: continuous problems
- Sequential Imputations and Bayesian Missing Data Problems
- Sequential Monte Carlo Samplers
- The Lorenz attractor exists
- The pseudo-marginal approach for efficient Monte Carlo computations
- The sample size required in importance sampling
This page was built for publication: Efficient importance sampling in low dimensions using affine arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1695502)