← Search

YuanBin Zou

2 accepted papers

2024

Linear Time Approximation Algorithm for Column Subset Selection with Local Search

NeurIPS 2024poster

The Column Subset Selection (CSS) problem has been widely studied in dimensionality reduction and feature selection. The goal of the CSS problem is to output a submatrix S, consisting of k columns from an n×d input matrix A that minimizes the residual error ‖A-SS^\dagger A‖_F^2, where S^\dagger is t…

Cited by 0SourcePDFScholar