Latent Graph Inference using Product Manifolds
Haitz S\'aez de Oc\'ariz Borde, Anees Kazi, Federico Barbero, Pietro, Li\`o

TL;DR
This paper introduces a novel method for latent graph inference that leverages product manifolds of constant curvature spaces, enabling more flexible and task-adaptive graph learning in neural networks.
Contribution
It generalizes the differentiable graph module by incorporating Riemannian geometry and product manifolds, allowing dynamic curvature learning for improved latent graph inference.
Findings
Outperforms the original dDGM model across multiple datasets
Enables task-specific curvature adaptation during training
Provides richer similarity measures through manifold embeddings
Abstract
Graph Neural Networks usually rely on the assumption that the graph topology is available to the network as well as optimal for the downstream task. Latent graph inference allows models to dynamically learn the intrinsic graph structure of problems where the connectivity patterns of data may not be directly accessible. In this work, we generalize the discrete Differentiable Graph Module (dDGM) for latent graph learning. The original dDGM architecture used the Euclidean plane to encode latent features based on which the latent graphs were generated. By incorporating Riemannian geometry into the model and generating more complex embedding spaces, we can improve the performance of the latent graph inference system. In particular, we propose a computationally tractable approach to produce product manifolds of constant curvature model spaces that can encode latent features of varying…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks
