{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T08:06:18Z","timestamp":1773216378367,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319244853","type":"print"},{"value":"9783319244860","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24486-0_1","type":"book-chapter","created":{"date-parts":[[2015,10,3]],"date-time":"2015-10-03T17:20:50Z","timestamp":1443892850000},"page":"3-18","source":"Crossref","is-referenced-by-count":20,"title":["Efficient Matrix Sensing Using Rank-1 Gaussian Measurements"],"prefix":"10.1007","author":[{"given":"Kai","family":"Zhong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prateek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inderjit S.","family":"Dhillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,31]]},"reference":[{"key":"1_CR1","unstructured":"Agarwal, A., Anandkumar, A., Jain, P., Netrapalli, P., Tandon, R.: Learning sparsely used overcomplete dictionaries via alternating minimization. COLT (2014)"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1214\/14-AOS1267","volume":"43","author":"TT Cai","year":"2015","unstructured":"Cai, T.T., Zhang, A., et al.: Rop: Matrix recovery via rank-one projections. The Annals of Statistics 43(1), 102\u2013138 (2015)","journal-title":"The Annals of Statistics"},{"issue":"6","key":"1_CR3","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Foundations of Computational Mathematics 9(6), 717\u2013772 (2009)","journal-title":"Foundations of Computational Mathematics"},{"issue":"5","key":"1_CR4","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inform. Theory 56(5), 2053\u20132080 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1_CR5","unstructured":"Chen, Y.: Incoherence-optimal matrix completion. arXiv preprint \n                      arXiv:1310.0154\n                      \n                     (2013)"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","volume":"57","author":"D Gross","year":"2011","unstructured":"Gross, D.: Recovering low-rank matrices from few coefficients in any basis. IEEE Transactions on Information Theory 57(3), 1548\u20131566 (2011)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Hardt, M.: Understanding alternating minimization for matrix completion. In: Foundations 2014 IEEE 55th Annual Symposium on of Computer Science (FOCS), pp. 651\u2013660. IEEE (2014)","DOI":"10.1109\/FOCS.2014.75"},{"key":"1_CR8","unstructured":"Hardt, M., Wootters, M.: Fast matrix completion without the condition number. In: Proceedings of The 27th Conference on Learning Theory, pp. 638\u2013678 (2014)"},{"key":"1_CR9","unstructured":"Hsieh, C.J., Dhillon, I.S., Ravikumar, P.K., Becker, S., Olsen, P.A.: Quic & dirty: A quadratic approximation approach for dirty statistical models. In: Advances in Neural Information Processing Systems, pp. 2006\u20132014 (2014)"},{"key":"1_CR10","unstructured":"Hsieh, C.J., Olsen, P.: Nuclear norm minimization via active subspace selection. In: Proceedings of The 31st International Conference on Machine Learning, pp. 575\u2013583 (2014)"},{"key":"1_CR11","unstructured":"Jain, P., Dhillon, I.S.: Provable inductive matrix completion (2013). CoRR. \n                      http:\/\/arxiv.org\/abs\/1306.0626"},{"key":"1_CR12","unstructured":"Jain, P., Meka, R., Dhillon, I.S.: Guaranteed rank minimization via singular value projection. In: NIPS, pp. 937\u2013945 (2010)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. In: STOC (2013)","DOI":"10.1145\/2488608.2488693"},{"issue":"6","key":"1_CR14","doi-asserted-by":"publisher","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Transactions on Information Theory 56(6), 2980\u20132998 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Kueng, R., Rauhut, H., Terstiege, U.: Low rank matrix recovery from rank one measurements. arXiv preprint \n                      arXiv:1410.6913\n                      \n                     (2014)","DOI":"10.1109\/SAMPTA.2015.7148921"},{"key":"1_CR16","unstructured":"Lee, K., Bresler, Y.: Guaranteed minimum rank approximation from linear observations by nuclear norm minimization with an ellipsoidal constraint. arXiv preprint \n                      arXiv:0903.4742\n                      \n                     (2009)"},{"key":"1_CR17","unstructured":"Liu, Y.K.: Universal low-rank matrix recovery from pauli measurements. In: Advances in Neural Information Processing Systems, pp. 1638\u20131646 (2011)"},{"key":"1_CR18","unstructured":"Netrapalli, P., Niranjan, U., Sanghavi, S., Anandkumar, A., Jain, P.: Non-convex robust PCA. In: Advances in Neural Information Processing Systems, pp. 1107\u20131115 (2014)"},{"key":"1_CR19","first-page":"3413","volume":"12","author":"B Recht","year":"2011","unstructured":"Recht, B.: A simpler approach to matrix completion. The Journal of Machine Learning Research 12, 3413\u20133430 (2011)","journal-title":"The Journal of Machine Learning Research"},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review 52(3), 471\u2013501 (2010)","journal-title":"SIAM Review"},{"issue":"4","key":"1_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2012","unstructured":"Tropp, J.A.: User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics 12(4), 389\u2013434 (2012)","journal-title":"Foundations of Computational Mathematics"},{"key":"1_CR22","unstructured":"Xu, M., Jin, R., Zhou, Z.H.: Speedup matrix completion with side information: application to multi-label learning. In: Advances in Neural Information Processing Systems, pp. 2301\u20132309 (2013)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Yu, H.F., Hsieh, C.J., Si, S., Dhillon, I.S.: Scalable coordinate descent approaches to parallel matrix factorization for recommender systems. In: ICDM, pp. 765\u2013774 (2012)","DOI":"10.1109\/ICDM.2012.168"},{"key":"1_CR24","unstructured":"Yu, H.F., Jain, P., Kar, P., Dhillon, I.S.: Large-scale multi-label learning with missing labels. In: Proceedings of The 31st International Conference on Machine Learning, pp. 593\u2013601 (2014)"},{"key":"1_CR25","unstructured":"Zuk, O., Wagner, A.: Low-rank matrix recovery from row-and-column affine measurements. In: Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6\u201311 July 2015, pp. 2012\u20132020 (2015)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24486-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:36:03Z","timestamp":1559259363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24486-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319244853","9783319244860"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24486-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}