- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes CLhypformer for node classification on graph data. The model maps node features to a Lorentz space with learnable curvature, constructs hyperedges using hyperbolic KNN, and employs a topology-aware discriminator to generate a structure-preserving view and a strongly perturbed view. It combines node-level, hyperedge-level, and cross-level contrastive objectives with hyperbolic propagation in a joint optimization framework. The authors evaluate the approach through classification, structural masking, ablation, and visualization experiments to support the effectiveness of jointly modeling geometry and topology.
Critical strengths
The paper addresses consistency between the distance used to construct a hypergraph and the space used for representation learning, and attempts to connect this issue with structure-aware contrastive learning. This is a meaningful research question. The experiments combining different construction strategies and contrastive spaces are also relevant to the motivation. However, the available evidence does not establish the independent value of the proposed mechanisms.
Critical weaknesses
- The core geometric definitions are inconsistent, and the central learning mechanism is incompletely specified.
Equation (9) does not satisfy the Lorentz-manifold constraint defined in the paper. Interpreting the equation as a node-wise mapping and letting , it gives
\qquad z_s=\frac{\sinh(\sqrt{\kappa}\,r)}{r}x.$$ Consequently, $$\langle z,z\rangle_L=-\frac{1}{\kappa}+\left(1-\frac{1}{\kappa}\right)\sinh^2(\sqrt{\kappa}\,r)$$ This generally differs from the required value of $-1/\kappa$. The spatial component is missing a factor of $1/\sqrt{\kappa}$. Since curvature is learnable, this issue cannot be avoided by assuming unit curvature. For example, with $\kappa=2$ and $\|x\|=1$, the resulting Lorentz inner product is approximately $1.37224$, whereas the constraint requires $-0.5$. If the implementation follows this equation, subsequent distance computations may even fall outside the real-valued domain. Equation (8) also uses inconsistent tangent-space base points: $$\exp_x^c\left(W\log_o^c(x)+b\right).$$ According to Eqs. (6) and (7), $\log_o^c(x)$ lies in the tangent space at the origin, whereas $\exp_x^c$ requires an input in the tangent space at $x$. The paper does not explain how this condition is ensured or provide the necessary parallel transport or projection. **These are questions about whether the geometric operations are valid, not whether the notation is concise.** If they are merely errors in the equations, the authors must specify the operations actually used and explain how they correspond to the experimental implementation. The discriminator's training mechanism is likewise incomplete. Equation (10) produces importance scores, Eqs. (11) and (12) perform discrete Bernoulli sampling, and Eq. (19) includes only classification and contrastive losses. The paper neither provides a separate training objective for the discriminator nor explains how gradients through discrete sampling are handled. Ordinary hard sampling does not directly propagate downstream gradients back to the sampling probabilities. The current description therefore does not establish how the importance scores are learned effectively. Furthermore, the debiasing function, class-prior estimation, and multi-hop topology mask in Eq. (14) are not fully defined. The hyperedge-level and cross-level losses in Eq. (15) are also left unspecified. **The paper presents these mechanisms as central contributions while leaving readers to supply essential parts of the algorithm themselves.** This prevents an adequate assessment of correctness, novelty, and reproducibility. 2. **Hyperbolic graph construction directly overlaps with prior work, while the experiments do not establish the independent contribution of the remaining modules.** Section 2.3 of [Dysformer (a publicly available 2026 preprint)](https://doi.org/10.21203/rs.3.rs-8513633/v1) already describes computing hyperbolic geodesic distances, selecting $K$ nearest neighbors for each node, and constructing an incidence matrix containing $N$ hyperedges. This directly overlaps with the central construction principle in Eqs. (21)–(25). Dysformer also includes learnable curvature and hyperbolic hypergraph propagation. The paper therefore needs to explain the substantive advance of its construction mechanism over this prior work. Using the Lorentz model rather than the Poincaré model does not, by itself, establish a new neighborhood-construction principle: for corresponding points related by an isometry at the same curvature, the two models preserve geodesic distances and nearest-neighbor rankings. Parameterization can affect optimization and numerical behavior, but these differences require justification and evaluation; they do not substitute for an explanation of novelty in graph construction. The complete models are not identical, so CLhypformer may still contribute through topology-aware contrastive learning. However, critical-node-aware augmentation and multi-level contrastive learning already have directly relevant precedents in [CNHCL](https://www.ijcai.org/proceedings/2025/0631.pdf) and [TriCL](https://ojs.aaai.org/index.php/AAAI/article/download/26019/25791). The paper does not sufficiently explain the differences or establish the value of its additions through appropriate comparisons. In particular, CLhypformer− simultaneously removes the discriminator, asymmetric augmentation, and all contrastive objectives. An improvement over this variant only shows that the entire self-supervised branch is helpful. **It does not establish that learned importance scores, asymmetric views, debiasing, or the three contrastive levels are individually effective.** Ordinary random augmentation and contrastive regularization could also explain this improvement. The existing comparisons between construction strategies and contrastive spaces do not rule out this alternative explanation. Moreover, ablations conducted only on Cora do not support claims about module effectiveness across different graph structures. The experiments also present DHG-Bench as a single model, although the cited work is a benchmark containing multiple algorithms. The actual comparator is therefore not clearly identified. The robustness experiments similarly fail to distinguish the effect of topology reconstruction from the contribution of the contrastive mechanism. If the proposed model can reconstruct connections from features while a baseline must rely on a corrupted original topology, the difference between their performance curves cannot be directly attributed to the proposed robustness mechanism. **The current experiments support the performance of the complete system, but not the claimed contributions of its individual designs or the mechanisms offered to explain those results.**Questions for authors
- Do the geometric operations match the actual implementation?
Please explain how Eq. (9) satisfies the Lorentz constraint and how Eq. (8) handles tangent spaces with different base points. If the equations differ from the code, please provide the actual operations and report manifold-constraint residuals and checks of the validity of distance computations under learnable curvature.
- How are the topology-aware discriminator and debiased objective trained?
Please specify the discriminator's optimization objective, parameter-update procedure, and treatment of gradients through the discrete sampling in Eqs. (11) and (12). Please fully define , class-prior estimation, , , and . Without these definitions, it is not possible to determine whether the implementation supports the stated contributions.
- What minimal ablations establish the independent value of the added modules?
Please provide at least the following comparisons using the same backbone, comparable training budgets, and consistent loss normalization:
-
The gains exceed those of ordinary contrastive regularization: Compare supervised training only, random augmentation with standard contrastive learning, and the full model. Keep the contrastive levels and training conditions comparable.
-
The importance scores contain useful structural information: Compare learned , scores shuffled among existing associations, and uniform random association removal. Preserve or match the perturbation budget for each hyperedge to avoid attributing differences in removal rates to importance learning.
-
Asymmetric views are necessary: Compare preservation/preservation, preservation/strong perturbation, and random/random view pairs, with matched actual average removal rates for the respective views.
-
The topology mask and debiasing each contribute: Compare standard contrastive learning, topology masking only, debiasing only, and both components together, with all other components fixed.
-
The three contrastive levels are complementary: Compare node only, node plus hyperedge, node plus cross-level, and all three objectives, with controlled loss scales and tuning budgets.
These core ablations should cover at least three datasets with different structural characteristics, using consistent splits and repeated runs. The relevant question is whether removing a specific mechanism consistently removes its claimed benefit, rather than merely whether removing the entire self-supervised branch reduces performance.
- Does the advantage of hyperbolic graph construction depend on a particular neighborhood size K?
Please analyze sensitivity to in Eqs. (22) and (23), for example using , and include the actual default value.
Compare hyperbolic KNN and Euclidean KNN simultaneously under the same , backbone, and tuning budget, and report classification performance, variability, and construction cost.
This experiment should establish whether hyperbolic construction remains effective across a reasonable range of neighborhood sizes or whether its advantage is confined to one particular setting. A curve showing only the full model's performance as changes does not establish the independent benefit of the geometric choice.
- Does the proposed contrastive mechanism outperform ordinary contrastive learning across a reasonable range of loss weights?
Please analyze sensitivity to in Eq. (19), for example using , and include the actual default value.
With loss normalization, graph construction, and other settings held fixed, compare the proposed contrastive branch against a branch using ordinary random augmentation and standard contrastive learning. Use the same validation-based tuning budget and report the relative magnitudes of the supervised and weighted contrastive terms.
The key question is not whether a positive contrastive loss weight outperforms a zero weight, but whether the proposed design outperforms ordinary contrastive learning under comparable tuning conditions. If a standard contrastive objective achieves the same performance with equal tuning, the necessity of the additional mechanisms remains unestablished.
- Do the technical contribution and robustness gains hold against directly relevant alternatives?
Please clarify the methodological differences from Dysformer, CNHCL, and TriCL, and provide direct comparisons under consistent data splits, comparable supervision, and training budgets. Please also identify the specific algorithm represented by “DHG-Bench.”
For structural masking, please specify whether masking is applied to the original graph, the reconstructed hypergraph, or the augmented views, and whether all methods have the same opportunity to reconstruct topology. Comparing the full model, CLhypformer−, and an ordinary contrastive-learning baseline under the same reconstruction conditions is necessary to determine whether the robustness gains arise from the proposed mechanism.