An Online Sparsification Algorithm from the Book
The original online leverage-score sampling algorithm is indeed robust to adaptive adversaries and is given the first online sparsification algorithm for adaptive streams that yields a sparsifier of near-optimal size $O(d \varepsilon^{-2}\log^2 d)$ whose working memory is proportional to the size of the sparsifier.