{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:32:26Z","timestamp":1743057146041,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030676605"},{"type":"electronic","value":"9783030676612"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67661-2_35","type":"book-chapter","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T07:06:46Z","timestamp":1614150406000},"page":"593-608","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Interpretable Multi-task Learning Using Bilevel Programming"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Alesiani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shujian","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ammar","family":"Shaker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenzhe","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Argyriou, A., Evgeniou, T., Pontil, M.: Multi-task feature learning. In: NIPS, pp. 41\u201348 (2007)","key":"35_CR1","DOI":"10.7551\/mitpress\/7503.003.0010"},{"issue":"3","key":"35_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A Argyriou","year":"2008","unstructured":"Argyriou, A., Evgeniou, T., Pontil, M.: Convex multi-task feature learning. Mach. Learn. 73(3), 243\u2013272 (2008)","journal-title":"Mach. Learn."},{"issue":"6","key":"35_CR3","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM (JACM) 45(6), 891\u2013923 (1998)","journal-title":"J. ACM (JACM)"},{"issue":"May","key":"35_CR4","first-page":"83","volume":"4","author":"B Bakker","year":"2003","unstructured":"Bakker, B., Heskes, T.: Task clustering and gating for Bayesian multitask learning. J. Mach. Learn. Res. 4(May), 83\u201399 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.entcs.2009.07.045","volume":"247","author":"BC Bedregal","year":"2009","unstructured":"Bedregal, B.C., Reiser, R.H., Dimuro, G.P.: Xor-implications and E-implications: classes of fuzzy implications based on fuzzy Xor. Electron. Notes Theor. Comput. Sci. 247, 5\u201318 (2009)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Advances in Neural Information Processing Systems, vol. 14, pp. 585\u2013591. MIT Press (2002)","key":"35_CR6","DOI":"10.7551\/mitpress\/1120.003.0080"},{"doi-asserted-by":"crossref","unstructured":"Chen, J., Zhou, J., Ye, J.: Integrating low-rank and group-sparse structures for robust multi-task learning. In: KDD, pp. 42\u201350. ACM (2011)","key":"35_CR7","DOI":"10.1145\/2020408.2020423"},{"issue":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153(1), 235\u2013256 (2007)","journal-title":"Ann. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Deng, D., Shahabi, C., Demiryurek, U., Zhu, L.: Situation aware multi-task learning for traffic prediction. In: ICDM, pp. 81\u201390. IEEE (2017)","key":"35_CR9","DOI":"10.1109\/ICDM.2017.17"},{"issue":"23","key":"35_CR10","doi-asserted-by":"publisher","first-page":"6160","DOI":"10.1109\/TSP.2016.2602809","volume":"64","author":"X Dong","year":"2016","unstructured":"Dong, X., Thanou, D., Frossard, P., Vandergheynst, P.: Learning Laplacian matrix in smooth graph signal representations. IEEE Trans. Signal Process. 64(23), 6160\u20136173 (2016)","journal-title":"IEEE Trans. Signal Process."},{"unstructured":"Flamary, R., Rakotomamonjy, A., Gasso, G.: Learning constrained task similarities in graph regularized multi-task learning. In: Regularization, Optimization, Kernels, and Support Vector Machines, pp. 103 (2014)","key":"35_CR11"},{"unstructured":"Franceschi, L., Frasconi, P., Salzo, S., Grazzi, R., Pontil, M.: Bilevel Programming for Hyperparameter Optimization and Meta-Learning. arXiv:1806.04910 [cs, stat], June 2018","key":"35_CR12"},{"unstructured":"Frecon, J., Salzo, S., Pontil, M.: Bilevel learning of the group lasso structure. In: Advances in Neural Information Processing Systems, pp. 8301\u20138311 (2018)","key":"35_CR13"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"100059","DOI":"10.1016\/j.yjbinx.2019.100059","volume":"4","author":"A Goncalves","year":"2019","unstructured":"Goncalves, A., et al.: Bayesian multitask learning regression for heterogeneous patient cohorts. J. Biomed. Inform. X 4, 100059 (2019)","journal-title":"J. Biomed. Inform. X"},{"doi-asserted-by":"crossref","unstructured":"Goncalves, A.R., Das, P., Chatterjee, S., Sivakumar, V., Von Zuben, F.J., Banerjee, A.: Multi-task sparse structure learning. In: Proceedings of the 23rd ACM CIKM 2014 (2014)","key":"35_CR15","DOI":"10.1145\/2661829.2662091"},{"issue":"1","key":"35_CR16","first-page":"1205","volume":"17","author":"AR Gon\u00e7alves","year":"2016","unstructured":"Gon\u00e7alves, A.R., Von Zuben, F.J., Banerjee, A.: Multi-task sparse structure learning with gaussian copula models. J. Mach. Learn. Res. 17(1), 1205\u20131234 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"35_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3236009","volume":"51","author":"R Guidotti","year":"2018","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., Pedreschi, D.: A survey of methods for explaining black box models. ACM Comput. Surv. 51(5), 1\u201342 (2018)","journal-title":"ACM Comput. Surv."},{"doi-asserted-by":"crossref","unstructured":"Han, L., Zhang, Y.: Learning multi-level task groups in multi-task learning. In: AAAI, vol. 15, pp. 2638\u20132644 (2015)","key":"35_CR18","DOI":"10.1609\/aaai.v29i1.9581"},{"doi-asserted-by":"crossref","unstructured":"He, X., Alesiani, F., Shaker, A.: Efficient and scalable multi-task regression on massive number of tasks. In: The Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19) (2019)","key":"35_CR19","DOI":"10.1609\/aaai.v33i01.33013763"},{"key":"35_CR20","first-page":"63","volume":"6","author":"F Hua","year":"2020","unstructured":"Hua, F., Nassif, R., Richard, C., Wang, H., Sayed, A.H.: Online distributed learning over graphs with multitask graph-filter models. IEEE Trans. Signal Inf. Process. Netw. 6, 63\u201377 (2020)","journal-title":"IEEE Trans. Signal Inf. Process. Netw."},{"issue":"5","key":"35_CR21","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/TSP.2018.2889951","volume":"67","author":"S Huang","year":"2019","unstructured":"Huang, S., Tran, T.D.: Sparse signal recovery via generalized entropy functions minimization. IEEE Trans. Signal Process. 67(5), 1322\u20131337 (2019)","journal-title":"IEEE Trans. Signal Process."},{"unstructured":"Hyv\u00f6nen, V., et al.: Fast k-nn search. arXiv:1509.06957, 2015","key":"35_CR22"},{"unstructured":"High-Level Expert Group on Artificial Intelligence. Policy and investment recommendations for trustworthy AI. June 2019. Publisher: European Commission Type: Article; Article\/Report","key":"35_CR23"},{"unstructured":"Jacob, L., Bach, F., Vert, J.P.: Clustered multi-task learning: a convex formulation. In: NIPS, pp. 745\u2013752 (2009)","key":"35_CR24"},{"doi-asserted-by":"crossref","unstructured":"Jenni, S., Favaro, P.: Deep bilevel learning. In: Proceedings of the European Conference on Computer Vision (ECCV), pp. 618\u2013633 (2018)","key":"35_CR25","DOI":"10.1007\/978-3-030-01249-6_38"},{"doi-asserted-by":"crossref","unstructured":"Ji, S., Ye, J.: An accelerated gradient method for trace norm minimization. In: ICML, pp. 457\u2013464. ACM (2009)","key":"35_CR26","DOI":"10.1145\/1553374.1553434"},{"doi-asserted-by":"crossref","unstructured":"Klement, E.P., Mesiar, R., Pap, E.: Triangular Norms. Kluwer Academic Publishers, Dordrecht, The Netherlands (2000)","key":"35_CR27","DOI":"10.1007\/978-94-015-9540-7"},{"unstructured":"Kumar, A., Daume III, H.: Learning task grouping and overlap in multi-task learning. In: ICML (2012)","key":"35_CR28"},{"unstructured":"Kunapuli G.: A bilevel optimization approach to machine learning. Ph.D. thesis, Ph.D. thesis, Rensselaer Polytechnic Institute (2008)","key":"35_CR29"},{"key":"35_CR30","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1186\/s12918-018-0569-7","volume":"12","author":"L Li","year":"2018","unstructured":"Li, L., He, X., Borgwardt, K.: Multi-target drug repositioning by bipartite block-wise sparse multi-task learning. BMC Syst. Biol. 12, 85\u201397 (2018)","journal-title":"BMC Syst. Biol."},{"issue":"10","key":"35_CR31","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3233231","volume":"61","author":"ZC Lipton","year":"2018","unstructured":"Lipton, Z.C.: The mythos of model interpretability. Commun. ACM 61(10), 36\u201343 (2018)","journal-title":"Commun. ACM"},{"unstructured":"Liu, P., Fu, J., Dong, Y., Qiu, X., Cheung, J.C.K.: Multi-task Learning over Graph Structures. arXiv:1811.10211 [cs], November 2018","key":"35_CR32"},{"unstructured":"Lundberg, S., Lee, S.I.: A Unified Approach to Interpreting Model Predictions. arXiv:1705.07874 [cs, stat], November 2017. arXiv: 1705.07874","key":"35_CR33"},{"unstructured":"Murugesan, K., Liu, H., Carbonell, J.G.,Yang, Y.: Adaptive Smoothed Online Multi-Task Learning. pp. 11 (2016)","key":"35_CR34"},{"issue":"2","key":"35_CR35","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s11222-008-9111-x","volume":"20","author":"G Obozinski","year":"2010","unstructured":"Obozinski, G., Taskar, B., Jordan, M.I.: Joint covariate selection and joint subspace selection for multiple classification problems. Stat. Comput. 20(2), 231\u2013252 (2010)","journal-title":"Stat. Comput."},{"doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cWhy Should I Trust You?\u201d: Explaining the Predictions of Any Classifier. arXiv:1602.04938 [cs, stat], August 2016","key":"35_CR36","DOI":"10.18653\/v1\/N16-3020"},{"unstructured":"Ruder, S.: An overview of multi-task learning in deep neural networks. arXiv preprint arXiv:1706.05098, 2017","key":"35_CR37"},{"unstructured":"Saha, A., Rai, P., Daume Iii, H., Venkatasubramanian, S.: Online Learning of Multiple Tasks and Their Relationships, pp. 9 (2011)","key":"35_CR38"},{"unstructured":"Van Dongen, S.M.: Graph clustering by flow simulation. Ph.D. thesis (2000)","key":"35_CR39"},{"issue":"1","key":"35_CR40","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. Roy. Stat. Soc.: Series B (Stat. Methodol.) 68(1), 49\u201367 (2006)","journal-title":"J. Roy. Stat. Soc.: Series B (Stat. Methodol.)"},{"unstructured":"Zhang, Y., Yang, Q.: A survey on multi-task learning. arXiv preprint arXiv:1707.08114v2, 2017","key":"35_CR41"},{"unstructured":"Zhang, Y., Yeung, D.Y.: A convex formulation for learning task relationships in multi-task learning. In: Proceedings of the Twenty-Sixth Conference on UAI, pp. 733\u2013742 (2010)","key":"35_CR42"},{"issue":"3","key":"35_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2538028","volume":"8","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Yeung, D.Y.: A regularization approach to learning task relationships in multitask learning. ACM Trans. TKDD 8(3), 1\u201331 (2014)","journal-title":"ACM Trans. TKDD"},{"unstructured":"Zhou, J., Chen, J., Ye, J.: Malsar: multi-task learning via structural regularization. Arizona State University, vol. 21 (2011)","key":"35_CR44"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67661-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T23:03:38Z","timestamp":1740351818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67661-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030676605","9783030676612"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67661-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecmlpkdd2020.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"945","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"195","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}