English
Related papers

Related papers: Exact slice sampler for Hierarchical Dirichlet Pro…

200 papers

The hierarchical Dirichlet process (HDP) has become an important Bayesian nonparametric model for grouped data, such as document collections. The HDP is used to construct a flexible mixed-membership model where the number of components is…

Machine Learning · Statistics 2012-01-10 Chong Wang , David M. Blei

Posterior computation in hierarchical Dirichlet process (HDP) mixture models is an active area of research in nonparametric Bayes inference of grouped data. Existing literature almost exclusively focuses on the Chinese restaurant franchise…

Computation · Statistics 2024-08-06 Snigdha Das , Yabo Niu , Yang Ni , Bani K. Mallick , Debdeep Pati

In this paper we introduce a new sampling algorithm which has the potential to be adopted as a universal replacement to the Metropolis--Hastings algorithm. It is related to the slice sampler, and motivated by an algorithm which is…

Computation · Statistics 2020-10-19 Yanxin Li , Stephen G. Walker

Slice sampling is a well-established Markov chain Monte Carlo method for (approximate) sampling of target distributions which are only known up to a normalizing constant. The method is based on choosing a new state on a slice, i.e., a…

Computation · Statistics 2025-12-22 Kevin Bitterlich , Daniel Rudolf , Björn Sprungk

Slice sampling is a standard Monte Carlo technique for Dirichlet process (DP)-based models, widely used in posterior simulation. However, formal assessments of the scalability of posterior slice samplers have remained largely unexplored,…

Computation · Statistics 2026-02-03 Beatrice Franzolini , Francesco Gaffi

We consider the problem of drawing samples from posterior distributions formed under a Dirichlet prior and a truncated multinomial likelihood, by which we mean a Multinomial likelihood function where we condition on one or more counts being…

Methodology · Statistics 2012-09-04 Matthew James Johnson , Alan S. Willsky

Time-varying mixture densities occur in many scenarios, for example, the distributions of keywords that appear in publications may evolve from year to year, video frame features associated with multiple targets may evolve in a sequence. Any…

Machine Learning · Statistics 2016-04-19 Cheng Luo , Yang Xiang , Richard Yi Da Xu

We present the \textit{hierarchical Dirichlet scaling process} (HDSP), a Bayesian nonparametric mixed membership model. The HDSP generalizes the hierarchical Dirichlet process (HDP) to model the correlation structure between metadata in the…

Machine Learning · Computer Science 2017-07-10 Dongwoo Kim , Alice Oh

Clustering is one of the most widely used procedures in the analysis of microarray data, for example with the goal of discovering cancer subtypes based on observed heterogeneity of genetic marks between different tissues. It is well-known…

Methodology · Statistics 2009-04-21 Heng Lian

Using the framework of weak Poincar\'e inequalities, we provide a general comparison between Hybrid and Ideal Slice Sampling in terms of their corresponding Dirichlet forms. In particular, under suitable assumptions Hybrid Slice Sampling…

Computation · Statistics 2025-08-25 Sam Power , Daniel Rudolf , Björn Sprungk , Andi Q. Wang

Completely random measures provide a principled approach to creating flexible unsupervised models, where the number of latent features is infinite and the number of features that influence the data grows with the size of the data set. Due…

Machine Learning · Statistics 2020-06-26 Peiyuan Zhu , Alexandre Bouchard-Côté , Trevor Campbell

Dynamically rescaled Hamiltonian Monte Carlo (DRHMC) is introduced as a computationally fast and easily implemented method for performing full Bayesian analysis in hierarchical statistical models. The method relies on introducing a modified…

Computation · Statistics 2018-10-23 Tore Selland Kleppe

We consider the question of Markov chain Monte Carlo sampling from a general stick-breaking Dirichlet process mixture model, with concentration parameter alpha. This paper introduces a Gibbs sampling algorithm that combines the slice…

Computation · Statistics 2014-02-21 David I. Hastie , Silvia Liverani , Sylvia Richardson

The Dirichlet process mixture (DPM) is a ubiquitous, flexible Bayesian nonparametric statistical model. However, full probabilistic inference in this model is analytically intractable, so that computationally intensive techniques such as…

Machine Learning · Statistics 2014-11-05 Yordan P. Raykov , Alexis Boukouvalas , Max A. Little

Probabilistic models are conceptually powerful tools for finding structure in data, but their practical effectiveness is often limited by our ability to perform inference in them. Exact inference is frequently intractable, so approximate…

Computation · Statistics 2014-07-25 Robert Nishihara , Iain Murray , Ryan P. Adams

We propose the supervised hierarchical Dirichlet process (sHDP), a nonparametric generative model for the joint distribution of a group of observations and a response variable directly associated with that whole group. We compare the sHDP…

Machine Learning · Statistics 2014-12-18 Andrew M. Dai , Amos J. Storkey

Elliptical slice sampling is a widely used gradient-free Markov chain Monte Carlo algorithm that is tuning-free and capable of adapting to local characteristics of the target distribution. However, its primary limitation is that sampling…

Computation · Statistics 2026-05-22 Nicholas Marco , Surya T. Tokdar

In this paper, we propose a MCMC algorithm based on elliptical slice sampling with the purpose to improve sampling efficiency. During sampling, a mixture distribution is fitted periodically to previous samples. The components of the mixture…

Computation · Statistics 2019-03-14 Song Li , Geoffrey K. F. Tso

There is much interest in the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) as a natural Bayesian nonparametric extension of the ubiquitous Hidden Markov Model for learning from sequential and time-series data. However, in…

Methodology · Statistics 2012-09-11 Matthew J. Johnson , Alan S. Willsky

Hierarchical clustering is a fundamental task often used to discover meaningful structures in data, such as phylogenetic trees, taxonomies of concepts, subtypes of cancer, and cascades of particle decays in particle physics. Typically…

Data Structures and Algorithms · Computer Science 2020-10-23 Craig S. Greenberg , Sebastian Macaluso , Nicholas Monath , Ji-Ah Lee , Patrick Flaherty , Kyle Cranmer , Andrew McGregor , Andrew McCallum
‹ Prev 1 2 3 10 Next ›