Fundamental limits for weighted empirical approximations of tilted distributions

• URL: http://arxiv.org/abs/2512.23979v1
• Date: Tue, 30 Dec 2025 04:30:27 GMT
• Title: Fundamental limits for weighted empirical approximations of tilted distributions
• Authors: Sarvesh Ravichandran Iyer, Himadri Mandal, Dhruman Gupta, Rushil Gupta, Agniv Bandhyopadhyay, Achal Bassamboo, Varun Gupta, Sandeep Juneja,
• Abstract summary: Consider the task of generating samples from a tilted distribution of a random vector whose underlying distribution is unknown, but samples from it are available.<n>This finds applications in fields such as finance and climate science, and in rare event simulation.<n>We provide a sharp characterization of its accuracy, given the number of samples and the degree of tilt.
• Score: 3.172282943656995
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Consider the task of generating samples from a tilted distribution of a random vector whose underlying distribution is unknown, but samples from it are available. This finds applications in fields such as finance and climate science, and in rare event simulation. In this article, we discuss the asymptotic efficiency of a self-normalized importance sampler of the tilted distribution. We provide a sharp characterization of its accuracy, given the number of samples and the degree of tilt. Our findings reveal a surprising dichotomy: while the number of samples needed to accurately tilt a bounded random vector increases polynomially in the tilt amount, it increases at a super polynomial rate for unbounded distributions.

Related papers

• Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination [40.15176310729312]
  We study the basic task of mean estimation in the presence of mean-shift contamination.<n>We show that there exists a sample-efficient algorithm that estimates the target mean to any desired accuracy.
  arXiv  Detail & Related papers  (2026-02-25T17:21:23Z)
• Optimal Bounds for Tyler's M-Estimator for Elliptical Distributions [1.6312989763677888]
  Tyler proposed a natural M-estimator for distributions.<n>We show that this estimator performs very well, and that Tyler's iterative procedure converges quickly to the estimator.<n>We show that distributions satisfy $infty$-expansion at the optimal sample threshold, and then prove a novel scaling result for inputs satisfying this condition.
  arXiv  Detail & Related papers  (2025-10-15T16:58:13Z)
• Bayesian Estimation of Extreme Quantiles and the Exceedance Distribution for Paretian Tails [3.9160947065896803]
  We show that for unconditional distributions, a Bayesian quantile estimate results in zero coverage error.<n>We derive an expression for the distribution, and moments of future exceedances which is vital for risk assessment.<n>We illustrate our results using simulations for a variety of light and heavy-tailed distributions.
  arXiv  Detail & Related papers  (2025-05-07T15:21:17Z)
• Enhanced Importance Sampling through Latent Space Exploration in Normalizing Flows [69.8873421870522]
  importance sampling is a rare event simulation technique used in Monte Carlo simulations.<n>We propose a method for more efficient sampling by updating the proposal distribution in the latent space of a normalizing flow.
  arXiv  Detail & Related papers  (2025-01-06T21:18:02Z)
• Theory on Score-Mismatched Diffusion Models and Zero-Shot Conditional Samplers [49.97755400231656]
  We present the first performance guarantee with explicit dimensional dependencies for general score-mismatched diffusion samplers.<n>We show that score mismatches result in an distributional bias between the target and sampling distributions, proportional to the accumulated mismatch between the target and training distributions.<n>This result can be directly applied to zero-shot conditional samplers for any conditional model, irrespective of measurement noise.
  arXiv  Detail & Related papers  (2024-10-17T16:42:12Z)
• Statistically Optimal Generative Modeling with Maximum Deviation from the Empirical Distribution [2.1146241717926664]
  We show that the Wasserstein GAN, constrained to left-invertible push-forward maps, generates distributions that avoid replication and significantly deviate from the empirical distribution. Our most important contribution provides a finite-sample lower bound on the Wasserstein-1 distance between the generative distribution and the empirical one. We also establish a finite-sample upper bound on the distance between the generative distribution and the true data-generating one.
  arXiv  Detail & Related papers  (2023-07-31T06:11:57Z)
• Adaptive Annealed Importance Sampling with Constant Rate Progress [68.8204255655161]
  Annealed Importance Sampling (AIS) synthesizes weighted samples from an intractable distribution. We propose the Constant Rate AIS algorithm and its efficient implementation for $alpha$-divergences.
  arXiv  Detail & Related papers  (2023-06-27T08:15:28Z)
• Mean-Square Analysis of Discretized It\^o Diffusions for Heavy-tailed Sampling [17.415391025051434]
  We analyze the complexity of sampling from a class of heavy-tailed distributions by discretizing a natural class of Ito diffusions associated with weighted Poincar'e inequalities. Based on a mean-square analysis, we establish the iteration complexity for obtaining a sample whose distribution is $epsilon$ close to the target distribution in the Wasserstein-2 metric.
  arXiv  Detail & Related papers  (2023-03-01T15:16:03Z)
• Unsupervised Learning of Sampling Distributions for Particle Filters [80.6716888175925]
  We put forward four methods for learning sampling distributions from observed measurements. Experiments demonstrate that learned sampling distributions exhibit better performance than designed, minimum-degeneracy sampling distributions.
  arXiv  Detail & Related papers  (2023-02-02T15:50:21Z)
• Unrolling Particles: Unsupervised Learning of Sampling Distributions [102.72972137287728]
  Particle filtering is used to compute good nonlinear estimates of complex systems. We show in simulations that the resulting particle filter yields good estimates in a wide range of scenarios.
  arXiv  Detail & Related papers  (2021-10-06T16:58:34Z)
• Uncorrelated problem-specific samples of quantum states from zero-mean Wishart distributions [4.289102530380288]
  We present a two-step algorithm for sampling from the quantum state space. We establish the explicit form of the induced Wishart distribution for quantum states. We demonstrate that this sampling algorithm is very efficient for one-qubit and two-qubit states, and reasonably efficient for three-qubit states.
  arXiv  Detail & Related papers  (2021-06-16T03:06:41Z)
• Efficiently Sampling Functions from Gaussian Process Posteriors [76.94808614373609]
  We propose an easy-to-use and general-purpose approach for fast posterior sampling. We demonstrate how decoupled sample paths accurately represent Gaussian process posteriors at a fraction of the usual cost.
  arXiv  Detail & Related papers  (2020-02-21T14:03:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.