FedBEns: One-Shot Federated Learning based on Bayesian Ensemble
Not on the map. Why?
Abstract (arXiv)
One-Shot Federated Learning (FL) is a recent paradigm that enables multiple clients to cooperatively learn a global model in a single round of communication with a central server. In this paper, we analyze the One-Shot FL problem through the lens of Bayesian inference and propose FedBEns, an algorithm that leverages the inherent multimodality of local loss functions to find better global models. Our algorithm leverages a mixture of Laplace approximations for the clients' local posteriors, which the server then aggregates to infer the global model. We conduct extensive experiments on various datasets, demonstrating that the proposed method outperforms competing baselines that typically rely on unimodal approximations of the local losses.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 36 of its 47 references that are in the map. First posted on arXiv 19 Mar 2025.
Builds on
36 of 47 references.
References · 36
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 897
- 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 836
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
- 2020Ensemble Distillation for Robust Model Fusion in Federated Learningcited by 678
- 2021Merging Models with Fisher-Weighted Averagingcited by 613
- 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 555
- 2020Bayesian Deep Learning and a Probabilistic Perspective of Generalizationcited by 480
24 more
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 438
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
- 2021Laplace Redux -- Effortless Bayesian Deep Learningcited by 359
- 2021What Are Bayesian Neural Network Posteriors Really Like?cited by 307
- 2019The Secret Revealer: Generative Model-Inversion Attacks Against Deep Neural Networkscited by 241
- 2020Being Bayesian, Even Just a Bit, Fixes Overconfidence in ReLU Networkscited by 227
- 2019Model Fusion via Optimal Transportcited by 217
- 2020Training independent subnetworks for robust predictioncited by 177
- 2020FedBE: Making Bayesian Model Ensemble Applicable to Federated Learningcited by 176
- 2016A Kronecker-factored approximate Fisher matrix for convolution layerscited by 138
- 2019One-Shot Federated Learningcited by 124
- 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 119
- 2020Distilled One-Shot Federated Learningcited by 108
- 2021DENSE: Data-Free One-Shot Federated Learningcited by 100
- 2020Bayesian Deep Learning via Subnetwork Inferencecited by 85
- 2022Heterogeneous Ensemble Knowledge Transfer for Training Large Models in Federated Learningcited by 81
- 2020Federated Learning via Posterior Averaging: A New Perspective and Practical Algorithmscited by 78
- 2022Preserving Privacy in Federated Learning with Ensemble Cross-Domain Knowledge Distillationcited by 45
- 2021Mixtures of Laplace Approximations for Improved Post-Hoc Uncertainty in Deep Learningcited by 25
- 2023Bayesian Federated Learning: A Surveycited by 22
- 2023FedLPA: One-shot Federated Learning with Layer-Wise Posterior Aggregationcited by 22
- 2023Federated Learning as Variational Inference: A Scalable Expectation Propagation Approachcited by 17
- 2024Revisiting Ensembling in One-Shot Federated Learningcited by 13
- 2023Calibrated One Round Federated Learning with Bayesian Inference in the Predictive Spacecited by 10
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.