1 code implementation • 4 Nov 2024 • Edwige Cyffers, Muni Sreenivas Pydi, Jamal Atif, Olivier Cappé
Performative learning addresses the increasingly pervasive situations in which algorithmic decisions may induce changes in the data distribution as a consequence of their public deployment.
1 code implementation • 15 Feb 2024 • Abdellah El Mrini, Edwige Cyffers, Aurélien Bellet
Decentralized Gradient Descent (D-GD) allows a set of users to perform collaborative learning without sharing their data by iteratively averaging local model updates with their neighbors in a network graph.
1 code implementation • 12 Feb 2024 • Edwige Cyffers, Aurélien Bellet, Jalaj Upadhyay
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.
1 code implementation • 24 Feb 2023 • Edwige Cyffers, Aurélien Bellet, Debabrota Basu
We study differentially private (DP) machine learning algorithms as instances of noisy fixed-point iterations, in order to derive privacy and utility results from this well-studied framework.
1 code implementation • 10 Oct 2022 • Jean Ogier du Terrail, Samy-Safwan Ayed, Edwige Cyffers, Felix Grimberg, Chaoyang He, Regis Loeb, Paul Mangold, Tanguy Marchand, Othmane Marfoq, Erum Mushtaq, Boris Muzellec, Constantin Philippenko, Santiago Silva, Maria Teleńczuk, Shadi Albarqouni, Salman Avestimehr, Aurélien Bellet, Aymeric Dieuleveut, Martin Jaggi, Sai Praneeth Karimireddy, Marco Lorenzi, Giovanni Neglia, Marc Tommasi, Mathieu Andreux
In this work, we propose a novel cross-silo dataset suite focused on healthcare, FLamby (Federated Learning AMple Benchmark of Your cross-silo strategies), to bridge the gap between theory and practice of cross-silo FL.
1 code implementation • 10 Jun 2022 • Edwige Cyffers, Mathieu Even, Aurélien Bellet, Laurent Massoulié
In this work, we introduce pairwise network differential privacy, a relaxation of LDP that captures the fact that the privacy leakage from a node $u$ to a node $v$ may depend on their relative position in the graph.
1 code implementation • 9 Dec 2020 • Edwige Cyffers, Aurélien Bellet
In this work, we introduce a novel relaxation of local differential privacy (LDP) that naturally arises in fully decentralized algorithms, i. e., when participants exchange information by communicating along the edges of a network graph without central coordinator.