Online Decentralized Federated Multi-task Learning With Trustworthiness in Cyber-Physical Systems
Not on the map. Why?
Abstract (arXiv)
Multi-task learning is an effective way to address the challenge of model personalization caused by high data heterogeneity in federated learning. However, extending multi-task learning to the online decentralized federated learning setting is yet to be explored. The online decentralized federated learning setting considers many real-world applications of federated learning, such as autonomous systems, where clients communicate peer-to-peer and the data distribution of each client is time-varying. A more serious problem in real-world applications of federated learning is the presence of Byzantine clients. Byzantine-resilient approaches used in federated learning work only when the number of Byzantine clients is less than one-half the total number of clients. Yet, it is difficult to put a limit on the number of Byzantine clients within a system in reality. However, recent work in robotics shows that it is possible to exploit cyber-physical properties of a system to predict clients' behavior and assign a trust probability to received signals. This can help to achieve resiliency in the presence of a dominating number of Byzantine clients. Therefore, in this paper, we develop an online decentralized federated multi-task learning algorithm to provide model personalization and resiliency when the number of Byzantine clients dominates the number of honest clients. Our proposed algorithm leverages cyber-physical properties, such as the received signal strength in wireless systems or side information, to assign a trust probability to local models received from neighbors in each iteration. Our simulation results show that the proposed algorithm performs close to a Byzantine-free setting.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 32 references that are in the map. First posted on arXiv 31 Aug 2025.
Builds on
22 of 32 references.
References · 22
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
- 2017Federated Multi-Task Learningcited by 669
- 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 479
- 2020Federated learning with hierarchical clustering of local updates to improve training on non-IID datacited by 222
- 2021Federated Multi-Task Learning under a Mixture of Distributionscited by 189
- 2022Decentralized Federated Learning: Fundamentals, State of the Art, Frameworks, Trends, and Challengescited by 137
- 2019Variational Federated Multi-Task Learningcited by 69
- 2022Recovering Private Text in Federated Learning of Language Modelscited by 67
- 2021Challenges and Approaches for Mitigating Byzantine Attacks in Federated Learningcited by 46
- 2019BRIDGE: Byzantine-resilient Decentralized Gradient Descentcited by 45
- 2016Geometric Median in Nearly Linear Timecited by 38
10 more
- 2017ByRDiE: Byzantine-resilient distributed coordinate descent for decentralized learningcited by 36
- 2020Byzantine-resilient Decentralized Stochastic Gradient Descentcited by 28
- 2021Federated Learning on the Road: Autonomous Controller Design for Connected and Autonomous Vehiclescited by 26
- 2023Federated Learning for Computer Visioncited by 22
- 2016Proximity Without Consensus in Online Multi-Agent Optimizationcited by 14
- 2020Dynamic Federated Learningcited by 12
- 2016CP-mtML: Coupled Projection multi-task Metric Learning for Large Scale Face Retrievalcited by 4
- 2022Resilient Distributed Optimization for Multi-Agent Cyberphysical Systemscited by 4
- 2021Characterizing Trust and Resilience in Distributed Consensus for Cyberphysical Systemscited by 2
- 2024Decentralized Multi-Task Online Convex Optimization Under Random Link Failurescited by 2
Built on by
Not cited yet.