cs.LGNov 14, 2026

Learning Graph-Conditioned Predictors in Weight Space

Authors: Zhewei Chen, Hao Zhu, Ahad N. Zehmakan

Organizations: Australian National University, Australia · CSIRO Technology, Australia

Abstract

The same node attributes can imply different labels in different structural contexts. Yet fast graphless models typically treat topology as additional evidence supplied to a globally shared predictor. This assumes that structure augments the available information, rather than determining how node attributes should be interpreted. We introduce SCOPE (Structure-COnditioned PrEdictor), in which a small generator maps each node's cached structural fingerprint to coefficients over a shared low-rank basis, producing a context-specific update to a global weight matrix. The base predictor, basis, and generator remain shared across all nodes, while the resulting transformation adapts how attributes are processed in each relational environment. Once fingerprints are cached, inference requires only a forward pass and no online message passing. This design combines context-specific specialization with global parameter sharing, compact low-rank adaptation, and message-passing-free inference. On two large OGB node-classification graphs, conditioning the weights with raw positional signals yields clear gains over supplying the same signals through input concatenation. Further results under a structure-transductive held-out-node protocol and in teacher-free graph classification show that the mechanism extends beyond a particular distillation setting. These findings establish graph structure not only as predictive evidence, but as context that determines the predictor used to interpret that evidence.

Figures & tables

Appendix figures & tables11 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Message Passing Does More with Less for In-Context Learning on Graphs

    Sep 29, 2026Dooho Lee, Jinmo Lee, Minho Jeong +2In-Context LearningGraph Neural Networks

  2. To Learn is to Wander: Learning Across Graphs and Tasks with Random Walks

    Oct 5, 2026Louis Tichelman, Xingyue Huang, Jinwoo Kim +1Multi-Task LearningGraph Transfer Learning

  3. LoGIC: Budgeted Context Construction for Node-Level Graph In-Context Learning with Tabular Foundation Models

    Sep 5, 2026Mingqi Yang, Zidong Guo, Jihui Yang +1In-Context LearningRetrieval-Augmented ICL