Towards more efficient SPSD matrix approximation and CUR matrix decomposition

MaRDI QIDQ2953633zbMATH OpenFDO

Authors

Publication date 5 January 2017

Full work available at URL https://arxiv.org/abs/1503.08395, http://jmlr.csail.mit.edu/papers/v17/15-190.html

zbMATH Keywords

CUR matrix decompositionkernel approximationmatrix factorizationNyström method

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Recommendations

• SPSD matrix approximation vis column selection: theories, algorithms, and extensions
• Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
• Relative-Error CUR Matrix Decompositions

Cited in

(7)

• CUR matrix decompositions for improved data analysis
• Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
• SPSD matrix approximation vis column selection: theories, algorithms, and extensions
• Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
• Revisiting the Nyström method for improved large-scale machine learning
• Sketched ridge regression: optimization perspective, statistical perspective, and model averaging
• Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds

This page was built for publication: Towards more efficient SPSD matrix approximation and CUR matrix decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953633)