Fast and Differentially Private Algorithms for Decentralized Collaborative Machine Learning

Aurélien Bellet 1 Rachid Guerraoui 2 Mahsa Taziki 2 Marc Tommasi 1, 3
1 MAGNET - Machine Learning in Information Networks
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : Consider a set of agents in a peer-to-peer communication network, where each agent has a personal dataset and a personal learning objective. The main question addressed in this paper is: how can agents collaborate to improve upon their locally learned model without leaking sensitive information about their data? Our first contribution is to reformulate this problem so that it can be solved by a block coordinate descent algorithm. We obtain an efficient and fully decentralized protocol working in an asynchronous fashion. Our second contribution is to make our algorithm differentially private to protect against the disclosure of any information about personal datasets. We prove convergence rates and exhibit the trade-off between utility and privacy. Our experiments show that our approach dramatically outperforms previous work in the non-private case, and that under privacy constraints we significantly improve over purely local models.
Type de document :
[Research Report] INRIA Lille. 2017, pp.1-18
Liste complète des métadonnées

Littérature citée [28 références]  Voir  Masquer  Télécharger
Contributeur : Aurélien Bellet <>
Soumis le : vendredi 15 décembre 2017 - 19:14:19
Dernière modification le : mardi 3 juillet 2018 - 11:28:18


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01665410, version 1
  • ARXIV : 1705.08435


Aurélien Bellet, Rachid Guerraoui, Mahsa Taziki, Marc Tommasi. Fast and Differentially Private Algorithms for Decentralized Collaborative Machine Learning. [Research Report] INRIA Lille. 2017, pp.1-18. 〈hal-01665410〉



Consultations de la notice


Téléchargements de fichiers