A determinantal point process for column subset selection

Doubly stochastic matrices and the diagonal of a rotation matrix

A. Horn · 1954

Earlier work this paper cites.

Numerical methods for solving linear least squares problems

G. H. Golub · 1965

Earlier work this paper cites.

Numerical methods for computing angles between linear subspaces

Å. Björck and G. H. Golub · 1973

Earlier work this paper cites.

The coincidence approach to stochastic point processes

O Macchi · 1975

Earlier work this paper cites.

A volume associated with m x n matrices

Adi Ben-Israel · 1992

Earlier work this paper cites.

Matrix Computations (3rd Ed.)

G. H. Golub and C. F. Van Loan · 1996

Earlier work this paper cites.

Efficient algorithms for computing a strong rank-revealing QR factorization

M. Gu and S. C. Eisenstat · 1996

Earlier work this paper cites.

Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays

U. Alon, N. Barkai, D. A. Notterman, K. Gish, S. Ybarra, D. Mack, and A. J. Levine · 1999

Earlier work this paper cites.

Molecular classification of cancer: class discovery and class prediction by gene expression monitoring

T. R. Golub, D. K. Slonim, P. Tamayo, C. Huard, M. Gaasenbeek, J. P. Mesirov, H. Coller, M. L. Loh, J. R. Downing, M. A. Caligiuri, et al · 1999

Earlier work this paper cites.

Determinantal random point fields

A. Soshnikov · 2000

Earlier work this paper cites.

GUEs and queues

Y. Baryshnikov · 2001

Earlier work this paper cites.

Clustering large graphs via the singular value decomposition

P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay · 2004

Earlier work this paper cites.

Generalized finite algorithms for constructing hermitian matrices with prescribed diagonal and spectrum

I. Dhillon, R. Heath, M. Sustik, and J. Tropp · 2005

Earlier work this paper cites.

Determinantal processes and independence

J. B. Hough, M. Krishnapur, Y. Peres, and B. Virág · 2005

Cited alongside, same era.

Random matrices and determinantal processes

K. Johansson · 2005

Cited alongside, same era.

Adaptive sampling and fast low-rank matrix approximation

A. Deshpande and S. Vempala · 2006

Cited alongside, same era.

Matrix approximation and projective clustering via volume sampling

A. Deshpande, L. Rademacher, S. Vempala, and G. Wang · 2006

Cited alongside, same era.

Relative-error CUR matrix decompositions

P. Drineas, M. W. Mahoney, and S. Muthukrishnan · 2008

Cited alongside, same era.

Twice-ramanujan sparsifiers

J. D. Batson, D. A. Spielman, and N. Srivastava · 2009

Cited alongside, same era.

Determinantal point processes for machine learning

A. Kulesza, B. Taskar, et al · 2012

Later among the works it cites.

Faster subset selection for matrices and applications

H. Avron and C. Boutsidis · 2013

Later among the works it cites.

Provable deterministic leverage score sampling

D. Papailiopoulos, A. Kyrillidis, and C. Boutsidis · 2014

Later among the works it cites.

Determinantal point process models and statistical inference

F. Lavancier, J. Møller, and E. Rubak · 2015

Later among the works it cites.

A statistical perspective on algorithmic leveraging

P. Ma, M. W. Mahoney, and B. Yu · 2015

Later among the works it cites.

Monte Carlo with Determinantal Point Processes

R. Bardenet and A. Hardy · 2016

Later among the works it cites.