Efficient Volume Sampling for Row/Column Subset Selection

Abstract

We give efficient algorithms for volume sampling, i.e., for picking k-subsets of the rows of any given matrix with probabilities proportional to the squared volumes of the simplices defined by them and the origin (or the squared volumes of the parallelepipeds defined by these subsets of rows). This solves an open problem from the monograph on spectral algorithms by Kannan and Vempala (see Section 7.4 of [15], also implicit in [1], [5]). Our first algorithm for volume sampling k-subsets of rows from an m-by-n matrix runs in O(kmn ω log n) arithmetic operations (where ω is the exponent of matrix multiplication) and a second variant of it for (1 + ϵ)-approximate volume sampling runs in O(mn log m · k 2 /ϵ 2 +m log ω m · k 2ω+1 /ϵ 2ω · log(kϵ -1 log m)) arithmetic operations, which is almost linear in the size of the input (i.e., the number of entries) for small k. Our efficient volume sampling algorithms imply the following results for low-rank matrix approximation: 1) Given A ∈ R m×n , in O(kmn ω log n) arithmetic operations we can find k of its rows such that projecting onto their span gives a √k + 1-approximation to the matrix of rank fc closest to A under the Frobenius norm. This improves the O(k√log k)-approximation of Boutsidis, Drineas and Mahoney [1] and matches the lower bound shown in [5]. The method of conditional expectations gives a deterministic algorithm with the same complexity. The running time can be improved to O(mn log m · k 2 /e 2 + m log ω m·k 2ω+1 ϵ 2ω -log(kϵ -1 log m)) at the cost of losing an extra (1 + ϵ) in the approximation factor. 2) The same rows and projection as in the previous point give a √(k + 1)(n -k)-approximation to the matrix of rank k closest to A under the spectral norm. In this paper, we show an almost matching lower bound of √n, even for k = 1.

References

Page 1

	Year	Citations

Page 1