- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies latent relational inference when no graph is observed directly. Instead of treating each entity pair as one binary edge, it models grouped counts collected across heterogeneous contexts. Each entity is embedded on a product manifold whose factors may be Euclidean, hyperbolic, or spherical. A differentiable distance-based link function converts the geometry into a pairwise relatedness propensity, and a Beta-Binomial observation model accounts for context-specific rates and overdispersion. The authors derive a variance ratio comparing the shared geometric estimate with an estimate based only on a pair's own counts, and construct a parameter-free combination of the two estimates. Posterior inference is performed with a Riemannian stochastic gradient Langevin sampler, producing uncertainty summaries and allowing a new entity to be embedded from its own evidence with shared parameters frozen. Synthetic experiments and evaluations on TCGA gene co-mutation and protein-protein interaction data show improved prediction in dropped-pair and held-out-entity settings.
Critical strengths
1.The problem raised in this paper is quite significant: Graph structures do not exist directly in the real world; rather, they are often inferred from observed statistical data.
2.Using Riemannian geometry to model the intrinsic geometric structure of data is both reasonable and well-motivated.
3.The experiments on biological data demonstrated the effectiveness of the proposed method.
Critical weaknesses
1.The variance-ratio result relies on an isotropic-neighborhood assumption that may be unrealistic for many relational datasets. In real data, information can be strongly directional: entities may be connected through several distinct relation types, have highly anisotropic local structure.
2.The experiments are limited to synthetic data and two biological datasets with about 1,000 entities. Broader evaluation on benchmarks such as RelBench, including heterogeneous-table, missing-relation, foreign-key, and inductive entity prediction tasks, would better test generalization beyond biological co-occurrence data.
3.The paper should cite and discuss more closely related work on Riemannian geometry and product-manifold representations.
[1]Latent Graph Inference using Product Manifolds. ICLR 2023
[2] Toward a Unified Geometry Understanding: Riemannian Diffusion Framework for Graph Generation and Prediction. NeurIPS 2025
[3] Neural Latent Geometry Search: Product Manifold Inference via Gromov-Hausdorff-Informed Bayesian Optimization. NeurIPS 2023.
Questions for authors
See Weakness.
2 comments
Thanks for authors' reply. My concern has already been solved. I would like to keep my positive score unchanged.
Response to Reviewer 3JAo
We thank the reviewer for a detailed and positive assessment and for three specific suggestions, each of which we have incorporated in the revision.
W1: The isotropy assumption. We agree that real neighborhoods are directional, and the main result does not depend on isotropy:
W2: Breadth and scale of evaluation, and RelBench. We added two real domains (Sec. 7.2):
On RelBench: its tasks are supervised predictions over relational databases with observed foreign-key links and entity features, which is the observed-graph setting. Our model applies where a database yields grouped counts instead. MovieLens-1M is built this way, from a user–movie rating table with users as the grouped observations and occupation as the context, and the same construction applies to transaction tables such as those in RelBench. RelBench's own supervised tasks require features and labels our model does not use, so we see them as complementary to our setting. On scale: TCGA, PPI and mtDNA have N=1,000 entities (about 500,000 candidate pairs); MovieLens has N=2,500 (about 3.1M, roughly 6×). The per-iteration cost is linear in the number of candidate pair–context cells, and one MAP fit on MovieLens takes about 30 minutes on a single T4 GPU (App. C).
W3: Related work. We added all three papers (Sec. 2 and App. E):
We hope the new domains, the exact-variance results and the product-manifold discussion address W1–W3. If so, we would be grateful if the reviewer would consider raising their score. We would be glad to discuss any of these points further.