- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper proposes a general abstract framework that unifies several existing symmetric spaces, including hyperbolic spaces, symmetric positive definite (SPD) spaces, and Siegel spaces, for representation learning. The authors develop a theoretical formulation based on symplectic groups over involutive algebras, which enables the construction of core geometric mappings suitable for integration into deep learning models. This theoretical direction appears novel and potentially interesting. However, the current manuscript suffers from weak presentation and remains incomplete in several important aspects, in my view, prevents it from meeting the expected standard of an ICLR submission.
Critical strengths
- To the best of my knowledge, the mathematical results presented in Section 3, including the mapping , the automorphisms , and their inverses, are novel.
Critical weaknesses
-
The authors do not provide any supplementary materials, such as source code or a link to a GitHub repository, making it difficult to assess the reproducibility of the proposed method.
-
The paper has duplicated references (lines 540-545):
- Galileo Namata, Ben London, Lise Getoor, and Bert Huang. Query-driven Active Surveying for Collective Classification. In 10th International Workshop on Mining and Learning with Graphs, volume 8, pp. 1, 2012a.
- Galileo Namata, Ben London, Lise Getoor, and Bert Huang. Query-driven Active Surveying for Collective Classification. In Workshop on Mining and Learning with Graphs, 2012b.
-
The formulations of the mapping , the autormorphisms and their reverse are mathematically heavy for both symplectic groups and . Such complexity is likely to introduce higher computational overhead than existing geometric learning methods such as HGCN [1] and SPD-GCN [2]. However, the current manuscript does not provide any analysis or empirical comparison of computational cost against these baselines, which makes it difficult to assess the practical efficiency of the proposed framework.
-
Section 5.2, which describes the application of the proposed precompact model framework to Graph Convolutional Networks (GCNs), is currently unclear and insufficiently explained. For instance, in Lines 341–342, the authors state that is transformed, yet the subsequent unnumbered equation in Lines 343–345 does not contain and instead introduces . The role of this representation appears to be directly related to the paper's mathematical contributions, including the automorphisms and their inverses. However, in the subsequent GCN formulation (Lines 352–366), particularly in the message-passing equations in Lines 362–366, it is unclear how , or these proposed mappings are incorporated. As a result, the connection between the precompact model framework and the actual GCN architecture is difficult to follow. More importantly, the paper does not provide a clear interpretation of the proposed geometric mappings in the context of deep learning, unlike existing methods. For examples, HGCN[1] introduces the logarithmic and exponential mappings which convert node features from hyperbolic space to Euclidean space, in order to utilize the fundamental algebra operations. In the current manuscript, however, the functional roles of the mapping , the automorphisms , and their inverses within a neural network remain unclear. The authors should explicitly explain what each mapping accomplishes in the forward computation and how these operations contribute to the proposed GCN architecture, followed by a pseudocode or an illustration.
-
The manuscript does not provide sufficient theoretical justification or empirical evidence to demonstrate why the proposed highly abstract precompact model, , is superior to existing geometric frameworks such as hyperbolic, SPD, and Siegel spaces. These established spaces are typically motivated by the structural properties they are able to represent; for example, hyperbolic geometry is well suited to hierarchical and tree-like graphs, whereas SPD spaces can capture more complex relational structures, including combinations of grid-like and tree-like patterns. In contrast, the paper does not clearly identify which intrinsic graph properties are uniquely preserved or modeled by , nor why existing geometries are insufficient for these structures. The authors should therefore provide a stronger justification for the necessity of , supported by theoretical analysis or targeted experiments that demonstrate the specific graph structures for which the proposed framework offers advantages over existing geometric approaches.
-
Table 4 omits several accuracy values and is only briefly referenced in Section 6.4 without further explanation.
[1] Ines Chami, Rex Ying, Christopher R, and Jure Leskovec. Hyperbolic Graph Convolutional Neural Networks. CoRR, abs/1910.12933, 2019.
[2] Wei Zhao, Federico Lopez, J. Maxwell Riestenberg, Michael Strube, Diaaeldin Taha, and Steve Trettel. Modeling Graphs Beyond Hyperbolic: Graph Neural Networks in Symmetric Positive Definite Matrices. CoRR, abs/2306.14064, 2023.
Questions for authors
-
Could the authors compare the proposed framework with existing geometric approaches in the GCN setting, such as hyperbolic methods (HGCN[1] and HGAT[2]) and Siegel-space-based models, through both theoretical analysis and empirical evaluation?
-
How is classification performed within the proposed framework? In particular, which linear classifier or regression formulation is used for the final prediction stage?
-
How can the proposed precompact model be extended to other graph architectures, such as Graph Transformers?
[1] Ines Chami, Rex Ying, Christopher R, and Jure Leskovec. Hyperbolic Graph Convolutional Neural Networks. CoRR, abs/1910.12933, 2019.
[2] Y. Zhang, X. Wang, X. Jiang, C. Shi, and Y. Ye, Hyperbolic graph attention network. CoRR, vol. abs/1912.03046, 2019. [Online].Available: http://arxiv.org/abs/1912.03046
3 comments
Comment 3: Table 4 omits several accuracy values and is only briefly referenced in Section 6.4 without further explanation.
We apologize for this issue. We used the structure and formatting of another table as a template. However, due to an oversight during the preparation of the paper, the table was not fully updated, and some entries from the original table remained. Regarding the difference between the performances of QB-GCN in Tabs. 2 and 4, we originally intended to compare QB-GCN and QB-GCN-NoAut in a setting where QB-GCN achieves the best accuracy with lowest dimension, which we found to be . The results of QB-GCN in Tab. 4 were obtained with this setting.
We acknowledge this error and take full responsibility for it. We have carefully reviewed the corrected results and present them in Table M below. As can be observed, applying the transformation improves the mean accuracy of QB-GCN-NoAut on 3 of the 4 datasets.
| Model | Airport | Pubmed | Cora | Disease |
|---|---|---|---|---|
| QB-GCN-NoAut | 88.6$\pm$0.9 | 78.1$\pm$0.5 | 82.9$\pm$0.8 | 97.0$\pm$1.6 |
| QB-GCN | 92.9$\pm$0.6 | 79.6$\pm$0.4 | 82.8$\pm$0.5 | 98.1$\pm$1.9 |
Table M: Node classification results (mean accuracy standard deviation) across ten runs..
Dear Reviewer,
We have updated our previous responses to provide additional clarification. We would appreciate it if you could kindly refer to the updated version.
Thank you again for your valuable feedback.
Best regards,
We thank the Reviewer for carefully examining our paper and for providing valuable feedback that helps us to improve the clarity of the paper and to strengthen it.
Q1: Could the authors compare the proposed framework with existing geometric approaches in the GCN setting, such as hyperbolic methods (HGCN[1] and HGAT[2]) and Siegel-space-based models, through both theoretical analysis and empirical evaluation?
For the graph and graph node classification experiments, we focused on comparing SPD-GCN and our model because the proposed GCN aims to improve SPD-GCN. In constrast, GCNs on Siegel spaces have not been proposed in previous works. On the other hand, the comparison between the studied domain and Siegel spaces was performed for the graph reconstruction task because Siegel models have proven to be strong baselines in López et al. (2021b) for this task. A detailed comparison between SPD-GCN and hyperbolic GCNs is given in the original SPD-GCN's paper in which SPD-GCN generally outperforms the hyperbolic models for the graph and graph node classification tasks. For this reason, our experiments focused on comparing SPD-GCN and our model.
Q2: How is classification performed within the proposed framework? In particular, which linear classifier or regression formulation is used for the final prediction stage?
The mapping from the original node features to QBn is applied only once. After the initial embedding Yj0 of node j is obtained, the feature transform, aggregation, and bias and nonlinearity operations are performed on SPD manifolds. Therefore, the classification is performed on SPD manifolds. In our experiments, we used the linear classifier implemented in the official code of the method in López et al. (2021b).
Q3: How can the proposed precompact model be extended to other graph architectures, such as Graph Transformers?
We thank the Reviewer for raising this interesting question. In order to extend the current method to other graph architectures such as Graph Transformers, further investigation is needed because of several challenges when working on the studied bounded domain. For instance, the question of how to effectively and efficiently compute a geometric mean on this domain remains open. Also, the lack of geometric mappings such as the exponential and logarithmic maps make the construction of fundamental building blocks on this domain difficult compared to other popular representation spaces such as hyperbolic manifolds.
Comment 1: The paper has duplicated references (lines 540-545)
We thank the Reviewer for this valuable observation. We will carefully check all the references and address this issue in the revised paper.
Comment 2: The current manuscript does not provide any analysis or empirical comparison of computational cost against these baselines
The training times of the competing models on the graph reconstruction task are reported in Table L. Our model is computationally more efficient during the training phase than Siegel models. It is important to note that the training time of the best Siegel model is about 3$\times$ that of our model in most cases.
Table L: Training times (seconds) per epoch on the graph reconstruction task.