Eckart–Young–Mirsky theorem
Statement
Let have singular values , and for let keep only the top singular components. Then for every matrix with , , and this bound is attained: . So is a best rank- approximation of in the operator norm.
Why is it true?
The singular values measure how much stretches vectors along each orthogonal direction ; keeping the largest ones and dropping the smallest throws away the directions stretches least. Any other rank- matrix must fail to reconstruct some direction among the top singular directions (there are too many of them to fit in a -dimensional image), and that failure costs at least .
Proof sketch
Achievability. Since have orthonormal columns, , where keeps the top singular values and zeroes the rest. is diagonal with entries , so its operator norm is its largest entry, .
Optimality. Let be any matrix with ; its null space (kernel) has dimension at least . Let , a -dimensional subspace. Since , the two subspaces must intersect in more than just the origin: there exists a unit vector with .
Write with (since has unit norm and the are orthonormal). Because , , using orthonormality of the .
Since for every , . Hence for every rank- matrix , which together with achievability proves the theorem.
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- Ian Goodfellow, Yoshua Bengio, Aaron Courville (2016). Deep Learning
- Christopher M. Bishop (2006). Pattern Recognition and Machine Learning
- Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, Oriol Vinyals (2017). Understanding deep learning requires rethinking generalization · arXiv:1611.03530
- Arthur Jacot, Franck Gabriel, Clément Hongler (2018). Neural Tangent Kernel: Convergence and Generalization in Neural Networks · arXiv:1806.07572
- Mikhail Belkin, Daniel Hsu, Siyuan Ma, Soumik Mandal (2019). Reconciling modern machine learning practice and the classical bias-variance trade-off · arXiv:1812.11118