acceptodds
Under review as a conference paper at ICLR 2027

When Should We Admit Generated Nodes? Utility-Guided Few-Shot Learning on Text-Attributed Graphs

Abstract

Generated nodes offer a promising way to augment limited supervision in text-attributed graphs but their usefulness depends on whether they improve learning rather than merely appear plausible. We study this problem as selective synthetic-node admission where accepting a candidate determines both its use as supervision and its participation in message passing. We introduce CSNA which ranks candidates using semantic and structural signals learned from validation-derived utility, retains a selected top fraction and removes rejected nodes together with their attachment edges. Across Cora and PubMed, CSNA outperforms admit-all across all 1/2/5/10-shot settings, with one-shot accuracy gains of 6.38 and 5.33 percentage points, respectively. Under 40% synthetic-label corruption, the Cora one-shot gain reaches 17.80 points. Together, these results show that the value of synthetic augmentation lies not only in what is generated, but in what is ultimately admitted.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
Few-shot node classification, text-attributed graphs, synthetic graph augmentation, selective synthetic-node admission, utility-guided data selection, graph neural networks, label-noise robustness

Reviews

Among:
Shape:
1234this paper, Bottom 1%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 1.00 over 3 reviews, above 0% of the others.
Reviewer_R1y5OpenReview ↗
Rating
1
Confidence
4
Informativeness
2
Presentation
1
Soundness
1
Read review
Paper summary

This work presents CSNA, a utility-guided framework for selecting synthetic nodes to boost few-shot node classification on text-attributed graphs. Existing methods add generated nodes to mitigate label shortage, yet these nodes may carry wrong labels, redundant content or spurious links and hurt model performance. CSNA extracts semantic and structural features for each candidate synthetic node, evaluates node utility via leave-one-in validation, and uses logistic regression to score node usefulness. It keeps high-value synthetic nodes and deletes low-quality ones together with their edges. Different from common loss reweighting, this hard-selection mechanism impacts both supervised training and graph message passing.

Critical strengths
  1. The paper addresses an important and practically relevant problem in graph data augmentation: determining whether a generated node should be included in the training graph. The distinction between loss reweighting and structural admission is well motivated, since generated nodes influence both supervision and message passing. This perspective provides a useful extension to existing synthetic-node generation frameworks.

  2. The authors acknowledge several important limitations, including the dependence on additional labeled validation data, computational overhead, moderate utility-prediction generalization, and potential class imbalance introduced by global selection. This discussion helps clarify the conditions under which the proposed method is most effective.

Critical weaknesses
  1. The presentation of the proposed method could be improved in terms of clarity and readability. The authors place the complete pseudocode of Algorithm 1 in Appendix C, while repeatedly referring to specific line numbers of this algorithm throughout Section 4.

  2. Although the student model is trained using only a few labeled support nodes per class, the proposed framework additionally relies on 500 labeled validation examples for utility estimation, admission-policy selection, and early stopping. Consequently, the setting is better characterized as validation-assisted few-shot learning rather than learning under a strictly limited annotation budget, as the authors acknowledge. This distinction is particularly important because the admission mechanism directly depends on the additional labeled validation data.

    I consider this one of the most critical concerns of the paper, as it fundamentally raises questions about the practical motivation and necessity of the proposed framework. If 500 additional labeled nodes are already available, a natural alternative would be to directly incorporate these labels into supervised training or leverage them through existing semi-supervised learning approaches, rather than using them to guide synthetic-node admission. However, the paper does not provide comparisons against such alternatives under the same total annotation budget. Therefore, it remains unclear whether the proposed framework offers meaningful advantages over simply utilizing the available real labeled data. Without such comparisons, the practical value of the proposed method in genuinely label-scarce scenarios is not sufficiently justified.

  3. The experimental results do not convincingly demonstrate that the learned utility-guided ranking is essential to the observed improvements. In the matched feature ablations, removing individual features frequently produces comparable or even better performance. Some simpler variants, such as structure-only and utility-only selection, also outperform the full model in certain settings.

  4. Insufficient comparisons with existing methods. The experimental evaluation lacks comparisons with existing few-shot node classification methods and relevant graph augmentation approaches. Although the authors include several baselines in Section 7.2, these mainly consist of simple selection strategies, robust loss functions, and the admit-all baseline. Comparisons with established methods from the literature are largely missing, making it difficult to assess the competitiveness of CSNA against existing approaches. Moreover, given the substantial amount of additional labeled validation data used by CSNA, it is important to ensure that competing methods are evaluated under a consistent annotation budget and experimental protocol. The authors should include stronger baselines from existing few-shot graph learning and synthetic graph augmentation methods to better demonstrate the effectiveness of the proposed approach.

  5. The reported held-out utility-prediction AUROC is only 0.675±0.1620.675\pm0.162, suggesting moderate predictive performance and substantial variation across random seeds.

  6. A central motivation of the paper is that rejecting synthetic nodes should remove both their supervision and their influence on message passing. However, the current experimental comparisons do not fully isolate these two effects. In particular, the soft-weighting baselines involve different weighting or calibration mechanisms, making it difficult to attribute performance differences exclusively to structural removal. A more convincing experiment would use the same candidate ranking and supervision weights while varying only whether rejected nodes remain in the graph. Such a controlled comparison would directly validate the claimed advantage of hard admission over loss-only filtering.

  7. The proposed method introduces several design choices and hyperparameters whose effects are not sufficiently investigated. For example, in Section 4.2 (Equation 4), the authors estimate candidate utility by averaging the validation accuracy differences over three random initializations. Although this is intended to reduce randomness, the choice of exactly three initializations is not justified, and it remains unclear whether the resulting utility estimates and candidate rankings are sufficiently stable. Furthermore, the framework involves multiple hyperparameters, including the retention ratio, attachment budget, neighborhood size, and parameters associated with utility estimation.

  8. The effectiveness of synthetic-node admission is inherently related to the quality and characteristics of the generated candidates. Different generation strategies may produce synthetic nodes with varying semantic consistency, diversity, label reliability, and structural compatibility, which can directly affect both the learned utility scores and the final admission decisions.

Questions for authors

See weaknesses section for detailed questions.

Reviewer_vHrCOpenReview ↗
Rating
1
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

The paper studies synthetic node augmentation in text-attributed graphs (TAGs). The authors argue that indiscriminately admitting generated nodes harms message passing and supervision. They propose CSNA, which extracts four heuristic features (semantic, agreement, edge prediction, and graph agreement), labels candidate utility via leave-one-in validation probes, fits an ℓ2\ell_2-regularized logistic regression, and retains the top-ρ\rho synthetic nodes while physically pruning rejected nodes and edges.

Critical strengths

The manuscript is unusually transparent regarding negative results, including failure on ogbn-arxiv and the breakdown of advantages at higher shots.

The conceptual separation between hard topological pruning (blocking message passing) and soft loss-weighting is well-motivated.

Critical weaknesses

While the training support is restricted to K∈{1,2}K \in \{1, 2\} per class (∣S∣=7|S|=7 on Cora), the pipeline quietly consumes a massive disjoint pool of \textbf{500 clean validation labels} to supervise probe models and tune thresholds. As shown in Table 18, once the validation budget is reduced to a realistic low-shot scale (nval≤25n_{\text{val}} \le 25), CSNA collapses and is beaten by naive admit-all. Calling this setup ''few-shot learning'' is practically disingenuous.

As demonstrated in Table 2, CSNA's advantage is restricted entirely to extreme low-shot (K=1K=1). At K≥2K \ge 2, trivial heuristics like \textbf{Random Retention} or standard \textbf{GCE / Co-teaching} consistently match or outperform CSNA (e.g., GCE is +1.17+1.17 ahead at Cora K=5K=5; Random is +0.64+0.64 ahead at Cora K=2K=2). A computationally heavy pipeline that loses to random selection at K=2K=2 lacks broad practical utility.

In Table 15, a single global threshold starves rare classes: CSNA admits 82.8% of frequent-class candidates but only 32.6% of rare-class candidates, leaving 39.2% of rare classes with zero synthetic nodes. Consequently, rare-class recall drops by \textbf{−12.36-12.36 pp} and overall \textbf{macro-F1 degrades} (−1.28-1.28 at K=1K=1). The method severely undermines tail classes—defeating the original purpose of data augmentation.

As the authors concede in lines 316--318, when ∣S∣≤k=10|S| \le k=10, qgraph(i)≡1/Cq_{\text{graph}}(i) \equiv 1/C is a constant. Thus, at the critical K=1K=1 regime, this key feature is mathematically vacuous. Furthermore, Appendix B's analytical statements are largely trivial: Proposition 3 merely states that the sigmoid function is strictly monotonic, and Proposition 4 is a standard Lipschitz forward-pass bound that ignores GNN optimization dynamics.

Submitting an experimental paper while openly acknowledging that configurations, splits, and code cannot be reproduced directly violates ICLR standards.

Questions for authors

How do the authors justify the methodological fairness of using 500 labeled validation nodes under a benchmark explicitly labeled as ''few-shot'' (K∈{1,2}K \in \{1, 2\})?

Did you test a class-conditional / stratified retention policy (e.g., top-ρ\rho per class) on \texttt{ogbn-arxiv}? Can it rescue the severe drop in Macro-F1 and tail recall without tanking overall accuracy?

Given the leave-one-in probe cost O(3NsCprobe)\mathcal{O}(3 N_s C_{\text{probe}}) and the fact that random retention beats CSNA at K≥2K \ge 2, what is the tangible practical deployment scenario for this pipeline?

Reviewer_JsgdOpenReview ↗
Rating
1
Confidence
3
Informativeness
1
Presentation
1
Soundness
1
Read review
Paper summary

This paper proposes CSNA, a generated node admission mechanism that ranks candidate nodes for hard admission based on validation-derived utility. Experiments have been conducted on four scholarly datasets to verify the effectiveness of CSNA.

Critical strengths

S1. Identifying the usefulness of generated nodes is an interesting and relevant problem for few-shot node classification.

Critical weaknesses

W1. The organization and presentation of this paper are suboptimal. For instance, the procedural steps of CSNA are not clearly described in Section 4. Specifically, the authors reference Algorithm 1 to explain their method, yet the algorithm itself is only provided in the Appendix.

W2. The theoretical analysis of the proposed method presented in Section 5 is insufficient and lacks significance.

W3. The experiments are limited to a small number of scholarly datasets, which makes the results unconvincing.

Questions for authors

Please address the weaknesses in your rebuttal.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.