{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:31:16Z","timestamp":1773930676739,"version":"3.50.1"},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"value":"9781643685489","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,10,16]]},"abstract":"<jats:p>In this paper, we study the Multi-Objective Bi-Level Optimization (MOBLO) problem, where the upper-level subproblem is a multi-objective optimization problem and the lower-level subproblem is for scalar optimization. Existing gradient-based MOBLO algorithms need to compute the Hessian matrix, causing the computational inefficient problem. To address this, we propose an efficient first-order multi-gradient method for MOBLO, called FORUM. Specifically, we reformulate MOBLO problems as a constrained multi-objective optimization (MOO) problem via the value-function approach. Then we propose a novel multi-gradient aggregation method to solve the challenging constrained MOO problem. Theoretically, we provide the complexity analysis to show the efficiency of the proposed method and a non-asymptotic convergence result. Empirically, extensive experiments demonstrate the effectiveness and efficiency of the proposed FORUM method in different learning problems. In particular, it achieves state-of-the-art performance on three multi-task learning benchmark datasets. The code is available at https:\/\/github.com\/Baijiong-Lin\/FORUM.<\/jats:p>","DOI":"10.3233\/faia240793","type":"book-chapter","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T13:23:11Z","timestamp":1729171391000},"source":"Crossref","is-referenced-by-count":4,"title":["A First-Order Multi-Gradient Algorithm for Multi-Objective Bi-Level Optimization"],"prefix":"10.3233","author":[{"given":"Feiyang","family":"Ye","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Southern University of Science and Technology"},{"name":"Australian Artificial Intelligence Institute, University of Technology Sydney"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baijiong","family":"Lin","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Cao","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Jilin University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Southern University of Science and Technology"},{"name":"Shanghai Artificial Intelligence Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivor W.","family":"Tsang","sequence":"additional","affiliation":[{"name":"Australian Artificial Intelligence Institute, University of Technology Sydney"},{"name":"Centre for Frontier AI Research, Agency for Science, Technology and Research"},{"name":"Institute of High Performance Computing, Agency for Science, Technology and Research"},{"name":"School of Computer Science and Engineering, Nanyang Technological University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2024"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA240793","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T13:23:12Z","timestamp":1729171392000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA240793"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,16]]},"ISBN":["9781643685489"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia240793","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,16]]}}}