{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:06:41Z","timestamp":1778587601488,"version":"3.51.4"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0812551IIS-0953662CCF-1025177"],"award-info":[{"award-number":["IIS-0812551IIS-0953662CCF-1025177"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["IIS-0812551IIS-0953662CCF-1025177"],"award-info":[{"award-number":["IIS-0812551IIS-0953662CCF-1025177"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["LM010730"],"award-info":[{"award-number":["LM010730"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2012,2]]},"abstract":"<jats:p>We consider the problem of learning incoherent sparse and low-rank patterns from multiple tasks. Our approach is based on a linear multitask learning formulation, in which the sparse and low-rank patterns are induced by a cardinality regularization term and a low-rank constraint, respectively. This formulation is nonconvex; we convert it into its convex surrogate, which can be routinely solved via semidefinite programming for small-size problems. We propose employing the general projected gradient scheme to efficiently solve such a convex surrogate; however, in the optimization formulation, the objective function is nondifferentiable and the feasible domain is nontrivial. We present the procedures for computing the projected gradient and ensuring the global convergence of the projected gradient scheme. The computation of the projected gradient involves a constrained optimization problem; we show that the optimal solution to such a problem can be obtained via solving an unconstrained optimization subproblem and a Euclidean projection subproblem. We also present two projected gradient algorithms and analyze their rates of convergence in detail. In addition, we illustrate the use of the presented projected gradient algorithms for the proposed multitask learning formulation using the least squares loss. Experimental results on a collection of real-world data sets demonstrate the effectiveness of the proposed multitask learning formulation and the efficiency of the proposed projected gradient algorithms.<\/jats:p>","DOI":"10.1145\/2086737.2086742","type":"journal-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T14:49:20Z","timestamp":1328021360000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":76,"title":["Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks"],"prefix":"10.1145","volume":"5","author":[{"given":"Jianhui","family":"Chen","sequence":"first","affiliation":[{"name":"Arizona State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Liu","sequence":"additional","affiliation":[{"name":"Arizona State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieping","family":"Ye","sequence":"additional","affiliation":[{"name":"Arizona State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1577098"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 2nd BioCreative Challenge Evaluation Workshop.","author":"Ando R. K.","year":"2007","unstructured":"Ando , R. K. 2007 . BioCreative II gene mention tagging system at IBM Watson . In Proceedings of the 2nd BioCreative Challenge Evaluation Workshop. Ando, R. K. 2007. BioCreative II gene mention tagging system at IBM Watson. In Proceedings of the 2nd BioCreative Challenge Evaluation Workshop."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1194905"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Bach F. Jenatton R. Mairal J. and Obozinski G. 2011. Convex optimization with sparsity-inducing norms. In Optimization for Machine Learning. S. Sra S. Nowozin and S. J. Wright Eds. MIT Press. Bach F. Jenatton R. Mairal J. and Obozinski G. 2011. Convex optimization with sparsity-inducing norms. In Optimization for Machine Learning . S. Sra S. Nowozin and S. J. Wright Eds. MIT Press.","DOI":"10.7551\/mitpress\/8996.003.0004"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244304322765658"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_2_1_8_1","volume-title":"Nonlinear Programming","author":"Bertsekas D. P.","unstructured":"Bertsekas , D. P. 1999. Nonlinear Programming . Athena Scientific . Bertsekas, D. P. 1999. Nonlinear Programming. Athena Scientific."},{"key":"e_1_2_1_9_1","unstructured":"Bertsekas D. P. Nedic A. and Ozdaglar A. E. 2003. Convex Analysis and Optimization. Athena Scientific. Bertsekas D. P. Nedic A. and Ozdaglar A. E. 2003. Convex Analysis and Optimization . Athena Scientific."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3120828.3120858"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390164"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Boyd S. and Vandenberghe L. 2004. Convex Optimization. Cambridge University Press. Boyd S. and Vandenberghe L. 2004. Convex Optimization . Cambridge University Press.","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the15th IFAC Symposium on System Identification (SYSID).","author":"Chandrasekaran V.","unstructured":"Chandrasekaran , V. , Sanghavi , S. , Parrilo , P. A. , and Willsky , A. S . 2009. Sparse and low-rank matrix decompositions . In Proceedings of the15th IFAC Symposium on System Identification (SYSID). Chandrasekaran, V., Sanghavi, S., Parrilo, P. A., and Willsky, A. S. 2009. Sparse and low-rank matrix decompositions. In Proceedings of the15th IFAC Symposium on System Identification (SYSID)."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553392"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.128"},{"key":"e_1_2_1_19_1","unstructured":"Chen X. Kim S. Lin Q. Carbonell J. G. and Xing E. P. 2010a. Graph-structured multi-task regression and an efficient optimization method for general fused lasso. Computing Research Repository (CoRR) abs\/1005.3579. Chen X. Kim S. Lin Q. Carbonell J. G. and Xing E. P. 2010a. Graph-structured multi-task regression and an efficient optimization method for general fused lasso. Computing Research Repository (CoRR) abs\/1005.3579."},{"key":"e_1_2_1_20_1","unstructured":"Chen X. Lin Q. Kim S. Carbonell J. G. and Xing E. P. 2010b. An efficient proximal-gradient method for single and multi-task regression with structured sparsity. Computing Research Repository (CoRR) abs\/1005.4717v3. Chen X. Lin Q. Kim S. Carbonell J. G. and Xing E. P. 2010b. An efficient proximal-gradient method for single and multi-task regression with structured sparsity. Computing Research Repository (CoRR) abs\/1005.4717v3."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1088693"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the American Control Conference (ACC).","author":"Fazel M.","unstructured":"Fazel , M. , Hindi , H. , and Boyd , S . 2001. A rank minimization heuristic with application to minimum order system approximation . In Proceedings of the American Control Conference (ACC). Fazel, M., Hindi, H., and Boyd, S. 2001. A rank minimization heuristic with application to minimum order system approximation. In Proceedings of the American Control Conference (ACC)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2008.01.053"},{"key":"e_1_2_1_24_1","volume-title":"Matrix Computations","author":"Golub G. H.","unstructured":"Golub , G. H. and Van Loan , C. F. 1996. Matrix Computations . Johns Hopkins University Press . Golub, G. H. and Van Loan, C. F. 1996. Matrix Computations. Johns Hopkins University Press."},{"key":"e_1_2_1_25_1","unstructured":"Gonzalez R. C. and Woods R. E. 2002. Digital Image Processing. Prentice Hall. Gonzalez R. C. and Woods R. E. 2002. Digital Image Processing . Prentice Hall."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).","author":"Jacob L.","unstructured":"Jacob , L. , Bach , F. , and Vert , J . -P. 2008. Clustered multi-task learning: A convex formulation . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). Jacob, L., Bach, F., and Vert, J.-P. 2008. Clustered multi-task learning: A convex formulation. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).","author":"Jalali A.","unstructured":"Jalali , A. , Ravikumar , P. , Sanghavi , S. , and Ruan , C . 2010. A dirty model for multi-task learning . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). Jalali, A., Ravikumar, P., Sanghavi, S., and Ruan, C. 2010. A dirty model for multi-task learning. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553434"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557068"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the International Conference on Machine Learning (ICML).","author":"Kim S.","unstructured":"Kim , S. and Xing , E. P . 2010. Tree-guided group lasso for multi-task regression with structured sparsity . In Proceedings of the International Conference on Machine Learning (ICML). Kim, S. and Xing, E. P. 2010. Tree-guided group lasso for multi-task regression with structured sparsity. In Proceedings of the International Conference on Machine Learning (ICML)."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015382"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2007.08.003"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553459"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI).","author":"Liu J.","unstructured":"Liu , J. , Ji , S. , and Ye , J . 2009a. Multi-task feature learning via efficient l2&minus;1-norm minimization . In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI). Liu, J., Ji, S., and Ye, J. 2009a. Multi-task feature learning via efficient l2&minus;1-norm minimization. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI)."},{"key":"e_1_2_1_35_1","volume-title":"SLEP: Sparse Learning with Efficient Projections","author":"Liu J.","year":"2009","unstructured":"Liu , J. , Ji , S. , and Ye , J . 2009 b. SLEP: Sparse Learning with Efficient Projections . Arizona State University . Liu, J., Ji, S., and Ye, J. 2009b. SLEP: Sparse Learning with Efficient Projections. Arizona State University."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"e_1_2_1_37_1","unstructured":"Martinez A. and Benavente R. 1998. The AR face database. Tech. rep. 24 Computer Vision Center (CVC). Martinez A. and Benavente R. 1998. The AR face database. Tech. rep. 24 Computer Vision Center (CVC)."},{"key":"e_1_2_1_38_1","unstructured":"Nemirovski A. 1995. Efficient methods in convex programming. Lecture Notes Technion. Nemirovski A. 1995. Efficient methods in convex programming. Lecture Notes Technion."},{"key":"e_1_2_1_39_1","unstructured":"Nesterov Y. 1998. Introductory lectures on convex programming. Lecture Notes. Nesterov Y. 1998. Introductory lectures on convex programming. Lecture Notes."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-008-9111-x"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/090763184"},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf B. and Smola A. J. 2002. Learning With Kernels: Support Vector Machines Regularization Optimization and Beyond. The MIT Press. Sch\u00f6lkopf B. and Smola A. J. 2002. Learning With Kernels: Support Vector Machines Regularization Optimization and Beyond. The MIT Press.","DOI":"10.7551\/mitpress\/4175.001.0001"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).","author":"Schwaighofer A.","unstructured":"Schwaighofer , A. , Tresp , V. , and Yu , K . 2004. Learning Gaussian process kernels via hierarchical Bayes . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). Schwaighofer, A., Tresp, V., and Yu, K. 2004. Learning Gaussian process kernels via hierarchical Bayes. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294158"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.126"},{"key":"e_1_2_1_46_1","first-page":"653","article-title":"Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones","volume":"11","author":"Sturm J. F.","year":"2001","unstructured":"Sturm , J. F. 2001 . Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones . Optim. Methods Softw. 11-12 , 653 -- 625 . Sturm, J. F. 2001. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11-12, 653--625.","journal-title":"Optim. Methods Softw."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775140"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90407-2"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).","author":"Wright J.","unstructured":"Wright , J. , Peng , Y. , Ma , Y. , Ganesh , A. , and Rao , S . 2009. Robust principal component analysis: Exact recovery of corrupted low-rank matrices by convex optimization . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). Wright, J., Peng, Y., Ma, Y., Ganesh, A., and Rao, S. 2009. Robust principal component analysis: Exact recovery of corrupted low-rank matrices by convex optimization. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248659.1248661"},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the International Conference on Machine Learning (ICML).","author":"Yang Y.","unstructured":"Yang , Y. and Pedersen , J. O . 1997. A comparative study on feature selection in text categorization . In Proceedings of the International Conference on Machine Learning (ICML). Yang, Y. and Pedersen, J. O. 1997. A comparative study on feature selection in text categorization. In Proceedings of the International Conference on Machine Learning (ICML)."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102479"},{"key":"e_1_2_1_55_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).","author":"Zhang J.","unstructured":"Zhang , J. , Ghahramani , Z. , and Yang , Y . 2005. Learning multiple related tasks using latent independent component analysis . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). Zhang, J., Ghahramani, Z., and Yang, Y. 2005. Learning multiple related tasks using latent independent component analysis. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_1_56_1","unstructured":"Zhang X. Saha A. and Vishwanathan S. V. N. 2010. Regularized risk minimization by Nesterov\u2019s accelerated gradient methods: Algorithmic extensions and empirical studies. Computing Research Repository (CoRR). abs\/1011.0472. Zhang X. Saha A. and Vishwanathan S. V. N. 2010. Regularized risk minimization by Nesterov\u2019s accelerated gradient methods: Algorithmic extensions and empirical studies. Computing Research Repository (CoRR). abs\/1011.0472."},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).","author":"Zhang Y.","unstructured":"Zhang , Y. and Schneider , J . 2010. Learning multiple tasks with a sparse matrix-normal penalty . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). Zhang, Y. and Schneider, J. 2010. Learning multiple tasks with a sparse matrix-normal penalty. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_1_58_1","volume-title":"Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI).","author":"Zhang Y.","unstructured":"Zhang , Y. and Yeung , D . -Y. 2010. A convex formulation for learning task relationship in multi-task learning . In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI). Zhang, Y. and Yeung, D.-Y. 2010. A convex formulation for learning task relationship in multi-task learning. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI)."},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).","author":"Zhou J.","unstructured":"Zhou , J. , Chen , J. , and Ye , J . 2011. Clustered multi-task learning via alternating structure optimization . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). Zhou, J., Chen, J., and Ye, J. 2011. Clustered multi-task learning via alternating structure optimization. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS)."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2086737.2086742","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2086737.2086742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:05:54Z","timestamp":1750241154000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2086737.2086742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["10.1145\/2086737.2086742"],"URL":"https:\/\/doi.org\/10.1145\/2086737.2086742","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2]]},"assertion":[{"value":"2010-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}