{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T02:51:05Z","timestamp":1784429465345,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,8,21]],"date-time":"2011-08-21T00:00:00Z","timestamp":1313884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,8,21]]},"DOI":"10.1145\/2020408.2020423","type":"proceedings-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T15:22:45Z","timestamp":1314804165000},"page":"42-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":179,"title":["Integrating low-rank and group-sparse structures for robust multi-task learning"],"prefix":"10.1145","author":[{"given":"Jianhui","family":"Chen","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiayu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jieping","family":"Ye","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1194905"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244304322765658"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS620"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835952"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553392"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1088693"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3115436.3115547"},{"key":"e_1_3_2_1_12_1","volume-title":"Robust matrix decomposition with outliers. arXiv:1011.1518","author":"Hsu D.","year":"2010","unstructured":"D. Hsu , S. Kakade , and T. Zhang . Robust matrix decomposition with outliers. arXiv:1011.1518 , 2010 . D. Hsu, S. Kakade, and T. Zhang. Robust matrix decomposition with outliers. arXiv:1011.1518, 2010."},{"key":"e_1_3_2_1_13_1","volume-title":"NIPS","author":"Jacob L.","year":"2008","unstructured":"L. Jacob , F. Bach , and J.-P. Vert . Clustered multi-task learning: A convex formulation . In NIPS , 2008 . L. Jacob, F. Bach, and J.-P. Vert. Clustered multi-task learning: A convex formulation. In NIPS, 2008."},{"key":"e_1_3_2_1_14_1","volume-title":"NIPS","author":"Jalali A.","year":"2010","unstructured":"A. Jalali , P. Ravikumar , S. Sanghavi , and C. Ruan . A dirty model for multi-task learning . In NIPS , 2010 . A. Jalali, P. Ravikumar, S. Sanghavi, and C. Ruan. A dirty model for multi-task learning. In NIPS, 2010."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553434"},{"key":"e_1_3_2_1_16_1","volume-title":"ICML","author":"Kim S.","year":"2010","unstructured":"S. Kim and E. P. Xing . Tree-guided group lasso for multi-task regression with structured sparsity . In ICML , 2010 . S. Kim and E. P. Xing. Tree-guided group lasso for multi-task regression with structured sparsity. In ICML, 2010."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015382"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557082"},{"key":"e_1_3_2_1_19_1","first-page":"339","volume-title":"UAI","author":"Liu J.","year":"2009","unstructured":"J. Liu , S. Ji , and J. Ye . Multi-task feature learning via efficient l2,1-norm minimization . In UAI , pages 339 -- 348 , 2009 . J. Liu, S. Ji, and J. Ye. Multi-task feature learning via efficient l2,1-norm minimization. In UAI, pages 339--348, 2009."},{"key":"e_1_3_2_1_20_1","volume-title":"SLEP: Sparse Learning with Efficient Projections","author":"Liu J.","year":"2009","unstructured":"J. Liu , S. Ji , and J. Ye . SLEP: Sparse Learning with Efficient Projections . Arizona State University , 2009 . J. Liu, S. Ji, and J. Ye. SLEP: Sparse Learning with Efficient Projections. Arizona State University, 2009."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835847"},{"key":"e_1_3_2_1_22_1","volume-title":"COLT","author":"Lounici K.","year":"2008","unstructured":"K. Lounici , M. Pontil , A. B. Tsybakov , and S. van de Geer. Taking advantage of sparsity in multi-task learning . In COLT , 2008 . K. Lounici, M. Pontil, A. B. Tsybakov, and S. van de Geer. Taking advantage of sparsity in multi-task learning. In COLT, 2008."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.24033\/bsmf.1625"},{"key":"e_1_3_2_1_24_1","volume-title":"Lecture Notes","author":"Nemirovski A.","year":"1995","unstructured":"A. Nemirovski . Efficient Methods in Convex Programming . Lecture Notes , 1995 . A. Nemirovski. Efficient Methods in Convex Programming. Lecture Notes, 1995."},{"key":"e_1_3_2_1_25_1","volume-title":"Lecture Notes","author":"Nesterov Y.","year":"1998","unstructured":"Y. Nesterov . Introductory Lectures on Convex Programming . Lecture Notes , 1998 . Y. Nesterov. Introductory Lectures on Convex Programming. Lecture Notes, 1998."},{"key":"e_1_3_2_1_26_1","volume-title":"NIPS","author":"Nie F.","year":"2010","unstructured":"F. Nie , H. Huang , X. Cai , and C. Ding . Efficient and robust feature selection via joint l21-norms minimization . In NIPS , 2010 . F. Nie, H. Huang, X. Cai, and C. Ding. Efficient and robust feature selection via joint l21-norms minimization. In NIPS, 2010."},{"key":"e_1_3_2_1_27_1","volume-title":"Technical report, Dept. of Statistics","author":"Obozinski G.","year":"2006","unstructured":"G. Obozinski , B. Taskar , and M. I. Jordan . Multi-task feature selection . In Technical report, Dept. of Statistics , UC Berkeley , 2006 . G. Obozinski, B. Taskar, and M. I. Jordan. Multi-task feature selection. In Technical report, Dept. of Statistics, UC Berkeley, 2006."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"e_1_3_2_1_29_1","volume-title":"NIPS","author":"Schwaighofer A.","year":"2004","unstructured":"A. Schwaighofer , V. Tresp , and K. Yu . Learning gaussian process kernels via hierarchical bayes . In NIPS , 2004 . A. Schwaighofer, V. Tresp, and K. Yu. Learning gaussian process kernels via hierarchical bayes. In NIPS, 2004."},{"key":"e_1_3_2_1_30_1","volume-title":"ICML","author":"Thrun S.","year":"1996","unstructured":"S. Thrun and J. O'Sullivan . Discovering structure in multiple learning tasks: The TC algorithm . In ICML , 1996 . S. Thrun and J. O'Sullivan. Discovering structure in multiple learning tasks: The TC algorithm. In ICML, 1996."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706095"},{"key":"e_1_3_2_1_32_1","volume-title":"NIPS","author":"Xu H.","year":"2010","unstructured":"H. Xu , C. Caramanis , and S. Sanghavi . Robust pca via outlier pursuit . In NIPS , 2010 . H. Xu, C. Caramanis, and S. Sanghavi. Robust pca via outlier pursuit. In NIPS, 2010."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248659.1248661"},{"key":"e_1_3_2_1_34_1","volume-title":"NIPS","author":"Yang X.","year":"2009","unstructured":"X. Yang , S. Kim , and E. P. Xing . Heterogeneous multitask learning with joint sparsity constraints . In NIPS , 2009 . X. Yang, S. Kim, and E. P. Xing. Heterogeneous multitask learning with joint sparsity constraints. In NIPS, 2009."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102479"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273635"},{"key":"e_1_3_2_1_37_1","volume-title":"NIPS","author":"Zhang J.","year":"2005","unstructured":"J. Zhang , Z. Ghahramani , and Y. Yang . Learning multiple related tasks using latent independent component analysis . In NIPS , 2005 . J. Zhang, Z. Ghahramani, and Y. Yang. Learning multiple related tasks using latent independent component analysis. In NIPS, 2005."},{"key":"e_1_3_2_1_38_1","volume-title":"AISTATS","author":"Zhang Y.","year":"2010","unstructured":"Y. Zhang and D.-Y. Yeung . Multi-task learning using generalized t process . In AISTATS , 2010 . Y. Zhang and D.-Y. Yeung. Multi-task learning using generalized t process. In AISTATS, 2010."}],"event":{"name":"KDD '11: The 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Diego California USA","acronym":"KDD '11","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020423","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2020408.2020423","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:15Z","timestamp":1750240095000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020423"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,21]]},"references-count":38,"alternative-id":["10.1145\/2020408.2020423","10.1145\/2020408"],"URL":"https:\/\/doi.org\/10.1145\/2020408.2020423","relation":{},"subject":[],"published":{"date-parts":[[2011,8,21]]},"assertion":[{"value":"2011-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}