4 papers
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…
Optimal Transport under Group Fairness Constraints
Linus Bleistein, Mathieu Dagréou, Francisco Andrade +2
Ensuring fairness in matching algorithms is a key challenge in allocating scarce resources and positions. Focusing on Optimal Transport (OT), we introduce a novel notion of group f…