analiza aiqbench
This research proposes FedCRF, a federated learning framework that models server aggregation as structured probabilistic inference using conditional random fields to handle data heterogeneity and unreliable clients. By treating client evidence and relationships as coupled variables in a joint inference problem, the method simultaneously addresses global aggregation, Byzantine robustness, and personalized FL with unified hyperparameters. The approach demonstrates competitive performance on standard benchmarks like CIFAR-10 and FEMNIST compared to specialized existing methods.
Federated Learning with Energy-Based Structured Probabilistic Inference
arXiv:2606.30161v2 Announce Type: replace-cross Abstract: Federated Learning (FL) enables multiple clients to collaboratively train machine learning models without sharing their local data. However, heterogeneity in client data and the presence of unreliable or adversarial updates make effective server aggregation challenging, motivating methods that adapt client contributions according to their reliability and relationships. In this work, we formulate server aggregation in FL as structured probabilistic inference using conditional random fields. We represent clients as nodes in a graph and define unary and pairwise energy potentials. Unary potentials capture individual client properties, while pairwise potentials encode similarities between clients. This formulation treats individual client evidence and pairwise relationships as coupled evidence in a joint inference problem, allowing client reliabilities to be inferred collectively and the resulting estimates to guide aggregation. Where most FL methods target a single challenge, FedCRF's inferred reliabilities and affinities provide one common representation for global aggregation, Byzantine robustness, clustered FL, and personalized FL. With a single set of hyperparameters, it is competitive with or outperforms specialized methods on CIFAR-10, FEMNIST, and Fed-ISIC2019 across diverse forms of client heterogeneity and unreliability.
Abstract:Federated Learning (FL) enables multiple clients to collaboratively train machine learning models without sharing their local data. However, heterogeneity in client data and the presence of unreliable or adversarial updates make effective server aggregation challenging, motivating methods that adapt client contributions according to their reliability and relationships. In this work, we formulate server aggregation in FL as structured probabilistic inference using conditional random fields. We represent clients as nodes in a graph and define unary and pairwise energy potentials. Unary potentials capture individual client properties, while pairwise potentials encode similarities between clients. This formulation treats individual client evidence and pairwise relationships as coupled evidence in a joint inference problem, allowing client reliabilities to be inferred collectively and the resulting estimates to guide aggregation. Where most FL methods target a single challenge, FedCRF's inferred reliabilities and affinities provide one common representation for global aggregation, Byzantine robustness, clustered FL, and personalized FL. With a single set of hyperparameters, it is competitive with or outperforms specialized methods on CIFAR-10, FEMNIST, and Fed-ISIC2019 across diverse forms of client heterogeneity and unreliability.
Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
arXiv:2606.30161 [cs.LG]
(or arXiv:2606.30161v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2606.30161 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 272 cuvinte
Subiecte conexe

Vertical Advantage: Transforming Industries with Lakebase and Agentic AI
Databricks · 27 aug. 2026

News
Quantum Computing Report · 7 iun. 2026

News
Quantum Computing Report · 25 iul. 2026

Memory , Fakes , and Thermodynamic Compute : CHIPS Act Bets $874M on Six AI Stack Gaps
techtimes.com · 31 iul. 2026