- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes BARGO, a graph oversampling method that generates minority nodes along geodesics in a Riemannian latent space. It combines reliable seed selection, endpoint and path screening, and a topology generator for synthetic nodes. Experiments on six artificially imbalanced benchmarks report consistent improvements over loss-reweighting and graph-oversampling baselines.
Critical strengths
-
BARGO considers representation synthesis, boundary crossing, and synthetic-node topology together rather than treating generated nodes as independent feature vectors.
-
The evaluation includes loss-modifying, oversampling, generative, and topology-augmentation methods across six datasets and reports means and standard deviations over ten runs.
-
BARGO achieves the best reported mean results across both long-tailed and step-imbalance settings, and the component ablations indicate that reliable sampling, screening, and topology coordination are useful.
Critical weaknesses
-
The central Riemannian contribution is not isolated. The paper does not compare BARGO with an otherwise identical Euclidean version that retains the same seed selection, endpoint/path screening, oversampling amount, and topology generator. The ablations remove screening or topology modules, but none replaces the Lorentz encoder and geodesic interpolation with a Euclidean encoder and linear interpolation. Therefore, the reported gains cannot be attributed to Riemannian geometry, despite this being the main claim and title of the paper.
-
The experimental protocol is incomplete and internally inconsistent. The paper does not report the train/validation/test splits, labeled samples per class, hyperparameter selection procedure, manifold curvature, or most thresholds used in Equations (10)–(23). Section 4.1 also claims that Appendix A.1 contains experiments on three naturally imbalanced datasets, but the appendix provides no such experiments. In addition, the appendix refers to the proposed method as “GraphCALH” and leaves the CB Loss citation unresolved. These omissions prevent reliable reproduction and weaken the claimed generalization beyond manually imbalanced benchmarks.
Questions for authors
-
How does BARGO compare with a matched Euclidean model that uses the same screening and topology modules but replaces geodesics with linear interpolation?
-
What fraction of Euclidean and Riemannian interpolation paths violate the endpoint or path criteria, and how often does BARGO shorten or reject a candidate?
-
Can the authors report endpoint-only and path-only screening ablations? The current joint removal does not establish the additional value of checking intermediate geodesic points.
-
What are the exact data splits, manifold curvature, threshold values, and tuning protocol, and where are the promised experiments on naturally imbalanced datasets?
Thank you for the response, which addresses most of my concerns. However, the response to Question 2 does not match the original question: it compares only different datasets, without separately reporting violation rates for Euclidean versus Riemannian paths or for endpoint versus path criteria, and without distinguishing path shortening from candidate rejection. Therefore, the current results do not establish that Riemannian paths are more reliable than Euclidean paths and are insufficient to raise my rating to weak acceptance.