Mixture Model

mixture-modellatent-classem-algorithmbayesianclusteringdensity-estimation

Definition

A finite mixture model represents the marginal density of an observable yy as a convex combination of KK component densities:

p(yθ)=k=1Kπkf(yθk),πk0,k=1Kπk=1p(y|\theta) = \sum_{k=1}^K \pi_k \, f(y|\theta_k), \qquad \pi_k \geq 0, \quad \sum_{k=1}^K \pi_k = 1

The component densities f(yθk)f(y|\theta_k) are typically from a parametric family (Normal, Poisson, etc.); the mixing weights πk\pi_k and component parameters θk\theta_k are unknown. Mixture models arise as models of population heterogeneity, as semiparametric approximations to arbitrary densities, and as data-generating processes in latent-class analysis.

Key Ideas

How It Works

EM algorithm: treats ziz_i as missing data. E-step: compute rik=πkf(yiθk)/jπjf(yiθj)r_{ik} = \pi_k f(y_i|\theta_k) / \sum_j \pi_j f(y_i|\theta_j) (posterior class probabilities). M-step: update π^k=n1irik\hat\pi_k = n^{-1}\sum_i r_{ik} and component parameters from weighted likelihoods.

Gibbs sampler: draw class indicators ziCategorical(ri1,,riK)z_i \sim \text{Categorical}(r_{i1},\ldots,r_{iK}), then draw (π1,,πK)(\pi_1,\ldots,\pi_K) from Dirichlet conjugate, and component parameters from conjugate posteriors conditional on class membership.

Why It Matters

Mixture models are the foundational tool for density estimation, clustering, and modelling population heterogeneity across econometrics, statistics, and machine learning.

Related