Pith. sign in

REVIEW 4 cited by

FedTAD: Topology-aware Data-free Knowledge Distillation for Subgraph Federated Learning

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 2404.14061 v2 pith:W26GQWBQ submitted 2024-04-22 cs.LG cs.AIcs.DBcs.SI

classification cs.LGcs.AIcs.DBcs.SI
keywords knowledgesubgraphfedtadmodeldata-freedifferencesdistillationfederated
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Subgraph federated learning (subgraph-FL) is a new distributed paradigm that facilitates the collaborative training of graph neural networks (GNNs) by multi-client subgraphs. Unfortunately, a significant challenge of subgraph-FL arises from subgraph heterogeneity, which stems from node and topology variation, causing the impaired performance of the global GNN. Despite various studies, they have not yet thoroughly investigated the impact mechanism of subgraph heterogeneity. To this end, we decouple node and topology variation, revealing that they correspond to differences in label distribution and structure homophily. Remarkably, these variations lead to significant differences in the class-wise knowledge reliability of multiple local GNNs, misguiding the model aggregation with varying degrees. Building on this insight, we propose topology-aware data-free knowledge distillation technology (FedTAD), enhancing reliable knowledge transfer from the local model to the global model. Extensive experiments on six public datasets consistently demonstrate the superiority of FedTAD over state-of-the-art baselines.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Towards Effective Federated Multimodal Graph Learning via Navigating Multifaceted Heterogeneity

    cs.LG 2026-08 conditional novelty 6.0 of 10

    A federated multimodal graph-learning method that uses server-side routing of topology-aware prototypes to align clients across tasks, modalities, and topologies, outperforming baselines on 8 datasets.

  2. Rethinking Federated Graph Foundation Models: A Graph-Language Alignment-based Approach

    cs.LG 2026-01 conditional novelty 6.0 of 10

    FedGALA replaces vector-quantized federated graph foundation models with continuous graph-text contrastive alignment plus prompt tuning, claiming up to 14.37% gains over 22 baselines.

  3. A Comprehensive Data-centric Overview of Federated Graph Learning

    cs.LG 2025-07 conditional novelty 5.0 of 10

    A data-centric taxonomy for Federated Graph Learning that classifies 79 studies by data characteristics and data utilization, plus a discussion of integration with pre-trained large models.

  4. S2FGL: Spatial Spectral Federated Graph Learning

    cs.LG 2025-07 conditional novelty 4.0 of 10

    S2FGL improves subgraph federated graph learning by injecting prototype-based semantic knowledge and aligning local and global spectral projections, gaining about 1 to 2 points of node classification accuracy.

Pith tools