TL;DR
This paper investigates the geometric challenges in embedding high-dimensional multiplex graphs, revealing that node representations lie on curved manifolds and proposing a hyperbolic hierarchical embedding method to improve downstream task performance.
Contribution
It introduces a novel hierarchical hyperbolic embedding approach that reduces geometric distortions in high-dimensional multiplex graph representations.
Findings
Node representations reside on highly curved manifolds.
Increasing graph dimensions causes additional distortions.
The proposed method improves downstream task performance.
Abstract
High-dimensional multiplex graphs are characterized by their high number of complementary and divergent dimensions. The existence of multiple hierarchical latent relations between the graph dimensions poses significant challenges to embedding methods. In particular, the geometric distortions that might occur in the representational space have been overlooked in the literature. This work studies the problem of high-dimensional multiplex graph embedding from a geometric perspective. We find that the node representations reside on highly curved manifolds, thus rendering their exploitation more challenging for downstream tasks. Moreover, our study reveals that increasing the number of graph dimensions can cause further distortions to the highly curved manifolds. To address this problem, we propose a novel multiplex graph embedding method that harnesses hierarchical dimension embedding and…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
