Paper recorded by Signals 4 on 2026-09-01 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-01 on arXiv · recorded by Signals 4 on 2026-09-02
Category: cs.LG · 机器学习 · first seen 2026-09-02
Security evaluations of decentralized federated learning (DFL) typically focus on how Byzantine participants behave, while largely overlooking which participants are compromised. Yet, because aggregation is distributed over a communication graph, the placement of Byzantine nodes determines how malicious influence propagates through the network. We therefore treat Byzantine placement as an explicit