- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a feature-node transformation method to selectively convert discrete features into auxiliary message-passing nodes for heterophilic graph learning, building directly on the exhaustive feature-node transformation approach GRAHITE (Qiu,2026). The proposed method ranks candidate features under a node budget K using a composite heuristic score. The authors provide bounds on graph size and two-hop label agreement, and evaluate the approach across six node-classification benchmarks (4 heterophilic,2 homophilic).
Critical strengths
- The motivation behind is practical. To tackle computational overhead of exhaustive feature-node construction as in GRAPHITE is reasonable.
- The experimental results demonstrate the computational efficiency ot the proposed method. As shown in Tab.2&5, restricting the number of auxiliary feature nodes predictably reduces the number of added incidence edges, leading to lower runtime and memory consumption.
Critical weaknesses
-
Limited technical novelty. The methodological contribution is highly incremental. First, the core idea of transforming discrete features into auxiliary nodes is directly inherited from GRAPHITE, while the selection mechanism is essentially a hand-crafted linear combination of standard statistical metrics (ie., mutual info., class pair purity, log-freq., and degree cost), coupled with z-score standardization and basic empirical shrinkage. Second, the theoretical results in Proposition 1 and Theorem 1 are mathematically trivial. Proposition1 merely counts added nodes and edges, while Theorm 1 simply states that a convex combination of terms greater than is also greater than .
-
Empirical results are unconvincing and contradictory with the paper's premise. First of all, although the paper is explicitly framed around heterophilic graphs, Table 2 shows that selective construction degrades acc. across all four heterophilic datasets compared to the controlled baseline, and only marginally improve on two homophilic datasets. Moreover, the results in table 3 show the inferiority of the proposed method to GRAPHITE and standard baselines (underperforming GRPAPHITE on 5/6 benchmarks, including a massive drop from 94.78% to 86.22% ROC-AUC on Minesweeper). A more concerning drop is on the homophilic graphs, the proposed method performs noticably worse than a vanilla GCN as well as GAT and GraphSAGE.
-
The composite score looks ineffective, based on Table 4. When comparing the proposed relevance score against naive baselines under the same node budget, the proposed method fails to outperform simple heristics on 3 out of 4 heterophilic graphs. In particular, 'Random' and Mutual Info. selection outperform the proposed method on Squirrel, while simple Frequency selection outperforms selective method on two datasets. This calls into question the necessity of the multi-component scoring (Eq.13).
-
Quite superficial experimental analysis. The discussion of experiment resutls is overly brief and lacks depth. No substantive analysis of why the proposed method outperform or lags behind strong baselines, no any core claims and takeaways from Table 3. Besides, framing Table 3 as "Architecture context" does not excuse the lack of rigorous comparison and explanation for the performance drops.
Severe Reproducibility issues: There are some weird (sounds alarming) statements iregarding the experimental integrity and reproducibility n the paper, e.g., in the caption of Table 5 (Line 397), the authors state that "measurement scope and diagnostic label masks require verification", and Line 466-470 (Reproducibilit paragraph): " Exact relication remain limited by unavailable code, seeds, ..., ablation error-bar defintion are also unspecified." Furthermore, the hyperparmeters like in Eq.13 are never specified in the text.
Questions for authors
Please find the concerns in the ''weakness"
2 comments
I thank the authors for their detailed response, which addresses some of my concerns regarding the experiments. I will therefore raise my score to 2. However, I remain concerned that the paper’s technical contribution is limited.
Official Comment to Reviewer bBrw
Response to Reviewer bBrw
We thank the reviewer for the critical assessment and for acknowledging the practical motivation and measured computational reductions. We agree that the methodological novelty, empirical trade-offs, and reproducibility require clearer justification.
1. Novelty relative to GRAPHITE.
We acknowledge that feature-node transformation itself originates from GRAPHITE and that the individual statistics in Eq. (13) are established concepts. The proposed novelty is not a new mutual-information estimator, graph transformation primitive, or propagation architecture.
The distinction is the structural selection problem: given a fixed auxiliary-node budget, which features should become additional message-passing nodes, considering both predictive relevance and the number of incidences introduced?
This differs from conventional input-feature selection because all original attributes and topology remain intact. Selection controls additional connectivity rather than removing input information. Equations (2)–(3) formulate this decision, while Eqs. (9)–(13) provide a practical support-adjusted surrogate combining class association, feature-sharing agreement, coverage, and incidence cost.
We agree that this is an extension of feature-node transformation and will emphasize its specific contribution without claiming novelty for the underlying statistical components.
2. Theoretical contribution.
The reviewer correctly notes that Proposition 1 follows from incidence counting and Theorem 1 from a weighted-average identity. These results are not intended as deep learning-theoretic guarantees. They establish exact construction costs and characterize labeled two-hop path agreement after selecting a feature subset.
Their purpose is to separate what can be guaranteed structurally from what must be established empirically. In particular, neither the ranking rule nor higher path agreement guarantees improved classification. We will ensure these claims are presented at their appropriate theoretical scope.
3. Predictive performance and GRAPHITE comparison.
We agree that selective construction does not consistently improve predictive accuracy. However, Table 3 contains published architecture results rather than controlled reruns, so the published GRAPHITE values cannot isolate the effect of feature selection.
This distinction is especially important for Minesweeper. Published GRAPHITE achieves 94.78 ROC-AUC, whereas the controlled exhaustive implementation achieves 87.33 and selective construction achieves 86.22. Thus, the controlled selection-associated difference is 1.11 points, not the 8.56-point difference between the published GRAPHITE result and the selective implementation. The discrepancy between the published and controlled exhaustive results requires investigation and cannot be attributed to selection.
Similarly, Table 3 does not establish state-of-the-art predictive performance. The intended contribution is an explicit structural-budget mechanism and its measured efficiency–accuracy behavior, rather than superiority over every GNN architecture.
4. Necessity of the composite score.
We agree that Table 4 does not demonstrate universal superiority over simple heuristics. The combined score achieves the highest mean on ACTOR, but frequency or other selectors can be preferable elsewhere. Figure 2 similarly shows that individual components are not uniformly beneficial.
These findings suggest that structural relevance depends on the graph and operating budget. The combined score is a configurable mechanism rather than an empirically established universally optimal selector. Equal-incidence-cost comparisons and paired evaluations are necessary before stronger conclusions can be drawn.
5. Reproducibility and experimental integrity.
We agree that the missing implementation details are serious limitations. In particular, the score weights in Eq. (13), optimizer settings, seeds, hardware configuration, measurement definitions, and ACTOR feature-count discrepancy require verification.
The statements in Section 4.5 were included to disclose these limitations, not to imply that the experimental record had been fully verified. Nevertheless, acknowledging missing information does not substitute for providing it.
We will prioritize recovery and documentation of the original experimental configurations, correct any verified inconsistencies, and ensure that unsupported claims are not retained. The exact graph-size identities are independent of these implementation details, whereas the measured runtime, memory, and predictive results require their proper documentation.
We appreciate the reviewer's assessment of the practical problem. We hope these clarifications help distinguish the proposed structural selection contribution from inherited feature-node transformation and establish a more precise interpretation of the empirical evidence.