Skip to content

Post-stratified importance sampling

Nov 2026 · 0 citations · 56 references
Mathematics Computer Science

Abstract

Importance sampling is a building block of modern statistical computing, but the weighted estimate is prone to high or infinite variance. Moreover, its empirical standard error is often unreliable, leaving importance sampling without practical uncertainty quantification. Motivated by multilevel regression and poststratification (MRP) in survey sampling, we propose post-stratified importance sampling (PIS) for estimating target expectations from proposal draws. PIS reformulates arbitrarily high-dimensional weighting into two one-dimensional probabilistic modeling problems: regression for the conditional mean given the importance ratio and marginal density estimation for the importance ratio. Different modeling choices yield a family of PIS estimators, encompassing ordinary importance sampling as a special case. We develop a model-based implementation that combines one-dimensional Gaussian process regression for the conditional mean and score-informed heavy-tailed density estimation for the marginal law, using both the observed weights and the available density evaluations. We study the oracle gains of PIS and establish consistency under general and model-specific conditions. Simulations and applications to cross-validation demonstrate improvements in estimation accuracy and uncertainty quantification.

View source

Similar papers

Preprint Sep 2026

Coherent and robust Bayesian inference under informative sampling via sample-level weight models

We develop two complementary Bayesian procedures for analytic inference under informative sampling. The first constructs a coherent likelihood by modeling the sample-level distribution of the design weight given the study variable and recovering the conditional inclusion probability through the identity of Sverchkov an...

Kosuke Morikawa, Jae Kwang Kim, Won Chang · 0 citations
Review Oct 2026

Fixed-Size Active Statistical Inference

Variance reduction techniques improve the efficiency of drawing conclusions from data. Recent proposals for variance-reduction use two complementary techniques to reduce variance: incorporating machine learning predictions into estimators and weighted sampling. A popular weighted sampling algorithm is Poisson Sampling...

Erik Skalnes, Michael Oberst · 0 citations
Preprint Oct 2026

LUCID: Local Understanding of Covariate Importance with Conditional Density Estimation

Computing local-level variable importance (VI) is critical for understanding machine learning models. Local permutation-based VI metrics offer a simple yet powerful approach, measuring how much a model's output changes when perturbing its inputs. However, existing perturbation strategies often ignore feature dependence...

Yi-Xiao Wang, Srikar Katta, Jon Donnelly et al. · 0 citations
Preprint Oct 2026

Improving score-based sampling via affine post-processing

Sampling from a probability distribution with access only to its log-density is a foundational problem in statistics, machine learning, and the physical sciences. This problem is studied in the data-free score-based diffusion literature, which samples the target density via estimating scores of densities produced by co...

Curtis McDonald, Kevin Rojas, Mo-Lei Tao et al. · 0 citations
Review Nov 2026

Data integration using propensity score weighting under missing at random

We study data integration for the setting in which a probability sample and a nonprobability sample are both available from a common target population, with auxiliary variables observed in both samples and the study variable observed only in the nonprobability sample. Under a parametric propensity score model for the n...

Caleb Leedy, Jae Kwang Kim · 0 citations
Preprint Oct 2026

Variance Estimation Under Local Pivotal Methods

Spatially balanced sampling designs, such as the local pivotal methods (LPM), improve representation of auxiliary-variable space, but design-based variance estimation is challenging because second-order inclusion probabilities are generally intractable and may be zero or near zero. We propose two approaches for estimat...

Justin T. Greene, Tirthankar Dasgupta · 0 citations

Related blog posts

Microsoft Research Blog Nov 3, 2026

Learn the rules: The hacker mindset

Research Manager Mike Walker reflects on a career spanning hacker culture, cybersecurity, and AI, sharing lessons about trust, teamwork, leadership, and why solving difficult problems requires curiosity, judgment, agility—and an understanding of the rules. The post Learn the rules: The hacker mindset appeared first on Microsoft Research.

Google DeepMind Blog Nov 3, 2026

Agentic cheminformatics with Google Antigravity

Learn how Google Antigravity and our Cheminformatics Skills accelerate drug discovery workflows, search compounds, and propose novel rigidified macrocycles.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.