Singular Value Decomposition › Summary

Michael BrenndoerferUpdated March 21, 20262 min read
Language AI HandbookAll chapters
Part 3 of 67Distributional Semantics
Chapter 18Singular Value Decomposition › Summary
Reading section 13 of 14 · Summary · 2 minSection 13 of 14 · 2 min

Book contents

Section 13 of 14 · 2 min read

Singular Value Decomposition › SummaryOne section · Sections in this chapter13 / 14 ↓
Reading tools Definitions & inline links

Choose your expertise level to adjust how many terms are explained. Beginners see more tooltips, experts see fewer to maintain reading flow. Hover over underlined terms for instant definitions.

Article links

Make inline references clickable

Singular Value Decomposition converts large, sparse co-occurrence matrices into compact, dense word embeddings by finding the most important linear dimensions of the data. The key ideas from this chapter are:

  • SVD decomposes any matrix as M=UΣVT\mathbf{M} = \mathbf{U} \mathbf{\Sigma} \mathbf{V}^T, where the left singular vectors U\mathbf{U} define word space, the right singular vectors V\mathbf{V} define context space, and the singular values Σ\mathbf{\Sigma} measure how much variance each direction captures
  • Truncated SVD retains only the top kk components, giving the optimal rank-kk approximation by the Eckart-Young-Mirsky theorem: no other rank-kk matrix is closer to the original under the Frobenius norm
  • LSA applies truncated SVD to word-context or term-document matrices to discover latent semantic dimensions, enabling words that never co-occur directly to have high similarity if they share distributional neighborhoods
  • The singular value spectrum guides the choice of kk: retain components before the elbow in the scree plot, and validate with downstream task performance
  • Exact SVD is O(V3)O(V^3) but sparse matrix algorithms and randomized SVD bring this to practical levels; scikit-learn's TruncatedSVD handles large sparse matrices efficiently with the randomized algorithm
  • Randomized SVD achieves near-exact results by projecting to a random low-dimensional subspace first, then computing exact SVD of the smaller projected matrix; this reduces computation from O(k⋅nnz)O(k \cdot \text{nnz}) to a much faster constant-factor improvement
  • SVD dimensions are not directly interpretable but reflect real semantic structure; examining top-loading words for each dimension reveals the semantic contrasts it captures
  • LSA captures global co-occurrence patterns but cannot handle polysemy, negation, or compositional meaning; these limitations motivated the transition to neural approaches
  • Word2Vec implicitly performs matrix factorization on a shifted PMI matrix, unifying the neural and algebraic traditions and showing that the progress from LSA to Word2Vec was a matter of objective and training procedure rather than a categorical shift in methodology