Definition
A finite mixture model represents the marginal density of an observable y as a convex combination of K component densities:
p(y∣θ)=k=1∑Kπkf(y∣θk),πk≥0,k=1∑Kπk=1
The component densities f(y∣θk) are typically from a parametric family (Normal, Poisson, etc.); the mixing weights πk and component parameters θ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
- Latent class interpretation: introducing an indicator variable zi∈{1,…,K} such that yi∣zi=k∼f(⋅∣θk) makes the mixture a hierarchical model amenable to Expectation-Maximization (EM) and Gibbs sampling.
- Label switching: mixture posteriors are invariant to permutation of component labels — identifiability requires constraints (e.g., ordering means μ1<μ2<⋯).
- Unbounded likelihood: without constraints on component variances, the Gaussian mixture likelihood is unbounded; regularisation via priors or minimum-variance constraints is needed.
- Number of components: K can be fixed (finite mixture) or random (Dirichlet Process Mixture, which allows K→∞).
How It Works
EM algorithm: treats zi as missing data. E-step: compute rik=πkf(yi∣θk)/∑jπjf(yi∣θj) (posterior class probabilities). M-step: update π^k=n−1∑irik and component parameters from weighted likelihoods.
Gibbs sampler: draw class indicators zi∼Categorical(ri1,…,riK), then draw (π1,…,π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