- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes GadrPFN, a prior-fitted network for in-context node classification. To address the limitation that existing graph PFN priors generate narrow feature–structure relationships, the authors introduce concepts and operations from graph neural diffusion into the synthetic data prior. Specifically, hidden node states and labels evolve over random graphs for randomly sampled flow times. In tandem, the authors design a corresponding Advection–Diffusion–Reaction (ADR) graph module in the network architecture. The paper validates the efficacy of the proposed prior and the superiority of the model across various types of graphs through rigorous controlled ablation studies, prior task-space coverage analyses, and empirical probing of the network's learned non-linearity.
Critical strengths
- Incorporating advection, diffusion, reaction, and evolution time into the task generation pipeline provides a well-structured prior design space for graph PFNs. The separate label time is especially valuable, as it decouples feature smoothness from label homophily, directly reflecting the diverse feature-structure relationships observed in real-world graphs. This design offers actionable building blocks for understanding what synthetic tasks facilitate cross-graph transfer.
- GadrPFN outperforms TAG and GraphPFN on the 28 benchmarks by 3.30 and 3.62 percentage points, respectively, achieving the best average rank across both homophilous and heterophilous graph subsets. Furthermore, Figure 10 demonstrates that the full prior consistently yields higher accuracy curves under a unified inference configuration, providing additional evidence for the effectiveness of the prior design. Together, these results strongly support the practical potential of the method.
Critical weaknesses
- Experimental Fairness and Hyperparameter Selection:
- In Appendix B, the authors state that in the controlled experiment of Table 2, "The two existing priors are evaluated under NodePFN's released settings on both networks and the GadrPFN prior under the per-dataset settings of Table 1." If GadrPFN benefits from a broader, re-tuned per-dataset hyperparameter search (including tuning the dual-head MLP weight tailored to "Ours" network) while the competing priors on the "Ours" network are locked to NodePFN's static released settings, the reported +5.1% gain cannot be considered a strictly fair apple-to-apple comparison attributed purely to the prior.
- Additionally, tuning five inference hyperparameters per dataset requires a validation set. While the standard splits in Table 1 provide validation nodes, in true few-shot or zero-shot deployment scenarios (e.g., the ProG protocol in Appendix F.1, where the text explicitly states "there is no validation set"), how were these dataset-specific inference hyperparameters selected? It remains unclear whether there is test-set leakage or an over-reliance on heuristic defaults.
- Missing Mathematical Definitions and Hyperparameter Specifications for the Prior: Although the Reproducibility Statement claims that "The sampler of §3.1 with its coefficient mixtures is in Appendix A", Appendix A.1 is surprisingly brief and mostly qualitative. The manuscript does not provide the exact probability distributions or mixture weights for the PDE coefficients (α,κ,β,γ), the precise mathematical formulation of the velocity field V derived from node potentials, the exact functional forms of the reaction terms r(Z), or the exact mixture ratios among the different random graph generators. These details are essential for readers to accurately reproduce the results, assess the prior's suitability for target datasets, and evaluate real-world deployment costs.
Questions for authors
- Could you report the performance of all three priors in Table 2 under an identical, default (untuned) inference configuration on both networks to verify that the gain from the prior still holds?
- How were the inference hyperparameters chosen in settings without a validation set, such as the ProG few-shot protocol?
- Could you provide the exact mathematical expressions, functional forms, and parameter distributions omitted from Appendix A.1 regarding the synthetic data sampler?
3 comments
Dear authors,
Thanks for the response. The authors have addressed my concerns, and I will keep my original rating.
Best of luck.
Thank you for your feedback
Dear Reviewer cm7F,
Thank you for confirming that our response has addressed your concerns, and for your time and support.
Best regards, The authors
We thank Reviewer cm7F for providing a clear explanation of the method and for three questions that we could answer with new experiments. The changes in the revised paper are highlighted in red.
Response to W1 and Q1. The three priors under one untuned configuration on both networks.
The gain from the GadrPFN prior remains on both networks when no setting is tuned for it, including the head-mixing weight. The reviewer is right that the comparison of 75.3 with 70.2 in the submitted Table 2 mixed two inference settings. We added the comparison under common settings to Appendix J.2, and the paragraph of Section 4.3 now reports it. As the identical untuned configuration we use NodePFN's released settings, which were not chosen for the GadrPFN prior and keep the head-mixing weight at its trained value of 0.5 on every graph. Each column below applies one inference setting identically to all three priors of Table 2.
On our network at NodePFN's released settings the GadrPFN prior is more accurate than NodePFN's prior. On NodePFN's network both new priors are more accurate than NodePFN's prior. In Appendix J.2, we also report the per-graph results.
Response to W1b and Q2. Settings without a validation set in the ProG protocol.
In settings without a validation set, such as the ProG protocol, the revised paper chooses no inference hyperparameter, so no test label can enter the choice of settings. To this end, GadrPFN and NodePFN use NodePFN's released settings and GraphPFN uses its default in the revised Appendix F.1 and Appendix 4.2. We have also added the ProG protocol on all 28 graphs to Appendix J.6. With these fixed settings, GadrPFN has the highest mean accuracy of the three PFNs at every budget. The table below shows the mean accuracy over the six graphs of Appendix F.1.
On all 28 graphs, the mean accuracy over 83 graph-budget pairs is 49.4 for GadrPFN, 45.9 for NodePFN and 45.7 for GraphPFN. The submitted rows had tuned these settings on the evaluation nodes, which gave 41.6 with one label per class.
Response to W2 and Q3. Mathematical definitions of the sampler.
In the revised paper, we provide the exact parameter distributions and functional forms of the sampler, so that readers can reproduce the sampler. In the new Appendix J.7, we list the distributions and mixture weights of α, κ, β and γ, the functional forms of the reaction terms r(Z), the construction of the velocity field V and the mixture ratios of the graph generators. In the revised paper, Appendix A.1 also refers to Appendix J.7. For the velocity field V, we have also clarified its description in Section 3.1. The prior draws a random velocity for each edge, antisymmetric in direction and redrawn at every flow layer, which generalises the fields derived from a node potential. Only the ADR layer of the network uses a learned potential.