[2510.00310] Robust Federated Inference
About this article
Abstract page for arXiv paper 2510.00310: Robust Federated Inference
Computer Science > Machine Learning arXiv:2510.00310 (cs) [Submitted on 30 Sep 2025 (v1), last revised 14 Apr 2026 (this version, v3)] Title:Robust Federated Inference Authors:Akash Dhasade, Sadegh Farhadkhani, Rachid Guerraoui, Nirupam Gupta, Maxime Jacovella, Anne-Marie Kermarrec, Rafael Pinot View a PDF of the paper titled Robust Federated Inference, by Akash Dhasade and 5 other authors View PDF HTML (experimental) Abstract:Federated inference, in the form of one-shot federated learning, edge ensembles, or federated ensembles, has emerged as an attractive solution to combine predictions from multiple models. This paradigm enables each model to remain local and proprietary while a central server queries them and aggregates predictions. Yet, the robustness of federated inference has been largely neglected, leaving them vulnerable to even simple attacks. To address this critical gap, we formalize the problem of robust federated inference and provide the first robustness analysis of this class of methods. Our analysis of averaging-based aggregators shows that the error of the aggregator is small either when the dissimilarity between honest responses is small or the margin between the two most probable classes is large. Moving beyond linear averaging, we show that problem of robust federated inference with non-linear aggregators can be cast as an adversarial machine learning problem. We then introduce an advanced technique using the DeepSet aggregation model, proposing a nov...