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

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.

Authors

Institutions

Publication Details

Journal
PLoS ONE
Published
2026-11-18
DOI
https://doi.org/10.1371/journal.pone.0362324
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

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

Fu Zhang, Jihua Fang, Shuai Chen, Lin Zhao et al.
3 links
PLoS ONE
Privacy-Preserving Technologies in Data
article

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

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

Abstract

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.

PLoS ONEVol. 21(11)
Nanjing University of Information Science and Technology (CN), Shandong Xiehe University (CN)
Natural Science Foundation of Shandong Province
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon