CALM is proposed, which replaces every hard decision with a smooth trust gate at three levels: per class, teachers are weighted by agreement with the peer consensus; per sample, distillation is scaled by the teachers'divergence from that target; and a label gate scales it by how strongly the target supports the sample's true label.
Abstract
Conventional federated learning relies on parameter averaging, which forces clients to be doubly homogeneous: all must run an identical architecture, and accuracy degrades when local data are non-IID. Decentralized federated distillation sidesteps both: each client runs its peers'model snapshots as teachers on its own local data and distills from their soft predictions, with no server, no public data, and no shared architecture. Under severe non-IID skew, however, the trustworthiness of the aggregated teacher target is a matter of degree, yet existing pipelines make hard, all-or-nothing decisions: outlier teachers are discarded by threshold, and whatever target survives is trusted in full. We propose CALM, which replaces every hard decision with a smooth trust gate at three levels: per class, teachers are weighted by agreement with the peer consensus; per sample, distillation is scaled by the teachers'divergence from that target; and a label gate scales it by how strongly the target supports the sample's true label. None of this adds communication or auxiliary data. On CIFAR-10, SVHN, OrganAMNIST, and Google Speech Commands with heterogeneous client architectures under Dirichlet label skew, CALM consistently outperforms uniform and hard-filtered distillation and matches or exceeds competing heterogeneous-FL methods.
This work proposes Class-wise Reliability-Aware Distillation (CRAD), which, per class, first discards teachers that disagree with the peer consensus and then takes a weighted average of the rest, weighting each teacher by its per-class reliability (precision, or inverse variance).
Baraa Bilbeisi, Meng-Chen Fan, Bao-Cheng Geng et al.· 1 citation
FedCC, a simple and effective algorithm for mitigating client misclassification that balances confidence in majority classes against uncertainty in under-represented ones, is proposed and significantly outperforms existing methods.
Wenxuan Ye, Onur Ayan, Xue-Li An et al.· 0 citations
Federated learning (FL) enables collaborative model training without sharing raw data, but its robustness is vulnerable to Byzantine clients, especially under non-identically distributed (non-IID) data. In heterogeneous FL, benign client updates may become multimodal and statistically diverse, making it difficult for m...
Shu-Juan Tian, Shu-Huan Xiang, Gang Liu et al.· IEEE Transactions on Neural...· 0 citations
Results indicate that CACTUS can propagate backdoors through repeated DFL aggregation and show that ASR varies with network topology and increases with the malicious-node ratio.
A new FAL framework is proposed that utilizes federated representation learning to align client data in a shared embedding space that achieves performance that surpasses existing FAL methods even when they are given substantially larger annotation budgets, demonstrating the value of centralized coordination under priva...
Liam Mohr, D. Weinshall· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 23, 2026
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.