Abstract
Despite the development of sophisticated techniques such as sequential Monte Carlo (Del Moral et al. in J R Stat Soc Ser B 68(3):411–436, 2006), importance sampling (IS) remains an important Monte Carlo method for low dimensional target distributions (Chopin and Ridgway in Leave Pima Indians alone: binary regression as a benchmark for Bayesian computation, 32:64–87, 2017). This paper describes a new technique for constructing proposal distributions for IS, using affine arithmetic (de Figueiredo and Stolfi in Numer Algorithms 37(1–4):147–158, 2004). This work builds on the Moore rejection sampler (Sainudiin in Machine interval experiments, Cornell University, Ithaca, 2005; Sainudiin and York in Algorithms Mol Biol 4(1):1, 2009) to which we provide a comparison.
Author supplied keywords
Cite
CITATION STYLE
Everitt, R. G. (2018). Efficient importance sampling in low dimensions using affine arithmetic. Computational Statistics, 33(1), 1–29. https://doi.org/10.1007/s00180-017-0729-z
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.