Skip to content

PACE: Propagation-Aware Collaborative Correction for One-Shot Personalized Federated Graph Learning

Sep 2026 · 0 citations · 45 references
Computer Science

TL;DR

A small transported correction can augment a complete Local model when receiver evidence supports it while leaving the Local prediction unchanged otherwise, and the central result is that a small transported correction can augment a complete Local model when receiver evidence supports it while leaving the Local prediction unchanged otherwise.

Abstract

Client heterogeneity creates both an opportunity and a risk in personalized federated graph learning. Knowledge held by other subgraphs may complement a receiver's Local model, but an incompatible transfer can override reliable predictions. One-shot communication sharpens this tension because an unsuitable server return cannot be corrected later. We introduce PACE, which treats collaborative knowledge as a compact correction to a complete Local predictor rather than as its replacement. Each client uploads a rank-r update carrier and a diagonal sketch of propagated message moments. The server uses them to construct a propagation-aware, receiver-anchored correction, while the receiver retains its full Local model. Convex negative-log-likelihood calibration (CNLL) then selects one coefficient between Local and External logits using validation nodes; model parameters remain fixed and no feedback is sent. At Rank-6, personalized returns occupy 9.6-17.6% of dense tensor bytes across the six evaluated datasets. The correction receives nonzero weight and improves both Accuracy and weighted-F1 over Local on five datasets; on ogbn-arxiv, CNLL assigns zero predictive weight to the correction and preserves Local predictions exactly. Applying the same CNLL rule to matched baselines on three citation datasets does not account for these gains. The central result is therefore that a small transported correction can augment a complete Local model when receiver evidence supports it while leaving the Local prediction unchanged otherwise.

View source

Similar papers

Open access 2026

StabFedVAE: Stabilizing Global-Local Latent Representations for Federated Recommendation

This work proposes StabFedVAE, a global-local variational autoencoder that disentangles shared and client-specific preference patterns and introduces a round-dependent local Kullback–Leibler (KL) penalty to stabilize the local posterior.

Jin-Cheng Cai, Li-Jiao Feng, Ni Zhao · 0 citations
#machine learning Preprint Sep 2026

Rethinking One-Shot Federated Graph Learning: Training-Free Statistical Estimation

One-shot federated graph learning generally aims to train Graph Neural Networks (GNNs) across clients with disconnected subgraphs in a single communication round. Existing methods predominantly design advanced optimization strategies under the premise that local GNN training is indispensable. However, empirical observa...

Shu-Tong Zheng, Si-An Chen · 0 citations
Open access Sep 2026

FedTIP: Communication-Efficient Federated Temporal Prompting for Few-Shot Dynamic Graph Adaptation

Temporal interaction streams are often distributed across data owners, while downstream labels and communication budgets remain limited. Existing temporal graph prompts typically adapt at a centralized trainer, whereas federated graph methods commonly exchange larger trainable states. This paper presents FedTIP, a prom...

Xi-Jun Wu, Xin-Ming Zhang · 0 citations
#machine learning Preprint Aug 2026

Personalized and Multi-View Representation for Federated Cold-Start Recommendation

PMFRec learns a personalized representation generator to produce user-specific item representations from attribute features, and introduces a global multi-view encoder with item-adaptive gating and an orthogonality objective to capture complementary semantic views while reducing cross-view redundancy.

Jaehyung Lim, Wonbin Kweon, Woojoo Kim et al. · 0 citations
#artificial intelligence Preprint Sep 2026

FedLAFP: Low-Rank Aggregation Meets Full-Rank Personalization in Federated Fine-Tuning

Federated parameter-efficient fine-tuning enables clients to adapt pre-trained models without sharing raw data or communicating the full model, but statistical heterogeneity makes a single global adapter insufficient for personalized prediction. Existing personalized methods typically use the same low-rank structure fo...

Meng-Jun Yi, Huai-An Gu, Yi-Hao Ai et al. · 0 citations
Preprint Aug 2026

FlowNeg: GFlowNet-Guided Diverse Hard Negative Sampling for Knowledge Graph Embedding

FlowNeg is introduced, a context-conditioned hierarchical generative flow network that amortizes reward-proportional sampling without normalizing a composite reward over the entity set: given a positive triple and corruption side, it selects a type, then an entity.

Ibne Farabi Shihab, Naoshin Anzum Hridi, Joyanta J. Mondal · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.