A local computation algorithm approximates any coordinate of a top eigenvector of a bounded-entry symmetric matrix with Õ(1/ε²) queries per coordinate (after Õ(1/ε⁴) preprocessing) when negative eigenvalues are not much larger than the top one, with a matching Ω(n/ε²) total-query lower bound and pol
A quasi-monte carlo data structure for smooth kernel evaluations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Locally Approximating the Top Eigenvector of Bounded Entry Matrices
A local computation algorithm approximates any coordinate of a top eigenvector of a bounded-entry symmetric matrix with Õ(1/ε²) queries per coordinate (after Õ(1/ε⁴) preprocessing) when negative eigenvalues are not much larger than the top one, with a matching Ω(n/ε²) total-query lower bound and pol