{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:33:27Z","timestamp":1757626407030,"version":"3.44.0"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030865221"},{"type":"electronic","value":"9783030865238"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86523-8_13","type":"book-chapter","created":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T06:05:16Z","timestamp":1631253916000},"page":"200-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust Regression via Model Based Methods"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8374-7286","authenticated-orcid":false,"given":"Armin","family":"Moharrer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4086-1038","authenticated-orcid":false,"given":"Khashayar","family":"Kamran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9544-1567","authenticated-orcid":false,"given":"Edmund","family":"Yeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8355-4751","authenticated-orcid":false,"given":"Stratis","family":"Ioannidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,11]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-Lojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-61159-9_32","volume":"1","author":"A Baccini","year":"1996","unstructured":"Baccini, A., Besse, P., Falguerolles, A.: A l1-norm PCA and a heuristic approach. Ordinal Symbolic Data Anal. 1(1), 359\u2013368 (1996)","journal-title":"Ordinal Symbolic Data Anal."},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmonic Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmonic Anal."},{"key":"13_CR4","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends\u00ae Mach. Learn. 3(1), 1\u2013122 (2011)"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Croux, C., Filzmoser, P.: Robust factorization of a data matrix. In: COMPSTAT, pp. 245\u2013250. Springer (1998). https:\/\/doi.org\/10.1007\/978-3-662-01131-7_29","DOI":"10.1007\/978-3-662-01131-7_29"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1908","DOI":"10.1137\/17M1151031","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Grimmer, B.: Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems. SIAM J. Optim. 29(3), 1908\u20131930 (2019)","journal-title":"SIAM J. Optim."},{"key":"13_CR8","unstructured":"Ding, C., Zhou, D., He, X., Zha, H.: R1-PCA: rotational invariant l 1-norm principal component analysis for robust subspace factorization. In: ICML (2006)"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Oper. Res. 43(3), 919\u2013948 (2018)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","volume":"178","author":"D Drusvyatskiy","year":"2019","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Prog. 178(1), 503\u2013558 (2019)","journal-title":"Math. Prog."},{"key":"13_CR11","unstructured":"Du, L., et al.: Robust multiple kernel k-means using l21-norm. In: IJCAI (2015)"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1137\/17M1135086","volume":"28","author":"JC Duchi","year":"2018","unstructured":"Duchi, J.C., Ruan, F.: Stochastic methods for composite and weakly convex optimization problems. SIAM J. Optim. 28(4), 3229\u20133259 (2018)","journal-title":"SIAM J. Optim."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Eriksson, A., Van Den Hengel, A.: Efficient computation of robust low-rank matrix approximations in the presence of missing data using the l1 norm. In: CVPR (2010)","DOI":"10.1109\/CVPR.2010.5540139"},{"issue":"9","key":"13_CR14","doi-asserted-by":"publisher","first-page":"2421","DOI":"10.1162\/NECO_a_00168","volume":"23","author":"C F\u00e9votte","year":"2011","unstructured":"F\u00e9votte, C., Idier, J.: Algorithms for nonnegative matrix factorization with the $$\\beta $$-divergence. Neural Comput. 23(9), 2421\u20132456 (2011)","journal-title":"Neural Comput."},{"key":"13_CR15","series-title":"Springer Series in Statistics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. SSS, Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-84858-7"},{"key":"13_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976410","volume-title":"Nonnegative Matrix Factorization","author":"N Gillis","year":"2020","unstructured":"Gillis, N.: Nonnegative Matrix Factorization. SIAM - Society for Industrial and Applied Mathematics, Philadelphia (2020)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Hosseini, S., Chapman, A., Mesbahi, M.: Online distributed ADMM via dual averaging. In: CDC (2014)","DOI":"10.1109\/CDC.2014.7039496"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Jiang, W., Gao, H., Chung, F.L., Huang, H.: The l2,1-norm stacked robust autoencoders for domain adaptation. In: AAAI (2016)","DOI":"10.1609\/aaai.v30i1.10274"},{"key":"13_CR19","unstructured":"Ke, Q., Kanade, T.: Robust l1 factorization in the presence of outliers and missing data by alternative convex programming. In: CVPR (2005)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Kong, D., Ding, C., Huang, H.: Robust nonnegative matrix factorization using l21-norm. In: CIKM (2011)","DOI":"10.1145\/2063576.2063676"},{"issue":"9","key":"13_CR21","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1109\/TPAMI.2008.114","volume":"30","author":"N Kwak","year":"2008","unstructured":"Kwak, N.: Principal component analysis based on l1-norm maximization. IEEE Trans. Pattern Anal. Mach. Intell. 30(9), 1672\u20131680 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"13_CR22","unstructured":"Le, H., Gillis, N., Patrinos, P.: Inertial block proximal methods for non-convex non-smooth optimization. In: ICML (2020)"},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10107-015-0943-9","volume":"158","author":"AS Lewis","year":"2016","unstructured":"Lewis, A.S., Wright, S.J.: A proximal method for composite minimization. Math. Prog. 158(1), 501\u2013546 (2016)","journal-title":"Math. Prog."},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Li, X., Pang, Y., Yuan, Y.: l1-norm-based 2DPCA. IEEE Trans. Syst. Man Cybern. Part B Cybern. 40(4), 1170\u20131175 (2010)","DOI":"10.1109\/TSMCB.2009.2035629"},{"key":"13_CR25","unstructured":"Liu, J., Ye, J.: Efficient l1\/lq NormRregularization. arXiv preprint arXiv:1009.4766 (2010)"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Liu, Y., Shang, F., Cheng, J.: Accelerated variance reduced stochastic ADMM. In: AAAI (2017)","DOI":"10.1609\/aaai.v31i1.10843"},{"key":"13_CR27","unstructured":"Mai, V., Johansson, M.: Convergence of a stochastic gradient method with momentum for non-smooth non-convex optimization. In: ICML (2020)"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Mehta, J., Gupta, K., Gogna, A., Majumdar, A., Anand, S.: Stacked robust autoencoder for classification. In: NeurIPS (2016)","DOI":"10.1007\/978-3-319-46675-0_66"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Michelot, C.: A finite algorithm for finding the projection of a point onto the canonical simplex of n. J. Optim. Theor. Appl. 50(1), 1\u20136 (1986)","DOI":"10.1007\/BF00938486"},{"key":"13_CR30","first-page":"667","volume":"6","author":"A Moharrer","year":"2020","unstructured":"Moharrer, A., Gao, J., Wang, S., Bento, J., Ioannidis, S.: Massively distributed graph distances. IEEE Trans. Sig. Inf. Process. Netw. 6, 667\u2013683 (2020)","journal-title":"IEEE Trans. Sig. Inf. Process. Netw."},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Moharrer, A., Kamran, K., Yeh, E., Ioannidis, S.: Robust regression via model based methods. arXiv preprint arXiv:2106.10759 (2021)","DOI":"10.1007\/978-3-030-86523-8_13"},{"key":"13_CR32","first-page":"238","volume":"255","author":"JJ Moreau","year":"1962","unstructured":"Moreau, J.J.: D\u00e9composition orthogonale d\u2019un espace hilbertien selon deux c\u00f4nes mutuellement polaires. Comptes rendus hebdomadaires des s\u00e9ances de l\u2019Acad\u00e9mie des sciences 255, 238\u2013240 (1962)","journal-title":"Comptes rendus hebdomadaires des s\u00e9ances de l\u2019Acad\u00e9mie des sciences"},{"issue":"2","key":"13_CR33","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"key":"13_CR34","unstructured":"Nie, F., Huang, H., Cai, X., Ding, C.H.: Efficient and robust feature selection via joint l2,1-norms minimization. In: NIPS (2010)"},{"issue":"1","key":"13_CR35","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/s10957-018-01452-0","volume":"181","author":"P Ochs","year":"2019","unstructured":"Ochs, P., Fadili, J., Brox, T.: Non-smooth non-convex Bregman minimization: unification and new algorithms. J. Optim. Theor. Appl. 181(1), 244\u2013278 (2019)","journal-title":"J. Optim. Theor. Appl."},{"key":"13_CR36","unstructured":"Ochs, P., Malitsky, Y.: Model function based conditional gradient method with Armijo-like line search. In: Proceedings of the 36th International Conference on Machine Learning (2019)"},{"key":"13_CR37","unstructured":"Ouyang, H., He, N., Tran, L., Gray, A.: Stochastic alternating direction method of multipliers. In: International Conference on Machine Learning, pp. 80\u201388. PMLR (2013)"},{"issue":"2","key":"13_CR38","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P Paatero","year":"1994","unstructured":"Paatero, P., Tapper, U.: Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 5(2), 111\u2013126 (1994)","journal-title":"Environmetrics"},{"issue":"11","key":"13_CR39","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1109\/TPAMI.2011.282","volume":"34","author":"Y Peng","year":"2012","unstructured":"Peng, Y., Ganesh, A., Wright, J., Xu, W., Ma, Y.: Rasl: robust alignment by sparse and low-rank decomposition for linearly correlated images. IEEE Trans. Pattern Anal. Mach. Intell. 34(11), 2233\u20132246 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"13_CR40","unstructured":"Pesme, S., Flammarion, N.: Online robust regression via SGD on the l1 loss. In: NeurIPS (2020)"},{"key":"13_CR41","unstructured":"Qian, M., Zhai, C.: Robust unsupervised feature selection. In: IJCAI (2013)"},{"issue":"1","key":"13_CR42","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10994-016-5546-z","volume":"104","author":"E Spyromitros-Xioufis","year":"2016","unstructured":"Spyromitros-Xioufis, E., Tsoumakas, G., Groves, W., Vlahavas, I.: Multi-target regression via input space expansion: treating targets as inputs. Mach. Learn. 104(1), 55\u201398 (2016)","journal-title":"Mach. Learn."},{"key":"13_CR43","unstructured":"Suzuki, T.: Dual averaging and proximal gradient descent for online alternating direction multiplier method. In: ICML (2013)"},{"issue":"1","key":"13_CR44","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"Tao, M., Yuan, X.: Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J. Optim. 21(1), 57\u201381 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"13_CR45","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/moor.8.2.231","volume":"8","author":"JP Vial","year":"1983","unstructured":"Vial, J.P.: Strong and weak convexity of sets and functions. Math. Oper. Res. 8(2), 231\u2013259 (1983)","journal-title":"Math. Oper. Res."},{"key":"13_CR46","unstructured":"Vincent, P., Larochelle, H., Lajoie, I., Bengio, Y., Manzagol, P.A.: Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion. J. Mach. Learn. Res. 11(Dec), 3371\u20133408 (2010)"},{"issue":"2","key":"13_CR47","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10618-018-0595-5","volume":"33","author":"W Waegeman","year":"2019","unstructured":"Waegeman, W., Dembczy\u0144ski, K., H\u00fcllermeier, E.: Multi-target prediction: a unifying view on problems and methods. Data Min. Knowl. Discovery 33(2), 293\u2013324 (2019)","journal-title":"Data Min. Knowl. Discovery"},{"key":"13_CR48","unstructured":"Wang, H., Banerjee, A.: Online alternating direction method. In: ICML (2012)"},{"key":"13_CR49","unstructured":"Zheng, S., Kwok, J.T.: Fast-and-light stochastic ADMM. In: IJCAI, pp. 2407\u20132613 (2016)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86523-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:03:35Z","timestamp":1757455415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86523-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865221","9783030865238"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86523-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2021.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"869","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"210","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}