mlsanityData to 7 Oct 2026

Federated Learning with Energy-Based Structured Probabilistic Inference

arXiv 2606.30161 ↗First posted 29 Jun 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Federated learning typically aggregates client updates using fixed or heuristic weighting rules, which can be suboptimal when clients have heterogeneous data and varying contributions to the global model. We propose a framework that refines client aggregation weights using Conditional Random Fields (CRFs). Our method defines unary potentials for individual clients and pairwise potentials for all client pairs, allowing the server to model both client-specific reliability and interactions between clients. The resulting CRF inference produces aggregation weights that enable better convergence of the global training objective. Experiments show that, under non-IID heterogeneity, our approach consistently improves performance over well-established federated learning baselines.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 20 references that are in the map. First posted on arXiv 29 Jun 2026.

Builds on

11 of 20 references.

References · 11

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  3. 2018Federated Optimization in Heterogeneous Networkscited by 2,971
  4. 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 897
  5. 2019Towards Federated Learning at Scale: System Designcited by 826
  6. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
  7. 2019Robust Aggregation for Federated Learningcited by 314
  8. 2023Stochastic Controlled Averaging for Federated Learning with Communication Compressioncited by 100
  9. 2024Federated Behavioural Planes: Explaining the Evolution of Client Behaviour in Federated Learningcited by 3
  10. 2025FLUX: Efficient Descriptor-Driven Clustered Federated Learning under Arbitrary Distribution Shiftscited by 3
  11. 2026Federated Learning with Profile Mapping under Distribution Shifts and Driftscited by 1

Built on by

Not cited yet.