English
Related papers

Related papers: Pareto Smoothed Importance Sampling

200 papers

Importance sampling is a Monte Carlo method which designs estimators of expectations under a target distribution using weighted samples from a proposal distribution. When the target distribution is complex, such as multimodal distributions…

Methodology · Statistics 2026-02-04 Anas Cherradi , Yazid Janati , Alain Durmus , Sylvain Le Corff , Yohan Petetin , Julien Stoehr

Adaptive importance sampling is a widely spread Monte Carlo technique that uses a re-weighting strategy to iteratively estimate the so-called target distribution. A major drawback of adaptive importance sampling is the large variance of the…

Statistics Theory · Mathematics 2021-11-01 Anna Korba , François Portier

Adaptive importance sampling is a class of techniques for finding good proposal distributions for importance sampling. Often the proposal distributions are standard probability distributions whose parameters are adapted based on the…

Computation · Statistics 2021-03-10 Topi Paananen , Juho Piironen , Paul-Christian Bürkner , Aki Vehtari

Computation of extreme quantiles and tail-based risk measures using standard Monte Carlo simulation can be inefficient. A method to speed up computations is provided by importance sampling. We show that importance sampling algorithms,…

Probability · Mathematics 2009-09-21 Henrik Hult , Jens Svensson

Importance sampling is a common technique for Monte Carlo approximation, including Monte Carlo approximation of p-values. Here it is shown that a simple correction of the usual importance sampling p-values creates valid p-values, meaning…

Computation · Statistics 2011-04-12 Matthew T. Harrison

Importance sampling is a rare event simulation technique used in Monte Carlo simulations to bias the sampling distribution towards the rare event of interest. By assigning appropriate weights to sampled points, importance sampling allows…

Monte Carlo methods represent the "de facto" standard for approximating complicated integrals involving multidimensional target distributions. In order to generate random realizations from the target distribution, Monte Carlo techniques use…

Computation · Statistics 2022-01-21 L. Martino , V. Elvira , D. Luengo , J. Corander

Importance sampling has been known as a powerful tool to reduce the variance of Monte Carlo estimator for rare event simulation. Based on the criterion of minimizing the variance of Monte Carlo estimator within a parametric family, we…

Methodology · Statistics 2013-02-11 Cheng-Der Fuh , Huei-Wen Teng , Ren-Her Wang

For complex latent variable models, the likelihood function is not available in closed form. In this context, a popular method to perform parameter estimation is Importance Weighted Variational Inference. It essentially maximizes the…

Statistics Theory · Mathematics 2025-01-16 Badr-Eddine Cherief-Abdellatif , Randal Douc , Arnaud Doucet , Hugo Marival

This paper addresses the problem of Monte Carlo approximation of posterior probability distributions. In particular, we have considered a recently proposed technique known as population Monte Carlo (PMC), which is based on an iterative…

Computation · Statistics 2016-06-03 Eugenia Koblents , Joaquín Míguez

In solving simulation-based stochastic root-finding or optimization problems that involve rare events, such as in extreme quantile estimation, running crude Monte Carlo can be prohibitively inefficient. To address this issue, importance…

Methodology · Statistics 2021-02-23 Shengyi He , Guangxin Jiang , Henry Lam , Michael C. Fu

Simulated tempering (ST) is an established Markov chain Monte Carlo (MCMC) method for sampling from a multimodal density $\pi(\theta)$. Typically, ST involves introducing an auxiliary variable $k$ taking values in a finite subset of $[0,1]$…

Computation · Statistics 2008-11-03 Robert B. Gramacy , Richard J. Samworth , Ruth King

Adaptive Monte Carlo methods are very efficient techniques designed to tune simulation estimators on-line. In this work, we present an alternative to stochastic approximation to tune the optimal change of measure in the context of…

Probability · Mathematics 2009-10-23 Benjamin Jourdain , Jérôme Lelong

Improving efficiency of importance sampler is at the center of research in Monte Carlo methods. While adaptive approach is usually difficult within the Markov Chain Monte Carlo framework, the counterpart in importance sampling can be…

Methodology · Statistics 2007-12-11 Heng Lian

Importance sampling is a popular variance reduction method for Monte Carlo estimation, where a notorious question is how to design good proposal distributions. While in most cases optimal (zero-variance) estimators are theoretically…

Statistics Theory · Mathematics 2021-02-22 Carsten Hartmann , Lorenz Richter

We propose an adaptive importance sampling scheme for Gaussian approximations of intractable posteriors. Optimization-based approximations like variational inference can be too inaccurate while existing Monte Carlo methods can be too slow.…

Computation · Statistics 2025-02-04 Willem van den Boom , Andrea Cremaschi , Alexandre H. Thiery

In this review, we address the use of Monte Carlo methods for approximating definite integrals of the form $Z = \int L(x) d P(x)$, where $L$ is a target function (often a likelihood) and $P$ a finite measure. We present vertical-likelihood…

Computation · Statistics 2015-06-24 Nicholas G. Polson , James G. Scott

Importance sampling has become an important tool for the computation of tail-based risk measures. Since such quantities are often determined mainly by rare events standard Monte Carlo can be inefficient and importance sampling provides a…

Probability · Mathematics 2013-06-29 Pierre Nyquist

Importance sampling Monte-Carlo methods are widely used for the approximation of expectations with respect to partially known probability measures. In this paper we study a deterministic version of such an estimator based on quasi-Monte…

Computation · Statistics 2024-12-20 Josef Dick , Daniel Rudolf , Houying Zhu

Population Monte Carlo (PMC) sampling methods are powerful tools for approximating distributions of static unknowns given a set of observations. These methods are iterative in nature: at each step they generate samples from a proposal…

Computation · Statistics 2022-01-17 Víctor Elvira , Luca Martino , David Luengo , Mónica F. Bugallo
‹ Prev 1 2 3 10 Next ›