{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T01:39:09Z","timestamp":1772847549610,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T00:00:00Z","timestamp":1680652800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T00:00:00Z","timestamp":1680652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10994-023-06325-w","type":"journal-article","created":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T17:07:44Z","timestamp":1680714464000},"page":"2723-2760","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Robust matrix estimations meet Frank\u2013Wolfe algorithm"],"prefix":"10.1007","volume":"112","author":[{"given":"Naimin","family":"Jing","sequence":"first","affiliation":[]},{"given":"Ethan X.","family":"Fang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6266-5257","authenticated-orcid":false,"given":"Cheng Yong","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,5]]},"reference":[{"key":"6325_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Negahban, S., & Wainwright, M.\u00a0J. (2012). Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions. The Annals of Statistics, 1171\u20131197.","DOI":"10.1214\/12-AOS1000"},{"key":"6325_CR2","unstructured":"Anderson, T. W. (2003). An introduction to multivariate statistical analysis. New York: Wiley, 3rd edition."},{"key":"6325_CR3","doi-asserted-by":"crossref","unstructured":"Boucheron, S., Lugosi, G., & Massart, P. (2013). Concentration inequalities: A nonasymptotic theory of independence. Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"issue":"6","key":"6325_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/S1631-073X(02)02292-6","volume":"334","author":"O Bousquet","year":"2002","unstructured":"Bousquet, O. (2002). A Bennett concentration inequality and its application to suprema of empirical processes. Comptes Rendus Mathematique, 334(6), 495\u2013500.","journal-title":"Comptes Rendus Mathematique"},{"issue":"5","key":"6325_CR5","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E. J., & Tao, T. (2010). The power of convex relaxation: Near-optimal matrix completion. IEEE Transactions on Information Theory, 56(5), 2053\u20132080.","journal-title":"IEEE Transactions on Information Theory"},{"key":"6325_CR6","doi-asserted-by":"crossref","unstructured":"Charisopoulos, V., Chen, Y., Davis, D., D\u00edaz, M., Ding, L., & Drusvyatskiy, D. (2021). Low-rank matrix recovery with composite optimization: Good conditioning and rapid convergence. Foundations of Computational Mathematics, 1\u201389.","DOI":"10.1007\/s10208-020-09490-9"},{"issue":"1","key":"6325_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1093\/imanum\/drq039","volume":"32","author":"C Chen","year":"2012","unstructured":"Chen, C., He, B., & Yuan, X. (2012). Matrix completion via an alternating direction method. IMA Journal of Numerical Analysis, 32(1), 227\u2013245.","journal-title":"IMA Journal of Numerical Analysis"},{"key":"6325_CR8","volume-title":"Regression graphics: Ideas for studying regressions through graphics,","author":"RD Cook","year":"2009","unstructured":"Cook, R. D. (2009). Regression graphics: Ideas for studying regressions through graphics, (Vol. 482). Hoboken: John Wiley & Sons."},{"issue":"6B","key":"6325_CR9","doi-asserted-by":"publisher","first-page":"3481","DOI":"10.1214\/17-AOS1666","volume":"46","author":"A Elsener","year":"2018","unstructured":"Elsener, A., & van de Geer, S. (2018). Robust low-rank matrix estimation. Annals of Statistics, 46(6B), 3481\u20133509.","journal-title":"Annals of Statistics"},{"issue":"3","key":"6325_CR10","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1214\/20-AOS1980","volume":"49","author":"J Fan","year":"2021","unstructured":"Fan, J., Wang, W., & Zhu, Z. (2021). A shrinkage principle for heavy-tailed data: High-dimensional robust low-rank matrix recovery. Annals of Statistics, 49(3), 1239.","journal-title":"Annals of Statistics"},{"issue":"1\u20132","key":"6325_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-014-0841-6","volume":"155","author":"RM Freund","year":"2016","unstructured":"Freund, R. M., & Grigas, P. (2016). New analysis and results for the Frank\u2013Wolfe method. Mathematical Programming, 155(1\u20132), 199\u2013230.","journal-title":"Mathematical Programming"},{"issue":"1","key":"6325_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/15M104726X","volume":"27","author":"RM Freund","year":"2017","unstructured":"Freund, R. M., Grigas, P., & Mazumder, R. (2017). An extended Frank\u2013Wolfe method with \u201cin-face\u2019\u2019 directions, and its application to low-rank matrix completion. SIAM Journal on Optimization, 27(1), 319\u2013346.","journal-title":"SIAM Journal on Optimization"},{"key":"6325_CR13","volume-title":"Robust statistics: The approach based on influence functions","author":"FR Hampel","year":"2011","unstructured":"Hampel, F. R., Ronchetti, E. M., Rousseeuw, P. J., & Stahel, W. A. (2011). Robust statistics: The approach based on influence functions (Vol. 196). Hoboken: John Wiley & Sons."},{"key":"6325_CR14","volume-title":"Robust statistics","author":"PJ Huber","year":"2004","unstructured":"Huber, P. J. (2004). Robust statistics (Vol. 523). Hoboken: John Wiley & Sons."},{"key":"6325_CR15","unstructured":"Jaggi, M. (2013). Revisiting frank-wolfe: Projection-free sparse convex optimization. In International conference on machine learning (pp. 427\u2013435). PMLR."},{"key":"6325_CR16","unstructured":"Kerdreux, T., d\u2019Aspremont, A., & Pokutta, S. (2018). Restarting frank-wolfe. arXiv preprint arXiv:1810.02429."},{"issue":"1","key":"6325_CR17","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"},{"issue":"5","key":"6325_CR18","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1214\/11-AOS894","volume":"39","author":"V Koltchinskii","year":"2011","unstructured":"Koltchinskii, V., Lounici, K., & Tsybakov, A. B. (2011). Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. The Annals of Statistics, 39(5), 2302\u20132329.","journal-title":"The Annals of Statistics"},{"key":"6325_CR19","unstructured":"Lacoste-Julien, S. & Jaggi, M. (2015). On the global linear convergence of Frank\u2013Wolfe optimization variants. arXiv preprint arXiv:1511.05932."},{"key":"6325_CR20","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical models","author":"SL Lauritzen","year":"1996","unstructured":"Lauritzen, S. L. (1996). Graphical models (Vol. 17). Oxford: Clarendon Press."},{"key":"6325_CR21","unstructured":"Ledoux, M., & Talagrand, M. (2013). Probability in Banach spaces: Isoperimetry and processes. Springer, Berlin."},{"issue":"2","key":"6325_CR22","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1214\/16-AOS1471","volume":"45","author":"P-L Loh","year":"2017","unstructured":"Loh, P.-L. (2017). Statistical consistency and asymptotic normality for high-dimensional robust $$m$$-estimators. The Annals of Statistics, 45(2), 866\u2013896.","journal-title":"The Annals of Statistics"},{"key":"6325_CR23","doi-asserted-by":"crossref","unstructured":"Negahban, S., & Wainwright, M. J. (2011). Estimation of (near) low-rank matrices with noise and high-dimensional scaling. The Annals of Statistics, 1069\u20131097.","DOI":"10.1214\/10-AOS850"},{"issue":"1","key":"6325_CR24","first-page":"1665","volume":"13","author":"S Negahban","year":"2012","unstructured":"Negahban, S., & Wainwright, M. J. (2012). Restricted strong convexity and weighted matrix completion: Optimal bounds with noise. The Journal of Machine Learning Research, 13(1), 1665\u20131697.","journal-title":"The Journal of Machine Learning Research"},{"issue":"4","key":"6325_CR25","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1214\/12-STS400","volume":"27","author":"SN Negahban","year":"2012","unstructured":"Negahban, S. N., Ravikumar, P., Wainwright, M. J., & Yu, B. (2012). A unified framework for high-dimensional analysis of $$m$$-estimators with decomposable regularizers. Statistical Science, 27(4), 538\u2013557.","journal-title":"Statistical Science"},{"key":"6325_CR26","unstructured":"Recht, B. (2011). A simpler approach to matrix completion. Journal of Machine Learning Research, 12(12)."},{"key":"6325_CR27","doi-asserted-by":"crossref","unstructured":"Reddi, S. J., Hefny, A., Sra, S., Poczos, B., & Smola, A. (2016). Stochastic variance reduction for nonconvex optimization. In International conference on machine learning (pp. 314\u2013323).","DOI":"10.1109\/ALLERTON.2016.7852377"},{"key":"6325_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2853-8","volume-title":"Multivariate reduced rank regression","author":"GC Reinsel","year":"1998","unstructured":"Reinsel, G. C., & Velu, R. (1998). Multivariate reduced rank regression. Berlin: Springer."},{"issue":"2","key":"6325_CR29","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1214\/10-AOS860","volume":"39","author":"A Rohde","year":"2011","unstructured":"Rohde, A., & Tsybakov, A. B. (2011). Estimation of high-dimensional low-rank matrices. The Annals of Statistics, 39(2), 887\u2013930.","journal-title":"The Annals of Statistics"},{"issue":"3","key":"6325_CR30","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1093\/biomet\/asx032","volume":"104","author":"Y She","year":"2017","unstructured":"She, Y., & Chen, K. (2017). Robust reduced-rank regression. Biometrika, 104(3), 633\u2013647.","journal-title":"Biometrika"},{"issue":"529","key":"6325_CR31","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1080\/01621459.2018.1543124","volume":"115","author":"Q Sun","year":"2020","unstructured":"Sun, Q., Zhou, W.-X., & Fan, J. (2020). Adaptive Huber regression. Journal of the American Statistical Association, 115(529), 254\u2013265.","journal-title":"Journal of the American Statistical Association"},{"key":"6325_CR32","doi-asserted-by":"crossref","unstructured":"Swoboda, P., & Kolmogorov, V. (2019). Map inference via block-coordinate Frank\u2013Wolfe algorithm. In Proceedings of the IEEE conference on computer vision and pattern recognition (pp. 11146\u201311155).","DOI":"10.1109\/CVPR.2019.01140"},{"issue":"615\u2013640","key":"6325_CR33","first-page":"15","volume":"6","author":"K-C Toh","year":"2010","unstructured":"Toh, K.-C., & Yun, S. (2010). An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pacific Journal of Optimization, 6(615\u2013640), 15.","journal-title":"Pacific Journal of Optimization"},{"issue":"1","key":"6325_CR34","first-page":"5404","volume":"18","author":"RK Wong","year":"2017","unstructured":"Wong, R. K., & Lee, T. C. (2017). Matrix completion with noisy entries and outliers. The Journal of Machine Learning Research, 18(1), 5404\u20135428.","journal-title":"The Journal of Machine Learning Research"},{"key":"6325_CR35","doi-asserted-by":"crossref","unstructured":"Zhou, W.-X., Bose, K., Fan, J., & Liu, H. (2018). A new perspective on robust m-estimation: Finite sample theory and applications to dependence-adjusted multiple testing. The Annals of Statistics, 46(5), 1904\u20131931.","DOI":"10.1214\/17-AOS1606"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06325-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-023-06325-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06325-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:03:06Z","timestamp":1712275386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-023-06325-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,5]]},"references-count":35,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["6325"],"URL":"https:\/\/doi.org\/10.1007\/s10994-023-06325-w","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,5]]},"assertion":[{"value":"7 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}