{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T12:30:42Z","timestamp":1766061042379,"version":"3.48.0"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Shenzhen Science and Technology Program","award":["KJZD20230923113901004"],"award-info":[{"award-number":["KJZD20230923113901004"]}]},{"name":"Key Programs of Ningbo Municipal Natural Science Foundation","award":["2024J021"],"award-info":[{"award-number":["2024J021"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62572501"],"award-info":[{"award-number":["62572501"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP210101723"],"award-info":[{"award-number":["DP210101723"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Serv. Comput."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tsc.2025.3616355","type":"journal-article","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T17:39:24Z","timestamp":1759340364000},"page":"3523-3537","source":"Crossref","is-referenced-by-count":0,"title":["BGTplanner: Maximizing Training Accuracy for Differentially Private Federated Recommenders via Strategic Privacy Budget Allocation"],"prefix":"10.1109","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2332-7941","authenticated-orcid":false,"given":"Xianzhi","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1533-0865","authenticated-orcid":false,"given":"Yipeng","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Computing, Faculty of Science and Engineering, Macquarie University, Sydney, NSW, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1518-002X","authenticated-orcid":false,"given":"Miao","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9433-7725","authenticated-orcid":false,"given":"Di","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5036-9899","authenticated-orcid":false,"given":"Pengshan","family":"Liao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8972-8094","authenticated-orcid":false,"given":"Mohsen","family":"Guizani","sequence":"additional","affiliation":[{"name":"Department of Machine Learning, Mohamed Bin Zayed University of Artificial Intelligence, Abu Dhabi, UAE"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3326-4147","authenticated-orcid":false,"given":"Quan Z.","family":"Sheng","sequence":"additional","affiliation":[{"name":"School of Computing, Faculty of Science and Engineering, Macquarie University, Sydney, NSW, Australia"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2023.3242338"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2021.3065035"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-30714-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3484493"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i10.28950"},{"key":"ref6","first-page":"1","article-title":"Active membership inference attack under local differential privacy in federated learning","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Nguyen"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2023.3285935"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00029"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599889"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i10.28965"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2023.3332102"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3428348"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484794"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i8.28790"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/electronics12030658"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3704633"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00065"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833647"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3376255"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.128"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512192"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.723"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/498"},{"key":"ref28","first-page":"1015","article-title":"Gaussian process optimization in the bandit setting: No regret and experimental design","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Srinivas"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228949"},{"key":"ref30","first-page":"5011","article-title":"Optimal contextual bandits with knapsacks under realizability via regression oracles","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Han"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref33","first-page":"3458","article-title":"Linear contextual bandits with knapsacks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Agrawal"},{"key":"ref34","first-page":"433","article-title":"Algorithms with logarithmic or sublinear regret for constrained contextual bandits","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref35","first-page":"3700","article-title":"Geometric matrix completion with recurrent multi-graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Monti"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583359"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"article-title":"Federated optimization in heterogeneous networks","year":"2020","author":"Li","key":"ref39"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3102030"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom56396.2022.00094"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3293961"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxae081"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3531146.3533070"},{"key":"ref45","doi-asserted-by":"crossref","DOI":"10.1109\/ICASSP49357.2023.10095274","article-title":"Client selection for generalization in accelerated federated learning: A multi-armed bandit approach","author":"Ami","year":"2023"},{"key":"ref46","first-page":"2917","article-title":"Federated multi-armed bandits with personalization","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Shi"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3264677"},{"key":"ref48","first-page":"2447","article-title":"Contextual gaussian process bandit optimization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Krause"},{"key":"ref49","first-page":"1195","article-title":"Differentially private regression with Gaussian processes","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Smith"},{"volume-title":"Gaussian Processes for Machine Learning","year":"2006","author":"Rasmussen","key":"ref50"}],"container-title":["IEEE Transactions on Services Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4629386\/11298270\/11186206.pdf?arnumber=11186206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T12:26:57Z","timestamp":1766060817000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11186206\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":50,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tsc.2025.3616355","relation":{},"ISSN":["1939-1374","2372-0204"],"issn-type":[{"type":"electronic","value":"1939-1374"},{"type":"electronic","value":"2372-0204"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}