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

• URL: http://arxiv.org/abs/2609.04832v1
• Date: Fri, 04 Sep 2026 07:44:12 GMT
• Title: PACE: Propagation-Aware Collaborative Correction for One-Shot Personalized Federated Graph Learning
• Abstract summary: We introduce PACE, which treats collaborative knowledge as a compact correction to a complete Local predictor.<n>Each client uploads a rank-r update carrier and a diagonal sketch of propagated message moments.<n>The server uses them to construct a propagation-aware, receiver-anchored correction, while the receiver retains its full Local model.
• Score: 4.349000444958713
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Rethinking One-Shot Federated Graph Learning: Training-Free Statistical Estimation [12.66442044096499]
  One-shot federated graph learning generally aims to train Graph Neural Networks (GNNs) across clients with disconnected subgraphs in a single communication round.<n>Under extreme non-IID conditions, local GNN training suffers from severe cross-client representation misalignment.<n>We propose SPEAR, a training-free framework that directly computes topology-smoothed class prototypes from local graphs.
  arXiv  Detail & Related papers  (2026-09-05T15:55:22Z)
• TI-StegoAlign: Channel-Guided Post-Training for Generative Text Steganography under Tokenization Inconsistency [20.336143930874993]
  LLM agents exchange secret information through task-relevant messages.<n>Most methods evaluate recovery on sender-side tokens, whereas the receiver observes only surface text.<n>Detokenization and receiver-side retokenization can alter token boundaries, desynchronize coding states, and cause such evaluation to overestimate receiver-side recovery.<n>We propose TI-StegoAlign, a channel-guided post-training framework.
  arXiv  Detail & Related papers  (2026-08-01T01:45:50Z)
• Federated Martingale Posterior Samping [28.76805404959501]
  Federated Bayesian neural networks require fixing a prior on the model parameters together with a likelihood.<n>Motivated by the rapid progress of predictive models, the martingale posterior, also known as predictive Bayes, replaces the prior--likelihood pair with a predictive distribution.<n>This letter proposes federated martingale posterior (FMP) sampling, a one-shot embarrassingly parallel protocol in which each client uploads a small set of trainable data embeddings and the server runs the predictive sampler centrally.
  arXiv  Detail & Related papers  (2026-05-18T15:33:18Z)
• Learning from Emptiness: De-biasing Listwise Rerankers with Content-Agnostic Probability Calibration [76.08899010904652]
  CapCal is a training-free framework that mechanically decouples positional bias from ranking decisions.<n>It achieves superior performance among training-free methods while preserving single-pass efficiency.
  arXiv  Detail & Related papers  (2026-04-11T10:47:22Z)
• ProCal: Probability Calibration for Neighborhood-Guided Source-Free Domain Adaptation [19.75458355825581]
  Source-Free Domain Adaptation (SFDA) adapts pre-trained models to unlabeled target domains without requiring access to source data.<n>ProCal is a probability calibration method that dynamically calibrates neighborhood-based predictions.
  arXiv  Detail & Related papers  (2026-03-19T11:18:21Z)
• CARE What Fails: Contrastive Anchored-REflection for Verifiable Multimodal [84.71254539482369]
  Group-relative reinforcement learning with verifiable rewards (RLVR) often wastes the most informative data it already has the failures.<n>We present CARE, a failure-centric post-training framework for multimodal reasoning that turns errors into supervision.<n> CARE improves accuracy and training smoothness while explicitly increasing the share of learning signal that comes from failures.
  arXiv  Detail & Related papers  (2025-12-22T16:34:21Z)
• Geometric Prior-Guided Federated Prompt Calibration [21.766231067185956]
  Federated Prompt Learning (FPL) offers a parameter-efficient solution for collaboratively training large models.<n>Existing methods, focusing on aggregation or regularization, fail to address this root cause of local training bias.<n>We propose Geometry-Guided Text Prompt (GGTPC), a novel framework that directly corrects this bias by providing clients with a global geometric prior.
  arXiv  Detail & Related papers  (2025-12-08T06:42:32Z)
• Optimal Transport-based Domain Alignment as a Preprocessing Step for Federated Learning [0.48342038441006796]
  Federated learning (FL) is a subfield of machine learning that avoids sharing local data with a central server.<n>In FL, fusing locally-trained models with unbalanced datasets may deteriorate the performance of global model aggregation.<n>We introduce an Optimal Transport-based preprocessing algorithm that aligns the datasets by minimizing the distributional discrepancy of data along the edge devices.
  arXiv  Detail & Related papers  (2025-06-04T15:35:55Z)
• Acceleration of Federated Learning with Alleviated Forgetting in Local Training [61.231021417674235]
  Federated learning (FL) enables distributed optimization of machine learning models while protecting privacy. We propose FedReg, an algorithm to accelerate FL with alleviated knowledge forgetting in the local training stage. Our experiments demonstrate that FedReg not only significantly improves the convergence rate of FL, especially when the neural network architecture is deep.
  arXiv  Detail & Related papers  (2022-03-05T02:31:32Z)
• Tackling the Local Bias in Federated Graph Learning [48.887310972708036]
  In Federated graph learning (FGL), a global graph is distributed across different clients, where each client holds a subgraph. Existing FGL methods fail to effectively utilize cross-client edges, losing structural information during the training. We propose a novel FGL framework to make the local models similar to the model trained in a centralized setting.
  arXiv  Detail & Related papers  (2021-10-22T08:22:36Z)
• Tail-to-Tail Non-Autoregressive Sequence Prediction for Chinese Grammatical Error Correction [49.25830718574892]
  We present a new framework named Tail-to-Tail (textbfTtT) non-autoregressive sequence prediction. Considering that most tokens are correct and can be conveyed directly from source to target, and the error positions can be estimated and corrected. Experimental results on standard datasets, especially on the variable-length datasets, demonstrate the effectiveness of TtT in terms of sentence-level Accuracy, Precision, Recall, and F1-Measure.
  arXiv  Detail & Related papers  (2021-06-03T05:56:57Z)
• Toward Understanding the Influence of Individual Clients in Federated Learning [52.07734799278535]
  Federated learning allows clients to jointly train a global model without sending their private data to a central server. We defined a new notion called em-Influence, quantify this influence over parameters, and proposed an effective efficient model to estimate this metric.
  arXiv  Detail & Related papers  (2020-12-20T14:34:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.