paper-with-me

Papers

Enhanced gradient-based MCMC in discrete spaces

2022-07-29 · Benjamin Rhodes, Michael Gutmann

The recent introduction of gradient-based MCMC for discrete spaces holds great promise, and comes with the tantalising possibility of new discrete counterparts to celebrated continuous methods such as MALA and HMC. Towards this goal, we introduce several discrete Metropolis-Hastings samplers that are conceptually-inspired by MALA, and demonstrate their strong empirical performance across a range of challenging sampling problems in Bayesian inference and energy-based modelling. Methodologically, we identify why discrete analogues to preconditioned MALA are generally intractable, motivating us to introduce a new kind of preconditioning based on auxiliary variables and the `Gaussian integral trick'.

📄 PDF Abstract BibTeX arXiv:2208.00040

Code (0)

등록된 구현이 없습니다.

Tasks

Bayesian Inference

Similar Papers 제목 키워드 기반

Near-Optimal MIMO Detection Using Gradient-Based MCMC in Discrete Spaces

2024-07-08 · Xingyu Zhou, Le Liang, Jing Zhang, Chao-Kai Wen 외

The discrete nature of transmitted symbols poses challenges for achieving optimal detection in multiple-input multiple-output (MIMO) systems associated with a large number of antennas. Recently, the combination of two po…

Discrete Langevin Sampler via Wasserstein Gradient Flow

2022-06-29 · Haoran Sun, Hanjun Dai, Bo Dai, Haomin Zhou 외

It is known that gradient-based MCMC samplers for continuous spaces, such as Langevin Monte Carlo (LMC), can be derived as particle versions of a gradient flow that minimizes KL divergence on a Wasserstein manifold. The …

Large-Scale Stochastic Sampling from the Probability Simplex

2018-06-19 · NeurIPS 2018 12 · Jack Baker, Paul Fearnhead, Emily B. Fox, Christopher Nemeth

Stochastic gradient Markov chain Monte Carlo (SGMCMC) has become a popular method for scalable Bayesian inference. These methods are based on sampling a discrete-time approximation to a continuous time process, such as t…

Bayesian InferenceTopic Models

Evolutionary MCMC Sampling and Optimization in Discrete Spaces

2003-08-21 · Proceedings of the Twentieth International Conference on International Conference on Machine Learning 2003 8 · Malcolm J A Strens

The links between genetic algorithms and population-based Markov Chain Monte Carlo (MCMC) methods are explored. Genetic algorithms (GAs) are well-known for their capability to optimize functions of discretevalued va…

Bayesian InferenceDiagnosticvalid

Sampling in Combinatorial Spaces with SurVAE Flow Augmented MCMC

2021-02-04 · Priyank Jaini, Didrik Nielsen, Max Welling

Hybrid Monte Carlo is a powerful Markov Chain Monte Carlo method for sampling from complex continuous distributions. However, a major limitation of HMC is its inability to be applied to discrete domains due to the lack o…