Results 1 to 10 of about 2,808,540 (284)
The particle Gibbs sampler is a Markov chain Monte Carlo (MCMC) algorithm to sample from the full posterior distribution of a state-space model. It does so by executing Gibbs sampling steps on an extended target distribution defined on the space of the auxiliary variables generated by an interacting particle system.
Nicolas Chopin, Sumeetpal S Singh
exaly +6 more sources
Diffusive Gibbs Sampling [PDF]
The inadequate mixing of conventional Markov Chain Monte Carlo (MCMC) methods for multi-modal distributions presents a significant challenge in practical applications such as Bayesian inference and molecular dynamics. Addressing this, we propose Diffusive Gibbs Sampling (DiGS), an innovative family of sampling methods designed for effective sampling ...
Wenlin Chen +4 more
openaire +5 more sources
Recycling Gibbs sampling [PDF]
Publication in the conference proceedings of EUSIPCO, Kos island, Greece ...
Luca Martino +2 more
openaire +4 more sources
Accepted for oral presentation at NeurIPS ...
Harrison, PMC +7 more
openaire +5 more sources
The Gibbs sampler is one of the most popular algorithms for inference in statistical models. In this paper, we introduce a herding variant of this algorithm, called herded Gibbs, that is entirely deterministic. We prove that herded Gibbs has an $O(1/T)$ convergence rate for models with independent variables and for fully connected probabilistic ...
Bornn, L. +5 more
openaire +8 more sources
Evolution with recombination as Gibbs sampling
This work presents a population genetic model of evolution, which includes haploid selection, mutation, recombination, and drift. The mutation-selection equilibrium can be expressed exactly in closed form for arbitrary fitness functions without resorting to diffusion approximations.
J.M. Poulton (Jenny) +2 more
openaire +2 more sources
Continuous Herded Gibbs Sampling
Herding is a technique to sequentially generate deterministic samples from a probability distribution. In this work, we propose a continuous herded Gibbs sampler that combines kernel herding on continuous densities with the Gibbs sampling idea. Our algorithm allows for deterministically sampling from high-dimensional multivariate probability densities,
Wolf, Laura M., Baum, Marcus
openaire +5 more sources
Gibbs sampling is a Markov Chain Monte Carlo (MCMC) method often used in Bayesian learning. MCMC methods can be difficult to deploy on parallel and distributed systems due to their inherently sequential nature. We study asynchronous Gibbs sampling, which achieves parallelism by simply ignoring sequential requirements.
Alexander Terenin +2 more
openaire +3 more sources
In some applied scenarios, the availability of complete data is restricted, often due to privacy concerns; only aggregated, robust and inefficient statistics derived from the data are made accessible. These robust statistics are not sufficient, but they demonstrate reduced sensitivity to outliers and offer enhanced data protection due to their higher ...
Luciano, Antoine +2 more
openaire +3 more sources
Gibbs Sampling Subjectively Interesting Tiles [PDF]
The local pattern mining literature has long struggled with the so-called pattern explosion problem: the size of the set of patterns found exceeds the size of the original data. This causes computational problems (enumerating a large set of patterns will inevitably take a substantial amount of time) as well as problems for interpretation and usability (
Anes Bendimerad +4 more
openaire +3 more sources

