Derives non-asymptotic error bounds for standard, defensive, and self-normalized importance sampling with random KDE proposals from geometrically ergodic Markov chains, separating n^{-1/2} Monte Carlo error from MIAE/MISE proposal error.
hub
A New Uncertainty Importance Measure
3 Pith papers cite this work, alongside 1,014 external citations. Polarity classification is still indexing.
3
Pith papers citing it
1,014
external citations · Crossref
hub tools
representative citing papers
An omnitree that bisects only selected dimensions per node can raise dyadic AMR convergence by up to the dimension count d for strongly anisotropic problems; on 4,166 shapes it improved mean convergence 1.5x versus octrees.
citing papers explorer
-
Error Bounds for Importance Sampling with Estimated Proposal Distributions
Derives non-asymptotic error bounds for standard, defensive, and self-normalized importance sampling with random KDE proposals from geometrically ergodic Markov chains, separating n^{-1/2} Monte Carlo error from MIAE/MISE proposal error.