We study the problem of distributed hypothesis testing over a network of mobile agents with limited communication and sensing ranges to infer the true hypothesis collaboratively. In particular, we consider a scenario where there is an unknown subset of compromised agents that may deliberately share altered information to undermine the team objective. We propose two distributed algorithms where each agent maintains and updates two sets of beliefs (i.e., probability distributions over the hypotheses), namely local and actual beliefs (LB and AB respectively for brevity). In both algorithms, at every time step, each agent shares its AB with other agents within its communication range and makes a local observation to update its LB. Then both algorithms can use the shared information to update ABs under certain conditions. One requires receiving a certain number of shared ABs at each time instant; the other accumulates shared ABs over time and updates after the number of shared ABs exceeds a prescribed threshold. Otherwise, both algorithms rely on the agent's current LB and AB to update the new AB. We prove under mild assumptions that the AB for every non-compromised agent converges almost surely to the true hypothesis, without requiring connectivity in the underlying time-varying network topology. Using a simulation of a team of unmanned aerial vehicles aiming to classify adversarial agents among themselves, we illustrate and compare the proposed algorithms. Finally, we show experimentally that the second algorithm consistently outperforms the first algorithm in terms of the speed of convergence.
Byzantine-resilient federated online learning for Gaussian process regression
School of Electrical Engineering and Computer Science, The Pennsylvania State University, University Park, PA 16802 USA(电气工程与计算机科学学院,宾夕法尼亚州立大学,大学公园,PA 16802 USA);Virginia Tech Transportation Institute, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061 USA(弗吉尼亚理工交通研究所,弗吉尼亚理工学院与州立大学,布莱克堡,VA 24061 USA)
Prox-DBRO-VR: A Unified Analysis on Byzantine-Resilient Decentralized Stochastic Composite Optimization with Variance Reduction and Non-Asymptotic Convergence Rates
Central South University(中南大学);City University of Hong Kong(香港城市大学);University of New South Wales(新南威尔士大学);Southwest University(西南大学)
Department of Applied Mathematics and Statistics(应用数学与统计学系);Stony Brook University(石溪大学);J.P. Morgan AI Research(摩根大通AI研究);Department of Computer Science(计算机科学系);University of Colorado Boulder(科罗拉多大学波尔德分校);Department of Electrical and Computer Engineering(电气与计算机工程系)