SearcharxivSearch

arXiv subjects

Carlo Vicentini

Publications and source records attributed to Carlo Vicentini.

2 recordsLinked to original sources

Prior selection for the precision parameter of Dirichlet Process Mixtures

Consider a Dirichlet process mixture model (DPM) with random precision parameter $\alpha$, inducing $K_n$ clusters over $n$ observations through its latent random partition. Our goal is to specify the prior distribution $p\left(\alpha\mid\boldsymbol{\eta}\right)$, including its fixed parameter vector $\boldsymbol{\eta}$, in a way that is meaningful. Existing approaches can be broadly categorised into three groups. Those in the first group depend on the sample size $n$, and often rely on the linkage between $p\left(\alpha\mid\boldsymbol{\eta}\right)$ and $p\left(K_n\right)$ to draw conclusions on how to best choose $\boldsymbol{\eta}$ to reflect one's prior knowledge of $K_{n}$; we call them sample-size-dependent. Those in the second and third group consist instead of using quasi-degenerate or improper priors, respectively. In this article, we show how all three methods have limitations, especially for large $n$. Then we propose an alternative methodology which does not depend on $K_n$ or on the size of the available sample, but rather on the relationship between the largest stick lengths in the stick-breaking construction of the DPM; and which reflects those prior beliefs in $p\left(\alpha\mid\boldsymbol{\eta}\right)$. We conclude with an example where existing sample-size-dependent approaches fail, while our sample-size-independent approach continues to be feasible.

stat.ME

The transcoding sampler for stick-breaking inferences on Dirichlet process mixtures

Dirichlet process mixture models suffer from slow mixing of the MCMC posterior chain produced by stick-breaking Gibbs samplers, as opposed to collapsed Gibbs samplers based on the Polya urn representation which have shorter integrated autocorrelation time (IAT). We study how cluster membership information is encoded under the two aforementioned samplers, and we introduce the transcoding algorithm to switch between encodings. We also develop the transcoding sampler, which consists of undertaking posterior partition inference with any high-efficiency sampler, such as collapsed Gibbs, and to subsequently transcode it to the stick-breaking representation via the transcoding algorithm, thereby allowing inference on all stick-breaking parameters of interest while retaining the shorter IAT of the high-efficiency sampler. The transcoding sampler is substantially simpler to implement than the slice sampler, it can inherit the shorter IAT of collapsed Gibbs samplers and it can also achieve zero IAT when paired with a posterior partition sampler that is i.i.d., such as the sequential importance sampler.

stat.ME