{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:20:27Z","timestamp":1759882827164,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,14]]},"DOI":"10.1145\/3712255.3726613","type":"proceedings-article","created":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T15:14:02Z","timestamp":1754925242000},"page":"455-458","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["MGDA\/D: A Multiple Gradient Descent Algorithm Based on Decomposition"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9072-1543","authenticated-orcid":false,"given":"Yawen","family":"Zhou","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6789-2670","authenticated-orcid":false,"given":"Ke","family":"Xue","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6011-2512","authenticated-orcid":false,"given":"Chao","family":"Qian","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"C. Bian S. Ren M. Li and C. Qian. 2024. An archive can bring provable speed-ups in multi-objective evolutionary algorithms. In IJCAI. 6905\u20136913.","DOI":"10.1145\/3712255.3734254"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2025.104308"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"K. Deb L. Thiele M. Laumanns and E. Zitzler. 2002. Scalable multi-objective optimization test problems. In CEC. Honolulu HI 825\u2013830.","DOI":"10.1109\/CEC.2002.1007032"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2012.03.014"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001860000043"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_2_1_8_1","unstructured":"X. Lin H. Zhen Z. Li Q. Zhang and S. Kwong. 2019. Pareto multi-task learning. In NeurIPS. Vancouver Canada 12037\u201312047."},{"key":"e_1_3_2_1_9_1","unstructured":"X. Liu X. Tong and Q. Liu. 2021. Profiling pareto front with multi-objective stein variational gradient descent. In NeurIPS. Virtual 14721\u201314733."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"T. Lu C. Bian and C. Qian. 2024. Towards running time analysis of interactive multi-objective evolutionary algorithms. In AAAI. 20777\u201320785.","DOI":"10.1609\/aaai.v38i18.30066"},{"key":"e_1_3_2_1_11_1","unstructured":"D. Mahapatra and V. Rajan. 2020. Multi-task learning with user preferences: Gradient descent with controlled ascent in Pareto optimization. In ICML. Virtual 6597\u20136607."},{"key":"e_1_3_2_1_12_1","unstructured":"H. Phan N. Tran T. Le T. Tran N. Ho and D. Phung. 2022. Stochastic multiple target sampling gradient descent. In NeurIPS. New Orleans LA 22643\u201322655."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103737"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"C. Qian J.-C. Shi Y. Yu and K. Tang. 2017. On subset selection with general cost constraints. In IJCAI. Melbourne Australia 2613\u20132619.","DOI":"10.24963\/ijcai.2017\/364"},{"volume-title":"NeurIPS.","author":"Qian C.","key":"e_1_3_2_1_15_1","unstructured":"C. Qian, J.-C. Shi, Y. Yu, K. Tang, and Z.-H. Zhou. 2017. Subset selection under noise. In NeurIPS. Long Beach, CA, 3563\u20133573."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.09.002"},{"volume-title":"AAAI.","author":"Qian C.","key":"e_1_3_2_1_17_1","unstructured":"C. Qian, Y. Yu, and Z.-H. Zhou. 2015. Pareto ensemble pruning. In AAAI. Austin, TX, 2935\u20132941."},{"key":"e_1_3_2_1_18_1","unstructured":"C. Qian Y. Yu and Z.-H. Zhou. 2015. Subset selection by Pareto optimization. In NeurIPS. Montreal Canada 1765\u20131773."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"S. Ren C. Bian M. Li and C. Qian. 2024. A first running time analysis of the strength Pareto evolutionary algorithm 2 (SPEA2). In PPSN. 295\u2013312.","DOI":"10.1007\/978-3-031-70071-2_19"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"S. Ren Z. Qiu C. Bian M. Li and C. Qian. 2024. Maintaining diversity provably helps in evolutionary multimodal optimization. In IJCAI. 7012\u20137020.","DOI":"10.1145\/3712255.3734253"},{"key":"e_1_3_2_1_21_1","unstructured":"S. Sabour N. Frosst and G. Hinton. 2017. Dynamic routing between capsules. In NeurIPS. Long Beach CA 3856\u20133866."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3470971","article-title":"Evolutionary large-scale multi-objective optimization: A survey","volume":"54","author":"Tian Y.","year":"2021","unstructured":"Y. Tian, L. Si, X. Zhang, R. Cheng, C. He, K. Tan, and Y. Jin. 2021. Evolutionary large-scale multi-objective optimization: A survey. Comput. Surveys 54, 8 (2021), 1\u201334.","journal-title":"Comput. Surveys"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"K. Xue C. Qian L. Xu and X. Fei. 2021. Evolutionary gradient descent for non-convex optimization. In IJCAI. Virtual 3221\u20133227.","DOI":"10.24963\/ijcai.2021\/443"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_3_2_1_25_1","volume-title":"NeurIPS","author":"Zhang X.","year":"2026","unstructured":"X. Zhang, L. Zhao, Y. Yu, X. Lin, Y. Chen, H. Zhao, and Q. Zhang. 2024. LibMOON: A gradient-based multiobjective optimizatioN library in PyTorch. In NeurIPS. Vancouver, Canada, 2026\u20132044."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568202"}],"event":{"name":"GECCO '25 Companion: Genetic and Evolutionary Computation Conference Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"NH Malaga Hotel Malaga Spain","acronym":"GECCO '25 Companion"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712255.3726613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:46:22Z","timestamp":1759837582000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712255.3726613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,14]]},"references-count":27,"alternative-id":["10.1145\/3712255.3726613","10.1145\/3712255"],"URL":"https:\/\/doi.org\/10.1145\/3712255.3726613","relation":{},"subject":[],"published":{"date-parts":[[2025,7,14]]},"assertion":[{"value":"2025-08-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}