mlsanityData to 7 Oct 2026

TinyGuard:A lightweight Byzantine Defense for Resource-Constrained Federated Learning via Statistical Update Fingerprints

arXiv 2602.02615 ↗First posted 2 Feb 2026cs.CR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Existing Byzantine robust aggregation mechanisms typically rely on fulldimensional gradi ent comparisons or pairwise distance computations, resulting in computational overhead that limits applicability in large scale and resource constrained federated systems. This paper proposes TinyGuard, a lightweight Byzantine defense that augments the standard FedAvg algorithm via statistical update f ingerprinting. Instead of operating directly on high-dimensional gradients, TinyGuard extracts compact statistical fingerprints cap turing key behavioral properties of client updates, including norm statistics, layer-wise ratios, sparsity measures, and low-order mo ments. Byzantine clients are identified by measuring robust sta tistical deviations in this low-dimensional fingerprint space with nd complexity, without modifying the underlying optimization procedure. Extensive experiments on MNIST, Fashion-MNIST, ViT-Lite, and ViT-Small with LoRA adapters demonstrate that TinyGuard pre serves FedAvg convergence in benign settings and achieves up to 95 percent accuracy under multiple Byzantine attack scenarios, including sign-flipping, scaling, noise injection, and label poisoning. Against adaptive white-box adversaries, Pareto frontier analysis across four orders of magnitude confirms that attackers cannot simultaneously evade detection and achieve effective poisoning, features we term statistical handcuffs. Ablation studies validate stable detection precision 0.8 across varying client counts (50-150), threshold parameters and extreme data heterogeneity . The proposed framework is architecture-agnostic and well-suited for federated fine-tuning of foundation models where traditional Byzantine defenses become impractical

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 26 references that are in the map. First posted on arXiv 2 Feb 2026.

Builds on

17 of 26 references.

References · 17

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  4. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  5. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  6. 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
  7. 2019Advances and Open Problems in Federated Learningcited by 3,021
  8. 2019Towards Federated Learning at Scale: System Designcited by 826
  9. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
  10. 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 479
  11. 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 330
  12. 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 324
5 more
  1. 2021Escaping the Big Data Paradigm with Compact Transformerscited by 261
  2. 2020Mime: Mimicking Centralized Stochastic Algorithms in Federated Learningcited by 152
  3. 2024Heterogeneous LoRA for Federated Fine-tuning of On-Device Foundation Modelscited by 114
  4. 2019Federated Variance-Reduced Stochastic Gradient Descent with Robustness to Byzantine Attackscited by 79
  5. 2024Adaptive Gradient Clipping for Robust Federated Learningcited by 10

Built on by

Not cited yet.