Results 11 to 20 of about 181,021 (277)
We consider various versions of adaptive Gibbs and Metropolis- within-Gibbs samplers, which update their selection probabilities (and perhaps also their proposal distributions) on the fly during a run, by learning as they go in an attempt to optimise the algorithm.
Latuszynski, Krzysztof +1 more
core +5 more sources
Facilitating the Gibbs Sampler: The Gibbs Stopper and the Griddy-Gibbs Sampler
Abstract The article briefly reviews the history, literature, and form of the Gibbs sampler. An importance sampling device is proposed for converting the output of the Gibbs sampler to a sample from the exact posterior. This Gibbs stopper technique is also useful for assessing convergence of the Gibbs sampler for moderate sized problems. Also presented
Ritter, Christian, Tanner, Martin A.
openaire +2 more sources
A partially collapsed Gibbs sampler for Bayesian quantile regression [PDF]
We introduce a set of new Gibbs sampler for Bayesian analysis of quantile re-gression model. The new algorithm, which partially collapsing an ordinary Gibbs sampler, is called Partially Collapsed Gibbs (PCG) sampler.
Yu, K, Reed, C
core +5 more sources
Adapting the Gibbs sampler [PDF]
In the present thesis, we close a methodological gap of optimising the basic Markov Chain Monte Carlo algorithms. Similarly to the straightforward and computationally efficient optimisation criteria for the Metropolis algorithm acceptance rate (and, equivalently, proposal scale), we develop criteria for optimising the selection probabilities of the ...
Chimisov, Cyril
openaire +3 more sources
The Gibbs Centroid Sampler [PDF]
The Gibbs Centroid Sampler is a software package designed for locating conserved elements in biopolymer sequences. The Gibbs Centroid Sampler reports a centroid alignment, i.e. an alignment that has the minimum total distance to the set of samples chosen from the a posteriori probability distribution of transcription factor binding-site alignments.
William A. Thompson +4 more
openaire +2 more sources
Explaining the Gibbs Sampler [PDF]
16 pages, 1 article*Explaining the Gibbs Sampler* (Casella, George; George, Edward I.) 16 ...
Casella, George +4 more
core +6 more sources
Variable Selection Using aModified Gibbs Sampler Algorithm with Application on Rock Strength Dataset
Variable selection is an essential and necessary task in the statistical modeling field. Several studies have triedto develop and standardize the process of variable selection, but it isdifficultto do so.
Ghadeer J. M. Mahdi, Othman M. Salih
doaj +1 more source
Gibbs sampling, as a model learning method, is known to produce the most accurate results available in a variety of domains, and is a de facto standard in these domains. Yet, it is also well known that Gibbs random walks usually have bottlenecks, sometimes termed "local maxima", and thus samplers often return suboptimal solutions.
Mark Kozdoba, Shie Mannor
openaire +3 more sources
Improved techniques for sampling complex pedigrees with the Gibbs sampler
Markov chain Monte Carlo (MCMC) methods have been widely used to overcome computational problems in linkage and segregation analyses. Many variants of this approach exist and are practiced; among the most popular is the Gibbs sampler.
Fernando Rohan L +2 more
doaj +1 more source

