Average-case hardness of RIP certification
暂无分享,去创建一个
[1] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[2] Arkadi Nemirovski,et al. On verifiable sufficient conditions for sparse signal recovery via ℓ1 minimization , 2008, Math. Program..
[3] Stephen J. Dilworth,et al. Explicit constructions of RIP matrices and related problems , 2010, ArXiv.
[4] Harrison H. Zhou,et al. Sparse CCA: Adaptive Estimation and Computational Barriers , 2014, 1409.8565.
[5] Philippe Rigollet,et al. Complexity Theoretic Lower Bounds for Sparse Principal Component Detection , 2013, COLT.
[6] Mark Jerrum,et al. Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.
[7] Santosh S. Vempala,et al. University of Birmingham On the Complexity of Random Satisfiability Problems with Planted Solutions , 2018 .
[8] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[9] Ari Juels,et al. Hiding Cliques for Cryptographic Security , 1998, SODA '98.
[10] Bruce E. Hajek,et al. Computational Lower Bounds for Community Detection on Random Graphs , 2014, COLT.
[11] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[12] Marc E. Pfetsch,et al. The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing , 2012, IEEE Transactions on Information Theory.
[13] Uriel Feige,et al. Relations between average case complexity and approximation complexity , 2002, STOC '02.
[14] T. Blumensath,et al. Theory and Applications , 2011 .
[15] Noga Alon,et al. Testing k-wise and almost k-wise independence , 2007, STOC '07.
[16] P. Rigollet,et al. Optimal detection of sparse principal components in high dimension , 2012, 1202.5070.
[17] Yihong Wu,et al. Computational Barriers in Minimax Submatrix Detection , 2013, ArXiv.
[18] Dustin G. Mixon,et al. Certifying the Restricted Isometry Property is Hard , 2012, IEEE Transactions on Information Theory.
[19] Santosh S. Vempala,et al. Statistical Algorithms and a Lower Bound for Detecting Planted Cliques , 2012, J. ACM.
[20] Mike E. Davies,et al. Iterative Hard Thresholding for Compressed Sensing , 2008, ArXiv.
[21] Alexandre d'Aspremont,et al. Optimal Solutions for Sparse Principal Component Analysis , 2007, J. Mach. Learn. Res..
[22] Olgica Milenkovic,et al. Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.
[23] Yoram Bresler,et al. Computing performance guarantees for compressed sensing , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.
[24] Michael Elad,et al. Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.
[25] Kevin A. Lai,et al. Label optimal regret bounds for online local learning , 2015, COLT.
[26] Aditya Bhaskara,et al. Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.
[27] Quentin Berthet,et al. Statistical and computational trade-offs in estimation of sparse principal components , 2014, 1408.5369.
[28] R. DeVore,et al. A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .
[29] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[30] S. Geer,et al. On the conditions used to prove oracle results for the Lasso , 2009, 0910.0722.
[31] Deanna Needell,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.
[32] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[33] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.
[34] E. Candès. The restricted isometry property and its implications for compressed sensing , 2008 .
[35] Yudong Chen,et al. Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices , 2014, J. Mach. Learn. Res..
[36] Martin J. Wainwright,et al. Lower bounds on the performance of polynomial-time algorithms for sparse linear regression , 2014, COLT.
[37] Dustin G. Mixon,et al. A conditional construction of restricted isometries , 2014, ArXiv.
[38] Pascal Koiran,et al. Hidden Cliques and the Certification of the Restricted Isometry Property , 2012, IEEE Transactions on Information Theory.
[39] Holger Rauhut,et al. A Mathematical Introduction to Compressive Sensing , 2013, Applied and Numerical Harmonic Analysis.
[40] Robert Krauthgamer,et al. The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set , 2003, SIAM J. Comput..
[41] Michael Elad,et al. Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[42] S. Frick,et al. Compressed Sensing , 2014, Computer Vision, A Reference Guide.
[43] P. Bickel,et al. SIMULTANEOUS ANALYSIS OF LASSO AND DANTZIG SELECTOR , 2008, 0801.1095.
[44] E. Arias-Castro,et al. Community detection in dense random networks , 2014 .
[45] Alexandre d'Aspremont,et al. Testing the nullspace property using semidefinite programming , 2008, Math. Program..
[46] Robert Krauthgamer,et al. How hard is it to approximate the best Nash equilibrium? , 2009, SODA.
[47] S. Mallat. A wavelet tour of signal processing , 1998 .