Invariant subspaces and PCA in nearly matrix multiplication time

Aleksandros Sobczyk, Marko Mladenović, Mathieu Luisier

Approximating invariant subspaces of generalized eigenvalue problems (GEPs) is a fundamental computational problem at the core of machine learning and scientific computing. It is,…