Proves existence of l1 sparsifier with O(n/ε² log(1/ε)) nonzeros, improving Talagrand's O(n/ε² log n) bound.
Proceedings of the 2024 Symposium on Simplicity in Algorithms (SOSA) , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.MG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Linear-size $\ell_1$ sparsifiers
Proves existence of l1 sparsifier with O(n/ε² log(1/ε)) nonzeros, improving Talagrand's O(n/ε² log n) bound.