2000 character limit reached
A Fast Greedy Algorithm for Generalized Column Subset Selection (1312.6820v1)
Published 24 Dec 2013 in cs.DS, cs.LG, and stat.ML
Abstract: 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.