Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures benefit from hyperbolic geometry. However, going beyond embedding spaces of constant sectional curvature, while potentially more representationally powerful, proves to be challenging as one can easily lose the appeal of computationally tractable tools such as geodesic distances or Riemannian gradients. Here, we explore computationally efficient matrix manifolds, showcasing how to learn and optimize graph embeddings in these Riemannian spaces. Empirically, we demonstrate consistent improvements over Euclidean geometry while often outperforming hyperbolic and elliptical embeddings based on various metrics that capture different graph properties. Our results serve as new evidence for the benefits of non-Euclidean embeddings in machine learning pipelines.

本研究探索了在借助矩阵流形学习和优化图嵌入的情况下，如何在曲线里曼尼流形中提高图像嵌入的表现。我们的实验结果证明，在各种衡量不同图形属性的指标基础上，我们通常优于基于超球体和椭球嵌入的欧几里得嵌入，从而为非欧几里得句子嵌入在机器学习流水线中的优势提供了新的证据。

计算可行的黎曼流形用于图嵌入