#### Filter Results:

#### Publication Year

2012

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Since being analyzed by Rokhlin, Szlam, and Tygert [1] and popularized by Halko, Martinsson, and Tropp [2], randomized Simultaneous Power Iteration has become the method of choice for approximate singular value decomposition. It is more accurate than simpler sketching algorithms, yet still converges quickly for any matrix, independently of singular value… (More)

We show how to approximate a data matrix A with a much smaller sketch ~A that can be used to solve a general class of constrained k-rank approximation problems to within (1+ε) error. Importantly, this class includes k-means clustering and unconstrained low rank approximation (i.e. principal component analysis). By reducing data points to just O(k)… (More)

We re-analyze Simultaneous Power Iteration and the Block Lanczos method, two classical iterative algorithms for the singular value decomposition (SVD). We are interested in convergence bounds that do not depend on properties of the input matrix (e.g. singular value gaps). Simultaneous Iteration is known to give a low rank approximation within (1 + ǫ) of… (More)

In this paper we provide faster algorithms and improved sample complexities for approximating the top eigenvector of a matrix A A. In particular we give the following results for computing an approximate eigenvector-i.e. some x such that x A Ax ≥ (1 −)λ 1 (A A): • Offline Eigenvector Estimation: Given an explicit matrix A ∈ R n×d , we show how to compute an… (More)

We show how to efficiently project a vector onto the top principal components of a matrix, without explicitly computing these components. Specifically , we introduce an iterative algorithm that provably computes the projection using few calls to any black-box routine for ridge regression. By avoiding explicit principal component analysis (PCA), our… (More)

Random sampling has become a critical tool in solving massive matrix problems. For linear regression, a small, manageable set of data rows can be randomly selected to approximate a tall, skinny data matrix, improving processing time significantly. For theoretical performance guarantees, each row must be sampled with probability proportional to its… (More)

Overview Iñ O(n) space, maintain a graph compression from which we can always return a spectral sparsifier. Main technique Use 2 heavy hitter sketches to sample by effective resistance in the streaming model. Overview Iñ O(n) space, maintain a graph compression from which we can always return a spectral sparsifier. Main technique Use 2 heavy hitter sketches… (More)

Finding a small spectral approximation for a tall n × d matrix A is a fundamental numerical primitive. For a number of reasons, one often seeks an approximation whose rows are sampled from those of A. Row sampling improves interpretability, saves space when A is sparse, and preserves row structure, which is especially important, for example, when A… (More)

Often used as importance sampling probabilities, leverage scores have become indispensable in randomized algorithms for linear algebra, optimization, graph theory, and machine learning. A major body of work seeks to adapt these scores to low-rank approximation problems. However, existing " low-rank leverage scores " can be difficult to compute, often work… (More)

Since being analyzed by Rokhlin, Szlam, and Tygert [1] and popularized by Halko, Martinsson, and Tropp [2], randomized Simultaneous Power Iteration has become the method of choice for approximate singular value decomposition. It is more accurate than simpler sketching algorithms, yet still converges quickly for any matrix, independently of singular value… (More)