Linear-size 1 sparsifiers

Abstract

We prove that for any matrix A ∈ Rm × n and any ∈ (0, 1/2] there is a diagonal matrix D ∈ R≥ 0m × m with at most O(n2 (1)) nonzero entries so that \[(1-) \|Ax\|1 ≤ \|DAx\|1 ≤ (1+)\|Ax\|1 ∀ x ∈ Rn.\]In particular, for any zonotope Z ⊂eq Rn there exists a zonotope Z' ⊂eq Rn generated by at most O(n2 (1)) segments so that (1-) Z ⊂eq Z' ⊂eq (1+) Z. Previously, the best known bound was O(n2 n) due to Talagrand (1990).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…