Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems

Roie Reshef, Kfir Y. Levy
7/17/2024
cs.LG

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{reshef2024private,
  title  = {Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems},
  author = {Roie Reshef and Kfir Y. Levy},
  year   = {2024},
  eprint = {2407.12396},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.12396v1},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.12396.svg)](https://codeofpaper.com/paper/2407.12396)

Discussion