A Fast Greedy Algorithm for Generalized Column Subset Selection
This paper defines a generalized column subset selection problem which is concerned with the selection of a few columns from a source matrix A that best approximate the span of a target matrix B. The paper then proposes a fast greedy algorithm for solving this problem and draws connections to different problems that can be efficiently solved using the proposed algorithm.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Greedy Column Subset Selection for Large-scale Data Sets
In today's information systems, the availability of massive amounts of data necessitates the development of fast and accurate algorithms to summarize these data and represent them in a succinct format. One crucial proble…
Regularized Greedy Column Subset Selection
The Column Subset Selection Problem provides a natural framework for unsupervised feature selection. Despite being a hard combinatorial optimization problem, there exist efficient algorithms that provide good approximati…
Combinatorial Optimizationfeature selectionAn Efficient Protocol for Distributed Column Subset Selection in the Entrywise $\ell_p$ Norm
We give a distributed protocol with nearly-optimal communication and number of rounds for Column Subset Selection with respect to the entrywise {$\ell_1$} norm ($k$-CSS$_1$), and more generally, for the $\ell_p$-norm wit…
3D ReconstructionLazy Greedy Hypervolume Subset Selection from Large Candidate Solution Sets
Subset selection is a popular topic in recent years and a number of subset selection methods have been proposed. Among those methods, hypervolume subset selection is widely used. Greedy hypervolume subset selection algor…
Generalized Leverage Scores: Geometric Interpretation and Applications
In problems involving matrix computations, the concept of leverage has found a large number of applications. In particular, leverage scores, which relate the columns of a matrix to the subspaces spanned by its leading si…