• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Differentially Private Federated Learning ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Pré-publication ou Document de travail
Title :
Differentially Private Federated Learning on Heterogeneous Data
Author(s) :
Noble, Maxence [Auteur]
Centre de Mathématiques Appliquées - Ecole Polytechnique [CMAP]
Bellet, Aurelien [Auteur] refId
Machine Learning in Information Networks [MAGNET]
Dieuleveut, Aymeric [Auteur]
Centre de Mathématiques Appliquées - Ecole Polytechnique [CMAP]
HAL domain(s) :
Informatique [cs]/Apprentissage [cs.LG]
Statistiques [stat]/Machine Learning [stat.ML]
English abstract : [en]
Federated Learning (FL) is a paradigm for large-scale distributed learning which faces two key challenges: (i) efficient training from highly heterogeneous user data, and (ii) protecting the privacy of participating users. ...
Show more >
Federated Learning (FL) is a paradigm for large-scale distributed learning which faces two key challenges: (i) efficient training from highly heterogeneous user data, and (ii) protecting the privacy of participating users. In this work, we propose a novel FL approach (DP-SCAFFOLD) to tackle these two challenges together by incorporating Differential Privacy (DP) constraints into the popular SCAFFOLD algorithm. We focus on the challenging setting where users communicate with a ''honest-but-curious'' server without any trusted intermediary, which requires to ensure privacy not only towards a third-party with access to the final model but also towards the server who observes all user communications. Using advanced results from DP theory, we establish the convergence of our algorithm for convex and non-convex objectives. Our analysis clearly highlights the privacy-utility trade-off under data heterogeneity, and demonstrates the superiority of DP-SCAFFOLD over the state-of-the-art algorithm DP-FedAvg when the number of local updates and the level of heterogeneity grow. Our numerical results confirm our analysis and show that DP-SCAFFOLD provides significant gains in practice.Show less >
Language :
Anglais
ANR Project :
Apprentissage automatique décentralisé et préservant la vie privée
Apprentissage automatique décentralisé et personnalisé sous contraintes
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Files
Thumbnail
  • https://hal.inria.fr/hal-03498158/document
  • Open access
  • Access the document
Thumbnail
  • http://arxiv.org/pdf/2111.09278
  • Open access
  • Access the document
Thumbnail
  • https://hal.inria.fr/hal-03498158/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.inria.fr/hal-03498158/document
  • Open access
  • Access the document
Université de Lille

Mentions légales
Université de Lille © 2017