- Rating
- 2
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces Graft, a pretrained in-context graph model for node-, edge-, and graph-level classification and regression. Given labeled examples from a graph, Graft predicts labels for query nodes, node pairs, or whole graphs without gradient updates or dataset-specific prediction heads. The model uses an exchangeable tokenizer for arbitrary node feature columns, a unified row-based representation across prediction levels, and an in-context head that combines closed-form estimators, label propagation, and a transformer. The authors evaluate Graft on 49 dataset-task pairs and compare it with GCN/GIN models trained on the same label budgets, as well as other graph and tabular foundation models.
Critical strengths
-
This paper addresses an important practical problem in graph learning: conventional GNNs usually require dataset-specific training, task-specific output heads, and hyperparameter tuning whenever the feature schema, prediction level, or label type changes.
-
This paper proposes a genuinely unified formulation in which one frozen model takes labeled examples in context and handles node-, edge-, and graph-level prediction, for both classification and regression, without gradient updates or a dataset-specific prediction head.
-
Its experimental evaluation is broad and mostly compelling: it covers 49 dataset-task pairs across citation, co-purchase, web, social, road, rating, molecular, and image-derived graphs, and reports that Graft matches or outperforms same-label GCN/GIN baselines on 45 of them, especially for link prediction and few-shot regression.
Critical weaknesses
-
The primary evaluation does not provide a fully clean test of cross-dataset generalization, because Graft may have seen other labeled rows from the same evaluated dataset during pretraining, whereas the GNN baseline is trained only on the labels in the prompt. The family-held-out experiments partially address this issue, but regression performance drops more substantially in that stricter setting.
-
The “unified” design still relies on several ad-hoc, manually specified task conventions. Node pairs are encoded using pooled and differenced node embeddings. Graph-level targets are represented with fixed pooling statistics, including the mean, standard deviation, maximum, and graph size. Multiclass labels are decomposed into one-vs-rest tasks. Outputs are represented using 64 fixed quantile bins with a learned residual, and wide node features are compressed to 32 PCA dimensions.
-
The framework remains limited to scalar or categorical supervised prediction. It does not directly support edge features, graph generation, graph editing, clustering, graph matching, list-wise ranking, sequence generation, or decision-making tasks. Can the proposed method be effectively extended to graph tasks beyond classification and regression?
Questions for authors
See Weakness.
We thank the reviewer for the comments on the practical value of one frozen model across prediction levels, and on the scope of its transfer.
Weakness 1 (pretraining exposure and regression under family holdout). The cleanest test of cross-dataset generalization is now the paper's primary result: pretrained on synthetic graphs only, without ever seeing a real graph, Graft matches or exceeds a GCN trained on the same labels on 28 of 49 real dataset-task pairs, without a gradient step. (GCN is the GNN type with the best mean validation rank, chosen without test labels; every type is reported in the revised appendix.) Synthetic-only transfer includes 13 of 13 link-prediction graphs, 5 of 5 graph-regression sets and 4 of 6 TU/OGB graph-classification sets. Revised Figure 3 compares all regimes against the same GCN on the same test rows: Graft+real (family held out), which adds real data from other families, reaches 36 of 49, and Graft+real, which also sees the evaluated training splits, 46 of 49. The latter comparison measures adaptation to datasets represented in pretraining.
Weakness 1, continued (the regression drop). Regression benefits substantially from real data, but transfer differs by prediction level. Synthetic-only graph regression reaches mean skill .110 against −.146 for the same-label GCN and retains 5 of 5 against the tuned GCN. Absolute skill is modest. Family-held-out models reach 5 of 5 graph-, 3 of 6 node- and 0 of 3 edge-regression sets against the same-label GCN, compared with 5 of 5, 6 of 6 and 3 of 3 when evaluated training splits are included. The appendix reports family-held-out results at every budget over three pretraining seeds. These results support useful graph-regression transfer while showing that node and edge regression depend more on real-data coverage.
Weakness 2 (fixed conventions within the unified interface). "Unified" refers to one set of pretrained weights and one labeled-context interface across node, pair and graph targets, for classification and regression. Endpoint combinations turn a pair into a row; mean, standard deviation, maximum and graph size turn a graph into a row. One-vs-rest passes express categorical labels through scalar targets, while 64 quantile bins and a learned residual provide a common output representation. The 32-column PCA projection controls feature width before tokenization. These are fixed design choices with learned projections: pair symmetry and permutation-invariant pooling respect the predicted object, and scalar targets let the head share a prediction rule. The same network processes these rows without fitting a dataset-specific head or changing its weights. Unification does not require every input adapter to be learned. For the camera-ready, we will collect these choices and their equations in the restructured method section and redraw Figure 1 to make their roles explicit.
Weakness 3 (extension beyond scalar and categorical prediction). Graft's evaluated interface covers supervised scalar and categorical targets. It does not currently consume edge features, and edge classification is evaluated as link prediction rather than relation-type classification. Pair scores can rank candidate links, as the added ranking evaluation demonstrates, but this is not a list-wise prediction interface. Graph generation, editing, clustering, matching, sequence generation and decision-making are outside the evaluated scope. These extensions are promising directions for future work; each needs new inputs, structured outputs or task objectives beyond the interface evaluated here.