Pith. sign in

Linear-size $\ell_1$ sparsifiers

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

We prove that for any matrix $A \in \mathbb{R}^{m \times n}$ and any $\varepsilon \in (0, 1/2]$ there is a diagonal matrix $D \in \mathbb{R}_{\geq 0}^{m \times m}$ with at most $O(\frac{n}{\varepsilon^2} \log(\frac{1}{\varepsilon}))$ nonzero entries so that \[(1-\varepsilon) \|Ax\|_1 \leq \|DAx\|_1 \leq (1+\varepsilon)\|Ax\|_1 \quad \forall x \in \mathbb{R}^n.\]In particular, for any zonotope $Z \subseteq \mathbb{R}^{n}$ there exists a zonotope $Z' \subseteq \mathbb{R}^{n}$ generated by at most $O(\frac{n}{\varepsilon^2} \log(\frac{1}{\varepsilon}))$ segments so that $(1-\varepsilon) Z \subseteq Z' \subseteq (1+\varepsilon) Z$. Previously, the best known bound was $O(\frac{n}{\varepsilon^2} \log n)$ due to Talagrand (1990).

fields

cs.DS 1

years

2026 1

verdicts

ACCEPT 1

representative citing papers

Optimal Sparsifiers for Abelian Cayley Graphs

cs.DS · 2026-07-09 · accept · novelty 6.5

Every abelian Cayley graph admits an optimal O(ε^{-2} log |G|)-generator weighted Cayley spectral sparsifier, proved via a character-symmetry volume bound on a sparsification polytope.

citing papers explorer

Showing 1 of 1 citing paper.

  • Optimal Sparsifiers for Abelian Cayley Graphs cs.DS · 2026-07-09 · accept · none · ref 20 · internal anchor

    Every abelian Cayley graph admits an optimal O(ε^{-2} log |G|)-generator weighted Cayley spectral sparsifier, proved via a character-symmetry volume bound on a sparsification polytope.