The square root rule for adaptive importance sampling
From MaRDI portal
Publication:6600089
DOI10.1145/3350426zbMath1544.65019MaRDI QIDQ6600089
Publication date: 8 September 2024
Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)
Computational methods for problems pertaining to statistics (62-08) Point estimation (62F10) Monte Carlo methods (65C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A nonlinear renewal theory with applications to sequential analysis. I
- Adapative importance sampling on discrete Markov chains
- Scrambled net variance for integrals of smooth functions
- Methods for approximating integrals in statistics with special emphasis on Bayesian integration problems
- The sample size required in importance sampling
- Importance sampling the union of rare events with an application to power systems analysis
- Fluid heuristics, Lyapunov bounds and efficient importance sampling for a heavy-tailed \(G/G/1\) queue
- A tutorial on the cross-entropy method
- Variance Reduction via Lattice Rules
- Adaptive Multiple Importance Sampling
- Sums of Powers of Integers
- Probability with Martingales
- Nonparametric Importance Sampling
- Asymptotic robustness of estimators in rare-event simulation
- Methods of Reducing Sample Size in Monte Carlo Computations
This page was built for publication: The square root rule for adaptive importance sampling
