Robust Server Defense Against Unreliable Clients in One-Shot Fair Collaborative Machine Learning
Chia-Yuan Wu, Frank E. Curtis, Daniel P. Robinson

TL;DR
This paper introduces a server-side defense framework for one-shot collaborative machine learning that mitigates the impact of unreliable clients on fairness and accuracy using a bilevel optimization approach.
Contribution
It proposes a novel bilevel optimization-based method that learns client weights and enforces fairness constraints with minimal trusted data, enhancing robustness against biased client data.
Findings
Improves fairness with minimal accuracy loss under biased proxy data.
Remains effective even when unreliable clients are in majority.
Outperforms existing methods in robustness and fairness.
Abstract
Collaborative machine learning (CML) enables multiple clients to train a global model jointly in a data-distributed setting. To address data privacy and communication efficiency, one-shot CML has been increasingly adopted, where clients communicate with the server only once by sharing synthetic or processed proxy data. This single-round communication, however, eliminates the possibility of iterative correction at the server, making the learning process particularly vulnerable to client unreliability. In this setting, unreliable clients, whether malicious or non-malicious, may provide biased proxy data that favors certain groups, thereby degrading the fairness of the global model and harming minority or unprivileged groups. In this work, we propose a server-side defense framework based on a bilevel optimization formulation. The proposed approach learns client-level weights to mitigate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
