arXiv Machine Learning By Murtaza Rangwala, Farag Azzedin, Richard O. Sinnott, Rajkumar Buyya

SketchGuard: Scaling Byzantine-Robust Decentralized Federated Learning via Sketch-Based Screening

Read the original on arXiv Machine Learning →

SketchGuard is a Byzantine‑robust decentralized federated learning method that separates neighbor screening from model aggregation by using a Count Sketch representation. The approach mitigates a vulnerability where an adaptive adversary can hide large perturbations in the sketch’s null space, by adopting a commit‑then‑sketch protocol that ensures the sketch seed is chosen only after model commitment. The authors prove convergence in both convex and non‑convex settings, demonstrate that SketchGuard achieves state‑of‑the‑art robustness against six attacks—including the adaptive null‑space attack—across various network topologies and data heterogeneity, while reducing per‑neighbor communication to a model‑dimension‑independent size.

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
2d ago

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
Aug 27

Rethinking the Transferable Adversarial Attacks and Robust Defense in Federated Learning

The paper investigates how adversarial examples transfer between client models in federated learning and explores the relationship between these examples and client data distributions. It proposes a defense strategy based on adversarial training that leverages the transferability of model robustness. Experiments on real-life datasets demonstrate that the new attack and defense methods outperform existing state‑of‑the‑art approaches.

By Zuobin Xiong, Deval Mukherjee, Homook Cho, Wei Li
arXiv Machine Learning
Aug 20

FedLNS: Leverage LayerNorm Signature Modeling to Mitigate Adversarial Manipulation in Federated LLMs

FedLNS is a server‑side framework that screens federated learning updates by representing each client’s contribution through changes in trainable normalization‑layer parameters, creating lightweight signatures that can be compared against a history‑aware cross‑client reference. The method requires no extra client‑to‑server communication, raw data, or labeled attack examples, and after screening, the remaining full‑model updates are aggregated with standard federated learning rules. Experiments on GPT‑style, BERT‑style, and LLaMA‑style models with 200 clients demonstrate that FedLNS achieves lower test perplexity than six baselines even when 40% of the population performs target manipulation under both IID and non‑IID data partitions.

By Kai Li, Jong-Ik Park, Carlee Joe-Wong, Wei Ni, Falko Dressler
arXiv Machine Learning
Jul 10

Communication-Efficient Byzantine-Robust Federated Conformal Prediction via Partial Model Sharing

arXiv:2602. 18396v2 Announce Type: replace Abstract: We propose PRISM-FCP (Partial shaRing and robust calIbration with Statistical Margins for Federated Conformal Prediction), a communication-efficient Byzantine-robust federated conformal prediction framework that uses partial model sharing to mitigate stochastic model-poisoning attacks during training and histogram-based filtering to mitigate adversarial calibration submissions.

By Ehsan Lari, Reza Arablouei, Stefan Werner