{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,11]],"date-time":"2026-09-11T15:50:57Z","timestamp":1789141857824,"version":"build-2803163510"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2021YFB2900102"],"award-info":[{"award-number":["2021YFB2900102"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472410"],"award-info":[{"award-number":["62472410"]}],"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":["62072436"],"award-info":[{"award-number":["62072436"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Fund for Distinguished Young Scholars of China","doi-asserted-by":"publisher","award":["62425201"],"award-info":[{"award-number":["62425201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3536777","type":"journal-article","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T19:14:22Z","timestamp":1738264462000},"page":"2464-2479","source":"Crossref","is-referenced-by-count":7,"title":["Enhancing Federated Learning Robustness Using Locally Benignity-Assessable Bayesian Dropout"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8328-3015","authenticated-orcid":false,"given":"Jingjing","family":"Xue","sequence":"first","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0260-2692","authenticated-orcid":false,"given":"Sheng","family":"Sun","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2824-9601","authenticated-orcid":false,"given":"Min","family":"Liu","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8776-8730","authenticated-orcid":false,"given":"Qi","family":"Li","sequence":"additional","affiliation":[{"name":"Institute for Network Sciences and Cyberspace and Beijing National Research Centre for Information Science and Technology (BNRist), Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2587-8517","authenticated-orcid":false,"given":"Ke","family":"Xu","sequence":"additional","affiliation":[{"name":"Zhongguancun Laboratory, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist.","author":"McMahan"},{"key":"ref2","first-page":"5311","article-title":"Learning from history for Byzantine robust optimization","volume-title":"Proc. 38th Int. Conf. Mach. Learn. (ICML)","author":"Karimireddy"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20903"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3333555"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3264697"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2024.01.009"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2021.3093711"},{"key":"ref8","first-page":"3521","article-title":"The hidden vulnerability of distributed learning in byzantium","volume-title":"Proc. 35th Int. Conf. Mach. Learn. (ICML)","author":"Mhamdi"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom56396.2022.00030"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2023.3237397"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2021.3135422"},{"key":"ref12","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. 35th Int. Conf. Mach. Learn. (ICML)","author":"Yin"},{"key":"ref13","first-page":"1","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Blanchard"},{"key":"ref14","first-page":"301","article-title":"The limitations of federated learning in Sybil settings","volume-title":"Proc. Int. Symp. Res. Attacks, Intrusions Defenses (RAID)","author":"Fung"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796935"},{"key":"ref16","first-page":"1","article-title":"A little is enough: Circumventing defenses for distributed learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Baruch"},{"key":"ref17","article-title":"Byzantine-robust learning on heterogeneous datasets via bucketing","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Karimireddy"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179362"},{"key":"ref19","first-page":"4387","article-title":"The non-IID data quagmire of decentralized machine learning","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Hsieh"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3365295"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS54959.2023.00056"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IST64061.2024.10843494"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2022.03.003"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3220849"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-61499-098-7-870"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.24498"},{"key":"ref27","first-page":"261","article-title":"Fall of empires: Breaking Byzantine-tolerant sgd by inner product manipulation","volume-title":"Proc. Uncertainty Artif. Intell.","author":"Xie"},{"key":"ref28","first-page":"21404","article-title":"Byzantine-robust learning on heterogeneous data via gradient splitting","volume-title":"Proc. 40th Int. Conf. Mach. Learn. (ICML)","author":"Liu"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.24434"},{"key":"ref30","first-page":"19837","article-title":"Reconstructive neuron pruning for backdoor defense","volume-title":"Proc. 40th Int. Conf. Mach. Learn. (ICML)","author":"Li"},{"key":"ref31","article-title":"FedREP: A Byzantine-robust, communication-efficient and privacy-preserving framework for federated learning","author":"Yang","year":"2023","journal-title":"arXiv:2303.05206"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-33377-4_34"},{"key":"ref33","first-page":"26293","article-title":"Personalized federated learning via variational Bayesian inference","volume-title":"Proc. 39th Int. Conf. Mach. Learn. (ICML)","author":"Zhang"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.5555\/3045390.3045502"},{"key":"ref35","first-page":"1831","article-title":"Convergence rates of variational inference in sparse deep learning","volume-title":"Proc. 37th Int. Conf. Mach. Learn. (ICML)","author":"Ch\u00e9rief-Abdellatif"},{"key":"ref36","article-title":"Frequentist consistency of variational Bayes","author":"Wang","year":"2017","journal-title":"arXiv:1705.03439"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.5555\/3295222.3295309"},{"key":"ref38","first-page":"4629","article-title":"What are Bayesian neural network posteriors really like?","volume-title":"Proc. 38th Int. Conf. Mach. Learn. (ICML)","author":"Izmailov"},{"key":"ref39","article-title":"Bayesian learning for neural networks: An algorithmic survey","author":"Magris","year":"2022","journal-title":"arXiv:2211.11865"},{"key":"ref40","first-page":"1","article-title":"A theoretically grounded application of dropout in recurrent neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Gal"},{"key":"ref41","volume-title":"USA Mobile Network Experience Report January 2024","year":"2024"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1214\/19-aos1855"},{"key":"ref43","first-page":"1","article-title":"Exact Langevin dynamics with stochastic gradients","volume-title":"Proc. 3rd Symp. Adv. Approx. Bayesian Inference","author":"Garriga-Alonso"},{"key":"ref44","article-title":"Uncertainty in deep learning","author":"Gal","year":"2016"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00470-5_13"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054676"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2019.8852464"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2023.23112"},{"key":"ref49","first-page":"1","article-title":"Posterior concentration for sparse deep learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Polson"},{"issue":"1","key":"ref50","first-page":"1","article-title":"Adaptive approximation and generalization of deep neural network with intrinsic dimensionality","volume":"21","author":"Nakada","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3166101"},{"key":"ref52","article-title":"Achieving personalized federated learning with sparse local models","author":"Huang","year":"2022","journal-title":"arXiv:2201.11380"},{"key":"ref53","first-page":"4587","article-title":"DisPFL: Towards communication-efficient personalized federated learning via decentralized sparse training","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Dai"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i7.25977"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00062"},{"key":"ref56","article-title":"Expanding the reach of federated learning by reducing client resource requirements","author":"Caldas","year":"2018","journal-title":"arXiv:1812.07210"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2022.3149783"},{"key":"ref58","article-title":"MNIST handwritten digit database","author":"LeCun","year":"2010"},{"key":"ref59","article-title":"Fashion-MNIST: A novel image dataset for benchmarking machine learning algorithms","author":"Xiao","year":"2017","journal-title":"arXiv:1708.07747"},{"key":"ref60","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref61","article-title":"LEAF: A benchmark for federated settings","author":"Caldas","year":"2018","journal-title":"arXiv:1812.01097"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3453142.3492909"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i6.20555"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3402113"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3402993"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3153135"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3461449"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3326983"},{"key":"ref69","article-title":"Federated learning for mobile keyboard prediction","author":"Hard","year":"2018","journal-title":"arXiv:1811.03604"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00100"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOMWKSHPS51825.2021.9484526"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/10858077.pdf?arnumber=10858077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T18:44:02Z","timestamp":1741200242000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10858077\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":71,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3536777","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}