AI 中文总结
本文从几何角度重新发现奇异值分解，证明即算法，并揭示其作为PCA、核方法和PageRank等机器学习核心机制的统一原理。
AI 中文摘要
本文是对奇异值分解的一种几何再发现，并进一步声称：它所构建的构造是机器学习许多内容背后的机制。回答关于椭圆的一个闲散问题的同一论证，就是主成分分析、核方法和PageRank背后的算法；不仅结果可以迁移，证明本身也可以作为过程运行。通常的介绍先给出$A = U\Sigma V^T$，并通过将谱定理应用于$A^T A$来证明它。这虽然正确但缺乏启发性，因为它假设了一个强大的定理来得到一个最终关于椭圆的结果。第一部分颠倒了顺序。一个线性映射将单位圆映射为椭圆；人们问哪些输入方向映射到其轴，并发现，一个接一个的例子中，这些方向是垂直的。在平面中这可以直观观察：旋转一个坐标系，跟踪其像与垂直方向的偏差，一个符号变化迫使存在一个坐标系使得它们恰好垂直，这也是映射拉伸最剧烈的方向。最大化拉伸并递归将此推广到n维，奇异值按顺序出现，并且该构造证明了谱定理而非假设它。第二部分将每个构造付诸应用：最大化-递归成为幂法和PageRank；定位最大化器的引理成为梯度下降的停止规则；$A^T A$与$A A^T$之间的对偶性成为核PCA核心的传输。每个联系都说明其边界，指出分解提供什么以及另一个想法在何处接管。先修课程是标准的二年级序列，且示例足够小，可以手工验证。
英文摘要
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Σ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.
Comments31 pages, 7 figures. Expository article
