Faster adaptive importance sampling in low dimensions

Research output: Contribution to journalArticlepeer-review

Abstract

Adaptive importance sampling using kernel density estimation techniques was introduced by West. This technique adapts the importance sampling function to the underlying integrand, thus yielding small-variance estimates. One drawback of this approach is that evaluation of the kernel mixture density is slow. We present a linear tensor spline representation of the adaptive importance function using variable bandwidth kernels that retains the small variance properties of West’s approach but executes more quickly.

Original languageEnglish (US)
Pages (from-to)158-174
Number of pages17
JournalJournal of Computational and Graphical Statistics
Volume7
Issue number2
DOIs
StatePublished - Jun 1998

Keywords

  • Bayesian computing
  • Kernel density estimation
  • Splines

Fingerprint

Dive into the research topics of 'Faster adaptive importance sampling in low dimensions'. Together they form a unique fingerprint.

Cite this