A Gibbs Sampler for a Class of Random Convex Polytopes
نویسندگان
چکیده
We present a Gibbs sampler for the Dempster–Shafer (DS) approach to statistical inference categorical distributions. The DS framework extends Bayesian approach, allows in particular use...
منابع مشابه
A Gibbs Sampler for Learning DAGs
We propose a Gibbs sampler for structure learning in directed acyclic graph (DAG) models. The standard Markov chain Monte Carlo algorithms used for learning DAGs are random-walk Metropolis-Hastings samplers. These samplers are guaranteed to converge asymptotically but often mix slowly when exploring the large graph spaces that arise in structure learning. In each step, the sampler we propose dr...
متن کاملPhyloGibbs: A Gibbs Sampler Incorporating Phylogenetic Information
We present a new Gibbs sampler algorithm with the motivation of finding motifs, representing candidate binding sites for transcription factors, in closely related species. Since much conservation here arises not from the existence of functional sites but simply from the lack of sufficient evolutionary divergence between the species, a conventional Gibbs sampler will fail. We compare the effecti...
متن کاملA Gibbs Sampler on the N-simplex
We determine the mixing time of a simple Gibbs sampler on the unit simplex, confirming a conjecture of D. Aldous. The upper bound is based on a two-step coupling, where the first step is a simple contraction argument and the second step is a non-Markovian coupling. We also present a MCMC-based perfect sampling algorithm that is based on our proof and which can be applied to Gibbs samplers that ...
متن کاملA GPU-Based Gibbs Sampler for a Unidimensional IRT Model
Item response theory (IRT) is a popular approach used for addressing large-scale statistical problems in psychometrics as well as in other fields. The fully Bayesian approach for estimating IRT models is usually memory and computationally expensive due to the large number of iterations. This limits the use of the procedure in many applications. In an effort to overcome such restraint, previous ...
متن کاملRandom Polytopes, Convex Bodies, and Approximation
Assume K ⊂ R is a convex body and Xn ⊂ K is a random sample of n uniform, independent points from K. The convex hull of Xn is a convex polytope Kn called random polytope inscribed in K. We are going to investigate various properties of this polytope: for instance how well it approximates K, or how many vertices and facets it has. It turns out that Kn is very close to the so called floating body...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 2021
ISSN: ['0162-1459', '1537-274X', '2326-6228', '1522-5445']
DOI: https://doi.org/10.1080/01621459.2021.1881523