暂无分享,去创建一个
[1] Benjamin Recht,et al. A Simpler Approach to Matrix Completion , 2009, J. Mach. Learn. Res..
[2] P. Massart,et al. Adaptive estimation of a quadratic functional by model selection , 2000 .
[3] M. Yuan,et al. Model selection and estimation in regression with grouped variables , 2006 .
[4] Alan M. Frieze,et al. Fast Monte-Carlo algorithms for finding low-rank approximations , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[5] Richard Peng,et al. Uniform Sampling for Matrix Approximation , 2014, ITCS.
[6] Akshay Krishnamurthy,et al. On the Power of Adaptivity in Matrix Completion and Approximation , 2014, ArXiv.
[7] Christos Boutsidis,et al. Optimal CUR matrix decompositions , 2014, STOC.
[8] Lon R. Cardon,et al. Efficient selective screening of haplotype tag SNPs , 2003, Bioinform..
[9] Lorenzo Rosasco,et al. Solving Structured Sparsity Regularization with Proximal Methods , 2010, ECML/PKDD.
[10] Miao Xu,et al. CUR Algorithm for Partially Observed Matrices , 2014, ICML.
[11] Akshay Krishnamurthy,et al. Low-Rank Matrix and Tensor Completion via Adaptive Sampling , 2013, NIPS.
[12] Christos Boutsidis,et al. An improved approximation algorithm for the column subset selection problem , 2008, SODA.
[13] Michael W. Mahoney,et al. Efficient Genomewide Selection of PCA‐Correlated tSNPs for Genotype Imputation , 2011, Annals of human genetics.
[14] W. Bajwa,et al. Column Subset Selection with Missing Data , 2010 .
[15] Sjsu ScholarWorks,et al. Rank revealing QR factorizations , 2014 .
[16] P. Tam. The International HapMap Consortium. The International HapMap Project (Co-PI of Hong Kong Centre which responsible for 2.5% of genome) , 2003 .
[17] S. Muthukrishnan,et al. Relative-Error CUR Matrix Decompositions , 2007, SIAM J. Matrix Anal. Appl..
[18] Zhihua Zhang,et al. Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling , 2013, J. Mach. Learn. Res..
[19] Christos Boutsidis,et al. Near-Optimal Column-Based Matrix Reconstruction , 2014, SIAM J. Comput..
[20] Edo Liberty,et al. Near-Optimal Entrywise Sampling for Data Matrices , 2013, NIPS.
[21] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[22] David P. Woodruff,et al. Fast approximation of matrix coherence and statistical leverage , 2011, ICML.
[23] Petros Drineas,et al. Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication , 2006, SIAM J. Comput..
[24] Michael W. Mahoney,et al. CUR from a Sparse Optimization Viewpoint , 2010, NIPS.
[25] Ming Gu,et al. Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization , 1996, SIAM J. Sci. Comput..
[26] Santosh S. Vempala,et al. Matrix approximation and projective clustering via volume sampling , 2006, SODA '06.
[27] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[28] Gudmundur A. Thorisson,et al. The International HapMap Project Web site. , 2005, Genome research.
[29] Michael W. Mahoney,et al. Intra- and interpopulation genotype reconstruction from tagging SNPs. , 2006, Genome research.
[30] Dimitris Achlioptas,et al. Fast computation of low-rank matrix approximations , 2007, JACM.
[31] Robert D. Nowak,et al. High-dimensional Matched Subspace Detection when data are missing , 2010, 2010 IEEE International Symposium on Information Theory.
[32] Emmanuel J. Candès,et al. Matrix Completion With Noise , 2009, Proceedings of the IEEE.
[33] Santosh S. Vempala,et al. Adaptive Sampling and Fast Low-Rank Matrix Approximation , 2006, APPROX-RANDOM.
[34] Petros Drineas,et al. Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition , 2006, SIAM J. Comput..
[35] Sujay Sanghavi,et al. Completing any low-rank matrix, provably , 2013, J. Mach. Learn. Res..
[36] S. Geer,et al. Oracle Inequalities and Optimal Inference under Group Sparsity , 2010, 1007.1771.
[37] Yi Yang,et al. A fast unified algorithm for solving group-lasso penalize learning problems , 2014, Statistics and Computing.
[38] Andrea Montanari,et al. Matrix completion from a few entries , 2009, 2009 IEEE International Symposium on Information Theory.
[39] Stephen Becker,et al. Quantum state tomography via compressed sensing. , 2009, Physical review letters.
[40] Petros Drineas,et al. FAST MONTE CARLO ALGORITHMS FOR MATRICES II: COMPUTING A LOW-RANK APPROXIMATION TO A MATRIX∗ , 2004 .
[41] Robert D. Nowak,et al. Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation , 2010, IEEE Transactions on Information Theory.