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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Derives Õ(d β² A² / ε⁴) oracle complexity for AIS estimating normalizing constant Z to relative error ε and introduces reverse diffusion sampler for geometric paths with large action.
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.
-
Complexity Analysis of Normalizing Constant Estimation: from Jarzynski Equality to Annealed Importance Sampling and beyond
Derives Õ(d β² A² / ε⁴) oracle complexity for AIS estimating normalizing constant Z to relative error ε and introduces reverse diffusion sampler for geometric paths with large action.