arXiv Machine Learning By Amirhossein Taherpour, Xiaodong Wang

Secure Decentralized Federated Learning via Gossip and Virtual Voting

Read the original on arXiv Machine Learning →

arXiv:2607. 08651v1 Announce Type: new Abstract: Decentralized federated learning (DFL) removes the central server by letting nodes exchange model updates through peer-to-peer gossip, but existing gossip-based methods often lack provenance finality and resilience to Byzantine or lazy participants.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Sep 2

Optimizing Byzantine Node Placement in Decentralized Federated Learning

The paper investigates how the strategic placement of Byzantine nodes in decentralized federated learning (DFL) affects the propagation of malicious influence across the communication graph. It introduces Byzantine Placement Influence (BPI), a measure that captures cumulative exposure of honest nodes to Byzantine sources over time, and develops algorithms to optimize BPI across various network structures and attack types. Experiments demonstrate that BPI-guided placements consistently yield highly damaging configurations, highlighting the importance of considering node placement in DFL threat models.

By Edoardo Gabrielli, Gabriele Tolomei
arXiv Machine Learning
Sep 15

End-to-End Verifiable and Robust Federated Learning

arXiv:2609.15521v1 Announce Type: new Abstract: Federated learning enables multiple parties to train a shared model without centralizing raw data with the help of an aggregator, but introduces integr...

By Doryan Lesaignoux, Enrique M\'armol Campos, Gabriele Spini, Jos\'e L. Hern\'andez-Ramos, Stephan Krenn