Noisy estimation of simultaneously structured models: Limitations of convex relaxation
暂无分享,去创建一个
[1] Stephen A. Vavasis,et al. Nuclear norm minimization for the planted clique and biclique problems , 2009, Math. Program..
[2] Paul Tseng,et al. Hankel Matrix Rank Minimization with Applications to System Identification and Realization , 2013, SIAM J. Matrix Anal. Appl..
[3] M. Yuan,et al. Model selection and estimation in regression with grouped variables , 2006 .
[4] Yurii Nesterov,et al. Generalized Power Method for Sparse Principal Component Analysis , 2008, J. Mach. Learn. Res..
[5] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[6] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.
[7] Martin J. Wainwright,et al. Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions , 2011, ICML.
[8] Robert W. Harrison,et al. Phase problem in crystallography , 1993 .
[9] Nicolas Vayatis,et al. Estimation of Simultaneously Sparse and Low Rank Matrices , 2012, ICML.
[10] Xiaodong Li,et al. Sparse Signal Recovery from Quadratic Measurements via Convex Programming , 2012, SIAM J. Math. Anal..
[11] David L. Donoho,et al. De-noising by soft-thresholding , 1995, IEEE Trans. Inf. Theory.
[12] Andrea Montanari,et al. Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising , 2011, IEEE Transactions on Information Theory.
[13] A. Walther. The Question of Phase Retrieval in Optics , 1963 .
[14] Bo Huang,et al. Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery , 2013, ICML.
[15] D. Donoho,et al. Minimax risk of matrix denoising by singular value thresholding , 2013, 1304.2085.
[16] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[17] Andrea Montanari,et al. The LASSO Risk for Gaussian Matrices , 2010, IEEE Transactions on Information Theory.
[18] S. Frick,et al. Compressed Sensing , 2014, Computer Vision, A Reference Guide.
[19] V. Koltchinskii,et al. Nuclear norm penalization and optimal rates for noisy low rank matrix completion , 2010, 1011.6256.
[20] Pablo A. Parrilo,et al. Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..
[21] Michael I. Jordan,et al. A Direct Formulation for Sparse Pca Using Semidefinite Programming , 2004, SIAM Rev..
[22] Veit Elser. Phase retrieval by iterated projections. , 2003, Journal of the Optical Society of America. A, Optics, image science, and vision.
[23] Andrew B. Nobel,et al. Reconstruction of a low-rank matrix in the presence of Gaussian noise , 2010, J. Multivar. Anal..
[24] Emmanuel J. Candès,et al. A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..
[25] R. Tibshirani,et al. Sparse Principal Component Analysis , 2006 .
[26] R. Gerchberg. A practical algorithm for the determination of phase from image and diffraction plane pictures , 1972 .
[27] Rick P. Millane,et al. Phase retrieval in crystallography and optics , 1990 .
[28] Yonina C. Eldar,et al. Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices , 2012, IEEE Transactions on Information Theory.
[29] Yonina C. Eldar,et al. Phase Retrieval via Matrix Completion , 2011, SIAM Rev..