L p Row Sampling by Lewis Weights

DOI10.1145/2746539.2746567zbMath1321.65064arXiv1412.0588OpenAlexW2962682298MaRDI QIDQ2941506

Richard Peng, Michael B. Cohen

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.0588

zbMATH Keywords

\(\ell_{p}\)Lewis weightsmatrix concentration boundsrow sampling

Mathematics Subject Classification ID

Related Items (2)

Determinant-Preserving Sparsification of SDDM Matrices ⋮ Tight Bounds for the Subspace Sketch Problem with Applications

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: L _p Row Sampling by Lewis Weights