{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:21:44Z","timestamp":1778084504610,"version":"3.51.4"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,8]]},"abstract":"<jats:p>Group LASSO is a widely used regularization that imposes sparsity considering groups of covariates. When used in Multi-Task Learning (MTL) formulations, it makes an underlying assumption that if one group of covariates is not relevant for one or a few tasks, it is also not relevant for all tasks, thus implicitly assuming that all tasks are related.\nThis implication can easily lead to negative transfer if this assumption does not hold for all tasks.\nSince for most practical applications we hardly know a priori how the tasks are related, several approaches have been conceived in the literature to (i) properly capture the transference structure, (ii) improve interpretability of the tasks interplay, and (iii) penalize potential negative transfer.\nRecently, the automatic estimation of asymmetric structures inside the learning process was capable of effectively avoiding negative transfer.\nOur proposal is the first attempt in the literature to conceive a Group LASSO with asymmetric transference formulation, looking for the best of both worlds in a  framework that admits the overlap of groups.\nThe resulting optimization problem is solved by an alternating procedure with fast methods.\nWe performed experiments using synthetic and real datasets to compare our proposal with state-of-the-art approaches, evidencing the promising predictive performance and distinguished interpretability of our proposal.\nThe real case study involves the prediction of cognitive scores for  Alzheimer's disease progression assessment.\nThe source codes are available at GitHub.<\/jats:p>","DOI":"10.24963\/ijcai.2019\/444","type":"proceedings-article","created":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:46:05Z","timestamp":1564299965000},"page":"3202-3208","source":"Crossref","is-referenced-by-count":5,"title":["Group LASSO with Asymmetric Structure Estimation for Multi-Task Learning"],"prefix":"10.24963","author":[{"given":"Saullo H. G.","family":"Oliveira","sequence":"first","affiliation":[{"name":"School of Electrical and Computer Engineering - FEEC"},{"name":"University of Campinas - Unicamp, Brazil"}]},{"given":"Andr\u00e9  R.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, USA"}]},{"given":"Fernando J.","family":"Von Zuben","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering - FEEC"},{"name":"University of Campinas - Unicamp, Brazil"}]}],"member":"10584","event":{"name":"Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}","theme":"Artificial Intelligence","location":"Macao, China","acronym":"IJCAI-2019","number":"28","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2019,8,10]]},"end":{"date-parts":[[2019,8,16]]}},"container-title":["Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:49:20Z","timestamp":1564300160000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2019\/444"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2019\/444","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}