English
Related papers

Related papers: Generalizing self-normalized importance sampling w…

200 papers

The sampling of probability distributions specified up to a normalization constant is an important problem in both machine learning and statistical mechanics. While classical stochastic sampling methods such as Markov Chain Monte Carlo…

Machine Learning · Statistics 2020-10-27 Hao Wu , Jonas Köhler , Frank Noé

Adaptive importance sampling (AIS) algorithms are widely used to approximate expectations with respect to complicated target probability distributions. When the target has heavy tails, existing AIS algorithms can provide inconsistent…

Computation · Statistics 2023-10-26 Thomas Guilmeau , Nicola Branchini , Emilie Chouzenoux , Víctor Elvira

Surrogates in lieu of expensive-to-evaluate performance functions can accelerate the reliability analysis greatly. This paper proposes a new two-stage framework for surrogate-aided reliability analysis named Surrogates for Importance…

Other Statistics · Statistics 2020-01-29 Wang-Sheng Liu , Sai Hung Cheung , Wen-Jun Cao

Adaptive importance sampling is a powerful tool to sample from complicated target densities, but its success depends sensitively on the initial proposal density. An algorithm is presented to automatically perform the initialization using…

Computation · Statistics 2013-05-01 Frederik Beaujean , Allen Caldwell

This paper introduces Adaptive Mixture Importance Sampling (AMIS) as a novel approach for optimizing key performance indicators (KPIs) in large-scale recommender systems, such as online ad auctions. Traditional importance sampling (IS)…

Machine Learning · Computer Science 2024-09-23 Yimeng Jia , Kaushal Paneri , Rong Huang , Kailash Singh Maurya , Pavan Mallapragada , Yifan Shi

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

Probability density function estimation with weighted samples is the main foundation of all adaptive importance sampling algorithms. Classically, a target distribution is approximated either by a non-parametric model or within a parametric…

Machine Learning · Computer Science 2023-10-16 Julien Demange-Chryst , François Bachoc , Jérôme Morio , Timothé Krauth

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…

Gaussian Process Latent Variable Models (GPLVMs) have become increasingly popular for unsupervised tasks such as dimensionality reduction and missing data recovery due to their flexibility and non-linear nature. An importance-weighted…

Machine Learning · Computer Science 2026-03-10 Jian Xu , Shian Du , Junmei Yang , Qianli Ma , Delu Zeng , John Paisley

We introduce a theoretical and practical framework for efficient importance sampling of mini-batch samples for gradient estimation from single and multiple probability distributions. To handle noisy gradients, our framework dynamically…

Machine Learning · Computer Science 2025-01-29 Corentin Salaün , Xingchang Huang , Iliyan Georgiev , Niloy J. Mitra , Gurprit Singh

We consider the sample efficient estimation of failure probabilities from expensive oracle evaluations of a limit state function via importance sampling (IS). In contrast to conventional ``two stage'' approaches, which first train a…

Computation · Statistics 2026-04-10 Ashwin Renganathan , Annie S. Booth

We consider importance sampling (IS) type weighted estimators based on Markov chain Monte Carlo (MCMC) targeting an approximate marginal of the target distribution. In the context of Bayesian latent variable models, the MCMC typically…

Computation · Statistics 2021-03-22 Matti Vihola , Jouni Helske , Jordan Franks

We propose a new sampling algorithm combining two quite powerful ideas in the Markov chain Monte Carlo literature -- adaptive Metropolis sampler and two-stage Metropolis-Hastings sampler. The proposed sampling method will be particularly…

Computation · Statistics 2021-01-05 Anirban Mondal , Kai Yin , Abhijit Mandal

The Integrated Nested Laplace Approximation (INLA) is a deterministic approach to Bayesian inference on latent Gaussian models (LGMs) and focuses on fast and accurate approximation of posterior marginals for the parameters in the models.…

Computation · Statistics 2021-03-05 Martin Outzen Berild , Sara Martino , Virgilio Gómez-Rubio , Håvard Rue

Some classical uncertainty quantification problems require the estimation of multiple expectations. Estimating all of them accurately is crucial and can have a major impact on the analysis to perform, and standard existing Monte Carlo…

Methodology · Statistics 2022-12-02 Julien Demange-Chryst , François Bachoc , Jérôme Morio

In recent years, sequential importance sampling (SIS) has been well developed for sampling contingency tables with linear constraints. In this paper, we apply SIS procedure to 2-dimensional Ising models, which give observations of 0-1…

Computation · Statistics 2014-10-17 Jing Xi , Seth Sullivant

Importance sampling is a widely used technique to estimate properties of a distribution. This paper investigates trading-off some bias for variance by adaptively winsorizing the importance sampling estimator. The novel winsorizing…

Computation · Statistics 2021-02-10 Paulo Orenstein

Importance sampling is often used in machine learning when training and testing data come from different distributions. In this paper we propose a new variant of importance sampling that can reduce the variance of importance sampling-based…

Machine Learning · Computer Science 2016-11-11 Philip S. Thomas , Emma Brunskill

Differentiable annealed importance sampling (DAIS), proposed by Geffner & Domke (2021) and Zhang et al. (2021), allows optimizing over the initial distribution of AIS. In this paper, we show that, in the limit of many transitions, DAIS…

Machine Learning · Statistics 2024-08-12 Johannes Zenn , Robert Bamler

Optimization problems with the objective function in the form of weighted sum and linear equality constraints are considered. Given that the number of local cost functions can be large as well as the number of constraints, a stochastic…

Optimization and Control · Mathematics 2026-05-26 Nataša Krejić , Nataša Krklec Jerinkić , Sanja Rapajić , Luka Rutešić