{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:55:40Z","timestamp":1760597740260,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T00:00:00Z","timestamp":1486425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T00:00:00Z","timestamp":1486425600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["III-1360971","bigdata-1419210"],"award-info":[{"award-number":["III-1360971","bigdata-1419210"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-13-1-0764"],"award-info":[{"award-number":["N00014-13-1-0764"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-13-1-0137"],"award-info":[{"award-number":["FA9550-13-1-0137"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["III-1360971","Bigdata-1419210"],"award-info":[{"award-number":["III-1360971","Bigdata-1419210"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-13-1-0764"],"award-info":[{"award-number":["N00014-13-1-0764"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-13-1-0137"],"award-info":[{"award-number":["FA9550-13-1-0137"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10994-017-5628-6","type":"journal-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T15:25:56Z","timestamp":1486481156000},"page":"419-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Online optimization for max-norm regularization"],"prefix":"10.1007","volume":"106","author":[{"given":"Jie","family":"Shen","sequence":"first","affiliation":[]},{"given":"Huan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Ping","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,7]]},"reference":[{"key":"5628_CR1","doi-asserted-by":"crossref","unstructured":"Arta\u010d, M., Jogan, M., & Leonardis, A. (2002). Incremental PCA for on-line visual learning and recognition. In Proceedings of the 16th international conference on pattern recognition (Vol. 3, pp. 781\u2013784).","DOI":"10.1109\/ICPR.2002.1048133"},{"key":"5628_CR2","unstructured":"Bertsekas, D. P. (1999). Nonlinear programming. Massachusetts: Athena Scientific."},{"key":"5628_CR3","unstructured":"Bhojanapalli, S., Kyrillidis, A., & Sanghavi, S. (2016). Dropping convexity for faster semi-definite optimization. In Proceedings of the 29th conference on learning theory (pp. 530\u2013582)."},{"issue":"2","key":"5628_CR4","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1137\/S0036144596302644","volume":"40","author":"JF Bonnans","year":"1998","unstructured":"Bonnans, J. F., & Shapiro, A. (1998). Optimization problems with perturbations: A guided tour. SIAM Review, 40(2), 228\u2013264.","journal-title":"SIAM Review"},{"issue":"9","key":"5628_CR5","first-page":"142","volume":"17","author":"L Bottou","year":"1998","unstructured":"Bottou, L. (1998). Online learning and stochastic approximations. On-line Learning in Neural Networks, 17(9), 142.","journal-title":"On-line Learning in Neural Networks"},{"issue":"3","key":"5628_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S Burer","year":"2005","unstructured":"Burer, S., & Monteiro, R. D. C. (2005). Local minima and convergence in low-rank semidefinite programming. Mathematical Programming, 103(3), 427\u2013444.","journal-title":"Mathematical Programming"},{"issue":"4","key":"5628_CR7","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J Cai","year":"2010","unstructured":"Cai, J., Cand\u00e8s, E. J., & Shen, Z. (2010). A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4), 1956\u20131982.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"5628_CR8","first-page":"3619","volume":"14","author":"TT Cai","year":"2013","unstructured":"Cai, T. T., & Zhou, W. (2013). A max-norm constrained minimization approach to 1-bit matrix completion. Journal of Machine Learning Research, 14(1), 3619\u20133647.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"5628_CR9","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1214\/16-EJS1147","volume":"10","author":"TT Cai","year":"2016","unstructured":"Cai, T. T., & Zhou, W. X. (2016). Matrix completion via max-norm constrained optimization. Electronic Journal of Statistics, 10(1), 1493\u20131525.","journal-title":"Electronic Journal of Statistics"},{"key":"5628_CR10","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E. J., Li, X., Ma, Y., & Wright, J. (2011). Robust principal component analysis? Journal of the ACM, 58(3), 11:1\u201311:37.","DOI":"10.1145\/1970392.1970395"},{"issue":"6","key":"5628_CR11","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. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717\u2013772.","journal-title":"Foundations of Computational Mathematics"},{"issue":"3","key":"5628_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1093\/imaiai\/iau006","volume":"3","author":"MA Davenport","year":"2014","unstructured":"Davenport, M. A., Plan, Y., van den Berg, E., & Wootters, M. (2014). 1-Bit matrix completion. Information and Inference, 3(3), 189\u2013223.","journal-title":"Information and Inference"},{"issue":"3","key":"5628_CR13","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/18.382009","volume":"41","author":"DL Donoho","year":"1995","unstructured":"Donoho, D. L. (1995). De-noising by soft-thresholding. IEEE Transactions on Information Theory, 41(3), 613\u2013627.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5628_CR14","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., & Boyd, S. P. (2001). A rank minimization heuristic with application to minimum order system approximation. In Proceedings of the American control conference (Vol. 6, pp. 4734\u20134739).","DOI":"10.1109\/ACC.2001.945730"},{"key":"5628_CR15","unstructured":"Feng, J., Xu, H., & Yan, S. (2013). Online robust PCA via stochastic optimization. In Proceedings of the 27th annual conference on neural information processing systems (pp. 404\u2013412)."},{"key":"5628_CR16","unstructured":"Foygel, R., Srebro, N., & Salakhutdinov, R. (2012). Matrix reconstruction with the local max norm. In Proceedings of the 26th annual conference on neural information processing systems (pp. 944\u2013952)."},{"key":"5628_CR17","unstructured":"Jalali, A., & Srebro, N. (2012). Clustering using max-norm constrained optimization. In Proceedings of the 29th international conference on machine learning."},{"key":"5628_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/0470013192.bsa501","volume-title":"Principal component analysis","author":"I Jolliffe","year":"2005","unstructured":"Jolliffe, I. (2005). Principal component analysis. Hoboken: Wiley Online Library."},{"issue":"1","key":"5628_CR19","doi-asserted-by":"publisher","first-page":"282","DOI":"10.3150\/12-BEJ486","volume":"20","author":"O Klopp","year":"2014","unstructured":"Klopp, O. (2014). Noisy low-rank matrix completion with general sampling distribution. Bernoulli, 20(1), 282\u2013303.","journal-title":"Bernoulli"},{"key":"5628_CR20","unstructured":"Lee, J. D., Recht, B., Salakhutdinov, R., Srebro, N., & Tropp, J. A. (2010). Practical large-scale optimization for max-norm regularization. In Proceedings of the 24th annual conference on neural information processing systems (pp. 1297\u20131305)."},{"key":"5628_CR21","unstructured":"Liu, G., Lin, Z., & Yu, Y. (2010). Robust subspace segmentation by low-rank representation. In Proceedings of the 27th international conference on machine learning (pp. 663\u2013670)."},{"key":"5628_CR22","unstructured":"Mairal, J. (2013). Stochastic majorization-minimization algorithms for large-scale optimization. In Proceedings of the 27th annual conference on neural information processing systems (pp. 2283\u20132291)."},{"key":"5628_CR23","first-page":"19","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal, J., Bach, F. R., Ponce, J., & Sapiro, G. (2010). Online learning for matrix factorization and sparse coding. Journal of Machine Learning Research, 11, 19\u201360.","journal-title":"Journal of Machine Learning Research"},{"key":"5628_CR24","doi-asserted-by":"crossref","unstructured":"Neyshabur, B., Makarychev, Y., & Srebro, N. (2014). Clustering, hamming embedding, generalized LSH and the max norm. In Proceedings of the 25th international conference on algorithmic learning theory (pp. 306\u2013320).","DOI":"10.1007\/978-3-319-11662-4_22"},{"key":"5628_CR25","unstructured":"Orabona, F., Argyriou, A., & Srebro, N. (2012). PRISMA: PRoximal Iterative SMoothing Algorithm. CoRR abs\/1206.2372."},{"issue":"3","key":"5628_CR26","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. (2010). Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review, 52(3), 471\u2013501.","journal-title":"SIAM Review"},{"key":"5628_CR27","doi-asserted-by":"crossref","unstructured":"Rennie, J. D. M., & Srebro, N. (2005). Fast maximum margin matrix factorization for collaborative prediction. In Proceedings of the 22nd international conference on machine learning (pp. 713\u2013719).","DOI":"10.1145\/1102351.1102441"},{"key":"5628_CR28","unstructured":"Salakhutdinov, R., & Srebro, N. (2010). Collaborative filtering in a non-uniform world: Learning with the weighted trace norm. In Proceedings of the 24th annual conference on neural information processing systems (pp. 2056\u20132064)."},{"key":"5628_CR29","unstructured":"Shen, J., Xu, H., & Li, P. (2014). Online optimization for max-norm regularization. In Proceedings of the 28th annual conference on neural information processing systems (pp. 1718\u20131726)."},{"key":"5628_CR30","unstructured":"Srebro, N., Rennie, J. D. M., & Jaakkola, T. S. (2004). Maximum-margin matrix factorization. In Proceedings of the 18th annual conference on neural information processing systems (pp. 1329\u20131336)."},{"key":"5628_CR31","doi-asserted-by":"crossref","unstructured":"Srebro, N., & Shraibman, A. (2005). Rank, trace-norm and max-norm. In Proceedings of the 18th annual conference on learning theory (pp. 545\u2013560).","DOI":"10.1007\/11503415_37"},{"key":"5628_CR32","volume-title":"Asymptotic statistics","author":"AW Van\u00a0der Vaart","year":"2000","unstructured":"Van\u00a0der Vaart, A. W. (2000). Asymptotic statistics (Vol. 3). Cambridge: Cambridge University Press."},{"key":"5628_CR33","unstructured":"Wang, H., & Banerjee, A. (2014). Randomized block coordinate descent for online and stochastic optimization. CoRR abs\/1407.0107."},{"key":"5628_CR34","unstructured":"Xu, H., Caramanis, C., & Mannor, S. (2010). Principal component analysis with contaminated data: The high dimensional case. In Proceedings of the 23rd conference on learning theory (pp. 490\u2013502)."},{"issue":"1","key":"5628_CR35","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1109\/TIT.2012.2212415","volume":"59","author":"H Xu","year":"2013","unstructured":"Xu, H., Caramanis, C., & Mannor, S. (2013). Outlier-robust PCA: The high-dimensional case. IEEE Transactions on Information Theory, 59(1), 546\u2013572.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"5628_CR36","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1109\/TIT.2011.2173156","volume":"58","author":"H Xu","year":"2012","unstructured":"Xu, H., Caramanis, C., & Sanghavi, S. (2012). Robust PCA via outlier pursuit. IEEE Transactions on Information Theory, 58(5), 3047\u20133064.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5628_CR37","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Li, X., Wright, J., Cand\u00e8s, E. J., & Ma, Y. (2010). Stable principal component pursuit. In Proceedings of the 2010 IEEE international symposium on information theory (pp. 1518\u20131522).","DOI":"10.1109\/ISIT.2010.5513535"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5628-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-017-5628-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5628-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T08:06:58Z","timestamp":1589702818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-017-5628-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,7]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["5628"],"URL":"https:\/\/doi.org\/10.1007\/s10994-017-5628-6","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2017,2,7]]},"assertion":[{"value":"8 November 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}