93 citations · 388 across the 44 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DS2015★ 1 cited
Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Sampling
Michael B. Cohen, Cameron Musco, Christopher Musco
We present a new algorithm for finding a near optimal low-rank approximation of a matrix in time. Our method is based on a recursive sampling scheme for computing a…
cs.DS2015★ 14 cited
Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation
Chi Jin, Sham M. Kakade, Cameron Musco +2
We provide faster algorithms and improved sample complexities for approximating the top eigenvector of a matrix. Offline Setting: Given an matrix , we show how to c…
cs.DS2015★ 90 cited
Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition
Cameron Musco, Christopher Musco
Since being analyzed by Rokhlin, Szlam, and Tygert and popularized by Halko, Martinsson, and Tropp, randomized Simultaneous Power Iteration has become the method of choice for appr…