Adaptive importance sampling in monte carlo integration

Man Suk Oh; James O. Berger

doi:10.1080/00949659208810398

Adaptive importance sampling in monte carlo integration

Man Suk Oh, James O. Berger

Department of Statistics

Research output: Contribution to journal › Article › peer-review

107 Scopus citations

Abstract

An Adaptive Importance Sampling (AIS) scheme is introduced to compute integrals of the form [Formula Omitted] as a mechanical, yet flexible, way of dealing with the selection of parameters of the importance function. AIS starts with a rough estimate for the parameters λ of the importance function [Formula Omitted], and runs importance sampling in an iterative way to continually update λ using only linear accumulation. Consistency of AIS is established. The efficiency of the algorithm is studied in three examples and found to be substantially superior to ordinary importance sampling.

Original language	English
Pages (from-to)	143-168
Number of pages	26
Journal	Journal of Statistical Computation and Simulation
Volume	41
Issue number	3-4
DOIs	https://doi.org/10.1080/00949659208810398
State	Published - 1 Jul 1992

Keywords

Monte Carlo integration
adaptive importance sampling
approximate normality
basic importance sampling
importance function
linear accumulation
martingale limit theorem

Access to Document

10.1080/00949659208810398

Cite this

@article{b403d478138b4e768d7beb00e3675f63,

title = "Adaptive importance sampling in monte carlo integration",

abstract = "An Adaptive Importance Sampling (AIS) scheme is introduced to compute integrals of the form [Formula Omitted] as a mechanical, yet flexible, way of dealing with the selection of parameters of the importance function. AIS starts with a rough estimate for the parameters λ of the importance function [Formula Omitted], and runs importance sampling in an iterative way to continually update λ using only linear accumulation. Consistency of AIS is established. The efficiency of the algorithm is studied in three examples and found to be substantially superior to ordinary importance sampling.",

keywords = "Monte Carlo integration, adaptive importance sampling, approximate normality, basic importance sampling, importance function, linear accumulation, martingale limit theorem",

author = "Oh, {Man Suk} and Berger, {James O.}",

note = "Funding Information: {"}Research was supported by the National Science Foundation, grants DMS-8702620 and DMS-8717799, and by a David Ross Fellowship from Purdue University, as part of the first author's Ph.D. thesis. Parts of the work were also done while the authors were visiting at Duke University. The authors thank Arup Bose for his help with the convergence proofs.",

year = "1992",

month = jul,

day = "1",

doi = "10.1080/00949659208810398",

language = "English",

volume = "41",

pages = "143--168",

journal = "Journal of Statistical Computation and Simulation",

issn = "0094-9655",

publisher = "Taylor and Francis Ltd.",

number = "3-4",

}

TY - JOUR

T1 - Adaptive importance sampling in monte carlo integration

AU - Oh, Man Suk

AU - Berger, James O.

N1 - Funding Information: "Research was supported by the National Science Foundation, grants DMS-8702620 and DMS-8717799, and by a David Ross Fellowship from Purdue University, as part of the first author's Ph.D. thesis. Parts of the work were also done while the authors were visiting at Duke University. The authors thank Arup Bose for his help with the convergence proofs.

PY - 1992/7/1

Y1 - 1992/7/1

N2 - An Adaptive Importance Sampling (AIS) scheme is introduced to compute integrals of the form [Formula Omitted] as a mechanical, yet flexible, way of dealing with the selection of parameters of the importance function. AIS starts with a rough estimate for the parameters λ of the importance function [Formula Omitted], and runs importance sampling in an iterative way to continually update λ using only linear accumulation. Consistency of AIS is established. The efficiency of the algorithm is studied in three examples and found to be substantially superior to ordinary importance sampling.

AB - An Adaptive Importance Sampling (AIS) scheme is introduced to compute integrals of the form [Formula Omitted] as a mechanical, yet flexible, way of dealing with the selection of parameters of the importance function. AIS starts with a rough estimate for the parameters λ of the importance function [Formula Omitted], and runs importance sampling in an iterative way to continually update λ using only linear accumulation. Consistency of AIS is established. The efficiency of the algorithm is studied in three examples and found to be substantially superior to ordinary importance sampling.

KW - Monte Carlo integration

KW - adaptive importance sampling

KW - approximate normality

KW - basic importance sampling

KW - importance function

KW - linear accumulation

KW - martingale limit theorem

UR - http://www.scopus.com/inward/record.url?scp=0001008381&partnerID=8YFLogxK

U2 - 10.1080/00949659208810398

DO - 10.1080/00949659208810398

M3 - Article

AN - SCOPUS:0001008381

SN - 0094-9655

VL - 41

SP - 143

EP - 168

JO - Journal of Statistical Computation and Simulation

JF - Journal of Statistical Computation and Simulation

IS - 3-4

ER -

Adaptive importance sampling in monte carlo integration

Abstract

Keywords

Access to Document

Fingerprint

Cite this