资源分类
》 资源 》论文》Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski p-Norms

Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski p-Norms

2020-03-16 | |  60 |   51 |   0

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 图片.png2 . We study other 图片.pngp 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 图片.png 1, including p = 图片.png, and (3) can be implemented in both distributed and streaming environments. We apply our results to 图片.pngp -regression, entrywise 图片.png1 -low rank approximation, and approximate matrix multiplication.

上一篇：Stochastic PCA with e2 and e1 Regularization

下一篇：Asynchronous Stochastic Quasi-Newton MCMC for Non-Convex Optimization

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...