liveBook · Manning

Unit vector

As explained in Math and Architectures of Deep Learning

A vector whose length is exactly 1, used here to restrict the optimization to direction rather than magnitude.

A unit vector has length exactly 1. Dividing every element of a vector by its length produces the corresponding unit vector, which represents direction while removing magnitude. Unit vectors are conventionally written with a hat, such as x̂, and satisfy x̂ᵀx̂ = ||x̂||² = 1. section 2.5.5 section 4.2.1

This constraint makes direction the object of optimization. Without it, scaling a vector could make a quadratic form arbitrarily large or small; restricting x̂ to unit length instead asks which direction optimizes x̂ᵀAx̂. section 4.2.1

Unit vectors organize several geometric and machine-learning constructions:

  • Use a unit direction vector l̂ to obtain data components through dot products, l̂ᵀx. section 4.4.1
  • Find the maximum data spread by maximizing l̂ᵀCl̂; the maximizing unit vector is the eigenvector associated with the largest covariance-matrix eigenvalue. section 4.4.1
  • Measure a matrix’s greatest amplification by maximizing ||Ax̂|| over unit vectors; this leads to the spectral norm and singular values. section 4.3.1

Direction without magnitude

If a vector is normalized by dividing each element by its length, the result points in the same direction but has length 1. In PCA, the selected unit vector identifies a direction through the data; in matrix analysis, it identifies a direction that a matrix amplifies most or least. section 2.5.5 section 4.4.1 section 4.3.1

Equation 4.2

Q = x̂TAx̂ = x̂TSΛSTx̂ = ŷTΛŷ

Follow the quadratic-form transformation showing how a unit vector becomes coordinates in an eigenvector basis. section 4.2.1

How Math and Architectures of Deep Learning covers it

How deep it goes
Defines normalization and develops constrained quadratic-form optimization, then applies it to PCA and spectral norms.
Examples
Uses normalized vectors, projected data components, PCA directions, and maximum matrix amplification as concrete applications.
What it assumes
Assumes vector length, dot products, matrix multiplication, eigenvectors, and covariance matrices while reinforcing geometric interpretations.
What you can do after
Evaluate/understand directional optimization in quadratic forms, principal-component analysis, and spectral-norm calculations.
How it connects
Connects L2 norm, quadratic forms, eigenvectors, PCA, covariance matrices, spectral norms, and singular value decomposition.

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.