Differentially Private Decentralized ...
Document type :
Communication dans un congrès avec actes
Title :
Differentially Private Decentralized Learning with Random Walks
Author(s) :
Cyffers, Edwige [Auteur]
Machine Learning in Information Networks [MAGNET]
Université de Lille
Bellet, Aurelien [Auteur]
Médecine de précision par intégration de données et inférence causale [PREMEDICAL]
Université de Montpellier [UM]
Upadhyay, Jalaj [Auteur]
Department of Computer Science [Rutgers]
Machine Learning in Information Networks [MAGNET]
Université de Lille
Bellet, Aurelien [Auteur]
Médecine de précision par intégration de données et inférence causale [PREMEDICAL]
Université de Montpellier [UM]
Upadhyay, Jalaj [Auteur]
Department of Computer Science [Rutgers]
Conference title :
ICML 2024 - Forty-first International Conference on Machine Learning
City :
Vienne (Autriche)
Country :
Autriche
Start date of the conference :
2024-07-21
Publisher :
arXiv
Publication date :
2024
English keyword(s) :
Machine Learning (cs.LG)
Cryptography and Security (cs.CR)
FOS: Computer and information sciences
Cryptography and Security (cs.CR)
FOS: Computer and information sciences
HAL domain(s) :
Informatique [cs]
English abstract : [en]
The popularity of federated learning comes from the possibility of better scalability and the ability for participants to keep control of their data, improving data security and sovereignty. Unfortunately, sharing model ...
Show more >The popularity of federated learning comes from the possibility of better scalability and the ability for participants to keep control of their data, improving data security and sovereignty. Unfortunately, sharing model updates also creates a new privacy attack surface. In this work, we characterize the privacy guarantees of decentralized learning with random walk algorithms, where a model is updated by traveling from one node to another along the edges of a communication graph. Using a recent variant of differential privacy tailored to the study of decentralized algorithms, namely Pairwise Network Differential Privacy, we derive closed-form expressions for the privacy loss between each pair of nodes where the impact of the communication topology is captured by graph theoretic quantities. Our results further reveal that random walk algorithms tends to yield better privacy guarantees than gossip algorithms for nodes close from each other. We supplement our theoretical results with empirical evaluation on synthetic and real-world graphs and datasets.Show less >
Show more >The popularity of federated learning comes from the possibility of better scalability and the ability for participants to keep control of their data, improving data security and sovereignty. Unfortunately, sharing model updates also creates a new privacy attack surface. In this work, we characterize the privacy guarantees of decentralized learning with random walk algorithms, where a model is updated by traveling from one node to another along the edges of a communication graph. Using a recent variant of differential privacy tailored to the study of decentralized algorithms, namely Pairwise Network Differential Privacy, we derive closed-form expressions for the privacy loss between each pair of nodes where the impact of the communication topology is captured by graph theoretic quantities. Our results further reveal that random walk algorithms tends to yield better privacy guarantees than gossip algorithms for nodes close from each other. We supplement our theoretical results with empirical evaluation on synthetic and real-world graphs and datasets.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
ANR Project :
Collections :
Source :
Files
- 2402.07471
- Open access
- Access the document