English
Related papers

Related papers: Heretical Multiple Importance Sampling

200 papers

Importance sampling is a popular method for efficient computation of various properties of a distribution such as probabilities, expectations, quantiles etc. The output of an importance sampling algorithm can be represented as a weighted…

Probability · Mathematics 2016-04-18 Henrik Hult , Pierre Nyquist

Acceptance-rejection (AR), Independent Metropolis Hastings (IMH) or importance sampling (IS) Monte Carlo (MC) simulation algorithms all involve computing ratios of probability density functions (pdfs). On the other hand, classifiers…

Methodology · Statistics 2023-09-11 Elouan Argouarc'h , François Desbouvries

A significant part of MCMC methods can be considered as the Metropolis-Hastings (MH) algorithm with different proposal distributions. From this point of view, the problem of constructing a sampler can be reduced to the question - how to…

Machine Learning · Statistics 2019-06-11 Kirill Neklyudov , Evgenii Egorov , Pavel Shvechikov , Dmitry Vetrov

Multiple imputation (MI) has been widely applied to missing value problems in biomedical, social and econometric research, in order to avoid improper inference in the downstream data analysis. In the presence of high-dimensional data,…

Methodology · Statistics 2023-05-04 Zhiqi Bu , Zongyu Dai , Yiliang Zhang , Qi Long

Importance weighting is a general way to adjust Monte Carlo integration to account for draws from the wrong distribution, but the resulting estimate can be highly variable when the importance ratios have a heavy right tail. This routinely…

Computation · Statistics 2024-04-12 Aki Vehtari , Daniel Simpson , Andrew Gelman , Yuling Yao , Jonah Gabry

The importance sampling (IS) method lies at the core of many Monte Carlo-based techniques. IS allows the approximation of a target probability distribution by drawing samples from a proposal (or importance) distribution, different from the…

Applications · Statistics 2017-04-21 Manuel A. Vázquez , Joaquín Míguez

Can we make Bayesian posterior MCMC sampling more efficient when faced with very large datasets? We argue that computing the likelihood for N datapoints in the Metropolis-Hastings (MH) test to reach a single binary decision is…

Machine Learning · Computer Science 2014-02-17 Anoop Korattikara , Yutian Chen , Max Welling

Bayesian inference involves two main computational challenges. First, in estimating the parameters of some model for the data, the posterior distribution may well be highly multi-modal: a regime in which the convergence to stationarity of…

Instrumentation and Methods for Astrophysics · Physics 2019-12-10 F. Feroz , M. P. Hobson , E. Cameron , A. N. Pettitt

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

While it's always possible to compute a variational approximation to a posterior distribution, it can be difficult to discover problems with this approximation. We propose two diagnostic algorithms to alleviate this problem. The…

Machine Learning · Statistics 2018-10-15 Yuling Yao , Aki Vehtari , Daniel Simpson , Andrew Gelman

Pseudo-marginal Metropolis-Hastings (pmMH) is a powerful method for Bayesian inference in models where the posterior distribution is analytical intractable or computationally costly to evaluate directly. It operates by introducing…

Computation · Statistics 2016-08-06 Johan Dahlin , Fredrik Lindsten , Joel Kronander , Thomas B. Schön

This paper presents an improved implicit sampling method for hierarchical Bayesian inverse problems. A widely used approach for sampling posterior distribution is based on Markov chain Monte Carlo (MCMC). However, the samples generated by…

Numerical Analysis · Mathematics 2018-11-27 Xiaoyan Song , Lijian Jiang , Guanghui Zheng

Sequential directional importance sampling (SDIS) is an efficient adaptive simulation method for estimating failure probabilities. It expresses the failure probability as the product of a group of integrals that are easy to estimate,…

Methodology · Statistics 2024-10-31 Kai Chenga , Iason Papaioannou , Daniel Straub

The hierarchical Dirichlet process (HDP) has become an important Bayesian nonparametric model for grouped data, such as document collections. The HDP is used to construct a flexible mixed-membership model where the number of components is…

Machine Learning · Statistics 2012-01-10 Chong Wang , David M. Blei

This paper deals with the Monte-Carlo methods for evaluating expectations of functionals of solutions to McKean-Vlasov Stochastic Differential Equations (MV-SDE) with drifts of super-linear growth. We assume that the MV-SDE is approximated…

Probability · Mathematics 2018-10-15 Goncalo dos Reis , Greig Smith , Peter Tankov

The substantial memory demands of pre-training and fine-tuning large language models (LLMs) require memory-efficient optimization algorithms. One promising approach is layer-wise optimization, which treats each transformer block as a single…

Machine Learning · Computer Science 2026-01-15 Yuxi Liu , Renjia Deng , Yutong He , Xue Wang , Tao Yao , Kun Yuan

Importance sampling is a promising variance reduction technique for Monte Carlo simulation based derivative pricing. Existing importance sampling methods are based on a parametric choice of the proposal. This article proposes an algorithm…

Applications · Statistics 2009-04-14 Jan C. Neddermeyer

Diffusion models (DMs) have proven to be effective in modeling high-dimensional distributions, leading to their widespread adoption for representing complex priors in Bayesian inverse problems (BIPs). However, current DM-based posterior…

Machine Learning · Computer Science 2025-06-06 Haoxuan Chen , Yinuo Ren , Martin Renqiang Min , Lexing Ying , Zachary Izzo

Sequential importance sampling algorithms have been defined to estimate likelihoods in models of ancestral population processes. However, these algorithms are based on features of the models with constant population size, and become…

Statistics Theory · Mathematics 2016-03-24 Coralie Merle , Raphaël Leblois , François Rousset , Pierre Pudlo

Importance sampling (IS) is an important technique to reduce the estimation variance in Monte Carlo simulations. In many practical problems, however, the use of IS method may result in unbounded variance, and thus fail to provide reliable…

Computation · Statistics 2019-02-26 Tengchao Yu , Linjun Lu , Jinglai Li