LGAIJan 24, 2025

FedAGHN: Personalized Federated Learning with Attentive Graph HyperNetworks

arXiv:2501.16379v22 citationsh-index: 5Knowledge-Based Systems
Originality Incremental advance
AI Analysis

This addresses the problem of data variability across clients in federated learning, offering a personalized approach that is incremental over existing aggregation-based methods.

The paper tackles statistical heterogeneity in federated learning by proposing FedAGHN, which uses attentive graph hypernetworks to dynamically capture fine-grained collaborative relationships and generate personalized models for each client, achieving superior performance in experiments.

Personalized Federated Learning (PFL) aims to address the statistical heterogeneity of data across clients by learning the personalized model for each client. Among various PFL approaches, the personalized aggregation-based approach conducts parameter aggregation in the server-side aggregation phase to generate personalized models, and focuses on learning appropriate collaborative relationships among clients for aggregation. However, the collaborative relationships vary in different scenarios and even at different stages of the FL process. To this end, we propose Personalized Federated Learning with Attentive Graph HyperNetworks (FedAGHN), which employs Attentive Graph HyperNetworks (AGHNs) to dynamically capture fine-grained collaborative relationships and generate client-specific personalized initial models. Specifically, AGHNs empower graphs to explicitly model the client-specific collaborative relationships, construct collaboration graphs, and introduce tunable attentive mechanism to derive the collaboration weights, so that the personalized initial models can be obtained by aggregating parameters over the collaboration graphs. Extensive experiments can demonstrate the superiority of FedAGHN. Moreover, a series of visualizations are presented to explore the effectiveness of collaboration graphs learned by FedAGHN.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes