This paper addresses the challenge of preserving privacy in Federated Learning (FL) within centralized systems, focusing on both trusted and untrusted server scenarios. We analyze this setting within the Stochastic Convex Optimization (SCO) framework, and devise methods that ensure Differential Privacy (DP) while maintaining optimal convergence rates for homogeneous and heterogeneous data distributions. Our approach, based on a recent stochastic optimization technique, offers linear computational complexity, comparable to non-private FL methods, and reduced gradient obfuscation. This work enhances the practicality of DP in FL, balancing privacy, efficiency, and robustness in a variety of server trust environment.
@article{arxiv.2407.12396,
title = {Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems},
author = {Roie Reshef and Kfir Y. Levy},
journal= {arXiv preprint arXiv:2407.12396},
year = {2024}
}