Robust adaptive importance sampling for normal random vectors (Q983877): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Adaptative Monte Carlo Method, A Variance Reduction Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive optimal allocation in stratified sampling methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4433608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Optimal Importance Sampling and Stratification for Pricing Path-Dependent Options / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Control Variates for Finite-Horizon Simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3550812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost sure convergence of randomly truncated stochastic algorithms under verifiable condi\-tions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconstrained recursive importance sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141922 / rank
 
Normal rank

Latest revision as of 23:52, 2 July 2024

scientific article
Language Label Description Also known as
English
Robust adaptive importance sampling for normal random vectors
scientific article

    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
    0 references