liveBook · Manning

Principal component

As explained in Math and Architectures of Deep Learning

The projection values of data onto a principal axis in PCA, representing coordinates along that direction.

A principal component is a data point’s coordinate after projection onto a principal axis. The first principal axis is the covariance matrix eigenvector with the largest eigenvalue, because it captures the direction of maximum variance. Components along later orthogonal axes capture successively smaller variance. section 4.4.1

For a unit direction l̂ and data vector x, the projected coordinate is l̂ᵀx. Collecting these coordinates gives a lower-dimensional representation. Discarding coordinates associated with small eigenvalues removes directions with little spread and usually little information. section 4.4.1 section 4.4.2

Principal components connect geometric structure, storage, and computation:

  • Represent the dominant directions of a dataset; their variances equal the corresponding covariance-matrix eigenvalues. section 4.4.1
  • Reduce dimensionality by retaining components with the largest principal values and removing small-variance directions. section 4.4.2
  • Support compression by storing projections onto only the first few principal axes. section 4.4.5
  • Represent topics in latent semantic analysis, where document-vector directions with high variance expose correlated vocabulary. section 4.6.2

Correlated document features

Construct 500 document vectors with x₁ approximately twice x₀ and x₂ varying only slightly. SVD finds a dominant component along the correlated x₀–x₁ direction; the small third singular value indicates that the x₂ variation can be ignored. section 4.6.4

Figure 4.3 Dimensionality reduction via PCA. Original data points are shown with filled little circles, and hollow circles represent lower-dimensional representations.

(a) Dimensionality reduction from 2D to 1D

(b) Dimensionality reduction from 3D to 2D

Compare 2D-to-1D and 3D-to-2D projections to see how dominant principal components preserve structure while removing small orthogonal variations. section 4.4.2

How Math and Architectures of Deep Learning covers it

How deep it goes
Explains variance maximization, covariance eigenvectors, projections, dimensionality reduction, compression, and SVD computation.
Examples
Uses geometric 2D and 3D projections, compressed datasets, correlated document terms, and a 500-vector PyTorch SVD experiment.
What it assumes
Assumes covariance matrices, eigenvectors, eigenvalues, matrix multiplication, and prior mean subtraction for the SVD formulation.
What you can do after
Apply it via PCA or SVD to project data, retain dominant coordinates, reduce dimensions, and identify high-variance topics.
How it connects
Connects PCA with covariance matrices, eigenvalues, eigenvectors, SVD, dimensionality reduction, data compression, and latent semantic analysis.

Also explained in

Compare how 5 books explain principal component →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Math and Architectures of Deep Learning. The section links point to the parts of the book it draws on.