- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This manuscript introduces a new graph node clustering method based on the Gromov-Wasserstein (GW) framework. The study introduces trainable weight parameters related to intra-cluster relationships into an existing GW model and develops an optimization algorithm for the extended model. Furthermore, the convergence of the algorithm is theoretically analyzed. Numerical experiments using real datasets demonstrate the superior performance of the proposed method over existing baseline methods.
Critical strengths
The extension of the conventional GW model is reasonable. Additionally, the discussion on the theoretical connection among previous models is interesting.
Critical weaknesses
Although the proposed method is strongly affected by the hyper-parameters ( and of the MixGSP initialization defined in line 364), their effect is not validated in the numerical experiments. Performance results using the best hyper-parameter for each dataset do not provide a fair comparison with existing methods. Furthermore, because the initialization depends on the previous models (GWL and SpecGWL), the effectiveness of the extended parameter is not confirmed from the current experimental results.
Questions for authors
- How were the MixGSP weights ( and ) adjusted? This is essential in practice to evaluate the performance.
- Does Table 8 demonstrate that the proposed optimization does not work without manually adjusted initialization? This might indicate some mistakes in the algorithm derivation or existence of serious local minima in the parameter space.
Minor comments:
- In Figure 1(b), The locations of variables are unnatural.
- In line 149, why did you define another variable?
- The sentence in line 327-328 includes a grammatical mistake.
2 comments
No changes to scores
Thank you for your response. However, I still have concerns regarding the second point. The proposed optimization method relies heavily on the MixGSP initialization, which is a combination of existing methods. It remains unclear how the proposed optimization improves performance over this initialization. Based on the numerical results, the improvement appears to be limited.
Thank you for the constructive review and minor corrections. We address your questions below.
1. Selection of the MixGSP weights, fairness, and what is isolated (W1 & Q1)
2. Does Table 8 indicate derivation mistakes or serious local minima? (Q2)
It is the second case: there are no derivation mistakes, and the issue is uninformative local minima and stationary points—in nonconvex GW optimization, a point optimized to a local minimum (or stationary point) of the objective does not necessarily match a high-quality clustering partition.
MixGSPoff sets π0=pspt⊤. In Table 14 (Appendix I.3), our solver converges cleanly fromProductand 150 random seeds (Dir,Logit-normal,Stick-breaking) to exact stationary points with machine-zero residuals (1.6×10−16 to 4.1×10−16 on Amazon—smaller than high-AMI solutions), yet their partitions have AMI=0.000. Even among structured starts, lower Fλ need not mean higher AMI (on Wiki(dir), SpecGWL-as-π0 reaches Fλ=−7.04×10−4 with AMI 0.226, whereas Mixed+noise has Fλ=−3.11×10−4 with AMI 0.323).Spectral0.917,$k$-means++0.895 on Amazon) directly reach high-AMI solutions, and in Table 1 MixGSP selects (w,ρ) automatically via unsupervised criteria (Table 24).3. Minor comments
We fixed all three in the revised PDF: (i) repositioned d3 and padded δφ labels in Figure 1(b); (ii) removed redundant sk (Line 149) in favor of νk; and (iii) fixed the grammar at Lines 327–328.