- Rating
- 2
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes Orthogonal Consensus Graph Learning (OCG) for robust heterogeneous graph representation learning. OCG constructs multiple schema-induced relational views and an attribute-derived semantic hypergraph, followed by view-specific encoding and iterative representation refinement. Its central component is a cross-Gram regularizer that penalizes interactions between relational and semantic residuals centered at their empirical consensus. The framework further combines cross-view contrastive alignment and stochastic-path predictive consistency. Experiments on ACM, DBLP, Yelp, and MAG evaluate node classification and clustering, with additional robustness tests, ablations, and residual-geometry analyses.
Critical strengths
-
The motivation is clearly connected to a limitation of conventional cross-view alignment. Different views may agree while sharing corruption-induced errors, so simply maximizing agreement does not necessarily produce robust representations. Examining residual interactions provides a meaningful additional perspective.
-
The framework integrates relational and attribute-derived information using complementary graph constructions. Schema-specific relational graphs capture typed connectivity, while the KNN-based semantic hypergraph provides feature-space relations that may be absent from the original graph. This is a reasonable design for multiplex representation learning.
-
The empirical evaluation covers several relevant baseline families. Beyond conventional GNNs, Table 2 includes graph structure learning, robust representation learning, and multiplex graph learning methods.
Critical weaknesses
-
A central motivation is that different views may contain correlated corruption. However, Proposition 1 establishes that adding the same matrix to every view leaves the residual penalty unchanged, and Proposition 3 explicitly demonstrates that shared errors can remain arbitrarily large even when the loss is zero. This creates a gap between the motivating problem and what the regularizer can actually control.
-
In Table 2, the Macro-F1 improvements over InfoMGF are most not very significant. While the ranking is consistent, these margins are modest compared with the complexity of the proposed framework. I would encourage the author to measure whether the improvements remain consistent under matched computational budgets.
-
Table 7 shows that coupling-only regularization achieves a slightly higher mean Macro-F1 than the complete residual penalty, while spectral-only regularization produces nearly the same performance as the complete penalty. Although these differences are small relative to the three-seed variability, the results do not establish that combining both components is necessary.
-
OCG adds view-specific structure learning, iterative refinement, cross-Gram regularization, and predictive consistency on top of multi-view encoding. Table 9 shows that its ACM training step is approximately 60% slower than InfoMGF, with substantially higher peak GPU memory. I would encourage the authors to add experimental analysis on large-scale datasets.
-
There are only 4 very classical heterogeneous graph datasets used in this paper. I think that there should be more datasets, especially large-scale ones I mentioned before.
Questions for authors
Please answer my problems in Critical Weaknesses. I may rise my rating if these problems can be well addressed.