Novel clustered federated learning based on local loss
Endong Gu, Yongxin Chen, Hao Wen, Xingju Cai, Deren Han

TL;DR
This paper introduces LCFL, a new clustering metric for federated learning that accurately assesses client data distribution variations without prior knowledge, enhancing privacy and performance.
Contribution
The paper presents LCFL, a novel clustering metric tailored for federated learning, addressing privacy, non-convex models, and accuracy issues in existing methods.
Findings
LCFL outperforms baseline methods on multiple benchmarks.
LCFL accurately evaluates client data distribution variations.
The framework is mathematically rigorous and feasible.
Abstract
This paper proposes LCFL, a novel clustering metric for evaluating clients' data distributions in federated learning. LCFL aligns with federated learning requirements, accurately assessing client-to-client variations in data distribution. It offers advantages over existing clustered federated learning methods, addressing privacy concerns, improving applicability to non-convex models, and providing more accurate classification results. LCFL does not require prior knowledge of clients' data distributions. We provide a rigorous mathematical analysis, demonstrating the correctness and feasibility of our framework. Numerical experiments with neural network instances highlight the superior performance of LCFL over baselines on several clustered federated learning benchmarks.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Machine Learning and ELM · Stochastic Gradient Optimization Techniques
