mlsanityData to 14 Oct 2026

FIRMA: FIbonacci Ring Model Aggregation for Privacy-preserving Federated Learning

arXiv 2605.22898 ↗First posted 21 May 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Federated learning protocols face a structural trilemma: canonical server-based aggregation~citemcmahan2017 creates a single point of failure and gradient inversion risk; decentralised ring-gossip alternatives~citehu2019segmented expose classification heads to semi-honest peers via uninformed uniform weights; and personalised methods~citecollins2021exploiting reintroduce central aggregation. No existing protocol simultaneously achieves server-free operation, permanently private heads, ring topology, and principled asymmetric neighbour weighting. We propose FIRMA (FIbonacci Ring Model Aggregation), a family of three progressively enhanced federated learning protocols: 1) fibfl establishes the foundation: server-free ring aggregation with Fibonacci-weighted neighbour blending and permanently private classification heads. 2) fibflp augments this with accuracy-gated neighbour suppression, selectively down-weighting poorly-converged peers while preserving the Fibonacci directional bias. 3) fibflpp, the full system, completes the family with a 2-opt ring permutation that maximises adjacent-client class diversity, global ring coverage via Kg=lceil N/2rceil gossip passes, and cosine-annealed self-retention calibration. We establish a convergence rate bound and three supporting propositions governing normalisation, coverage, retention, and diversity optimality. Systematic experiments across 28 configurations -- four benchmarks crossed with seven heterogeneity regimes -- demonstrate that fibflpp surpasses fedavg in all 12 label-skew configurations, with a peak advantage of +20.7,pp on CIFAR-10 at K=1. Under Dirichlet heterogeneity, fibflpp is the Pareto-dominant method among all server-free protocols, achieving the highest accuracy in 17 of 28 configurations.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 27 references that are in the map. First posted on arXiv 21 May 2026.

Builds on

19 of 27 references.

References · 19

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  3. 2016Layer Normalizationcited by 5,669
  4. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  5. 2018Federated Optimization in Heterogeneous Networkscited by 2,987
  6. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
  7. 2018Federated Learning with Non-IID Datacited by 1,108
  8. 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 906
  9. 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 851
  10. 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 712
  11. 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 672
  12. 2020Personalized Federated Learning with Moreau Envelopescited by 618
7 more
  1. 2021Exploiting Shared Representations for Personalized Federated Learningcited by 541
  2. 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 502
  3. 2020iDLG: Improved Deep Leakage from Gradientscited by 382
  4. 2020Adaptive Personalized Federated Learningcited by 358
  5. 2020Think Locally, Act Globally: Federated Learning with Local and Global Representationscited by 325
  6. 2021Federated Multi-Task Learning under a Mixture of Distributionscited by 192
  7. 2019Decentralized Federated Learning: A Segmented Gossip Approachcited by 64

Built on by

Not cited yet.