{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T06:54:48Z","timestamp":1771916088263,"version":"3.50.1"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100008977","name":"Universit\u00e4t Ulm","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3334910","type":"journal-article","created":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T19:24:36Z","timestamp":1701199476000},"page":"134009-134022","source":"Crossref","is-referenced-by-count":10,"title":["Performance Analysis of Federated Learning Algorithms for Multilingual Protest News Detection Using Pre-Trained DistilBERT and BERT"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6332-3865","authenticated-orcid":false,"given":"Pascal","family":"Riedel","sequence":"first","affiliation":[{"name":"Institute of Databases and Information Systems, Ulm University, Ulm, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2536-4153","authenticated-orcid":false,"given":"Manfred","family":"Reichert","sequence":"additional","affiliation":[{"name":"Institute of Databases and Information Systems, Ulm University, Ulm, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1368-8209","authenticated-orcid":false,"given":"Reinhold","family":"Von Schwerin","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Ulm University of Applied Sciences, Ulm, Germany"}]},{"given":"Alexander","family":"Hafner","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Ulm University of Applied Sciences, Ulm, Germany"}]},{"given":"Daniel","family":"Schaudt","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Ulm University of Applied Sciences, Ulm, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1645-730X","authenticated-orcid":false,"given":"Gaurav","family":"Singh","sequence":"additional","affiliation":[{"name":"Independent Researcher, Varanasi, India"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Attention is all you need","volume":"30","author":"Vaswani","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-021-09958-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1452"},{"key":"ref4","article-title":"LLaMA: Open and efficient foundation language models","author":"Touvron","year":"2023","journal-title":"arXiv:2302.13971"},{"key":"ref5","article-title":"Language models are few-shot learners","author":"Brown","year":"2020","journal-title":"arXiv:2005.14165"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.lindif.2023.102274"},{"key":"ref7","article-title":"Learning transferable visual models from natural language supervision","author":"Radford","year":"2021","journal-title":"arXiv:2103.00020"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-020-00318-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.13052\/jmbmit2245-456X.434"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/idpl\/ipx003"},{"key":"ref11","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"McMahan","year":"2016","journal-title":"arXiv:1602.05629"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3298981"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/msp.2020.2975749"},{"key":"ref14","article-title":"The federated tumor segmentation (FeTS) challenge","author":"Pati","year":"2021","journal-title":"arXiv:2105.05874"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2015.2484326"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.naacl-main.155"},{"key":"ref18","article-title":"Federated learning for mobile keyboard prediction","author":"Hard","year":"2018","journal-title":"arXiv:1811.03604"},{"key":"ref19","article-title":"Adaptive methods for nonconvex optimization","volume":"31","author":"Zaheer","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"5","key":"ref20","first-page":"566","article-title":"Adagrad\u2014An optimizer for stochastic gradient descent","volume":"6","author":"Lydia","year":"2019","journal-title":"Int. J. Inf. Comput. Sci"},{"key":"ref21","first-page":"20461","article-title":"On large-cohort training for federated learning","volume-title":"Advances in Neural Information Processing Systems","volume":"34","author":"Charles","year":"2021"},{"key":"ref22","article-title":"Adaptive federated optimization","author":"Reddi","year":"2020","journal-title":"arXiv:2003.00295"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00987"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.case-1.11"},{"key":"ref25","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"Devlin","year":"2018","journal-title":"arXiv:1810.04805"},{"key":"ref26","article-title":"DistilBERT, a distilled version of BERT: Smaller, faster, cheaper and lighter","author":"Sanh","year":"2019","journal-title":"arXiv:1910.01108"},{"key":"ref27","article-title":"Distilling task-specific knowledge from BERT into simple neural networks","author":"Tang","year":"2019","journal-title":"arXiv:1903.12136"},{"key":"ref28","first-page":"374","article-title":"Towards federated learning at scale: System design","volume-title":"Proc. Mach. Learn. Syst.","volume":"1","author":"Bonawitz"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOM50583.2021.9439129"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.55"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1181"},{"key":"ref32","article-title":"Where to begin? Exploring the impact of pre-training and initialization in federated learning","author":"Nguyen","year":"2022","journal-title":"arXiv:2206.15387"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.naacl-main.101"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.findings-naacl.13"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3510033"},{"key":"ref36","article-title":"Measuring the effects of non-identical data distribution for federated visual classification","author":"Hsu","year":"2019","journal-title":"arXiv:1909.06335"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3570361.3592505"},{"key":"ref38","first-page":"6357","article-title":"Ditto: Fair and robust federated learning through personalization","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","volume":"139","author":"Li"},{"key":"ref39","volume-title":"Scikit-Learn F1 Score","year":"2023"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.07.098"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1264"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1101"},{"key":"ref43","doi-asserted-by":"crossref","DOI":"10.1145\/1150402.1150464","article-title":"Model compression","volume-title":"Proc. KDD","author":"Bucila"},{"key":"ref44","first-page":"1","article-title":"Distilling the knowledge in a neural network","author":"Hinton","year":"2015","journal-title":"arXiv:1503.02531"},{"key":"ref45","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"},{"key":"ref46","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2012"},{"key":"ref47","article-title":"On the convergence of Adam and beyond","author":"Reddi","year":"2019","journal-title":"arXiv:1904.09237"},{"key":"ref48","article-title":"Decoupled weight decay regularization","author":"Loshchilov","year":"2017","journal-title":"arXiv:1711.05101"},{"key":"ref49","volume-title":"Good Practices for Neural Network Training: Identify, Save, and Document Best Models","author":"Jaccard","year":"2021"},{"key":"ref50","volume-title":"Saving and Loading the Best Model in PyTorch","author":"Rath","year":"2021"},{"key":"ref51","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume":"32","author":"Paszke","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref52","article-title":"Flower: A friendly federated learning research framework","author":"Beutel","year":"2020","journal-title":"arXiv:2007.14390"},{"key":"ref53","volume-title":"DistilBERT","year":"2023"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-98464-9_5"},{"key":"ref55","volume-title":"BERT Multilingual Base Model (Cased)","year":"2023"},{"key":"ref56","first-page":"7611","article-title":"Tackling the objective inconsistency problem in heterogeneous federated optimization","volume":"33","author":"Wang","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref57","article-title":"Twenty newsgroups","author":"Mitchell","year":"1999"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10330588.pdf?arnumber=10330588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T23:32:38Z","timestamp":1703028758000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10330588\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3334910","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}