A small random column sample of a symmetric matrix yields all outlying approximate eigenvectors with small residual error and entrywise query time poly(log n, 1/epsilon).
International Conference on Machine Learning , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sublinear Time Eigenvector Approximation via Column Sampling
A small random column sample of a symmetric matrix yields all outlying approximate eigenvectors with small residual error and entrywise query time poly(log n, 1/epsilon).