{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T06:52:18Z","timestamp":1709448738358},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T00:00:00Z","timestamp":1538524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10208-018-9401-4","type":"journal-article","created":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T17:39:17Z","timestamp":1538588357000},"page":"813-841","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving Equations of Random Convex Functions via Anchored Regression"],"prefix":"10.1007","volume":"19","author":[{"given":"Sohail","family":"Bahmani","sequence":"first","affiliation":[]},{"given":"Justin","family":"Romberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,3]]},"reference":[{"issue":"3","key":"9401_CR1","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1109\/TIT.2013.2294644","volume":"60","author":"A Ahmed","year":"2014","unstructured":"A.\u00a0Ahmed, B.\u00a0Recht, and J.\u00a0Romberg. Blind deconvolution using convex programming. IEEE Trans. Inform. Theory, 60(3):1711\u20131732, 2014.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9401_CR2","unstructured":"S.\u00a0Bahmani and J.\u00a0Romberg. Phase retrieval meets statistical learning theory: A flexible convex relaxation. In A.\u00a0Singh and J.\u00a0Zhu, editors, Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, volume\u00a054 of Proceedings of Machine Learning Research, pages 252\u2013260. PMLR, 2017."},{"issue":"2","key":"9401_CR3","doi-asserted-by":"publisher","first-page":"5254","DOI":"10.1214\/17-EJS1378SI","volume":"11","author":"S Bahmani","year":"2017","unstructured":"S.\u00a0Bahmani and J.\u00a0Romberg. A flexible convex relaxation for phase retrieval. Elect. J. Stat., 11(2):5254\u20135281, 2017.","journal-title":"Elect. J. Stat."},{"key":"9401_CR4","first-page":"807","volume":"14","author":"S Bahmani","year":"2013","unstructured":"S.\u00a0Bahmani, B.\u00a0Raj, and P.\u00a0T. Boufounos. Greedy sparsity-constrained optimization. J. Machine Learning Research, 14:807\u2013841, 2013.","journal-title":"J. Machine Learning Research"},{"issue":"3","key":"9401_CR5","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/120869778","volume":"23","author":"A Beck","year":"2013","unstructured":"A.\u00a0Beck and Y.\u00a0C. Eldar. Sparsity constrained nonlinear optimization: Optimality conditions and algorithms. SIAM J. Optim., 23(3):1480\u20131509, 2013.","journal-title":"SIAM J. Optim."},{"key":"9401_CR6","unstructured":"Q.\u00a0Berthet and P.\u00a0Rigollet. Complexity theoretic lower bounds for sparse principal component detection. In Journal of Machine Learning Research W&CP, volume\u00a030 of Proceedings of the 26th Conference on Learning Theory (COLT\u201913), pages 1046\u20131066, 2013."},{"issue":"6","key":"9401_CR7","doi-asserted-by":"publisher","first-page":"3466","DOI":"10.1109\/TIT.2013.2245716","volume":"59","author":"T Blumensath","year":"2013","unstructured":"T.\u00a0Blumensath. Compressed sensing with nonlinear observations and related nonlinear optimization problems. IEEE Trans. Inform. Theory, 59(6):3466\u20133474, 2013.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9401_CR8","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s10208-013-9162-z","volume":"14","author":"E Cand\u00e8s","year":"2014","unstructured":"E.\u00a0Cand\u00e8s and X.\u00a0Li. Solving quadratic equations via PhaseLift when there are about as many equations as unknowns. Found. of Comput. Math., 14:1017\u20131026, 2014.","journal-title":"Found. of Comput. Math."},{"issue":"8","key":"9401_CR9","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1002\/cpa.21432","volume":"66","author":"E Cand\u00e8s","year":"2013","unstructured":"E.\u00a0Cand\u00e8s, T.\u00a0Strohmer, and V.\u00a0Voroninski. Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming. Comm. Pure Appl. Math., 66(8):1241\u20131274, 2013.","journal-title":"Comm. Pure Appl. Math."},{"key":"9401_CR10","doi-asserted-by":"crossref","unstructured":"E.\u00a0J. Cand\u00e8s, X.\u00a0Li, and M.\u00a0Soltanolkotabi. Phase retrieval via Wirtinger flow: Theory and algorithms. Information Theory, IEEE Transactions on, 61(4):1985\u20132007, Apr. 2015.","DOI":"10.1109\/TIT.2015.2399924"},{"key":"9401_CR11","doi-asserted-by":"crossref","unstructured":"V.\u00a0H. de\u00a0la Pe\u00f1a and E.\u00a0Gin\u00e9. Decoupling: From dependence to independence. Probability and its Applications. Springer-Verlag, New York, 1999.","DOI":"10.1007\/978-1-4612-0537-1"},{"issue":"2","key":"9401_CR12","doi-asserted-by":"publisher","first-page":"138","DOI":"10.4169\/000298910x476059","volume":"117","author":"L. D\u00fcmbgen","year":"2010","unstructured":"L.\u00a0D\u00fcmbgen, S.\u00a0A. van de Geer, M.\u00a0C. Veraar, and J.\u00a0A. Wellner. Nemirovski\u2019s inequalities revisited. American mathematical monthly, 117(2):138\u2013160, 2010.","journal-title":"American mathematical monthly"},{"issue":"2","key":"9401_CR13","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/130929928","volume":"12","author":"M Ehler","year":"2014","unstructured":"M.\u00a0Ehler, M.\u00a0Fornasier, and J.\u00a0Sigl. Quasi-linear compressed sensing. SIAM J. Multiscale Model. Simul., 12(2):725\u2013754, 2014.","journal-title":"SIAM J. Multiscale Model. Simul."},{"key":"9401_CR14","unstructured":"T.\u00a0Goldstein and C.\u00a0Studer. Convex phase retrieval without lifting via PhaseMax. In D.\u00a0Precup and Y.\u00a0W. Teh, editors, Proceedings of the 34th International Conference on Machine Learning, volume\u00a070 of Proceedings of Machine Learning Research, pages 1273\u20131281. PMLR, 2017."},{"key":"9401_CR15","unstructured":"P.\u00a0Hand and V.\u00a0Voroninski. Compressed sensing from phaseless gaussian measurements via linear programming in the natural parameter space. preprint \n arXiv:1611.05985\n \n , 2016."},{"key":"9401_CR16","unstructured":"P.\u00a0Hand and V.\u00a0Voroninski. Corruption robust phase retrieval via linear programming. preprint \n arXiv:1612.03547\n \n , 2016."},{"key":"9401_CR17","unstructured":"P.\u00a0Hand and V.\u00a0Voroninski. An elementary proof of convex phase retrieval in the natural parameter space via the linear program PhaseMax. preprint \n arXiv:1611.03935\n \n , 2016."},{"key":"9401_CR18","volume-title":"Neural Networks and Learning Machines","author":"S Haykin","year":"2009","unstructured":"S.\u00a0Haykin. Neural Networks and Learning Machines. Pearson, Upper Saddle River, NJ, USA, 3rd edition, 2009.","edition":"3"},{"issue":"6","key":"9401_CR19","doi-asserted-by":"publisher","first-page":"45:1","DOI":"10.1145\/2512329","volume":"60","author":"C.\u00a0J. Hillar","year":"2013","unstructured":"C.\u00a0J. Hillar and L.\u00a0Lim. Most tensor problems are NP-hard. Journal of the ACM, 60(6):45:1\u201345:39, Nov. 2013.","journal-title":"Journal of the ACM"},{"issue":"1","key":"9401_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-4076(93)90114-K","volume":"58","author":"H Ichimura","year":"1993","unstructured":"H.\u00a0Ichimura. Semiparametric least squares (SLS) and weighted SLS estimation of single-index models. Journal of Econometrics, 58(1):71 \u2013 120, 1993.","journal-title":"Journal of Econometrics"},{"issue":"486","key":"9401_CR21","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1198\/jasa.2009.0121","volume":"104","author":"IM Johnstone","year":"2009","unstructured":"I.\u00a0M. Johnstone and A.\u00a0Y. Lu. On consistency and sparsity for principal components analysis in high dimensions. Journal of the American Statistical Association, 104(486):682\u2013693, 2009.","journal-title":"Journal of the American Statistical Association"},{"issue":"23","key":"9401_CR22","first-page":"12991","volume":"2015","author":"V Koltchinskii","year":"2015","unstructured":"V.\u00a0Koltchinskii and S.\u00a0Mendelson. Bounding the smallest singular value of a random matrix without concentration. International Mathematics Research Notices, 2015(23):12991\u201313008, 2015.","journal-title":"International Mathematics Research Notices"},{"issue":"146","key":"9401_CR23","first-page":"1","volume":"18","author":"G Lecu\u00e9","year":"2017","unstructured":"G.\u00a0Lecu\u00e9 and S.\u00a0Mendelson. Regularization and the small-ball method II: Complexity dependent error rates. Journal of Machine Learning Research, 18(146):1\u201348, 2017.","journal-title":"Journal of Machine Learning Research"},{"key":"9401_CR24","doi-asserted-by":"crossref","unstructured":"G.\u00a0Lecu\u00e9 and S.\u00a0Mendelson. Regularization and the small-ball method I: Sparse recovery. Ann. Statist., 46(2):611\u2013641, 04 2018.","DOI":"10.1214\/17-AOS1562"},{"key":"9401_CR25","volume-title":"Probability in Banach Spaces: Isoperimetry and processes","author":"M. Ledoux","year":"2013","unstructured":"M.\u00a0Ledoux and M.\u00a0Talagrand. Probability in Banach Spaces: Isoperimetry and processes. Springer Science & Business Media, 2013."},{"key":"9401_CR26","doi-asserted-by":"crossref","unstructured":"W.\u00a0V. Li and A.\u00a0Wei. Gaussian integrals involving absolute value functions, volume Volume 5 of Collections, pages 43\u201359. Institute of Mathematical Statistics, Beachwood, Ohio, USA, 2009.","DOI":"10.1214\/09-IMSCOLL504"},{"key":"9401_CR27","doi-asserted-by":"publisher","first-page":"115002","DOI":"10.1088\/0266-5611\/31\/11\/115002","volume":"31","author":"S Ling","year":"2015","unstructured":"S.\u00a0Ling and T.\u00a0Strohmer. Self-calibration and biconvex compressive sensing. Inverse Problems, 31:115002, 2015.","journal-title":"Inverse Problems"},{"key":"9401_CR28","unstructured":"P.\u00a0Mccullagh and J.\u00a0A. Nelder. Generalized linear models, volume\u00a037 of Monographs on statistics and applied probability. Chapman and Hall\/CRC, London ; New York, 2nd edition, 1989."},{"issue":"1","key":"9401_CR29","first-page":"148","volume":"141","author":"C McDiarmid","year":"1989","unstructured":"C.\u00a0McDiarmid. On the method of bounded differences. Surveys in combinatorics, 141(1):148\u2013188, 1989.","journal-title":"Surveys in combinatorics"},{"key":"9401_CR30","unstructured":"S.\u00a0Mendelson. Learning without concentration. In Proceedings of the 27th Conference on Learning Theory (COLT), volume\u00a035 of JMLR W&CP, pages 25\u201339, 2014."},{"key":"9401_CR31","unstructured":"S.\u00a0Mendelson. Learning without concentration for general loss functions. preprint; \n arXiv:1410.3192\n \n , 2014."},{"key":"9401_CR32","unstructured":"A.\u00a0Nemirovski. Topics in Non-parametric Statistics, chapter\u00a05, pages 183\u2013206. Springer Berlin Heidelberg, Berlin, Heidelberg, 2000."},{"issue":"5","key":"9401_CR33","doi-asserted-by":"publisher","first-page":"2886","DOI":"10.1109\/TIT.2015.2401574","volume":"61","author":"S Oymak","year":"2015","unstructured":"S.\u00a0Oymak, A.\u00a0Jalali, M.\u00a0Fazel, Y.\u00a0Eldar, and B.\u00a0Hassibi. Simultaneously structured models with application to sparse and low-rank matrices. Information Theory, IEEE Transactions on, 61(5):2886\u20132908, 2015.","journal-title":"Information Theory, IEEE Transactions on"},{"issue":"3","key":"9401_CR34","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1017\/S0305004100010112","volume":"28","author":"REAC Paley","year":"1932","unstructured":"R.\u00a0E. A.\u00a0C. Paley and A.\u00a0Zygmund. A note on analytic functions in the unit circle. Mathematical Proceedings of the Cambridge Philosophical Society, 28(3):266\u2013272, 1932.","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"9401_CR35","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Plan and R.\u00a0Vershynin. The generalized LASSO with non-linear observations. IEEE Transactions on Information Theory, 62(3):1528\u20131537, Mar. 2016.","DOI":"10.1109\/TIT.2016.2517008"},{"key":"9401_CR36","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Plan, R.\u00a0Vershynin, and E.\u00a0Yudovina. High-dimensional estimation with geometric constraints. Information and Inference, 2016.","DOI":"10.1093\/imaiai\/iaw015"},{"key":"9401_CR37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"S.\u00a0Shalev-Shwartz and S.\u00a0Ben-David. Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, New York, NY, USA, 2014."},{"issue":"4","key":"9401_CR38","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1109\/TSP.2013.2297687","volume":"62","author":"Y Shechtman","year":"2014","unstructured":"Y.\u00a0Shechtman, A.\u00a0Beck, and Y.\u00a0C. Eldar. GESPAR: Efficient phase retrieval of sparse signals. IEEE Trans. Sig. Proc., 62(4):928\u2013938, 2014.","journal-title":"IEEE Trans. Sig. Proc."},{"key":"9401_CR39","unstructured":"M.\u00a0Soltanolkotabi. Learning ReLUs via gradient descent. In Advances in Neural Information Processing Systems, volume\u00a030, pages 2007\u20132017. Curran Associates, Inc., 2017."},{"key":"9401_CR40","unstructured":"C.\u00a0Stein. A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. In Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, volume\u00a02 of Probability Theory, pages 583\u2013602, Berkeley, Calif., 1972. University of California Press."},{"key":"9401_CR41","first-page":"67","volume-title":"Convex Recovery of a Structured Signal from Independent Random Linear Measurements","author":"J.\u00a0A. Tropp","year":"2015","unstructured":"J.\u00a0A. Tropp. Convex Recovery of a Structured Signal from Independent Random Linear Measurements, pages 67\u2013101. Springer International Publishing, Cham, 2015."},{"key":"9401_CR42","doi-asserted-by":"crossref","unstructured":"A.\u00a0W. van Der Vaart and J.\u00a0A. Wellner. Weak Convergence and Empirical Processes. Springer Series in Statistics. Springer, 1996.","DOI":"10.1007\/978-1-4757-2545-2_3"},{"issue":"2","key":"9401_CR43","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1093\/biomet\/asv008","volume":"102","author":"Y. Yu","year":"2014","unstructured":"Y.\u00a0Yu, T.\u00a0Wang, and R.\u00a0J. Samworth. A useful variant of the Davis\u2013Kahan theorem for statisticians. Biometrika, 102(2):315\u2013323, 2014.","journal-title":"Biometrika"},{"issue":"2","key":"9401_CR44","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2006","unstructured":"H.\u00a0Zou, T.\u00a0Hastie, and R.\u00a0Tibshirani. Sparse principal component analysis. Journal of Computational and Graphical Statistics, 15(2):265\u2013286, 2006.","journal-title":"Journal of Computational and Graphical Statistics"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-018-9401-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-018-9401-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-018-9401-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T23:16:33Z","timestamp":1570058193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-018-9401-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,3]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["9401"],"URL":"http:\/\/dx.doi.org\/10.1007\/s10208-018-9401-4","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,3]]},"assertion":[{"value":"2 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}
