- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes H2G (Hyperbolic Hypergraph Generator), a hypergraph generation framework based on latent hyperbolic geometry. The method first learns hyperbolic embeddings of nodes and hyperedges, node popularity parameters, and spatial curvature through maximum likelihood estimation. It then generates new latent hyperedge embeddings using either empirical resampling (H2G-EB) or a Riemannian diffusion model (H2G-RD). Finally, new hyperedges are generated through probabilistic decoding based on hyperbolic distances and node popularity. The paper also analyzes curvature identifiability, higher-order dependencies, and consistency of the generated distribution, and demonstrates the effectiveness of the proposed method on three real-world hypergraph datasets.
Critical strengths
-
Interpretable Generative Framework with Theoretical Support. The paper combines hyperbolic geometry with probabilistic generative modeling, capturing complex multi-node interactions through low-dimensional embeddings, node popularity, and geometric distances. The framework is relatively simple and interpretable. Furthermore, the theoretical analyses of curvature identifiability, higher-order dependencies, and generative consistency provide solid theoretical support for the proposed method.
-
Strong Empirical Performance. The experiments cover three real-world hypergraph datasets and include comparisons with various generative models. H2G achieves competitive results on generation quality metrics such as Energy Distance and MMD², while using only a two-dimensional hyperbolic latent space, demonstrating strong representational capability and practical potential.
Critical weaknesses
-
Limited Scalability Evaluation. The paper emphasizes the scalability of the proposed method, but the experiments mainly focus on small- to medium-scale hypergraphs. Although some computational cost information is provided, a systematic efficiency evaluation across different dataset scales and runtime comparisons with baselines are still lacking. Given that the method involves curvature grid search, manifold optimization, and diffusion training, its computational efficiency on larger hypergraphs remains to be validated.
-
Insufficient Validation of Hyperbolic Geometry. The paper does not sufficiently establish the independent contribution of hyperbolic geometry. The existing DDE baseline uses Euclidean inner products, whereas H2G employs hyperbolic distances, changing both the geometric space and the interaction function. This makes it difficult to isolate the actual benefits of negative curvature. Furthermore, a systematic analysis of the conditions under which hyperbolic geometry is advantageous is lacking.
Questions for authors
-
Algorithm 1 requires separate embedding optimization for multiple candidate curvature values, while Appendix B.7 only reports the computational cost on MIMIC-III under a single fixed curvature. Could the authors clarify the total training cost of the full curvature search and how the computational overhead scales with the number of nodes and hyperedges?
-
Appendix D.3 compares DDE with different Euclidean embedding dimensions, but its inner-product-based interaction mechanism differs from H2G's distance-based decoder. Have the authors considered a Euclidean model with the same Bernoulli distance-based decoder? Could such a comparison help isolate the contribution of negative curvature to generation quality?
4 comments
W2 & Q2. Regarding the controlled Euclidean comparison
Response:
Thank you for this suggestion. We now have introduced the Euclidean Hypergraph Generator (EHG), which uses the same Bernoulli distance-based decoder as H2G with Euclidean distances:
\qquad f,z_i\in\mathbb{R}^d.$$ DDE uses Euclidean inner products, so comparing it with H2G changes both the latent geometry and the interaction function. EHG lets us compare the two geometries under the same decoder. **1. Experiments.** We implement EHG-EB and EHG-D as the Euclidean counterparts of H2G-EB and H2G-RD, respectively. The implementations differ in geometry-dependent initialization and optimization (USVT+EU20 and MGD for H2G, USVT and GD for EHG) and in the diffusion process for the diffusion variants. We focus on H2G-EB and EHG-EB so that the comparison uses the same empirical bootstrap procedure in both geometries. We select the Euclidean dimension from $d\in\\{2,4,8\\}$ using validation Energy, the same criterion used to select curvature for H2G. **Real data.** Appendix D.9 reports the full comparisons. The table below shows test means (SDs) for the selected configurations. Energy is in units of $10^{-3}$ for MIMIC-III and $10^{-4}$ for MathOverflow-Answers and CORUM. MMD\$^2\$ is in units of $10^{-3}$ throughout. | Dataset | EHG dimension | H2G-EB Energy | EHG-EB Energy | H2G-EB MMD² | EHG-EB MMD² | |---|---:|---:|---:|---:|---:| | MIMIC-III | 8 | 1.34 (0.07) | **1.17 (0.105)** | 7.45 (0.05) | **7.34 (0.114)** | | MathOverflow-Answers | 8 | **3.67 (0.36)** | 9.92 (1.1) | **3.52 (0.02)** | 3.93 (0.18) | | CORUM | 2 | **7.33 (0.60)** | 41.3 (2.4) | **2.16 (0.09)** | 4.41 (0.30) | EHG-EB performs slightly better on MIMIC-III, while H2G-EB achieves substantially lower Energy and MMD\$^2\$ on MathOverflow-Answers and CORUM. **Synthetic data.** Appendix C.4 compares both geometries in a controlled $2\times2$ study varying the ground-truth geometry and average hyperlink order. Both fitted models use two-dimensional embeddings. Test results are means (SDs) in units of $10^{-3}$. | True geometry | Mean order | H2G-EB Energy | EHG-EB Energy | H2G-EB MMD² | EHG-EB MMD² | |---|---:|---:|---:|---:|---:| | Hyperbolic | 5.03 | **3.716 (0.932)** | 7.906 (1.721) | **9.129 (0.651)** | 11.574 (0.611) | | Hyperbolic | 19.96 | **2.438 (0.967)** | 2.439 (0.996) | **7.876 (0.383)** | 7.878 (0.334) | | Euclidean | 4.99 | **0.605 (0.546)** | 1.192 (0.843) | **7.165 (0.419)** | 7.415 (0.455) | | Euclidean | 19.97 | **0.699 (0.464)** | 0.846 (0.493) | **7.146 (0.152)** | 7.202 (0.141) | Under sparse hyperbolic ground truth, H2G-EB reduces Energy by **53.0%** and MMD\$^2\$ by **21.1%**, while the two models perform nearly identically at the higher hyperlink order. H2G-EB also achieves lower mean Energy and MMD\$^2\$ at both orders under Euclidean ground truth. These findings suggest that hyperbolic geometry can offer advantages in hyperlink generation without requiring the true latent geometry to be strictly hyperbolic. **2. Theory.** Hyperbolic geometry does not consistently outperform Euclidean geometry, and its advantages depend on the underlying hyperlink distribution. Beyond the tree-metric representation result in Proposition A.1, we have added Propositions 2–3 (Section 2.3, with proofs in Appendix E.4) to directly compare the expressivity of the induced hyperlink distributions. Proposition 2 establishes that a two-dimensional hyperbolic model can approximate certain overlapping modular hyperlink distributions arbitrarily well, whereas Euclidean models of any fixed maximum dimension have a nonvanishing total variation (TV) approximation gap. Conversely, Proposition 3 constructs a distribution over three pairwise hyperlinks that Euclidean models can approximate arbitrarily well, while hyperbolic models with curvature bounded away from zero have a strictly positive TV approximation gap. These results show that neither geometry is universally superior. In practice, hypergraph structures are typically more complex, making it difficult to choose a latent geometry solely by looking for patterns like those in the propositions. A held-out validation set can help guide this choice by comparing the generative fidelity of the fitted models. In summary, we introduce H2G, provide an accompanying toolkit, and examine how its expressivity and performance compare with Euclidean alternatives. In practice, practitioners should choose the model that best fits their application, and our results can help guide that choice. Thank you again for your helpful feedback. Please let us know if you have any additional questions. Meanwhile, we are continuing to proofread the manuscript and double-check the details.Thanks for the author's rebuttal response. I maintain my score.
Thank you very much for taking the time to read our rebuttal response. We appreciate your careful review and feedback.
Thank you for taking the time and effort to review our paper and your constructive suggestions. We appreciate your recognition of our theoretical and empirical contributions. Below, we address your concerns and questions point by point.
W1 & Q1. Regarding computational efficiency, full curvature search, and scalability
Response:
Implementation improvements. Since submission, we have improved computational efficiency by using a single inner MGD epoch, fewer embedding-fitting iterations, and a coarser curvature grid, while maintaining comparable generation fidelity (main results are updated in Section 4.2). We also chunk the probability matrices and use compressed sparse row (CSR) storage for the incidence data to reduce GPU memory consumption, particularly for large sparse hypergraphs.
We summarize the results of our newly added experiments below, with further details in Appendix B.7 of our revised manuscript.
1. Large-scale feasibility.
We further evaluate H2G on two large-scale hypergraphs, using a lightweight initialization to reduce computational overhead while keeping the model, likelihood objective, and optimization procedure unchanged.
Real-world hypergraph. We trained H2G on threads-ubuntu [1, 2], a real-world hypergraph with 90,054 nodes, 115,987 hyperlinks, and an average hyperlink size of 2.30. We then used the fitted model to generate synthetic hyperlinks on the same node set.
Synthetic hypergraph. We trained H2G on a bipartite stochastic block model [3] with 32,768 nodes, 32,768 hyperlinks, a 3×3 block interaction structure, and an expected hyperlink size of 5. H2G generated 1,048,576 hyperlinks, 32 times the number in the training hypergraph. The generated hypergraph preserved the block structure, with estimated block-wise connection probabilities close to the ground truth.
We refer the reviewer to Appendix B.7 of the revised manuscript for the full experimental setup and computational details. These experiments demonstrate the feasibility of H2G on substantially larger hypergraphs than those considered in the original manuscript.
2. Scalability with hypergraph size. At a fixed latent dimension, each full embedding update costs O(nm), and the optimization cost scales with the number of curvature candidates and updates per candidate. With a fixed batch size and architecture, each diffusion training step has no direct dependence on n or m. Decoding m~ generated hyperlinks costs O(m~n).
Appendix B.7.3 reports runtime and peak GPU memory as we vary n and m. H2G-RD scales across the tested configurations, with embedding fitting accounting for most of the runtime. Table 9 separates the memory cost of initialization from that of embedding optimization.
3. Cost of full curvature search and comparison with baselines. Appendix B.7 of the revised manuscript reports end-to-end runtime and peak GPU memory for H2G's full curvature search and the baselines on all three real-world datasets. The comparison uses three curvature candidates for H2G and three hyperparameter configurations for each baseline.
References:
[1] Benson, A. R., Abebe, R., Schaub, M. T., Jadbabaie, A., and Kleinberg, J. (2018). Simplicial closure and higher-order link prediction. Proceedings of the National Academy of Sciences, 115(48), E11221–E11230.
[2] Lee, G., Choe, M., and Shin, K. (2021). How do hyperedges overlap in real-world hypergraphs? Patterns, measures, and generators. Proceedings of the Web Conference 2021, 3396–3407.
[3] Coupette, C., Dalleiger, S., and Rieck, B. (2023). Ollivier-Ricci curvature for hypergraphs: A unified framework. International Conference on Learning Representations (ICLR).