mlsanityData to 7 Oct 2026

BR-SNIS: Bias Reduced Self-Normalized Importance Sampling

arXiv 2207.06364 ↗First posted 13 Jul 2022stat.ML cs.LG stat.COcited by 12

Not on the map. Why?

Abstract (arXiv)

Importance Sampling (IS) is a method for approximating expectations under a target distribution using independent samples from a proposal distribution and the associated importance weights. In many applications, the target distribution is known only up to a normalization constant, in which case self-normalized IS (SNIS) can be used. While the use of self-normalization can have a positive effect on the dispersion of the estimator, it introduces bias. In this work, we propose a new method, BR-SNIS, whose complexity is essentially the same as that of SNIS and which significantly reduces bias without increasing the variance. This method is a wrapper in the sense that it uses the same proposal samples and importance weights as SNIS, but makes clever use of iterated sampling--importance resampling (ISIR) to form a bias-reduced version of the estimator. We furnish the proposed algorithm with rigorous theoretical results, including new bias, variance and high-probability bounds, and these are illustrated by numerical examples.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 17 of its 61 references that are in the map. First posted on arXiv 13 Jul 2022.

Builds on

17 of 61 references.

References · 17

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Variational Inference: A Review for Statisticianscited by 1,466
  3. 2015Importance Weighted Autoencoderscited by 454
  4. 2019Elements of Sequential Monte Carlocited by 60
  5. 2018Policy Optimization via Importance Samplingcited by 47
  6. 2020Markovian Score Climbing: Variational Inference with KL(p||q)cited by 46
  7. 2019Non-asymptotic Analysis of Biased Stochastic Approximation Schemecited by 45
  8. 2020Confident Off-Policy Evaluation and Selection through Self-Normalized Importance Weightingcited by 38
  9. 2017Mixing time estimation in reversible Markov chains from a single sample pathcited by 26
  10. 2014Particle Gibbs with Ancestor Samplingcited by 21
  11. 2017Asymptotic Bias of Stochastic Gradient Searchcited by 19
  12. 2018Optimal Bayesian Transfer Learningcited by 17
5 more
  1. 2019Energy-Inspired Models: Learning with Sampler-Induced Distributionscited by 12
  2. 2021Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative Filteringcited by 8
  3. 2019Unbiased Smoothing using Particle Independent Metropolis-Hastingscited by 6
  4. 2018External Patch-Based Image Restoration Using Importance Samplingcited by 3
  5. 2021Robust Importance Sampling for Error Estimation in the Context of Optimal Bayesian Transfer Learningcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 4; 2026: 5.

12 papers.