DeepAI AI Chat
Log In Sign Up

Improved guarantees and a multiple-descent curve for the Column Subset Selection Problem and the Nyström method

by   Michał Dereziński, et al.

The Column Subset Selection Problem (CSSP) and the Nyström method are among the leading tools for constructing small low-rank approximations of large datasets in machine learning and scientific computing. A fundamental question in this area is: how well can a data subset of size k compete with the best rank k approximation? We develop techniques which exploit spectral properties of the data matrix to obtain improved approximation guarantees which go beyond the standard worst-case analysis. Our approach leads to significantly better bounds for datasets with known rates of singular value decay, e.g., polynomial or exponential decay. Our analysis also reveals an intriguing phenomenon: the approximation factor as a function of k may exhibit multiple peaks and valleys, which we call a multiple-descent curve. A lower bound we establish shows that this behavior is not an artifact of our analysis, but rather it is an inherent property of the CSSP and Nyström tasks. Finally, using the example of a radial basis function (RBF) kernel, we show that both our improved bounds and the multiple-descent curve can be observed on real datasets simply by varying the RBF parameter.


page 1

page 2

page 3

page 4


Column Subset Selection and Nyström Approximation via Continuous Optimization

We propose a continuous optimization algorithm for the Column Subset Sel...

Low-rank approximation in the Frobenius norm by column and row subset selection

A CUR approximation of a matrix A is a particular type of low-rank appro...

On the numerical rank of radial basis function kernel matrices in high dimension

Low-rank approximations are popular techniques to reduce the high comput...

Optimal Analysis of Subset-Selection Based L_p Low Rank Approximation

We study the low rank approximation problem of any given matrix A over R...

Flip-Flop Spectrum-Revealing QR Factorization and Its Applications on Singular Value Decomposition

We present Flip-Flop Spectrum-Revealing QR (Flip-Flop SRQR) factorizatio...

On the Estimation of Coherence

Low-rank matrix approximations are often used to help scale standard mac...

Generalized Leverage Scores: Geometric Interpretation and Applications

In problems involving matrix computations, the concept of leverage has f...