Analysis of Federated Aggregation under Model Poisoning and Backdoor Attacks: A Reconstructed Cross-Dataset and Cross-Architecture Benchmark
Not on the map. Why?
Abstract (arXiv)
Robust comparisons of federated aggregation methods require joint consideration of predictive performance, threat definitions, metric semantics, and execution provenance. A 500-cell seed-1 evaluation matrix was reconstructed across five aggregation methods, five datasets, five architectures, and four recorded conditions: clean, sign-flipping, Gaussian, and BadNets. Successful execution logs were identified for 454 original runs and 36 repaired or rerun executions, whereas 10 clean SVHN cells were supported by summary-only provenance. Trimmed Mean achieved the highest clean macro-mean accuracy (76.02%) and the lowest mean within-task rank (1.70). Krum attained the highest recorded accuracy under both sign-flipping and Gaussian configurations. These relative rankings remained unchanged when analysis was restricted to 21 task pairs for which original successful logs were available for every method-condition combination. Audit of the supplied BadNets metric implementation established that every test input is triggered prior to target-label counting; consequently, the retained metric represents Triggered Target-Label Rate (TTLR) rather than a conventional target-excluding attack success rate. An audit of the supplied FedPARETO scaffold further identified a pathway in which predictive summaries may characterize an uncorrupted local model while the aggregation weight is applied to a separately corrupted update, introducing a potential discrepancy between reported predictive outcomes and the updates used for aggregation. The canonical matrix contains a single identified seed for each cell, and exact attack and configuration lineage is incomplete. Accordingly, the findings should be interpreted as descriptive comparisons within the recorded configurations and not as statistical estimates or universal claims regarding robustness.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 14 references that are in the map. First posted on arXiv 11 Aug 2026.
Builds on
11 of 14 references.
References · 11
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2018Federated Optimization in Heterogeneous Networkscited by 2,987
- 2020Adaptive Federated Optimizationcited by 1,046
- 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 906
- 2018How To Backdoor Federated Learningcited by 765
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
- 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 346
- 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 329
- 2019Robust Aggregation for Federated Learningcited by 317
- 2020Byzantine-Robust Learning on Heterogeneous Datasets via Bucketingcited by 128
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Revisiting Backdoor Threat in Federated Instruction Tuning from a Signal Aggregation Perspective
- 2025SoK: Benchmarking Poisoning Attacks and Defenses in Federated Learning
- 2025BackFed: An Efficient & Standardized Benchmark Suite for Backdoor Attacks in Federated Learning
- 2024A Whole-Process Certifiably Robust Aggregation Method Against Backdoor Attacks in Federated Learning
- 2022Invariant Aggregator for Defending against Federated Backdoor Attacks
- 2026Dynamic Meta-Layer Aggregation for Byzantine-Robust Federated Learning
- 2026Bypassing Krum: Selection-Aware Backdoor Attacks in Federated Learning
- 2024Visualizing the Shadows: Unveiling Data Poisoning Behaviors in Federated Learning