scientific article; zbMATH DE number 7370597
From MaRDI portal
Publication:4999000
Ying Zhang, Wen-Jie Zhang, Zengfeng Huang, Xuemin Lin
Publication date: 9 July 2021
Full work available at URL: https://jmlr.csail.mit.edu/papers/v22/20-705.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Faster least squares approximation
- Sums of random Hermitian matrices and an inequality by Rudelson
- User-friendly tail bounds for sums of random matrices
- Distributed streams algorithms for sliding windows
- Spectral norm of products of random and deterministic matrices
- Finding repeated elements
- Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy
- Frequent Directions: Simple and Deterministic Matrix Sketching
- Improved Practical Matrix Sketching with Guarantees
- Mergeable summaries
- Optimal CUR Matrix Decompositions
- Low-Rank Approximation and Regression in Input Sparsity Time
- Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling
- Communication Complexity
- The Communication Complexity of Distributed epsilon-Approximations
- Eigenvector Computation and Community Detection in Asynchronous Gossip Models
- Determinantal Point Processes in Randomized Numerical Linear Algebra
- Numerical linear algebra in the streaming model
- Optimal principal component analysis in distributed and streaming models
- Online Principal Components Analysis
- Tighter Low-rank Approximation via Sampling the Leveraged Element
- Relative Errors for Deterministic Low-Rank Matrix Approximations
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
- Concentration of Measure for the Analysis of Randomized Algorithms
This page was built for publication:
