{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T10:44:40Z","timestamp":1781779480508,"version":"3.54.5"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"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":["12371519"],"award-info":[{"award-number":["12371519"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61771013"],"award-info":[{"award-number":["61771013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Asiainfo Technologies"},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Funds of Shanghai Jiading District"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1109\/tnse.2025.3545912","type":"journal-article","created":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T18:54:11Z","timestamp":1740682451000},"page":"2402-2414","source":"Crossref","is-referenced-by-count":8,"title":["Cellular Traffic Prediction via Byzantine-Robust Asynchronous Federated Learning"],"prefix":"10.1109","volume":"12","author":[{"given":"Hui","family":"Ma","sequence":"first","affiliation":[{"name":"Department of Computer Science, Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5983-198X","authenticated-orcid":false,"given":"Kai","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9468-1000","authenticated-orcid":false,"given":"Yang","family":"Jiao","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3132363"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2020.2986238"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3243391"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.130.2200352"},{"key":"ref5","article-title":"TimeAutoML: Autonomous representation learning for multivariate irregularly sampled time series","author":"Jiao","year":"2020"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2024.3418906"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2017.1800079"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2930202"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.011.1900647"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2022.3217170"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2022.10.023"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.006.2200437"},{"key":"ref13","first-page":"16937","article-title":"Inverting gradients - How easy is it to break privacy in federated learning?","volume-title":"Proc. Adv. Neural Inf. Proces. Syst.","author":"Geiping","year":"2020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACOMP.2019.00022"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3140131"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS54860.2022.00086"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-012-9198-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.171"},{"key":"ref19","first-page":"119","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Adv. Neural Inf. Proces. Syst.","author":"Blanchard","year":"2017"},{"key":"ref20","first-page":"5636","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yin","year":"2018"},{"key":"ref21","article-title":"Certifiably Byzantine-robust federated conformal prediction","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kang","year":"2024"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011544"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/337"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3167434"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3335626"},{"key":"ref26","article-title":"TimeMixer: Decomposable multiscale mixing for time series forecasting","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Wang","year":"2024"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC45102.2020.9294453"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2991401"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3221970"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2021.3050955"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2021.3055283"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3179391"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3215326"},{"key":"ref34","first-page":"429","article-title":"Federated optimization in heterogeneous networks","volume-title":"Proc. Mach. Learn. Syst.","author":"Li","year":"2020"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2019.8852464"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488883"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3151670"},{"key":"ref38","article-title":"Privacy in deep learning: A survey","author":"Mireshghallah","year":"2020"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.2982555"},{"key":"ref40","article-title":"Fed-GLOSS-DP: Federated, global learning using synthetic sets with record level differential privacy","author":"Wang","year":"2023"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3189361"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2991416"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761267"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1049\/cmu2.12722"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3510032"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3616537"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1080\/0952813X.2024.2391778"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2023.3237397"},{"key":"ref50","first-page":"902","article-title":"DRACO: Byzantine-resilient distributed training via redundant gradients","volume-title":"Proc. Int. Conf. Mach. Learn","volume":"80","author":"Chen","year":"2018"},{"key":"ref51","first-page":"10320","article-title":"DETOX: A redundancy-based framework for faster and more robust gradient aggregation","volume-title":"Proc. Adv. Neural Inf. Proces. Syst.","author":"Rajput","year":"2019"},{"key":"ref52","doi-asserted-by":"crossref","DOI":"10.14722\/ndss.2021.24434","article-title":"FLTrust: Byzantine-robust federated learning via trust bootstrapping","volume-title":"Proc. Annu. Netw. Distrib. Syst. Secur. Symp.","author":"Cao","year":"2021"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2021.3128164"},{"key":"ref55","first-page":"5311","article-title":"Learning from history for Byzantine robust optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"139","author":"Karimireddy","year":"2021"},{"key":"ref56","first-page":"7987","article-title":"Distributed distributionally robust optimization with non-convex objectives","volume-title":"Proc. Adv. Neural Inf. Proces. Syst.","volume":"35","author":"Jiao","year":"2022"},{"key":"ref57","article-title":"Gradient-based bi-level optimization for deep learning: A survey","author":"Chen","year":"2022"},{"key":"ref58","article-title":"Fair resource allocation in federated learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li","year":"2020"},{"key":"ref59","article-title":"Asynchronous distributed bilevel optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Jiao","year":"2023"},{"key":"ref60","first-page":"4615","article-title":"Agnostic federated learning","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"97","author":"Mohri","year":"2019"},{"key":"ref61","first-page":"15111","article-title":"Distributionally robust federated averaging","volume-title":"Proc. Adv. Neural Inf. Proces. Syst.","volume":"33","author":"Deng","year":"2020"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1172-1"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-014-0583-7"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-021-01765-6"},{"key":"ref65","first-page":"4882","article-title":"Bilevel optimization: Convergence analysis and enhanced design","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ji","year":"2021"},{"key":"ref66","first-page":"11490","article-title":"Convergence of meta-learning with task-specific adaptation over partial parameters","volume-title":"Proc. Adv. Neural Inf. Proces. Syst.","volume":"33","author":"Ji","year":"2020"},{"key":"ref67","article-title":"The suplementary content","author":"Ma","year":"2025"},{"key":"ref68","article-title":"Telecommunications - SMS, call, internet - MI","author":"Italia","year":"2015"},{"key":"ref69","article-title":"Social pulse - milano","author":"SpazioDati","year":"2015"},{"key":"ref70","article-title":"MilanoToday","year":"2015","journal-title":""},{"key":"ref71","article-title":"Telecommunications - SMS, call, internet - TN","author":"Italia","year":"2015"},{"key":"ref72","article-title":"Social pulse - trentino","year":"2015","journal-title":""},{"key":"ref73","article-title":"TrentoToday","year":"2015","journal-title":""},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3056991"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/11015837\/10906373.pdf?arnumber=10906373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:01:03Z","timestamp":1751090463000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10906373\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":74,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2025.3545912","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7]]}}}