Metraipolis › archive › dc_5bf252d7d534
Analysis of Federated Aggregation under Model Poisoning and Backdoor Attacks: A Reconstructed Cross-Dataset and Cross-Architecture Benchmark — arXiv:2608.11423
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.11423
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T05:34:57.459Z
- SHA-256 of the archived text
bcd729537a1acfebdb6fd0642aec97ce396d4dd5cea667d0e9728ab99c006ea2- Stable URL of this page
https://metraipolis.com/documento/dc_5bf252d7d534
How to cite
Analysis of Federated Aggregation under Model Poisoning and Backdoor Attacks: A Reconstructed Cross-Dataset and Cross-Architecture Benchmark — arXiv:2608.11423 — arXiv (en), https://arxiv.org/abs/2608.11423 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5bf252d7d534 (Metraipolis archive dc_5bf252d7d534, sha256 bcd729537a1acfebdb6fd0642aec97ce396d4dd5cea667d0e9728ab99c006ea2)
BibTeX
@misc{dc5bf252d7d534,
title = {Analysis of Federated Aggregation under Model Poisoning and Backdoor Attacks: A Reconstructed Cross-Dataset and Cross-Architecture Benchmark — arXiv:2608.11423},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.11423},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5bf252d7d534; sha256 bcd729537a1acfebdb6fd0642aec97ce396d4dd5cea667d0e9728ab99c006ea2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11423. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-08-13 in cs.CR). Categorie arXiv: Machine Learning (cs.LG) ; Cryptography and Security (cs.CR); Computer Vision and Pattern Recognition (cs.CV). Pagina del lavoro: https://arxiv.org/abs/2608.11423 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T05:17:58.138Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).