{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:14:42Z","timestamp":1755839682759,"version":"3.37.3"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006190","name":"Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006190","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,4,14]]},"DOI":"10.1109\/icassp48485.2024.10448153","type":"proceedings-article","created":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T18:56:31Z","timestamp":1710788191000},"page":"5905-5909","source":"Crossref","is-referenced-by-count":1,"title":["Learning from Easy to Hard: Multi-Task Learning with Data Scheduling"],"prefix":"10.1109","author":[{"given":"Zeyu","family":"Liu","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology,School of Computer Science and Technology,Shenzhen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heyan","family":"Chai","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,School of Computer Science and Technology,Shenzhen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Liao","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,School of Computer Science and Technology,Shenzhen"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3070203"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00312"},{"key":"ref3","article-title":"Pareto multi-task learning","volume":"32","author":"Lin","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref4","first-page":"6597","article-title":"Multi-task learning with user preferences: Gradient descent with controlled ascent in pareto optimization","volume-title":"Proceedings of the 37th International Conference on Machine Learning","volume":"119","author":"Mahapatra"},{"key":"ref5","article-title":"Efficient continuous pareto exploration in multi-task learning","author":"Ma","year":"2020","journal-title":"CoRR"},{"key":"ref6","first-page":"5824","article-title":"Gradient surgery for multi-task learning","volume":"33","author":"Yu","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00781"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00197"},{"key":"ref9","article-title":"Reasonable effectiveness of random weighting: A litmus test for multi-task learning","author":"Lin","year":"2022","journal-title":"Transactions on Machine Learning Research"},{"article-title":"Multi-task curriculum learning based on gradient similarity","year":"2022","author":"Igarashi","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.144"},{"article-title":"Gradient vaccine: Investigating and improving multi-task optimization in massively multilingual models","year":"2020","author":"Wang","key":"ref12"},{"key":"ref13","first-page":"18878","article-title":"Conflict-averse gradient descent for multitask learning","volume":"34","author":"Liu","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00077"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3069908"},{"key":"ref16","first-page":"2039","article-title":"Just pick a sign: Optimizing deep multitask models with gradient sign dropout","volume":"33","author":"Chen","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33715-4_54"},{"key":"ref18","article-title":"Dynamic routing between capsules","volume":"30","author":"Sabour","year":"2017","journal-title":"Advances in neural information processing systems"},{"article-title":"LibMTL: A python library for multi-task learning","year":"2022","author":"Lin","key":"ref19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.75"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1802.02611"},{"article-title":"Adam: A method for stochastic optimization","year":"2014","author":"Kingma","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref24","article-title":"Multi-task learning as multi-objective optimization","volume":"31","author":"Sener","year":"2018","journal-title":"Advances in neural information processing systems"}],"event":{"name":"ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2024,4,14]]},"location":"Seoul, Korea, Republic of","end":{"date-parts":[[2024,4,19]]}},"container-title":["ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10445798\/10445803\/10448153.pdf?arnumber=10448153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T06:51:55Z","timestamp":1722581515000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10448153\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,14]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icassp48485.2024.10448153","relation":{},"subject":[],"published":{"date-parts":[[2024,4,14]]}}}