Metraipolis › archive › dc_998d9036232b
Singular Value Decomposition: A Geometric Rediscovery, Where Proofs Become Algorithms — arXiv:2610.08565
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.08565
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:41:53.064Z
- SHA-256 of the archived text
ebcbb77b08de3ae57c6ac0b4fea7015cbb1246ecb5a1e0adcd70e9b7956ad3bb- Stable URL of this page
https://metraipolis.com/documento/dc_998d9036232b
How to cite
Singular Value Decomposition: A Geometric Rediscovery, Where Proofs Become Algorithms — arXiv:2610.08565 — arXiv (en), https://arxiv.org/abs/2610.08565 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_998d9036232b (Metraipolis archive dc_998d9036232b, sha256 ebcbb77b08de3ae57c6ac0b4fea7015cbb1246ecb5a1e0adcd70e9b7956ad3bb)
BibTeX
@misc{dc998d9036232b,
title = {Singular Value Decomposition: A Geometric Rediscovery, Where Proofs Become Algorithms — arXiv:2610.08565},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.08565},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_998d9036232b; sha256 ebcbb77b08de3ae57c6ac0b4fea7015cbb1246ecb5a1e0adcd70e9b7956ad3bb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08565. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This article is a geometric rediscovery of the singular value decomposition, with a further claim: the construction it builds is the machinery behind much of machine learning. The same argument that answers an idle question about ellipses is the algorithm behind principal component analysis, kernel methods, and PageRank, and it is not only the results that transfer but the proofs themselves, run as procedures. The usual introduction states $A = U\Sigma V^T$ and justifies it via the spectral theorem applied to $A^T A$. This is correct but unilluminating, since it assumes a powerful theorem to reach a result that is, in the end, about ellipses. Part I reverses the order. A linear map sends the unit circle to an ellipse; one asks which input directions map to its axes, and finds, example after example, that they are perpendicular. In the plane this can be watched: rotate a frame, track how far its images are from perpendicular, and a sign change forces a frame where they are exactly perpendicular, which is also where the map stretches hardest. Maximizing the stretch and recursing generalizes this to n dimensions, with singular values falling out in order, and the construction proves the spectral theorem rather than assuming it. Part II puts each construction to work: maximize-and-recurse becomes the power method and PageRank; the lemma locating the maximizer becomes the stopping rule of gradient descent; the duality between $A^T A$ and $A A^T$ becomes the transport at the heart of kernel PCA. Each connection is stated with its boundary, saying what the decomposition supplies and where another idea takes over. Prerequisites are the standard sophomore sequence, and the worked examples are small enough to check by hand. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; History and Overview (math.HO). Pagina del lavoro: https://arxiv.org/abs/2610.08565 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T11:19:24.839Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).