# A Fast Greedy Algorithm for Generalized Column Subset Selection

arXiv: https://arxiv.org/abs/1312.6820 · HTML: https://mlsanity.com/paper/1312.6820/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Dec 2013.

## Built on by (most cited first, 1 of 1)

- [Syntactic vs Semantic Linear Abstraction and Refinement of Neural Networks](https://mlsanity.com/paper/2307.10891/) (2023)

## Abstract (arXiv)

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.