How Robust Are Robust Aggregators? Model Poisoning in Federated Learning under Data Heterogeneity

Federated learning trains a shared model acrossmany clients without collecting their data, but a few maliciousclients can sabotage training by sending falsified updates. Robustaggregation rules are designed to resist such attacks, yet theyare often evaluated on homogeneous data, whereas real clientshold heterogeneous data. We study how data heterogeneity affectsfive aggregation rules (FedAvg, coordinate-wise median, trimmedmean, Krum and norm clipping) under four poisoning attacks,in 585 experiments on Fashion-MNIST with Dirichlet-partitionedclients. We find that heterogeneity strongly amplifies the attacks:under sign flipping with 20% malicious clients, the robust ruleslose less than 2 points of accuracy with nearly IID data, but 8 to12 points with highly heterogeneous data. In this setting, Krumis 39 points less accurate than FedAvg even without attackers,while norm clipping, which bounds each client’s influence withoutdiscarding updates, is the most resilient. These results suggestthat robust aggregation rules should be evaluated under realisticnon-IID conditions.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-03
DOI
https://doi.org/10.5281/zenodo.23905646
Primary Topic
Privacy-Preserving Technologies in Data
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

How Robust Are Robust Aggregators? Model Poisoning in Federated Learning under Data Heterogeneity

john glody KUBIKULA-ve
Zenodo (CERN European Organization for Nuclear Research)
Privacy-Preserving Technologies in Data
preprint

How Robust Are Robust Aggregators? Model Poisoning in Federated Learning under Data Heterogeneity

john glody KUBIKULA-ve
preprint en

Abstract

Federated learning trains a shared model acrossmany clients without collecting their data, but a few maliciousclients can sabotage training by sending falsified updates. Robustaggregation rules are designed to resist such attacks, yet theyare often evaluated on homogeneous data, whereas real clientshold heterogeneous data. We study how data heterogeneity affectsfive aggregation rules (FedAvg, coordinate-wise median, trimmedmean, Krum and norm clipping) under four poisoning attacks,in 585 experiments on Fashion-MNIST with Dirichlet-partitionedclients. We find that heterogeneity strongly amplifies the attacks:under sign flipping with 20% malicious clients, the robust ruleslose less than 2 points of accuracy with nearly IID data, but 8 to12 points with highly heterogeneous data. In this setting, Krumis 39 points less accurate than FedAvg even without attackers,while norm clipping, which bounds each client’s influence withoutdiscarding updates, is the most resilient. These results suggestthat robust aggregation rules should be evaluated under realisticnon-IID conditions.

Zenodo (CERN European Organization for Nuclear Research)
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon