Learning graph representations via low-dimensional embeddings that preserve relevant network properties is an important class of problems in machine learning. We here present a novel method to embed directed acyclic graphs. Following prior work, we first advocate for using hyperbolic spaces which provably model tree-like structures better than Euclidean geometry. Second, we view hierarchical relations as partial orders defined using a family of nested geodesically convex cones. We prove that these entailment cones admit an optimal shape with a closed form expression both in the Euclidean and hyperbolic spaces. Moreover, they canonically define the embedding learning process. Experiments show significant improvements of our method over strong recent baselines both in terms of representational capacity and generalization.

在机器学习中，通过保留相关网络属性的低维嵌入学习图表示是一类重要的问题。本文提出了一种嵌入有向无环图的新方法，使用证明能够更好地模拟树状结构的双曲空间，并使用一组嵌套的测地凸锥来定义分层关系，并证明这些蕴含锥体在欧几里得和双曲空间中均具有一种优化的形式，而且它们可以规范地定义嵌入学习过程。实验显示，我们的方法在表示能力和泛化方面都比最近的强有力的基线有显着的改进。

学习分层嵌入的双曲包含锥