{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T00:49:15Z","timestamp":1777164555784,"version":"3.51.4"},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62402148"],"award-info":[{"award-number":["62402148"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hangzhou Key Scientific Research Plan","award":["2024SZD1A28"],"award-info":[{"award-number":["2024SZD1A28"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Serv. Comput."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tsc.2025.3593906","type":"journal-article","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T18:34:06Z","timestamp":1753986846000},"page":"3052-3064","source":"Crossref","is-referenced-by-count":8,"title":["Multi-Objective Unlearning in Recommender Systems via Preference Guided Pareto Exploration"],"prefix":"10.1109","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4896-2885","authenticated-orcid":false,"given":"Yuyuan","family":"Li","sequence":"first","affiliation":[{"name":"School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China"}]},{"given":"Yizhao","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4115-7667","authenticated-orcid":false,"given":"Weiming","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University, Hangzhou, China"}]},{"given":"Xiaohua","family":"Feng","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9957-7325","authenticated-orcid":false,"given":"Zhongxuan","family":"Han","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1419-964X","authenticated-orcid":false,"given":"Chaochao","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1204-0512","authenticated-orcid":false,"given":"Chenggang","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.35"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511997"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3701987"},{"key":"ref4","first-page":"794","article-title":"Gradnorm: Gradient normalization for adaptive loss balancing in deep multitask networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen","year":"2018"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3424305"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2012.03.014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.10.010"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714671"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531820"},{"key":"ref10","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume":"9","author":"Glorot","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref11","first-page":"979","article-title":"You are who you know and how you behave: Attribute inference attacks via users\u2019 social friends and behaviors","volume-title":"Proc. 25th USENIX Secur. Symp.","author":"Gong","year":"2016"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3154793"},{"issue":"1","key":"ref13","first-page":"723","article-title":"A kernel two-sample test","volume":"13","author":"Gretton","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref14","article-title":"Efficient attribute unlearning: Towards selective removal of input attributes from feature representations","author":"Guo","year":"2022"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883037"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806504"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3523273"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2025.3594687"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.24525"},{"key":"ref23","article-title":"California Senate Bill 362","year":"2023"},{"key":"ref24","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":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.579"},{"key":"ref26","first-page":"1","article-title":"User-level membership inference attack against metric embedding learning","volume-title":"Proc. Workshop PAIR2 Struct: Privacy, Accountability, Interpretability, Robustness, Reasoning Struct. Data","author":"Li","year":"2022"},{"key":"ref27","first-page":"12611","article-title":"UltraRE: Enhancing receraser for recommendation unlearning via error decomposition","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Li","year":"2023"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.111124"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121025"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3581783.3612418"},{"key":"ref31","first-page":"12917","article-title":"Pareto domain adaptation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Liang","year":"2021"},{"key":"ref32","first-page":"12060","article-title":"Pareto multi-task learning","volume-title":"Proc. 33rd Int. Conf. Neural Inf. Process. Syst.","author":"Lin","year":"2019"},{"key":"ref33","first-page":"6522","article-title":"Efficient continuous pareto exploration in multi-task learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ma","year":"2020"},{"key":"ref34","first-page":"6597","article-title":"Multi-task learning with user preferences: Gradient descent with controlled ascent in pareto optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mahapatra","year":"2020"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833623"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3523227.3546756"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102666"},{"key":"ref38","first-page":"15895","article-title":"A multi-objective\/multi-task learning framework induced by Pareto stationarity","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Momma","year":"2022"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2019.23119"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591989"},{"key":"ref41","first-page":"525","article-title":"Multi-task learning as multi-objective optimization","volume-title":"Proc. 32nd Int. Conf. Neural Inf. Process. Syst.","author":"Sener","year":"2018"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2556270"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.41"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i12.33367"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417270"},{"key":"ref46","first-page":"1938","article-title":"Minimax estimation of maximum mean discrepancy with radial kernels","volume-title":"Proc. 30th Int. Conf. Neural Inf. Process. Syst.","author":"Tolstikhin","year":"2016"},{"key":"ref47","article-title":"General data protection regulation","year":"2018"},{"issue":"193327","key":"ref48","article-title":"Towards efficient and effective unlearning of large language models for recommendation","volume":"19","author":"Wang","year":"2025","journal-title":"Front. Comput. Sci."},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.5220\/0012757300003756"},{"key":"ref50","article-title":"Multi-task deep recommender systems: A survey","author":"Wang","year":"2023"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539392"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2365952.2365989"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6107"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3616855.3635823"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3603620"},{"key":"ref56","article-title":"Netflix and forget: Efficient and exact machine unlearning from bi-linear recommendations","author":"Xu","year":"2023"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/447"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.107"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8388-9_33"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17284"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570463"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3181270"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484770"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/3701763"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.11.041"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583447"}],"container-title":["IEEE Transactions on Services Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4629386\/11198176\/11106189.pdf?arnumber=11106189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:30:55Z","timestamp":1760135455000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11106189\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":66,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tsc.2025.3593906","relation":{},"ISSN":["1939-1374","2372-0204"],"issn-type":[{"value":"1939-1374","type":"electronic"},{"value":"2372-0204","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}