Accelerated sampling for the Indian Buffet Process

Finale Doshi-Velez, Zoubin Ghahramani

Abstract

We often seek to identify co-occurring hidden features in a set of observations. The Indian Buffet Process (IBP) provides a non-parametric prior on the features present in each observation, but current inference techniques for the IBP often scale poorly. The collapsed Gibbs sampler for the IBP has a running time cubic in the number of observations, and the uncollapsed Gibbs sampler, while linear, is often slow to mix. We present a new linear-time collapsed Gibbs sampler for conjugate likelihood models and demonstrate its efficacy on large real-world datasets.
BibTeX
@inproceedings{doshivelez2009accelerated,
  author = {Finale Doshi-Velez and Zoubin Ghahramani},
  title = {{Accelerated sampling for the Indian Buffet Process}},
  booktitle = {International Conference on Machine Learning},
  year = {2009},
  doi = {10.1145/1553374.1553409},
}

Loading related content...

Figure