Fetching the paper…
Reading the bibliography…
We consider the problem of matrix column subset selection, which selects a subset of columns from an input matrix such that the input can be well approximated by the span of the selected columns.
Rank revealing QR factorizations
Tony F Chan · 1987
Earlier work this paper cites.
Efficient algorithms for computing a strong rank-revealing QR factorization
Ming Gu and Stanley C Eisenstat · 1996
Earlier work this paper cites.
Adaptive estimation of a quadratic functional by model selection
Beatrice Laurent and Pascal Massart · 2000
Earlier work this paper cites.
The international HapMap project
The international HapMap consortium · 2003
Earlier work this paper cites.
Efficient selective screening of haplotype tag SNPs
Xiayi Ke and Lon Cardon · 2003
Earlier work this paper cites.
Fast monte-carlo algorithms for finding low-rank approximations
Alan Frieze, Ravi Kannan, and Santosh Vempala · 2004
Earlier work this paper cites.
Adaptive sampling and fast low-rank matrix approximation
Amit Deshpande and Santosh Vempala · 2006
Earlier work this paper cites.
Matrix approximation and projective clustering via volume sampling
Amit Deshpande, Luis Rademacher, Santosh Vempala, and Grant Wang · 2006
Earlier work this paper cites.
Model selection and estimation in regression with grouped variables
Ming Yuan and Yi Lin · 2006
Earlier work this paper cites.
Fast computation of low-rank matrix approximations
Dimitris Achlioptas and Frank McSherry · 2007
Earlier work this paper cites.
Intra- and interpopulation genotype reconstruction from tagging SNPs
Peristera Paschou, Michael Mahoney, Asif Javed, Judith Kidd, Andrew Pakstis, Sheng Gu, Kenneth Kidd, and Petros Drineas · 2007
Earlier work this paper cites.
Relative-error CUR matrix decompositions
Petros Drineas, Michael W Mahoney, and S Muthukrishnan · 2008
Earlier work this paper cites.
An improved approximation algorithm for the column subset selection problem
Christos Boutsidis, Michael Mahoney, and Petros Drineas · 2009
Earlier work this paper cites.
CUR from a sparse optimization viewpoint
Jacob Bien, Ya Xu, and Michael Mahoney · 2010
Cited alongside, same era.
Matrix completion with noise
Emmanuel J Candes and Yaniv Plan · 2010
Cited alongside, same era.
Efficient volume sampling for row/column subset selection
Amit Deshpande and Luis Rademacher · 2010
Cited alongside, same era.
Quantum state tomography via compressed sensing
David Gross, Yi-Kai Liu, Steven T Flammia, Stephen Becker, and Jens Eisert · 2010
Cited alongside, same era.
Matrix completion from a few entries
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh · 2010
Cited alongside, same era.
Solving structured sparsity regularization with proximal methods
Sofia Mosci, Lorenzo Rosasco, Matteo Santoro, Alessandro Verri, and Silvia Villa · 2010
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
Joel Tropp · 2012
Later among the works it cites.
Near-optimal entrywise sampling for data matrices
Dimitris Achlioptas, Zohar Karnin, and Edo Liberty · 2013
Later among the works it cites.
Completing any low-rank matrix, provably
Yudong Chen, Srinadh Bhojanapalli, Sujay Sanghavi, and Rachel Ward · 2013
Later among the works it cites.
Low-rank matrix and tensor completion via adaptive sampling
Akshay Krishnamurthy and Aarti Singh · 2013
Later among the works it cites.
Improving CUR matrix decomposition and the nyström approximation via adaptive sampling
Shusen Wang and Zhihua Zhang · 2013
Later among the works it cites.
Optimal CUR matrix decompositions
Christos Boutsidis and David P Woodruff · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Roman Vershynin · 2010
Cited alongside, same era.
Distilled sensing: Adaptive sampling for sparse detection and estimation
Jarvis Haupt, Rui M Castro, and Robert Nowak · 2011
Cited alongside, same era.
Efficient genomewide selection of PCA-correlated tSNPs for genotype imputation
Asif Javed, Petros Drineas, Michael Mahoney, and Peristera Paschou · 2011
Cited alongside, same era.
Minimax localization of structural information in large noisy matrices
Mladen Kolar, Sivaraman Balakrishnan, Alessandro Rinaldo, and Aarti Singh · 2011
Cited alongside, same era.
Oracle inequalities and optimal inference under group sparsity
Karim Lounici, Massimiliano Pontil, Sara Van De Geer, and Alexandre B Tsybakov · 2011
Cited alongside, same era.
A simpler approach to matrix completion
Benjamin Recht · 2011
Cited alongside, same era.
Later among the works it cites.
Near-optimal column-based matrix reconstruction
Christos Boutsidis, Petros Drineas, and Malik Magdon-Ismail · 2014
Later among the works it cites.
On the power of adaptivity in matrix completion and approximation
Akshay Krishnamurthy and Aarti Singh · 2014
Later among the works it cites.
A fast unified algorithm for solving group-lasso penalize learning problems
Yi Yang and Hui Zou · 2014
Later among the works it cites.
Tighter low-rank approximation via sampling the leveraged element
Srinadh Bhojanapalli, Prateek Jain, and Sujay Sanghavi · 2015
Closest in time.
Uniform sampling for matrix approximation
Michael B Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford · 2015
Closest in time.
CUR algorithm for partially observed matrices
Miao Xu, Rong Jin, and Zhi-Hua Zhou · 2015
Closest in time.
Monte carlo markov chain algorithms for sampling strongly rayleigh distributions and determinantal point processes, 2016
Nima Anari, Shayan Oveis Gharan, and Alireza Rezaei · 2016
Closest in time.