Daily Arxiv

This page organizes papers related to artificial intelligence published around the world.
This page is summarized using Google Gemini and is operated on a non-profit basis.
The copyright of the paper belongs to the author and the relevant institution. When sharing, simply cite the source.

Personalized Subgraph Federated Learning with Differentiable Auxiliary Projections

Created by
  • Haebom

Author

Wei Zhuo, Zhaohuan Zhan, Han Yu

Outline

Federated Learning (FL) using graph-structured data typically suffers from the non-IID problem, where each client has a different subgraph sampled from the global graph. In this paper, we introduce FedAux (Federated Learning with Auxiliary Projections), a personalized subgraph FL framework that aligns, compares, and aggregates heterogeneously distributed local models without sharing raw data or node embeddings. In FedAux, each client jointly learns (i) a local GNN and (ii) a learnable auxiliary projection vector (APV) that differentially projects node embeddings into 1D space. Soft alignment operations and lightweight 1D convolutions refine these embeddings in the aligned space, allowing the APV to effectively capture client-specific information. After local learning, these APVs serve as compact signatures that the server uses to compute cross-client similarities and perform similarity-weighted parameter blending, generating personalized models while maintaining knowledge transfer across clients. Additionally, we provide rigorous theoretical analysis to establish the convergence and rationality of the design. Experimental evaluations on various graph benchmarks demonstrate that FedAux significantly outperforms existing baselines in both accuracy and personalization performance.

Takeaways, Limitations

Takeaways:
FedAux provides improved accuracy and personalized performance in federated learning processing non-IID graph data.
Enhances privacy by not sharing raw data or node embeddings.
We create personalized models by leveraging APV, which computes similarity between clients and enables knowledge transfer.
Provides a theoretical analysis of convergence.
It outperforms existing methods in various graph benchmarks.
Limitations:
The specific Limitations is not explicitly mentioned in the paper. (This answer is based solely on the abstract; you will need to review the entire paper to determine more detailed Limitations.)
👍