A Unified Framework for Fair and Personalized Decentralized Learning under Communication Constraints
Read the original on arXiv Machine Learning →The paper introduces DMFL-SQ, a decentralized multi-task learning algorithm that integrates graph-based personalization, agnostic fairness, and compressed event-triggered communication. It provides convergence guarantees for non-convex objectives, achieving an ≠O(T^{-1/2}) stationarity rate despite sparse, quantized, and event-triggered communication, and offers PAC-Bayes generalization bounds for the fairness objective. Experiments on CIFAR-10 and the MUSMET EEG dataset show that DMFL-SQ reduces communication while preserving predictive performance and improving fairness across clients.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.