8 papers · 1 filter
Tight Stability Bounds for Robust Distributed Learning: Byzantine Failures Hurt Generalization More than Data Poisoning
Thomas Boudou, Batiste Le Bars, Nirupam Gupta +1
Robust distributed learning algorithms aim to maintain reliable performance despite the presence of misbehaving workers. Such misbehaviors are commonly modeled as \textit{Byzantine…
Unveiling the Non-Monotonic Effect of Privacy on Generalization under Byzantine Robustness
Thomas Boudou, Batiste Le Bars, Nirupam Gupta +1
Recent work has established a fundamental trilemma between Byzantine robustness, local differential privacy (LDP), and optimization error in distributed learning. We show that this…
Dangerous Liaisons of Convex Learning and Non-Affine Aggregation
Thomas Boudou, Batiste Le Bars, Nirupam Gupta +1
Last-iterate convergence and generalization guarantees in first-order convex learning hinge on the monotonicity of the update operator. While linear averaging preserves the monoton…
Disparate Impact in Synthetic Data Generation
Paul Andrey, Michaël Perrot, Batiste Le Bars +1
We revisit the fairness notion of disparate impact for synthetic data generation (SDG), that assesses whether the utility of generated records is the same across sensitive groups.…
Adaptive Personalized Federated Learning via Multi-task Averaging of Kernel Mean Embeddings
Jean-Baptiste Fermanian, Batiste Le Bars, Aurélien Bellet
Personalized Federated Learning (PFL) enables a collection of agents to collaboratively learn individual models without sharing raw data. We propose a new PFL approach in which eac…
TAMIS: Tailored Membership Inference Attacks on Synthetic Data
Paul Andrey, Batiste Le Bars, Marc Tommasi
Membership Inference Attacks (MIA) enable to empirically assess the privacy of a machine learning algorithm. In this paper, we propose TAMIS, a novel MIA against differentially-pri…