The server-less nature of Decentralized Federated Learning (DFL) requires allocating the aggregation role to specific participants in each federated round. Current DFL architectures ensure the trustworthiness of the aggregator node upon selection. However, most of these studies overlook the possibility that the aggregating node may turn rogue and act maliciously after being nominated. To address this problem, this paper proposes a DFL structure, called TrustChain, that scores the aggregators before selection based on their past behavior and additionally audits them after the aggregation. To do this, the statistical independence between the client updates and the aggregated model is continuously monitored using the Hilbert-Schmidt Independence Criterion (HSIC). The proposed method relies on several principles, including blockchain, anomaly detection, and concept drift analysis. The designed structure is evaluated on several federated datasets and attack scenarios with different numbers of Byzantine nodes.
翻译:去中心化联邦学习(DFL)的无服务器特性要求在每一轮联邦学习中将聚合角色分配给特定参与者。当前的DFL架构在聚合器节点被选中时确保其可信性。然而,这些研究大多忽视了聚合节点在被提名后可能变为恶意节点的可能性。为解决这一问题,本文提出了一种名为TrustChain的DFL架构,该架构基于聚合器的历史行为在选举前对其进行评分,并在聚合后对其进行审计。为此,我们使用希尔伯特-施密特独立性准则(HSIC)持续监控客户端更新与聚合模型之间的统计独立性。所提出的方法依赖于区块链、异常检测和概念漂移分析等多项原则。该设计的架构在多个联邦数据集和不同数量拜占庭节点的攻击场景下进行了评估。