atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Improved guarantees and a multiple-descent curve for Column Subset Selection and the Nystrom method

NeurIPS 2020 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank approximation theory

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Exploit polynomial spectral decay with k-DPP samplingCSSP · Matrices with λ_i between c_1 i^{-p} and c_2 i^{-p}approximation factor: c γ pHelped
Exploit exponential spectral decay with k-DPP samplingCSSP · Matrices with λ_i between c_1(1-δ)^i and c_2(1-δ)^iapproximation factor: cγ(1+ δ k)Helped
Use the stable-rank-dependent Master Theorem boundCSSP with k-DPP · s < k < t_sapproximation factor: (1+2ε)^2 Φ_s(k)Helped
Vary the RBF parameter σ to flatten the spectrumNyström approximation on bodyfat · bodyfatapproximation factorHelped
Vary the RBF parameter σ to flatten the spectrumNyström approximation on eunite2001 · eunite2001approximation factorHelped
Introduce sharp spectral drops around subset sizesCSSP and Nyström · Subset size kapproximation factorHurt
Use multiple spectral dropsCSSP and Nyström · Subset size kapproximation factorMixed
Use a flat spectrumNyström approximation on the toy dataset · Toy datasetapproximation factorHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy