{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T06:41:13Z","timestamp":1782888073941,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"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":[[2012,8,12]]},"DOI":"10.1145\/2339530.2339672","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"895-903","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":192,"title":["Robust multi-task feature learning"],"prefix":"10.1145","author":[{"given":"Pinghua","family":"Gong","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jieping","family":"Ye","sequence":"additional","affiliation":[{"name":"The Biodesign Institute, Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changshui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1194905"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","DOI":"10.1561\/9781601985118","volume-title":"Optimization with sparsity-inducing penalties. Arxiv preprint arXiv:1108.0775","author":"Bach F.","year":"2011","unstructured":"F. Bach , R. Jenatton , J. Mairal , and G. Obozinski . Optimization with sparsity-inducing penalties. Arxiv preprint arXiv:1108.0775 , 2011 . F. Bach, R. Jenatton, J. Mairal, and G. Obozinski. Optimization with sparsity-inducing penalties. Arxiv preprint arXiv:1108.0775, 2011."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244304322765658"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622248.1622254"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS620"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835952"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020423"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014067"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2011.02.019"},{"key":"e_1_3_2_2_13_1","volume-title":"Matrix analysis","author":"Horn R.","year":"1990","unstructured":"R. Horn and C. Johnson . Matrix analysis . Cambridge University Press , 1990 . R. Horn and C. Johnson. Matrix analysis. Cambridge University Press, 1990."},{"key":"e_1_3_2_2_14_1","volume-title":"NIPS","author":"Jacob L.","year":"2008","unstructured":"L. Jacob , F. Bach , and J. Vert . Clustered multi-task learning: A convex formulation . NIPS , 2008 . L. Jacob, F. Bach, and J. Vert. Clustered multi-task learning: A convex formulation. NIPS, 2008."},{"key":"e_1_3_2_2_15_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 . NIPS , 2010 . A. Jalali, P. Ravikumar, S. Sanghavi, and C. Ruan. A dirty model for multi-task learning. NIPS, 2010."},{"key":"e_1_3_2_2_16_1","volume-title":"ICML","author":"Kang Z.","year":"2011","unstructured":"Z. Kang , K. Grauman , and F. Sha . Learning with whom to share in multi-task feature learning . In ICML , 2011 . Z. Kang, K. Grauman, and F. Sha. Learning with whom to share in multi-task feature learning. In ICML, 2011."},{"key":"e_1_3_2_2_17_1","volume-title":"ICML","author":"Kim S.","year":"2009","unstructured":"S. Kim and E. Xing . Tree-guided group lasso for multi-task regression with structured sparsity . In ICML , 2009 . S. Kim and E. Xing. Tree-guided group lasso for multi-task regression with structured sparsity. In ICML, 2009."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015382"},{"key":"e_1_3_2_2_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_2_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_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835847"},{"key":"e_1_3_2_2_22_1","volume-title":"COLT","author":"Lounici K.","year":"2009","unstructured":"K. Lounici , M. Pontil , A. Tsybakov , and S. Van De Geer. Taking advantage of sparsity in multi-task learning . In COLT , 2009 . K. Lounici, M. Pontil, A. Tsybakov, and S. Van De Geer. Taking advantage of sparsity in multi-task learning. In COLT, 2009."},{"key":"e_1_3_2_2_23_1","first-page":"21","article-title":"Joint support recovery under high-dimensional scaling: Benefits and perils of l1,\u221e-regularization","author":"Negahban S.","year":"2008","unstructured":"S. Negahban and M. Wainwright . Joint support recovery under high-dimensional scaling: Benefits and perils of l1,\u221e-regularization . NIPS , 21 , 2008 . S. Negahban and M. Wainwright. Joint support recovery under high-dimensional scaling: Benefits and perils of l1,\u221e-regularization. NIPS, 21, 2008.","journal-title":"NIPS"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS850"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory lectures on convex optimization: A basic course","author":"Nesterov Y.","year":"2004","unstructured":"Y. Nesterov . Introductory lectures on convex optimization: A basic course . Springer Netherlands , 2004 . Y. Nesterov. Introductory lectures on convex optimization: A basic course. Springer Netherlands, 2004."},{"key":"e_1_3_2_2_26_1","volume-title":"Center for Operations Research and Econometrics (CORE)","author":"Nesterov Y.","year":"2007","unstructured":"Y. Nesterov . Gradient methods for minimizing composite objective function. Center for Operations Research and Econometrics (CORE) , Catholic University of Louvain , Tech . Rep, 76, 2007 . Y. Nesterov. Gradient methods for minimizing composite objective function. Center for Operations Research and Econometrics (CORE), Catholic University of Louvain, Tech. Rep, 76, 2007."},{"key":"e_1_3_2_2_28_1","first-page":"1867","article-title":"Large margin multi-task metric learning","volume":"23","author":"Parameswaran S.","year":"2010","unstructured":"S. Parameswaran and K. Weinberger . Large margin multi-task metric learning . NIPS , 23 : 1867 -- 1875 , 2010 . S. Parameswaran and K. Weinberger. Large margin multi-task metric learning. NIPS, 23:1867--1875, 2010.","journal-title":"NIPS"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/090763184"},{"key":"e_1_3_2_2_30_1","volume-title":"NIPS","author":"Quadrianto N.","year":"2010","unstructured":"N. Quadrianto , A. Smola , T. Caetano , S. Vishwanathan , and J. Petterson . Multitask learning without label correspondences . NIPS , 2010 . N. Quadrianto, A. Smola, T. Caetano, S. Vishwanathan, and J. Petterson. Multitask learning without label correspondences. NIPS, 2010."},{"key":"e_1_3_2_2_31_1","first-page":"1209","article-title":"Learning gaussian process kernels via hierarchical bayes","volume":"17","author":"Schwaighofer A.","year":"2005","unstructured":"A. Schwaighofer , V. Tresp , and K. Yu . Learning gaussian process kernels via hierarchical bayes . NIPS , 17 : 1209 -- 1216 , 2005 . A. Schwaighofer, V. Tresp, and K. Yu. Learning gaussian process kernels via hierarchical bayes. NIPS, 17:1209--1216, 2005.","journal-title":"NIPS"},{"key":"e_1_3_2_2_32_1","first-page":"489","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 , pages 489 -- 497 , 1996 . S. Thrun and J. O'Sullivan. Discovering structure in multiple learning tasks: The tc algorithm. In ICML, pages 489--497, 1996."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706095"},{"key":"e_1_3_2_2_34_1","first-page":"35","article-title":"Multi-task learning for classification with dirichlet process priors","volume":"8","author":"Xue Y.","year":"2007","unstructured":"Y. Xue , X. Liao , L. Carin , and B. Krishnapuram . Multi-task learning for classification with dirichlet process priors . JMLR , 8 : 35 -- 63 , 2007 . Y. Xue, X. Liao, L. Carin, and B. Krishnapuram. Multi-task learning for classification with dirichlet process priors. JMLR, 8:35--63, 2007.","journal-title":"JMLR"},{"key":"e_1_3_2_2_35_1","first-page":"23","article-title":"Heterogeneous multitask learning with joint sparsity constraints","author":"Yang X.","year":"2009","unstructured":"X. Yang , S. Kim , and E. Xing . Heterogeneous multitask learning with joint sparsity constraints . NIPS , 23 , 2009 . X. Yang, S. Kim, and E. Xing. Heterogeneous multitask learning with joint sparsity constraints. NIPS, 23, 2009.","journal-title":"NIPS"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102479"},{"key":"e_1_3_2_2_37_1","volume-title":"NIPS","author":"Yuan L.","year":"2011","unstructured":"L. Yuan , J. Liu , and J. Ye . Efficient methods for overlapping group lasso . NIPS , 2011 . L. Yuan, J. Liu, and J. Ye. Efficient methods for overlapping group lasso. NIPS, 2011."},{"key":"e_1_3_2_2_38_1","first-page":"1585","article-title":"Learning multiple related tasks using latent independent component analysis","volume":"18","author":"Zhang J.","year":"2006","unstructured":"J. Zhang , Z. Ghahramani , and Y. Yang . Learning multiple related tasks using latent independent component analysis . NIPS , 18 : 1585 -- 1592 , 2006 . J. Zhang, Z. Ghahramani, and Y. Yang. Learning multiple related tasks using latent independent component analysis. NIPS, 18:1585--1592, 2006.","journal-title":"NIPS"},{"key":"e_1_3_2_2_39_1","volume-title":"AISTATS","author":"Zhang Y.","year":"2010","unstructured":"Y. Zhang and D. Yeung . Multi-task learning using generalized t process . AISTATS , 2010 . Y. Zhang and D. Yeung. Multi-task learning using generalized t process. AISTATS, 2010."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835954"},{"key":"e_1_3_2_2_41_1","volume-title":"NIPS","author":"Zhang Y.","year":"2010","unstructured":"Y. Zhang , D. Yeung , and Q. Xu . Probabilistic multi-task feature selection . NIPS , 2010 . Y. Zhang, D. Yeung, and Q. Xu. Probabilistic multi-task feature selection. NIPS, 2010."},{"key":"e_1_3_2_2_42_1","volume-title":"NIPS","author":"Zhou J.","year":"2011","unstructured":"J. Zhou , J. Chen , and J. Ye . Clustered multi-task learning via alternating structure optimization . NIPS , 2011 . J. Zhou, J. Chen, and J. Ye. Clustered multi-task learning via alternating structure optimization. NIPS, 2011."},{"key":"e_1_3_2_2_43_1","volume-title":"MALSAR: Multi-tAsk Learning via StructurAl Regularization","author":"Zhou J.","year":"2012","unstructured":"J. Zhou , J. Chen , and J. Ye . MALSAR: Multi-tAsk Learning via StructurAl Regularization . Arizona State University , 2012 . J. Zhou, J. Chen, and J. Ye. MALSAR: Multi-tAsk Learning via StructurAl Regularization. Arizona State University, 2012."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020549"}],"event":{"name":"KDD '12: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Beijing China","acronym":"KDD '12","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 18th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339672","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339530.2339672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:13Z","timestamp":1750239253000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":43,"alternative-id":["10.1145\/2339530.2339672","10.1145\/2339530"],"URL":"https:\/\/doi.org\/10.1145\/2339530.2339672","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}