BR-SNIS: Bias Reduced Self-Normalized Importance Sampling
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
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Variational Inference: A Review for Statisticianscited by 1,466
- 2015Importance Weighted Autoencoderscited by 454
- 2019Elements of Sequential Monte Carlocited by 60
- 2018Policy Optimization via Importance Samplingcited by 47
- 2020Markovian Score Climbing: Variational Inference with KL(p||q)cited by 46
- 2019Non-asymptotic Analysis of Biased Stochastic Approximation Schemecited by 45
- 2020Confident Off-Policy Evaluation and Selection through Self-Normalized Importance Weightingcited by 38
- 2017Mixing time estimation in reversible Markov chains from a single sample pathcited by 26
- 2014Particle Gibbs with Ancestor Samplingcited by 21
- 2017Asymptotic Bias of Stochastic Gradient Searchcited by 19
- 2018Optimal Bayesian Transfer Learningcited by 17
5 more
- 2019Energy-Inspired Models: Learning with Sampler-Induced Distributionscited by 12
- 2021Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative Filteringcited by 8
- 2019Unbiased Smoothing using Particle Independent Metropolis-Hastingscited by 6
- 2018External Patch-Based Image Restoration Using Importance Samplingcited by 3
- 2021Robust Importance Sampling for Error Estimation in the Context of Optimal Bayesian Transfer Learningcited by 1
Built on by
Citing papers per year: 2024: 3; 2025: 4; 2026: 5.
12 papers.
- 2025On the Closed-Form of Flow Matching: Generalization Does Not Arise from Target Stochasticitycited by 48
- 2024Explicit Flow Matching: On The Theory of Flow Matching Algorithms with Applicationscited by 6
- 2024Non-asymptotic Analysis of Biased Adaptive Stochastic Approximationcited by 4
- 2024TRADE: Transfer of Distributions between External Conditions with Normalizing Flowscited by 3
- 2025Importance Weighted Score Matching for Diffusion Samplers with Enhanced Mode Coveragecited by 2
- 2026Analytical Correction for Subsampling Bias in Drifting Modelscited by 1
- 2025Reducing the Probability of Undesirable Outputs in Language Models Using Probabilistic Inferencecited by 0
- 2025Convergence of a class of gradient-free optimisation schemes when the objective function is noisy, irregular, or bothcited by 0
- 2026Principled Synthetic Data Enables the First Scaling Laws for LLMs in Recommendationcited by 0
- 2026Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedbackcited by 0
- 2026Particle Monte Carlo Tree Searchcited by 0
- 2026A Probabilistic Interpretation of KV Cache Evictioncited by 0
- 2026A Probabilistic Interpretation of KV Cache Eviction28 Aug 2026
- 2026Particle Monte Carlo Tree Search9 May 2026
- 2026Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback30 Apr 2026
- 2026Analytical Correction for Subsampling Bias in Drifting Models29 Apr 2026
- 2026Principled Synthetic Data Enables the First Scaling Laws for LLMs in Recommendation7 Feb 2026
- 2025Convergence of a class of gradient-free optimisation schemes when the objective function is noisy, irregular, or both2 Dec 2025
- 2025Reducing the Probability of Undesirable Outputs in Language Models Using Probabilistic Inference24 Oct 2025
- 2025On the Closed-Form of Flow Matching: Generalization Does Not Arise from Target Stochasticity4 Jun 2025
- 2025Importance Weighted Score Matching for Diffusion Samplers with Enhanced Mode Coverage26 May 2025
- 2024TRADE: Transfer of Distributions between External Conditions with Normalizing Flows25 Oct 2024
- 2024Explicit Flow Matching: On The Theory of Flow Matching Algorithms with Applications5 Feb 2024
- 2024Non-asymptotic Analysis of Biased Adaptive Stochastic Approximation5 Feb 2024