Robust adaptive importance sampling for normal random vectors (Q983877)

From MaRDI portal
!
WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

scientific article; zbMATH DE number 5735972
Language Label Description Also known as
default for all languages
No label defined
    English
    Robust adaptive importance sampling for normal random vectors
    scientific article; zbMATH DE number 5735972

      Statements

      Robust adaptive importance sampling for normal random vectors (English)
      0 references
      0 references
      0 references
      13 July 2010
      0 references
      From the authors' summary: We present an alternative to stochastic approximation to tune the optimal change of measure in the context of importance sampling for normal random vectors. Unlike stochastic approximation, which requires very fine tuning in practice, we propose to use sample average approximation and deterministic optimization techniques to devise a robust and fully automatic variance reduction methodology. The same samples are used in the sample optimization of the importance sampling parameter and in the Monte Carlo computations of the expectations of interest with the optimal measure computed in the previous step. We prove that this highly dependent Monte Carlo estimator is convergent and satisfies a central limit theorem with the optimal limiting variance.
      0 references
      sample averaging
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references