{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:59Z","timestamp":1750220099621,"version":"3.41.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:00:00Z","timestamp":1649116800000},"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":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2022,10,31]]},"abstract":"<jats:p>In this article, we present the Group Asymmetric Multi-Task Learning (GAMTL) algorithm that automatically learns from data how tasks transfer information among themselves at the level of a subset of features. In practice, for each group of features GAMTL extracts an asymmetric relationship supported by the tasks, instead of assuming a single structure for all features. The additional flexibility promoted by local transference in GAMTL allows any two tasks to have multiple asymmetric relationships. The proposed method leverages the information present in these multiple structures to bias the training of individual tasks towards more generalizable models.<\/jats:p>\n          <jats:p>\n            The solution to the GAMTL\u2019s associated optimization problem is an alternating minimization procedure involving tasks parameters and multiple asymmetric relationships, thus guiding to convex smaller sub-problems. GAMTL was evaluated on both synthetic and real datasets. To evidence GAMTL versatility, we generated a synthetic scenario characterized by diverse profiles of structural relationships among tasks. GAMTL was also applied to the problem of Alzheimer\u2019s Disease (AD) progression prediction. Our experiments indicated that the proposed approach not only increased prediction performance, but also estimated scientifically grounded relationships among multiple cognitive scores, taken here as multiple regression tasks, and regions of interest in the brain, directly associated here with groups of features. We also employed stability selection analysis to investigate GAMTL\u2019s robustness to data sampling rate and hyper-parameter configuration. GAMTL source code is available on GitHub:\n            <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/github.com\/shgo\/gamtl\">https:\/\/github.com\/shgo\/gamtl<\/jats:ext-link>\n            .\n          <\/jats:p>","DOI":"10.1145\/3514252","type":"journal-article","created":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T21:56:36Z","timestamp":1644011796000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Asymmetric Multi-Task Learning with Local Transference"],"prefix":"10.1145","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9432-8688","authenticated-orcid":false,"given":"Saullo H. G.","family":"Oliveira","sequence":"first","affiliation":[{"name":"School of Electrical and Computer Engineering (FEEC), University of Campinas (Unicamp), Campinas, S\u00e3o Paulo, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0320-280X","authenticated-orcid":false,"given":"Andr\u00e9 R.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, California"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4128-5415","authenticated-orcid":false,"given":"Fernando J.","family":"Von Zuben","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering (FEEC), University of Campinas (Unicamp), Campinas, S\u00e3o Paulo, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2022,4,5]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330701"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_3_3_4_2","first-page":"288","volume-title":"Advances in Soft Computing","author":"Bezdek James C.","year":"2002","unstructured":"James C. Bezdek and Richard J. Hathaway. 2002. Some notes on alternating optimization. In Advances in Soft Computing. Nikhil R. Pal and Michio Sugeno (Eds.), Springer, Berlin, 288\u2013300."},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.3233\/JAD-2011-0040"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2086737.2086742"},{"key":"e_1_3_3_8_2","unstructured":"Michael Crawshaw. 2020. Multi-task learning with deep neural networks: A survey. arXiv:2009.09796 [cs stat] (Sept. 2020). http:\/\/arxiv.org\/abs\/7952009.0979600004."},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014067"},{"issue":"33","key":"e_1_3_3_10_2","first-page":"1","article-title":"Multi-task sparse structure learning with gaussian copula models","volume":"17","author":"Gon\u00e7alves Andr\u00e9 R.","year":"2016","unstructured":"Andr\u00e9 R. Gon\u00e7alves, Fernando J. Von Zuben, and Arindam Banerjee. 2016. Multi-task sparse structure learning with gaussian copula models. Journal of Machine Learning Research 17, 33 (2016), 1\u201330. Retrieved from http:\/\/jmlr.org\/papers\/v17\/15-215.html.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-007-0161-1"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.5555\/2834535"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiolchem.2010.07.002"},{"key":"e_1_3_3_14_2","volume-title":"World Alzheimer Report","author":"International Alzheimer\u2019s Disease","year":"2018","unstructured":"Alzheimer\u2019s Disease International. 2018. World Alzheimer Report. Technical Report. Alzheimer\u2019s Disease International. Retrieved from https:\/\/www.alzint.org\/resource\/world-alzheimer-report-2018\/."},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553431"},{"key":"e_1_3_3_16_2","first-page":"964","volume-title":"Proceedings of the 23rd International Conference on Neural Information Processing Systems - Volume 1 (NIPS\u201910)","author":"Jalali Ali","year":"2010","unstructured":"Ali Jalali, Pradeep Ravikumar, Sujay Sanghavi, and Chao Ruan. 2010. A dirty model for multi-task learning. In Proceedings of the 23rd International Conference on Neural Information Processing Systems - Volume 1 (NIPS\u201910). Curran Associates Inc., Red Hook, NY, 964\u2013972."},{"key":"e_1_3_3_17_2","first-page":"521","volume-title":"Proceedings of the 28th International Conference on International Conference on Machine Learning (ICML\u201911)","author":"Kang Zhuoliang","year":"2011","unstructured":"Zhuoliang Kang, Kristen Grauman, and Fei Sha. 2011. Learning with whom to share in multi-task feature learning. In Proceedings of the 28th International Conference on International Conference on Machine Learning (ICML\u201911). Omnipress, Madison, WI, 521\u2013528."},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1001\/archneur.1985.04060100083029"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.5555\/3042573.3042793"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.5555\/3045390.3045416"},{"key":"e_1_3_3_21_2","first-page":"339","volume-title":"Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI\u201909)","author":"Liu Jun","year":"2009","unstructured":"Jun Liu, Shuiwang Ji, and Jieping Ye. 2009. Multi-task feature learning via efficient L2, 1-norm minimization. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI\u201909). AUAI Press, Arlington, Virginia, 339\u2013348. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=1795114.1795154."},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3230668"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compmedimag.2017.11.001"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2010.00740.x"},{"key":"e_1_3_3_25_2","first-page":"1161","volume-title":"Proceedings of the 21st International Conference on Neural Information Processing Systems (NIPS\u201908)","author":"Negahban Sahand","year":"2008","unstructured":"Sahand Negahban and Martin J. Wainwright. 2008. Joint support recovery under high-dimensional scaling: benefits and perils of \\( l_{1, \\inf } \\) -Regularization. In Proceedings of the 21st International Conference on Neural Information Processing Systems (NIPS\u201908). Curran Associates Inc., Red Hook, NY, 1161\u20131168."},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9378493"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/jbhi.2021.3051470"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2021.3054609"},{"key":"e_1_3_3_29_2","unstructured":"Guillaume Obozinski. 2011. Group Lasso with Overlaps: the Latent Group Lasso approach. Research Report. 60pages. https:\/\/hal.inria.fr\/inria-00628498."},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/444"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1523\/JNEUROSCI.23-03-00994.2003"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1093\/cercor\/11.1.1"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054719"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016018"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3070203"},{"key":"e_1_3_3_39_2","first-page":"733","volume-title":"Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI\u201910)","author":"Zhang Yu","year":"2010","unstructured":"Yu Zhang and Dit-Yan Yeung. 2010. A convex formulation for learning task relationships in multi-task learning. In Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI\u201910). AUAI Press, Arlington, Virginia, 733\u2013742. Retrieved fromhttp:\/\/dl.acm.org\/citation.cfm?id=3023549.3023636."},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/2538028"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248637"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.5555\/2986459.2986538"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020549"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1198\/016214506000000735"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514252","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:14Z","timestamp":1750183814000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,5]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10,31]]}},"alternative-id":["10.1145\/3514252"],"URL":"https:\/\/doi.org\/10.1145\/3514252","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2022,4,5]]},"assertion":[{"value":"2021-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-04-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}