BRAGA

02 Writing02-02 Notes02-02-460

Generative Model

Published 16 Apr 20262 min read
Contents
  1. 01Deep Breakdown
  2. 02Flowchart
z∼N(0,I),x∣z∼N(Wz+μ,σ2I)z \sim \mathcal{N}(0, I), \quad x \mid z \sim \mathcal{N}(Wz + \mu, \sigma^2 I)
(1)

We are working on the generative model of Probabilistic PCA, where a low-dimensional latent vector zz is drawn from a standard Gaussian and the observed vector xx is generated from a linear transformation plus isotropic Gaussian noise. The canonical formulas are

z∼N(0,I)z \sim \mathcal{N}(0, I)
(2)

and

x∣z∼N(Wz+μ,σ2I),x \mid z \sim \mathcal{N}(Wz + \mu, \sigma^2 I),
(3)

under the assumptions of linear latent structure, Gaussian latent factors, and isotropic observation noise.

Deep Breakdown

The generative model of Probabilistic PCA, PPCA, is the probabilistic foundation behind a PCA-like dimensionality reduction method. Instead of describing PCA only as a geometric projection or matrix factorization, PPCA says that the observed data is generated by an underlying random process involving hidden latent variables.

The model works in two stages:

  1. Draw a low-dimensional latent variable zz from a standard multivariate Gaussian.

Transform zz linearly into the observed space and add Gaussian noise to produce xx.

The model is:

z∼N(0,I)z \sim \mathcal{N}(0, I)
(4)
x∣z∼N(Wz+μ,σ2I)x \mid z \sim \mathcal{N}(Wz + \mu, \sigma^2 I)
(5)

Inputs:

  • latent dimension kk,
  • loading matrix WW,
  • mean vector μ\mu,
  • isotropic noise variance σ2\sigma^2.

Output:

  • a distribution for the observed data vector xx,
  • and, conditionally, a posterior distribution over latent variables for each observed point.

Why this matters in DA/DS:

  • it turns PCA into a likelihood-based latent variable model,
  • it supports principled handling of uncertainty,
  • it creates a bridge between classical PCA and probabilistic models,
  • it provides a generative story for how observed variables arise from hidden factors,
  • it is a stepping stone toward factor analysis, mixture models, and variational latent-variable methods.

In standard PCA, we often say: “find the best low-dimensional linear subspace.” In PPCA, we say: “assume the data was generated from a lower-dimensional Gaussian latent variable through a linear mapping plus isotropic noise.” That difference is important because PPCA gives us:

  • a full probability model,
  • a marginal likelihood for the observed data,
  • posterior distributions over latent factors,
  • a clear interpretation of noise.

This object links directly to:

  • standard PCA, because PPCA approaches PCA in the maximum-likelihood sense,
  • latent variables, because zz is hidden and must be inferred from xx,
  • dimensionality reduction, because k<dk < d creates a compressed representation,
  • generative modeling, because the model can simulate new observations.

Flowchart

Choose latentdimension kSample latentvector z ~ N(0, I)Apply linear mapWzAdd meanvector μAdd isotropicGaussian noiseε ~ N(0, σ²I)Generateobserved vectorx = Wz + μ + εObtaindistribution x | z~ N(Wz + μ, σ²I)Infer latentstructure fromobserved dataUse forprobabilisticdimensionalityreductionConnect to PCA,likelihood, anduncertainty

#machine-learning#machine-learning-algorithms#probabilistic-pca-ppca

Keyboard shortcuts

Single keys, ignored while typing in a field or with Cmd, Ctrl or Alt held.

0
Home
1 2 3 4
Work, Writing, Tools, About
j / k
Next / previous section on this page
n / p
Next / previous project or essay
u
Up one level
l
Deutsch
t
Light or dark theme
?
This list
Esc
Close