{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T14:55:35Z","timestamp":1784904935098,"version":"3.55.0"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Research Grant Council of the Hong Kong Special Administrative Region, China","award":["11215622"],"award-info":[{"award-number":["11215622"]}]},{"name":"Research Grant Council of the Hong Kong Special Administrative Region, China","award":["11215723"],"award-info":[{"award-number":["11215723"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1109\/tetci.2025.3526459","type":"journal-article","created":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T13:19:58Z","timestamp":1744291198000},"page":"1098-1110","source":"Crossref","is-referenced-by-count":6,"title":["PMGDA: A Preference-Based Multiple Gradient Descent Algorithm"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4370-3112","authenticated-orcid":false,"given":"Xiaoyuan","family":"Zhang","sequence":"first","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5298-6893","authenticated-orcid":false,"given":"Xi","family":"Lin","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Hong Kong"}],"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"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Fair resource allocation in multi-task learning","volume-title":"Proc. 41st Int. Conf. Mach. Learn","author":"Ban","year":"2024"},{"key":"ref2","first-page":"525","article-title":"Multi-task learning as multi-objective optimization","volume":"31","author":"Sener","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref3","first-page":"14721","article-title":"Conflict-averse gradient descent for multi-task learning","volume":"34","author":"Liu","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref4","article-title":"Pareto policy adaptation","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kyriakis","year":"2022"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2024.3449647"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00162"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.425"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3470788"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3564285"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.11.015"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3457182"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498487"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3640457.3688048"},{"key":"ref14","first-page":"12037","article-title":"Pareto multi-task learning","volume-title":"Proc. 33rd Conf. Neural Inf. Process. Syst.","volume":"32","author":"Lin","year":"2019"},{"key":"ref15","article-title":"Controllable pareto multi-task learning","author":"Lin","year":"2020"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref17","volume-title":"Deep Learning","author":"Goodfellow","year":"2016"},{"key":"ref18","article-title":"Easing non-convex optimization with neural networks","author":"Lopez-Paz","year":"2018"},{"key":"ref19","first-page":"242","article-title":"A convergence theory for deep learning via over-parameterization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Allen-Zhu","year":"2019"},{"key":"ref20","first-page":"6597","article-title":"Multi-task learning with user preferences: Gradient descent with controlled ascent in pareto optimization","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Mahapatra","year":"2020"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2704118"},{"key":"ref22","first-page":"38902","article-title":"Hypervolume maximization: A geometric view of pareto set learning","volume-title":"Proc. 37th Conf. Neural Inf. Process. Syst.","author":"Zhang","year":"2023"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5563-6"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3067454"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3627673.3679533"},{"key":"ref26","first-page":"7482","article-title":"Multi-task learning using uncertainty to weigh losses for scene geometry and semantics","volume-title":"Proc. IEEE Conf. Comput. Vis. Pattern Recognit.","author":"Kendall","year":"2018"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2012.03.014"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1980.1102298"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s001860000043"},{"issue":"5","key":"ref30","first-page":"313","article-title":"Mutiple-gradient descent algorithm for multiobjective optimization","volume-title":"Proc. Eur. Congr. Comput. Methods Appl. Sci. Eng. (ECCOMAS 2012)","volume":"350","author":"Dsidri","year":"2012"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2859363"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.3.411"},{"key":"ref33","article-title":"Optimization on pareto sets: On a theory of multi-objective optimization","author":"Roy","year":"2023"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref35","first-page":"122206","article-title":"Direct preference-based evolutionary multi-objective optimization with dueling bandit","volume-title":"Proc. 38th Annu. Conf. Neural Inf. Process. Syst.","author":"Huang","year":"2024"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96104-0_2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.1"},{"issue":"3","key":"ref38","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1057\/palgrave.jors.2600425","article-title":"Nonlinear programming,(optimization and computation)","volume":"48","author":"Bertsekas","year":"1997","journal-title":"J. Oper. Res. Soc."},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/100802529"},{"issue":"1","key":"ref40","first-page":"2909","article-title":"Cvxpy: A python-embedded modeling language for convex optimization","volume":"17","author":"Diamond","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3424305"},{"key":"ref42","first-page":"1057","article-title":"Policy gradient methods for reinforcement learning with function approximation","volume-title":"Adv. Neural Inf. Process. Syst.","volume":"12","author":"Sutton","year":"1999"},{"key":"ref43","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"ref44","first-page":"1889","article-title":"Trust region policy optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Schulman","year":"2015"},{"key":"ref45","article-title":"LibMOON: A gradient-based multiobjective optimization library in PyTorch","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"37","author":"Zhang","year":"2024"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568202"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/298151.298382"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1007032"},{"key":"ref49","first-page":"19231","article-title":"Pareto set learning for expensive multi-objective optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lin","year":"2022"},{"key":"ref50","article-title":"Profiling pareto front with multi-objective stein variational gradient descent","volume":"34","author":"Liu","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref51","first-page":"14721","article-title":"Profiling pareto front with multi-objective stein variational gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Liu","year":"2021"},{"issue":"2016","key":"ref52","first-page":"139","article-title":"Machine bias","volume":"23","author":"Angwin","year":"2016","journal-title":"ProPublica"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.12.020"},{"key":"ref54","first-page":"600","article-title":"Addressing fairness in classification with a model-agnostic multi-objective algorithm","volume-title":"Proc. Uncertainty Artif. Intell.","author":"Padh","year":"2021"},{"key":"ref55","first-page":"10607","article-title":"Prediction-guided multi-objective reinforcement learning for continuous robot control","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu","year":"2020"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57422-2_3"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-019-00535-z"},{"key":"ref58","article-title":"PD-MORL: Preference-driven multi-objective reinforcement learning algorithm","author":"Basaklar","year":"2023"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7433297\/11456635\/10960608.pdf?arnumber=10960608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T05:16:59Z","timestamp":1774588619000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10960608\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":58,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2025.3526459","relation":{},"ISSN":["2471-285X"],"issn-type":[{"value":"2471-285X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]}}}