- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper attempts to solve the problem of fixed allocation of synthetic nodes across classes based on class frequencies in graph condensation, which can lead to inefficient budget utilization. The authors propose two adaptive allocation methods, AUA and LUA, to dynamically allocate nodes based on the actual needs of different regions, thereby improving the effectiveness and efficiency of graph condensation.
Critical strengths
- The authors propose a new approach of dynamically allocating synthetic nodes based on actual needs, rather than fixed allocation based on class sizes.
- The AUA method performs graph condensation much faster than the compared methods, and the classification performance is also competitive.
- The LUA method further improves graph condensation performance while remaining relatively fast, showing good performance across different neural network architectures.
Critical weaknesses
- The methodological novelty is limited, as CGC (WWW 2025) already explored class-wise clustering for graph condensation, while C2TC (ICDE 2026) introduced adaptive allocation of condensed samples across classes.
- There is a lack of direct evidence to prove that the regions selected by the algorithm can indeed bring better classification results.
- Some experimental results are not as good as those of existing methods, some have small improvements, and the gains lack statistical testing.
- It has only been tested in the authors' own graph condensation process and has not yet been proven to be applicable to other graph condensation methods.
Questions for authors
- Can you provide direct evidence to prove that the regions prioritized by the algorithm can indeed bring greater classification benefits?
- Can statistical significance tests be provided to demonstrate the reliability of small performance improvements? How do you explain the fact that some results are not as good as those of existing methods?
- Can AUA and LUA be combined with other graph condensation methods such as GCond and SimGC while maintaining performance advantages? Is there experimental support?
2 comments
W3 & Q2. Statistical Reliability and Comparisons with Existing Methods.
We acknowledge that some performance improvements are modest and that our methods do not outperform every existing approach across all settings.
Our primary contribution is to investigate adaptive synthetic-budget allocation as an additional design dimension in graph condensation. This perspective also yields strong empirical competitiveness, particularly on the larger benchmarks. AUA provides an efficient alternative with competitive accuracy, while LUA further improves performance through task-grounded refinement.
Regarding statistical reliability, the main experiments report means and standard deviations over five runs. We further examined paired accuracy differences using the Random@Top-8 control, which shares LUA's candidate proposal mechanism and condensation pipeline.
Table Z2. Paired LUA–Random@Top-8 comparisons over five runs. Differences are in percentage points. The reported p-values are approximate, uncorrected two-sided paired t-test results computed from the rounded paired-difference summaries.
| Dataset | LUA–Random (pp) | Positive runs | Approx. p-value |
|---|---|---|---|
| Flickr | +.40 ± .19 | 5/5 | .009 |
| +.30 ± .21 | 4/5 | .033 | |
| ogbn-products | +.10 ± .28 | 3/5 | .469 |
The paired comparisons provide additional evidence for the benefits of learned refinement, particularly on Flickr and Reddit. On ogbn-products, the incremental gains from learned reranking are smaller in these controlled settings, while the complete LUA framework still achieves the best performance across all three condensation ratios in Table 1. We interpret small paired differences cautiously, without extending statistical significance claims to comparisons with external baselines.
For Cora and Citeseer, the standard public splits contain only 20 labeled training nodes per class, making frequency-based and uniform allocations effectively equivalent. Together with the limited synthetic budgets, this reduces the opportunities for beneficial cross-class redistribution and may partly explain the smaller gains on these datasets.
Overall, the controlled allocation experiments, candidate-level evaluations, and paired comparisons support the effectiveness of adaptive refinement, particularly on larger graphs with heterogeneous representational demands, while indicating where its benefits remain modest.
W4 & Q3. Generalizability to Other Condensation Methods.
We appreciate this suggestion and share the reviewer's interest in extending adaptive allocation across different graph condensation frameworks. This was also a direction we considered during the initial design.
Such integration requires additional consideration because condensation methods differ in their objectives and in how synthetic node attributes and graph structures are generated. From a black-box perspective, evaluating alternative allocations would require repeated condensation and downstream evaluation, potentially introducing substantial overhead. From a white-box perspective, integrating refinement decisions requires method-specific adaptation to the underlying feature and topology optimization processes.
Consequently, allocation transfer across heterogeneous condensation pipelines involves more than replacing a predefined class-wise budget.
Our present experiments establish the effectiveness of adaptive allocation within a controlled condensation pipeline (Table 5), while the cross-architecture evaluations (Table 3) support transferability across downstream GNNs. These results do not establish direct integration gains for GCond or SimGC, which remains an important limitation and a promising direction for future investigation.
We thank the reviewer again for the constructive suggestions. We hope the additional downstream-utility analysis, controlled comparisons, and discussion of empirical scope help clarify the contributions and limitations of our approach. We have also incorporated relevant clarifications and additional empirical evidence into the revised manuscript, particularly regarding the distinction from existing methods and the alignment with downstream GNN improvements.
Author Response to Reviewer
We thank the reviewer for the constructive feedback and for recognizing the motivation behind adaptive budget allocation, AUA's efficiency, and LUA's competitive performance. We appreciate the concerns regarding methodological novelty, downstream benefits, statistical reliability, and generalizability. We address them below, drawing on additional controlled experiments and candidate-level analyses.
W1. Novelty Relative to CGC and C2TC.
We appreciate the reviewer highlighting these closely related studies. CGC advances efficient graph condensation through class-partitioned distribution matching, while C2TC jointly optimizes class-adaptive cluster allocation and clustering quality for tabular condensation.
Our work investigates a more fine-grained allocation formulation: which currently represented region should receive the next unit of synthetic-node capacity? Each refinement adds one synthetic node, allowing class-wise budgets to emerge from sequential region-level decisions.
Within this formulation, AUA estimates refinement utility through reductions in class-normalized representation and semantic residuals, with an explicit global-potential interpretation. LUA further learns task-grounded refinement preferences to improve alignment with downstream predictive gains.
The controlled experiments provide evidence for both aspects of this design. Under the same splitter and condensation pipeline, Table 5 shows that AUA improves over the stronger static allocation on four of six benchmarks, including +3.6 percentage points on Flickr and +1.4 on ogbn-arxiv. Furthermore, compared with random selection from the same AUA Top-8 proposal pool, LUA achieves paired improvements of +0.40 ± 0.19, +0.30 ± 0.21, and +0.10 ± 0.28 points on Flickr, Reddit, and ogbn-products, respectively.
These results support the value of both utility-guided budget allocation and learned regional refinement preferences.
W2 & Q1. Do Prioritized Regions Yield Greater Downstream Classification Benefits?
We agree that reductions in analytic residuals or proxy losses do not necessarily translate into downstream GNN improvements.
We therefore conducted an additional candidate-level analysis on Flickr, Reddit, and ogbn-products. For each dataset, we evaluated eight refinement states with eight candidate refinements per state, using five paired student seeds. We compared the rankings produced by AUA, the ridge probe, and LUA against actual marginal accuracy improvements under GCN and SGC.
Table Z1. Alignment with actual downstream GNN marginal gains. Spearman correlations are averaged over eight refinement states. Selected gains represent average one-step accuracy improvements in percentage points (pp). Each entry compares AUA → LUA.
LUA achieves stronger ranking alignment than AUA across all six dataset–architecture settings, and its selected refinements consistently yield larger average GNN marginal gains. LUA also exceeds the ridge probe in five of six settings.
These findings provide direct empirical support that the proposed refinement criteria identify regions with greater downstream predictive benefits. While the correlations are moderate and vary across datasets, they establish positive alignment between estimated refinement utility and observed GNN improvements.
Importantly, actual GNN marginal gains are used exclusively for offline diagnostic evaluation, not for training LUA or determining allocation decisions.