Theory of Intelligence
MATH FOR AI•Linear Algebra•Singular Value Decomposition•11.2 Low-Rank Approximation

Introduction

Truncating the SVD to get the best rank-k approximation, the Eckart–Young theorem, and image compression.

Introduction

The SVD writes a matrix as a sum of rank-1 layers ordered by importance (σ1≥σ2≥…\sigma_1 \ge \sigma_2 \ge \dots). Keep only the first few layers and you get a much smaller approximation that still captures most of the matrix. This is the idea behind image compression, denoising, recommender systems, PCA, and LoRA fine-tuning of large language models.

Discuss theoretical concepts, mathematical formulas, and architectural foundations.

Supports inline code with `backticks`
No comments yet. Be the first to start the discussion!