Original title: Optimizing Byzantine Node Placement in Decentralized Federated Learning
Edoardo Gabrielli, Gabriele Tolomei · September 2026
In decentralized federated learningA way for devices to train a shared model without central coordination, using peer-to-peer communication., many devices train an AI model together by sharing updates directly with their neighbors across a network. Bad actors, called Byzantine participants, can try to corrupt this shared model. Most security studies look only at how these attackers behave, not which specific devices they take over. Because devices pass messages from neighbor to neighbor, where attackers sit completely changes how their bad updates spread. Researchers treated choosing which nodes to corrupt as a key attacker strategy under a fixed budget. To find the worst spots without running slow simulations, they created a metric called Byzantine Placement Influence. It tracks how bad updates spread over multiple network hops over time. Their tests showed this method consistently finds the most damaging attack positions, proving that attacker location is vital for network defense.
Imagine you're in a group of friends passing a secret message around a table. If a couple of friends are spies trying to distort the message, where they sit matters. If they're next to key people, the distortion spreads quickly and ruins the message for everyone. In this paper, the network of devices is like the table, and the researchers figure out the worst seats for the spies to maximize how badly they can corrupt the shared model.
This affects the security of AI systems where many devices train models together without a central server. If attackers can choose which devices to compromise, they can cause more damage to the shared model, impacting users who rely on it.
The abstract doesn't discuss the computational cost or scalability of the BPI optimization algorithms. It also focuses on specific graph families and attack types, so the results might not generalize to all decentralized federated learning scenarios.
Ask anything about this paper. Answers come from its abstract, and say so when the abstract doesn't cover your question.
Optimizing Byzantine Node Placement in Decentralized Federated Learning — Edoardo Gabrielli, Gabriele Tolomei
Abstract licence: CC0
Explanation generated by Synthesis from the abstract — it is not the original paper. This is a preprint, so it hasn't necessarily been peer reviewed.