paper-with-me

Papers

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 variables, but the MCMC interpretation allows GA variants to be used for sampling discrete spaces (e.g. in Bayesian inference for machine learning). The GA crossover and mutation operators are modi ed to provide valid MCMC samples, and a new \exclusive-or" operator is introduced as an alternative way to recombine population members. This is shown to improve sampling performance in a medical diagnostic problem domain. The sampler can also be used within simulated annealing to provide a global optimizer that is similar to a GA in structure but has known convergence properties.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Bayesian InferenceDiagnosticvalid

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…

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. Towar…

Bayesian Inference

A Parallel Evolutionary Multiple-Try Metropolis Markov Chain Monte Carlo Algorithm for Sampling Spatial Partitions

2020-07-22 · Wendy K. Tam Cho, Yan Y. Liu

We develop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampling spatial partitions that lie within a large and complex spatial state space. Our algorithm combines the advantages of evolutionary algorit…

Evolutionary Algorithms

LSB: Local Self-Balancing MCMC in Discrete Spaces

2021-09-08 · NeurIPS 2021 12 · Emanuele Sansone

We present the Local Self-Balancing sampler (LSB), a local Markov Chain Monte Carlo (MCMC) method for sampling in purely discrete domains, which is able to autonomously adapt to the target distribution and to reduce the …

Beyond trans-dimensional RJMCMC with a case study in impulsive data modeling

2017-11-09 · Oktay Karakuş, Ercan E. Kuruoğlu, Mustafa A. Altınkaya

Reversible jump Markov chain Monte Carlo (RJMCMC) is a Bayesian model estimation method which has been used for trans-dimensional sampling. In this study, we propose utilization of RJMCMC beyond trans-dimensional samplin…