- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes COST-GED, a way to train GELATO without using exact GED labels for the training pairs. starts with a feasible node matching for each pair. During training, the model generates new matchings by global sampling and local reconstruction. A new matching becomes the training target only when its edit cost is lower than the current one. The paper evaluates this method on six small-graph benchmarks and two larger MolHIV benchmarks. It reports results close to supervised GELATO on several small datasets and lower matching costs than IPFP on the larger graphs.
Critical strengths
-
main idea is simple and practical. The edit cost of a feasible matching can be computed without knowing the exact GED. Using this cost to check proposed training labels is a reasonable way to train a matching model with less supervision.
-
Figure 2 shows that the gap between the training pool’s pseudo-matching costs and exact GED becomes less than 1% after 25 cycles on the three datasets shown. This is useful evidence that the training labels improve during the process.
-
The larger MolHIV experiments are relevant because exact GED labels are harder to obtain there. The reported matching costs are about 17% and 19% lower than IPFP on the two datasets. These are meaningful improvements (although the comparison is limited to traditional baselines).
Critical weaknesses
-
I find the methodological novelty limited. The solver architecture, construction of training subproblems, and loss come from GELATO (Pellizzoni et al., ICLR 2026). Sampling several solutions, keeping a better one, and learning from it is also close to earlier self-improvement work in neural combinatorial optimization, including Pirnay and Grimm (TMLR 2024). The paper should clarify its methodological contributions beyond these established techniques.
-
The comparison with supervised GELATO is difficult to interpret. GELATO is trained on 5,000 labeled pairs, while COST-GED regularly refreshes its active pool and can see many more pairs over training. For Code2-22, its result with a 40,000-pair active pool is compared with GELATO trained on 5,000 pairs. At test time, COST-GED uses 32 paths in each of eight decoding rounds, but GELATO’s corresponding inference budget is not stated. Can you add more analyssis and discussion about this result.
-
In Table 1(b): Its GEDRanker row agrees with the original paper on several AIDS values, but the original paper reports LINUX MAE of 0.01 rather than 0.000, and IMDB accuracy and τ of 94% and 0.97 rather than 84.0% and 0.990. The time values also seem to be shown in milliseconds, although the column says seconds. Please review and justifiy the reason for the differences.
-
The ablations do not isolate several important choices. There is no plain best-of-K self-training variant without the incumbent and strict acceptance rule, no local-only variant, and no separate experiment on pool refresh. Table 3 suggests that the training setup has a large effect, , but it is still unclear how much pool refresh contributes. Adding these comparisons would be helpful.
Questions for authors
Please see above weaknesses.
2 comments
I would like to thank the authors for the response. The concerns about the novelty has been addressed. However, I still noticed that the concerns about the settings of training GELATO and the proposed COST-GED has not been addressed in the proposed paper. Meanwhile, the response states that 16 rounds are used in this experiment, however, in the original paper, only 8 rounds are used as the budget. The reason for this difference is not justified. As for the difference between the performance of GEDRanker, I would like to know the details of the reproduction. Since the reported accuracy is lower and τ is higher, more justification is required.
Therefore, at this stage, I would like to maintain my score.
Response to Reviewer KEmN
We thank the reviewer for recognizing the practical value of COST-GED and for the constructive comments. We address the four concerns below.
W1. Methodological novelty We acknowledge that COST-GED builds on GELATO's autoregressive architecture and is inspired by self-improvement methods such as Pirnay and Grimm and SIL. However, these methods cannot be directly transferred to GED. SIL reconstructs route segments, whereas GED solutions are node correspondences: replacing some correspondences can violate injectivity and change edge-edit costs outside the modified region. We therefore design reference-guided local correspondence replacement, conflict repair, and full edit-cost validation, combined with global sampling and autoregressive pseudo-matching feedback. GEDRanker also updates cost-based incumbents, but its main method uses a preference discriminator to guide a diffusion generator; COST-GED instead directly trains an autoregressive matcher on improved feasible matchings. Our contribution lies in this GED-specific candidate-improvement and feedback-learning design, not in claiming self-improvement itself as new.
W2. Comparison with supervised GELATO COST-GED achieves 89.9% EHR on Code2-22 with a 5K active pool of unlabeled graph pairs, rising to 95.8% with 40K. GELATO's original Code2-22 main training configuration uses 100K supervised pairs and reports 95.7% EHR. We will verify and correct the training-scale attribution in our paper. Pool refresh resamples pairings within a fixed training-graph split; it adds no external graphs, but the number of distinct pairs encountered over training may exceed the active pool size. We therefore do not claim equal cumulative data budgets. To control inference, we evaluated COST-GED and supervised GELATO on the same test pairs, with identical node-label Hungarian initialization, K=32, and 16 rounds of the same Global–Local search:
W3. GEDRanker results and timing units The GEDRanker entries in Table 1(b) come from our local reproduction rather than being copied entirely from the original paper, and the accuracy discrepancies are within the normal range. However, I agree that we should verify the metric definitions and correct the runtime units.
W4. Ablations Our ablations target two central mechanisms: pseudo-matching feedback and Global–Local candidate improvement. With refresh disabled, Updated-Label substantially outperforms Fixed-Label (Table 3); the additional matched-training-progress experiment above further supports this conclusion. Under the same neural decoding-path budget, adding local reconstruction to global sampling improves EHR by 0.6 and 1.4 percentage points on ZINC-16 and Code2-22, respectively. We agree that best-of-K without incumbent retention, local-only search, and an isolated refresh-on/off comparison would provide finer attribution. These variants have not been separately evaluated, so we do not claim that every component is indispensable. The reported ablations nevertheless support the effectiveness of the two mechanisms central to our method.