Griffiths 2011 - Latent Feature Models and the Finite Beta-Bernoulli Prior

Summary

A latent feature model represents each object by , a binary pattern times feature values . The IBP is a prior on derived from a finite model , whose expected number of ones is bounded by independent of .

Main Content

Latent feature models (Sec. 3). Object has latent vector ; properties are generated from . With (Hadamard product), is a binary matrix with iff object has feature , and holds feature values (continuous as in sparse PCA, or discrete). Dense models (PCA, cooperative vector quantisation) set all of to 1. The prior is ; focus on because it fixes the effective dimensionality. Desiderata: objects exchangeable; tractable inference; method: finite model, then .

Finite beta-Bernoulli feature model (Eq. 9)

independently across and . The choice gives and is what makes the limit work (relaxed to in the two-parameter IBP).

Marginal of (Eq. 10)

Integrating out by beta-binomial conjugacy,

It is exchangeable in rows (depends only on the column counts ).

Sparsity bound (Eq. 11)

, hence for all , and the limit is .

Proof: ; sum over rows and columns.

Examples

Expected ones for

, i.e. five features per object on average, regardless of the (arbitrarily large) - the model is sparse by construction.

Connections

Compare to continuous latent factors: Factor Analysis and PPCA. The CRP-analogue limit argument: Griffiths 2011 - Infinite Mixtures and the CRP Review.

See Also

Griffiths 2011 - The Indian Buffet Process - Overview