When to Trust Aggregated Gradients: Addressing Negative Client Sampling in Federated Learning
원문 초록
Federated Learning has become a widely-used framework which allows learning a global model on decentralized local datasets under the condition of protecting local data privacy. However, federated learning faces severe optimization difficulty when training samples are not independently and identically distributed (non-i.i.d.). In this paper, we point out that the client sampling practice plays a decisive role in the aforementioned optimization difficulty. We find that the negative client sampling will cause the merged data distribution of currently sampled clients heavily inconsistent with that of all available clients, and further make the aggregated gradient unreliable. To address this issue, we propose a novel learning rate adaptation mechanism to adaptively adjust the server learning rate for the aggregated gradient in each round, according to the consistency between the merged data distribution of currently sampled clients and that of all available clients. Specifically, we make theoretical deductions to find a meaningful and robust indicator that is positively related to the optimal server learning rate and can effectively reflect the merged data distribution of sampled clients, and we utilize it for the server learning rate adaptation. Extensive experiments on multiple image and text classification tasks validate the great effectiveness of our method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Making Language Model a Hierarchical Classifier and Generator
Robustness of Misinformation Classification Systems to Adversarial Examples Through BeamAttack
Prompt Candidates, then Distill: A Teacher-Student Framework for LLM-driven Data Annotation
PRL: Prompts from Reinforcement Learning
Guarded Query Routing for Large Language Models
GNN-CNN: An Efficient Hybrid Model of Convolutional and Graph Neural Networks for Text Representation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.