- Rating
- 4
- Confidence
- 1
- Informativeness
- 3
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
This paper studies hyperbolic graph contrastive learning, especially focusing on spreading. Different from previous papers, the authors claimed that intrinsic construction is better than wrapped construction, since the former is directly specified in hyperbolic space. Furthermore, they discovered a critical intrinsic regime, a balance between and , and only can guarantee that the optimized embeddings are normalizable. This critical value is more accurate than former wrapped construction.
Critical strengths
- This paper studies a key problem in hyperbolic graph contrastive learning, how to avoid embedding spreading in hyperbolic space.
- The paper is strongly supported by theory.
Critical weaknesses
- In the main experiments, the selected datasets may not present obvious tree-like structure, so the brought improvement looks not significant.
Questions for authors
- The main motivation is to avoid unconstrained spreading in hyperbolic space. However, we also use alignment loss in GCL, which may cancels out a part of spreading. Could you further illurstate if this unconstrained spreading is severe in real case?
- One step is to find KNN in hyperbolic space, which is a time-consuming operation. Why not directly use the original edges to find neighbors?
- To further prove the usefulness of hyperbolic space, a variant could choose Euclidean space with the same other components (e.g., encoder, augmentations, objectives).
3 comments
Thanks for the authors' replies. I will keep my positive score.
We sincerely thank the reviewer for their careful consideration of our responses and positive assessment of the revised manuscript.
Thank you for the encouraging assessment and for raising these useful questions. We agree that the distinction between the geometric argument and what happens during training deserves a clearer explanation. We address each point below, including a focused control for the role of hyperbolic geometry.
W1 : Applicability beyond tree-like graphs. The confinement threshold comes from volume growth in hyperbolic space, not from assuming that the input graph is a tree. Our benchmarks include Disease, a tree with 1,044 nodes and 1,043 edges, and Airport, which contains cycles. Table 6 provides a direct test of what intrinsic spreading contributes when the hyperbolic encoder and the rest of the training setup are unchanged:
The gains are 2.92, 3.10, and 3.16 percentage points, respectively. The improvement on Airport is particularly relevant here: the benefit is not limited to a tree input. Of course, cycles do not rule out latent hierarchical structure. The comparison establishes the value of spreading within a hyperbolic model; Q3 addresses the separate question of whether hyperbolic geometry itself helps.
Q1 : Why alignment does not prevent radial escape. Alignment asks two views of the same node to agree. It says nothing about how far their common representation lies from the center: even two identical embeddings at a very large radius incur zero alignment loss. Proposition 3(iii) captures this distinction. At fixed curvature, alignment does not change the condition β>(d−1)√κ for the unclipped finite-sample objective. This is not a claim that a clipped SGD trajectory literally diverges.
We can also see the radial effect in trained models. Table 10 keeps alignment active and varies confinement. On Disease at (d,κ)=(256,2), increasing χ from 0.90 to 1.10 reduces the terminal 95th-percentile radius, normalized by the clipping radius, from 1.000 to 0.406 when measured from the origin, and from 0.637 to 0.156 when measured from the learned center. The latter is useful because clipping about the origin does not directly fix distances from that center. At (64,1), the origin-referenced value also decreases, from 0.516 to 0.356, although more gradually. Thus alignment does not remove the radial-scale effect, and we do not suggest that every geometry exhibits an abrupt training transition.
Q2 : Why embedding-space kNN instead of graph neighbors. These neighborhoods serve different purposes. Graph edges define which nodes exchange messages. The kNN distances in Eq. (7), by contrast, estimate local density in the learned representation distribution for the Kozachenko–Leonenko entropy term. A graph neighbor need not be among a node's nearest neighbors in representation space; substituting adjacency distances would therefore change the estimator, not simply speed it up.
The implementation also avoids a full-graph hyperbolic-geodesic neighbor search. Algorithm 1 log-maps a sample to the tangent space at a common center and computes Euclidean kNN spacings within that sample. With at most M=2,048 embeddings, exact pairwise distances cost O(M²d) time and O(M²) distance storage. We will make this sampling step and its computational overhead clearer in the paper.
Q3 : Matched Euclidean control on Airport. We agree that the Euclidean baselines in Table 1 cannot isolate geometry because several other components differ. We therefore added a targeted comparison on Airport, keeping the data splits, encoder capacity, augmentations, optimizer, training and evaluation budgets, linear probe, and random seeds matched. The Euclidean version uses squared-distance alignment and kNN entropy without the hyperbolic volume-Jacobian term. Its confinement strength is tuned separately with the same validation budget; simply taking κ→0 in the hyperbolic formula would remove confinement and make the comparison unfair.
The hyperbolic variant performs better in this controlled Airport comparison. We view that as evidence for the usefulness of the geometry on this benchmark, not as proof of statistical significance or a universal advantage on all graphs. Our theoretical contribution is more specific: it identifies the intrinsic entropy formulation and critical normalizability threshold in hyperbolic space. In the revision, we will also separate the population argument, finite-sample objective, and behavior of clipped training more clearly.