Approximating Probability Densities by Iterated Laplace Approximations

Abstract

The Laplace approximation is an old, but frequently used method to approximate integrals for Bayesian calculations. In this paper we develop an extension of the Laplace approximation, by applying it iteratively to the residual, i.e., the difference between the current approximation and the true function. The final approximation is thus a linear combination of multivariate normal densities, where the coefficients are chosen to achieve a good fit to the target distribution. We illustrate on real and artificial examples that the proposed procedure is a computationally efficient alternative to current approaches for approximation of multivariate probability densities. The R-package iterLap implementing the methods described in this article is available from the CRAN servers.

to appear in Journal of Computational and Graphical Statistics, http://pubs.amstat.org/loi/jcgs

References in corpus (6)

• Distributions generated by perturbation of symmetry with emphasis on a multivariate skew $t$ distribution
• Approximation and learning by greedy algorithms
• On the ergodicity properties of some adaptive MCMC algorithms
• Markov Chain Monte Carlo: Can We Trust the Third Significant Figure?
• Adaptive Importance Sampling in General Mixture Classes
• Estimation of cosmological parameters using adaptive importance sampling

Cited by in corpus (4)

• Deterministic Sampling of Expensive Posteriors Using Minimum Energy Designs
• Functional Uniform Priors for Nonlinear Modelling
• Laplace approximation for fast Bayesian inference in generalized additive models based on penalized regression splines
• A Composite Likelihood Approach for Inference under Photometric Redshift Uncertainty