Pith. sign in

REVIEW 1 cited by

FedSheafHN: Personalized Federated Learning on Graph-structured Data

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.16056 v3 pith:B2WQAJWF submitted 2024-05-25 cs.LG

classification cs.LG
keywords modelclientgraphpersonalizedcollaborationfedsheafhncharacteristicsclients
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Personalized subgraph Federated Learning (FL) is a task that customizes Graph Neural Networks (GNNs) to individual client needs, accommodating diverse data distributions. However, applying hypernetworks in FL, while aiming to facilitate model personalization, often encounters challenges due to inadequate representation of client-specific characteristics. To overcome these limitations, we propose a model called FedSheafHN, using enhanced collaboration graph embedding and efficient personalized model parameter generation. Specifically, our model embeds each client's local subgraph into a server-constructed collaboration graph. We utilize sheaf diffusion in the collaboration graph to learn client representations. Our model improves the integration and interpretation of complex client characteristics. Furthermore, our model ensures the generation of personalized models through advanced hypernetworks optimized for parallel operations across clients. Empirical evaluations demonstrate that FedSheafHN outperforms existing methods in most scenarios, in terms of client model performance on various graph-structured datasets. It also has fast model convergence and effective new clients generalization.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. HeteroBA: A Structure-Manipulating Backdoor Attack on Heterogeneous Graphs

    cs.LG 2025-05 conditional novelty 6.0 of 10

    HeteroBA achieves high attack success rates by inserting trigger nodes with sampled features and strategically chosen connections into heterogeneous graphs, with minimal impact on clean accuracy.

Pith tools