Loading
Life sciences · Preprint
arXiv · September 4, 2026
Early or partial results. Treat as a signal, not a conclusion.
This is an unpublished technical preprint proposing PACE, a federated graph learning algorithm that transmits compact corrections rather than full model replacements. The work reports improvements in accuracy and weighted-F1 on five of six benchmark datasets, with communication efficiency of 9.6–17.6% of dense tensor bytes, but lacks peer review, independent validation, and comparison to established methods.
Preprint. Intervention: PACE algorithm: rank-r update carrier, diagonal sketch of propagated message moments, and convex negative-log-likelihood calibration for coefficient selection between Local and External logits.. Compared with: Local model predictions; matched baselines on three citation datasets..
Personalized returns occupy 9.6–17.6% of dense tensor bytes across six evaluated datasets Correction receives nonzero weight and improves 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
Safety was not reported in the material analysed. Check the source before drawing any conclusion about harm.
The source did not state who this applies to in practice.
This is a methodological preprint presenting an algorithm for federated graph learning with no peer review, clinical validation, or comparison to published baselines on standard benchmarks.
As stated by the source record.
Quoted from the source exactly as published.
Graded across the dimensions that decide whether you should act, each from what the source actually supports. There is no single score, and where a dimension was not assessed it says so.
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.
Taken from the source record, never inferred. Follow any of these and new work involving them reaches your briefing.