Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski $p$-Norms
Abstract
Work on approximate linear algebra has led to efficient distributed and streaming algorithms for problems such as approximate matrix multiplication, low rank approximation, and regression, primarily for the Euclidean norm $\ell_2$. We study other $\ell_p$ norms, which are more robust for $p < 2$, and can be used to find outliers for $p > 2$. Unlike previous algorithms for such norms, we give algorithms that are (1) deterministic, (2) work simultaneously for every $p \geq 1$, including $p = \infty$, and (3) can be implemented in both distributed and streaming environments. We study $\ell_p$-regression, entrywise $\ell_p$-low rank approximation, and versions of approximate matrix multiplication.
Cite
Text
Dickens et al. "Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski $p$-Norms." International Conference on Machine Learning, 2018.Markdown
[Dickens et al. "Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski $p$-Norms." International Conference on Machine Learning, 2018.](https://mlanthology.org/icml/2018/dickens2018icml-leveraging/)BibTeX
@inproceedings{dickens2018icml-leveraging,
title = {{Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski $p$-Norms}},
author = {Dickens, Charlie and Cormode, Graham and Woodruff, David},
booktitle = {International Conference on Machine Learning},
year = {2018},
pages = {1243-1251},
volume = {80},
url = {https://mlanthology.org/icml/2018/dickens2018icml-leveraging/}
}