中文

Linear-size $\ell_1$ sparsifiers

度量几何 2026-06-26 v1 离散数学

摘要

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

引用

@article{arxiv.2606.28147,
  title  = {Linear-size $\ell_1$ sparsifiers},
  author = {Victor Reis and Thomas Rothvoss},
  journal= {arXiv preprint arXiv:2606.28147},
  year   = {2026}
}

备注

20 pages