- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2(−1)
- Soundness
- 2(+1)
Read review
Paper summary
The paper proposes HiKGR, a hierarchical invariant semantic learning framework for inductive knowledge graph reasoning with unseen entities. HiKGR aims to reduce reliance on environment-specific spurious correlations introduced by indiscriminate GNN message passing. Across three real-world benchmarks comprising 12 entity-disjoint inductive settings, HiKGR is reported to improve MRR, Hits@1, and Hits@10 over prior rule-based and message-passing-based methods. The paper has an interesting intuition, but its empirical positioning is currently incomplete, and its invariance claims are overstated. A stronger comparison with recent inductive KGC methods and a serious discussion or evaluation against foundation models are necessary before the claimed contribution can be properly assessed.
Critical strengths
S1 The paper addresses an important limitation of inductive knowledge graph reasoning: GNN-based models may capture environment-specific structural correlations that do not generalize to unseen entities.
S2 The hierarchical invariant learning mechanism provides a concrete way to model cross-environment semantics at the relation, entity-path, and query-subgraph levels.
S3 This paper is easy to follow.
Critical weaknesses
W1 The paper should more clearly distinguish HiKGR from existing graph augmentation, multi-environment learning, consistency regularization, and invariant-learning methods. At present, the proposed environment generator plus cross-environment consistency objective appears conceptually close to learning robustness against self-generated structural perturbations.
W2 The connection between the stated objective and the implemented relation-level, entity-level, and subgraph-level losses is unclear. The paper does not provide a derivation showing that these losses optimize a meaningful bound or surrogate of the claimed information-theoretic objective.
W3 The mask-density constraint may preserve graph size or sparsity, but it does not ensure that essential facts, relation semantics, connectivity patterns, or reasoning paths are preserved. In particular, dropping edges can easily eliminate the only evidence supporting a query, while retaining density alone does not prevent semantically implausible environments. This raises the concern that the model may learn invariance to arbitrary graph corruption rather than invariant KG semantics.
W4 The paper repeatedly refers to “spurious correlations,” “stable semantics,” and invariant knowledge, but no causal assumptions or real environment shifts are specified. Besides, the paper uses “generalization,” “extrapolation,” “inductive reasoning,” and OOD robustness in a somewhat interchangeable manner. These are not equivalent notions. The task seems primarily to be inductive knowledge graph completion/link prediction over unseen entities, rather than general KG reasoning or broad extrapolation.
W5 The comparison set does not adequately reflect recent work on transferable relation structures and cross-graph generalization. It is not sufficiently clear whether all baselines use identical inductive splits, candidate entity sets, filtered-ranking protocols, hyperparameter budgets, training epochs, and official implementations.
Questions for authors
Main question pls see weakness.
Q1 If only compared in the transductive setting, ULTRA cannot be regarded as direct support for the claim regarding "related work in Inductive knowledge graph reasoning".
Q2 The first sentence of the conclusion is obviously repetitive. And pls double check Table 5, dataset name and details are wrong.
Thank you for the additional analyses. The new results address most of my empirical concerns. Some limitations remain regarding the theoretical justification and the assumptions underlying the generalization analysis. I therefore keep my original score of 2.