The original online leverage-score sampling algorithm is adaptively robust and yields spectral sparsifiers of size O(d ε^{-2} log^2 d) with memory proportional to the sparsifier.
Title resolution pending
1 Pith paper cite this work, alongside 24 external citations. Polarity classification is still indexing.
1
Pith paper citing it
24
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
An Online Sparsification Algorithm from the Book
The original online leverage-score sampling algorithm is adaptively robust and yields spectral sparsifiers of size O(d ε^{-2} log^2 d) with memory proportional to the sparsifier.