- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes Relational Alignment Profiles (RAP) to characterize graph-learning problems through multiscale alignment between graph structure, node features, and task labels. RAP provides compact coordinates for architecture selection and alignment curves for relational diagnosis.
Critical strengths
The paper explores a problem-first perspective on graph learning, aiming to characterize relational properties before selecting suitable GNN architectures.
Critical weaknesses
- The manuscript contains obvious errors that suggest insufficient proofreading of AI generation content. For example, Figure 1 contains the duplicated text "Attributed Attributed Graph", along with inconsistent spacing, crowded labels, and poor visual organization. Such basic errors in a central framework figure raise serious concerns about the care taken in preparing and verifying the submission. The overall presentation falls below the expected standard for a conference paper.
- The task-conditioned component consistently fails to improve architecture selection, despite being part of the central formulation. The real-world Top-1 selection accuracy is only 36.36%, and the evaluation mainly relies on a small, fixed architecture bank.
Questions for authors
See weakness.
Response to followup by Reviewer rr3u
We thank the reviewer for the follow-up and for recognizing the value of a problem-first perspective. We respectfully clarify three points.
1. The fixed baseline. We added this baseline at another reviewer's request and reported every result openly. We gently note a tension: the original review criticized our reliance on a small bank and a limited suite, yet the follow-up treats a fixed choice's success on that same suite as decisive. A fixed default works only when the test suite resembles its corpus. When it does not, SAGE-role's regret reaches 15.64 pp (worse than random), the re-chosen default flips to GT with tripled real-data regret (1.46 → 4.89 pp), and on a regime absent from training α has 6.65 pp regret vs. 13.11 pp for the fixed choice (Appendix C.7). On the current suite the difference is not significant (p=0.29), and the two datasets where α loses are flagged in advance by RAP's own task curve (Appendix C.5). A fixed default offers neither adaptation nor such a warning.
2. Selection is one part of the contribution. The paper's second half, the diagnostic curves and β (§4.3, Appendix C.10), explains why Squirrel-filtered defeats propagation despite the strongest structure–feature alignment in the suite, why featureless airport graphs reward role-aware models, and when the selector should not be trusted. No fixed default provides this.
3. On "trivial methodology behind obscure framing." We respectfully disagree. An attributed graph defines two geometries on the same node population, one from the attributes and one from the graph, and RAP asks how they align, where, and at what scale. Comparing two notions of proximity on one population is a well-studied problem, and RAP uses established tools for it, motivated and formally defined in §3 and Appendix B:
These tools come from statistics and geometry rather than mainstream GNN design, but clearly motivated, formally defined constructions are not obscure. The other reviewers found the paper clear: "the motivation is clear", "the paper is well-organised" (wzJR), "the unified analysis is useful for interpretation" (VFpu).
Nor is the method a rank correlation. Its central object is the full alignment field ASX(d)(r,s), which records where structure and features agree or conflict. The correlation is only its lossy integral (Appendix B.5), which §3.2 explicitly argues is insufficient. The simple final stage is deliberate: NNLS gives interpretable mechanism coordinates that outperform matched-dimension PCA and NMF (p=0.013), and the low-capacity predictor (§3.5) ensures that the representation carries the signal. A method cannot be both "trivial" and "over-complicated."
Finally, the presentation was first judged insufficiently careful and is now judged too heavy; the additions were made at reviewers' request. We sincerely hope the reviewer will reconsider the paper in light of its stated contribution: a general, principled diagnosis of graph-learning problems.