{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:57:41Z","timestamp":1780635461356,"version":"3.54.1"},"reference-count":99,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Research Grants Council of the Hong Kong Special Administrative Region","award":["CityU11215622"],"award-info":[{"award-number":["CityU11215622"]}]},{"name":"Research Grants Council of the Hong Kong Special Administrative Region","award":["CityU11215723"],"award-info":[{"award-number":["CityU11215723"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tevc.2025.3537986","type":"journal-article","created":{"date-parts":[[2025,2,3]],"date-time":"2025-02-03T18:27:04Z","timestamp":1738607224000},"page":"616-630","source":"Crossref","is-referenced-by-count":5,"title":["Dealing With Structure Constraints in Evolutionary Pareto Set Learning"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5298-6893","authenticated-orcid":false,"given":"Xi","family":"Lin","sequence":"first","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4370-3112","authenticated-orcid":false,"given":"Xiaoyuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1738-6096","authenticated-orcid":false,"given":"Zhiyuan","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0786-0671","authenticated-orcid":false,"given":"Qingfu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106078"},{"key":"ref2","first-page":"1","article-title":"Pareto multi-task learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Lin"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3052758"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017536311488"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.894202"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27659-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5563-6"},{"key":"ref8","volume-title":"Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications","volume":"63","author":"Zitzler","year":"1999"},{"key":"ref9","volume-title":"Multi-Objective Optimization Using Evolutionary Algorithms","author":"Deb","year":"2001"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.03.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2514\/6.2003-296"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.851274"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2033671"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2622301"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2865931"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2926151"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.3020630"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3181306"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14714-2_29"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0956-0521(91)90049-B"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-010-0343-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00128"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2395073"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.3008877"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3125071"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3144880"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.3.411"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1736-z"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2987559"},{"key":"ref31","article-title":"Controllable Pareto multi-task learning","author":"Lin","year":"2020","journal-title":"arXiv:2010.06313"},{"key":"ref32","first-page":"1","article-title":"Learning the Pareto front with hypernetworks","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Navon"},{"key":"ref33","first-page":"1","article-title":"Pareto set learning for neural multi-objective combinatorial optimization","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Lin"},{"key":"ref34","first-page":"1","article-title":"Pareto set learning for expensive multiobjective optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Lin"},{"key":"ref35","first-page":"1","article-title":"Hypervolume maximization: A geometric view of Pareto set learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Zhang"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00162"},{"key":"ref37","first-page":"1","article-title":"Continuation path learning for homotopy optimization","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Lin"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2023.3312476"},{"key":"ref39","first-page":"1","article-title":"Neural multi-objective combinatorial optimization with diversity enhancement","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Chen"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i13.29331"},{"key":"ref41","first-page":"1","article-title":"Multi-objective GFlowNets","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Jain"},{"key":"ref42","first-page":"1","article-title":"Sample-efficient multi-objective molecular optimization with gflownets","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Zhu"},{"key":"ref43","volume-title":"Multi-objective molecular design through learning latent Pareto set","author":"Liu","year":"2023"},{"key":"ref44","first-page":"1","article-title":"Multi-objective deep learning with adaptive reference vectors","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Chen"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654024"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN60899.2024.10651267"},{"key":"ref47","first-page":"1","article-title":"Smooth tchebycheff scalarization for multi-objective optimization","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Lin"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.jretconser.2016.11.007"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.aat2544"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s40436-017-0204-7"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.biotechadv.2019.06.002"},{"key":"ref52","first-page":"7015","article-title":"Efficient Pareto manifold learning with low-rank structure","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Chen"},{"key":"ref53","article-title":"Pareto low-rank adapters: Efficient multi-task learning with preferences","author":"Dimitriadis","year":"2024","journal-title":"arXiv:2407.08056"},{"key":"ref54","first-page":"1","article-title":"LoRa: Low-rank adaptation of large language models","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Hu"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1080\/0305215031000151256"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144266"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.10.011"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.11.015"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-27250-9_3"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/BF01197559"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1137\/s1052623496307510"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281533"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2611642"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2707980"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.3.467"},{"key":"ref66","first-page":"1","article-title":"Robust multi-task learning with excess risks","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"He"},{"key":"ref67","article-title":"Traversing Pareto optimal policies: Provably efficient multi-objective reinforcement learning","author":"Qiu","year":"2024","journal-title":"arXiv:2407.17466"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.925798"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2608507"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2978158"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511569920.003"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1162\/106365601750190398"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015059928466"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100694"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref77","first-page":"1","article-title":"Generalizing Gaussian smoothing for random search","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Gao"},{"issue":"1","key":"ref78","first-page":"949","article-title":"Natural evolution strategies","volume":"15","author":"Wierstra","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/4235.728207"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.882427"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30217-9_84"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-80808-1"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1145\/366573.366611"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1986.4767753"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/34.601253"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409256"},{"key":"ref91","first-page":"1","article-title":"DeepZero: Scaling up zeroth-order optimization for deep model training","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Chen"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-005-0527-z"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2990567"},{"key":"ref96","first-page":"8026","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Paszke"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1080\/03052159908941390"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-9445(1989)115:3(626)"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4235\/11018639\/10870122.pdf?arnumber=10870122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:42:44Z","timestamp":1748666564000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10870122\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":99,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2025.3537986","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}