EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Byzantine-resilient decentralized online federated learning with Bandit feedback for IoV networks

Guixiang Guo iD, Lin Zhao, Shuai Chen, Fu Zhang, Jihua Fang, Wenhua Zhang

PLOS One · 18.11.2026 · 21 (11) · e0362324

DOI: 10.1371/journal.pone.0362324 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS One, online erschienen am 18.11.2026. Verfasst von Guixiang Guo und 5 weiteren Autor:innen. Beteiligte Einrichtung: School of Computer Science and Technology, Shandong Xiehe University, Jinan, China. Hauptthemen laut MEDLINE: Internet, Computer Security, Computer Communication Networks. Die Arbeit nennt 51 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Natural Science Foundation of Shandong Province.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

As a canonical application of computational complex networks, the intelligent Internet of Vehicles (IoV) has attracted significant research interest regarding network security. This paper investigates a class of decentralized federated learning algorithms designed to operate without access to exact gradient information and under Byzantine attacks, in which compromised nodes transmit erroneous data, causing client states to deviate from their normal trajectories. To address these challenges, a Byzantine-Resilient Decentralized Bandit Online Federated Learning algorithm is proposed. This algorithm utilizes a One-Point Residual Feedback (OPRF) mechanism to estimate gradients using function evaluations, requiring only one new objective-function query per iteration and thereby reducing the zeroth-order query cost relative to conventional two-point feedback. Furthermore, the integration of a resilient filtering mechanism enables the algorithm to tolerate up to ℬ Byzantine neighbors for each regular client under the adopted ℬ -local adversary model, thereby mitigating deviations in regular-client states caused by malicious behavior. The formal analysis considers time-varying local objective functions over a fixed robust communication graph, while a topology-switching experiment provides an empirical extension to changing communication connectivity. Under the stated assumptions, the theoretical analysis establishes sublinear dynamic regret in the presence of Byzantine clients. Finally, the effectiveness of the proposed algorithm is evaluated through simulation experiments within a federated learning framework.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

InternetComputer SecurityComputer Communication NetworksFederated LearningAlgorithmsFeedback

Autor:innen und Institutionen

  • School of Computer Science and Technology, Shandong Xiehe University, Jinan, China.
  • School of Automation, Nanjing University of Information Science and Technology, Nanjing, China.

ORCID-Profile: Guixiang Guo

Förderung

  • Natural Science Foundation of Shandong Province

Zitieren

APA

Guo, G., Zhao, L., Chen, S., Zhang, F., Fang, J., & Zhang, W. (2026). Byzantine-resilient decentralized online federated learning with Bandit feedback for IoV networks. PLOS One, 21(11), e0362324. https://doi.org/10.1371/journal.pone.0362324

Vancouver

Guo G, Zhao L, Chen S, Zhang F, Fang J, Zhang W. Byzantine-resilient decentralized online federated learning with Bandit feedback for IoV networks. PLOS One. 2026;21(11):e0362324. doi:10.1371/journal.pone.0362324

BibTeX
@article{Guo2026,
  author = {Guo, Guixiang and Zhao, Lin and Chen, Shuai and Zhang, Fu and Fang, Jihua and Zhang, Wenhua},
  title = {Byzantine-resilient decentralized online federated learning with Bandit feedback for IoV networks},
  journal = {PLOS One},
  year = {2026},
  volume = {21},
  number = {11},
  pages = {e0362324},
  doi = {10.1371/journal.pone.0362324}
}
Kostenlos starten →