English
Related papers

Related papers: Hamiltonian Annealed Importance Sampling for parti…

200 papers

This paper is concerned with Bayesian inference when the likelihood is analytically intractable but can be unbiasedly estimated. We propose an annealed importance sampling procedure for estimating expectations with respect to the posterior.…

Methodology · Statistics 2014-02-26 M. -N. Tran , C. Strickland , M. K. Pitt , R. Kohn

The past several years have seen remarkable progress in generative models which produce convincing samples of images and other modalities. A shared component of many powerful generative models is a decoder network, a parametric deep neural…

Machine Learning · Computer Science 2017-06-08 Yuhuai Wu , Yuri Burda , Ruslan Salakhutdinov , Roger Grosse

Gaussian latent variable models are a key class of Bayesian hierarchical models with applications in many fields. Performing Bayesian inference on such models can be challenging as Markov chain Monte Carlo algorithms struggle with the…

Computation · Statistics 2020-11-09 Charles C. Margossian , Aki Vehtari , Daniel Simpson , Raj Agrawal

Simulated annealing - moving from a tractable distribution to a distribution of interest via a sequence of intermediate distributions - has traditionally been used as an inexact method of handling isolated modes in Markov chain samplers.…

Computational Physics · Physics 2007-05-23 Radford M. Neal

Multiple importance sampling estimators are widely used for computing intractable constants due to its reliability and robustness. The celebrated balance heuristic estimator belongs to this class of methods and has proved very successful in…

Computation · Statistics 2019-09-05 Felipe J Medina-Aguayo , Richard G Everitt

Given an unnormalized target distribution we want to obtain approximate samples from it and a tight lower bound on its (log) normalization constant log Z. Annealed Importance Sampling (AIS) with Hamiltonian MCMC is a powerful method that…

Machine Learning · Computer Science 2021-11-02 Tomas Geffner , Justin Domke

We consider estimating the marginal likelihood in settings with independent and identically distributed (i.i.d.) data. We propose estimating the predictive distributions in a sequential factorization of the marginal likelihood in such…

Machine Learning · Statistics 2019-11-19 Scott A. Cameron , Hans C. Eggers , Steve Kroon

A learned generative model often produces biased statistics relative to the underlying data distribution. A standard technique to correct this bias is importance sampling, where samples from the model are weighted by the likelihood ratio…

Machine Learning · Statistics 2019-11-05 Aditya Grover , Jiaming Song , Alekh Agarwal , Kenneth Tran , Ashish Kapoor , Eric Horvitz , Stefano Ermon

Quantum annealing is typically regarded as a tool for combinatorial optimization, but its coherent dynamics also offer potential for machine learning. We present a model that encodes classical data into an Ising Hamiltonian, evolves it on a…

Importance sampling is a popular technique in Bayesian inference: by reweighting samples drawn from a proposal distribution we are able to obtain samples and moment estimates from a Bayesian posterior over latent variables. Recent work,…

Computation · Statistics 2024-06-19 Sam Bowyer , Thomas Heap , Laurence Aitchison

Variational inference is a powerful paradigm for approximate Bayesian inference with a number of appealing properties, including support for model learning and data subsampling. By contrast MCMC methods like Hamiltonian Monte Carlo do not…

Machine Learning · Statistics 2022-07-14 Martin Jankowiak , Du Phan

Recent research has developed several Monte Carlo methods for estimating the normalization constant (partition function) based on the idea of annealing. This means sampling successively from a path of distributions that interpolate between…

Machine Learning · Statistics 2023-10-10 Omar Chehab , Aapo Hyvarinen , Andrej Risteski

For big data analysis, high computational cost for Bayesian methods often limits their applications in practice. In recent years, there have been many attempts to improve computational efficiency of Bayesian inference. Here we propose an…

Computation · Statistics 2017-04-19 Cheng Zhang , Babak Shahbaba , Hongkai Zhao

Several interesting generative learning algorithms involve a complex probability distribution over many random variables, involving intractable normalization constants or latent variable normalization. Some of them may even not have an…

Machine Learning · Computer Science 2014-05-13 Yoshua Bengio , Li Yao , Kyunghyun Cho

Driven by applications in telecommunication networks, we explore the simulation task of estimating rare event probabilities for tandem queues in their steady state. Existing literature has recognized that importance sampling methods can be…

Machine Learning · Computer Science 2025-04-22 Ruoning Zhao , Xinyun Chen

This article presents new methodology for sample-based Bayesian inference when data are partitioned and communication between the parts is expensive, as arises by necessity in the context of "big data" or by choice in order to take…

Methodology · Statistics 2022-11-01 Marc Box

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 investigate the efficiency of a marginal likelihood estimator where the product of the marginal posterior distributions is used as an importance-sampling function. The approach is generally applicable to multi-block parameter vector…

Computation · Statistics 2014-07-08 K. Perrakis , I. Ntzoufras , E. G. Tsionas

Bayesian reasoning in linear mixed-effects models (LMMs) is challenging and often requires advanced sampling techniques like Markov chain Monte Carlo (MCMC). A common approach is to write the model in a probabilistic programming language…

Machine Learning · Computer Science 2025-03-25 Jinlin Lai , Justin Domke , Daniel Sheldon

Probabilistic models based on Restricted Boltzmann Machines (RBMs) imply the evaluation of normalized Boltzmann factors, which in turn require from the evaluation of the partition function Z. The exact evaluation of Z, though, becomes a…

Machine Learning · Computer Science 2020-07-24 Ferran Mazzanti , Enrique Romero
‹ Prev 1 2 3 10 Next ›