A key technique of machine learning and computer vision is to embed discrete weighted graphs into continuous spaces for further downstream processing. Embedding discrete hierarchical structures in hyperbolic geometry has proven very successful since it was shown that any weighted tree can be embedded in that geometry with arbitrary low distortion. Various optimization methods for hyperbolic embeddings based on common models of hyperbolic geometry have been studied. In this paper, we consider Hilbert geometry for the standard simplex which is isometric to a vector space equipped with the variation polytope norm. We study the representation power of this Hilbert simplex geometry by embedding distance matrices of graphs. Our findings demonstrate that Hilbert simplex geometry is competitive to alternative geometries such as the Poincar\'e hyperbolic ball or the Euclidean geometry for embedding tasks while being fast and numerically robust.

翻译：机器学习和计算机视觉中的一项关键技术是将离散加权图嵌入到连续空间中，以进行后续的下游处理。将离散层次结构嵌入双曲几何中已被证明非常成功，因为研究表明，任何加权树都可以以任意低的失真嵌入到该几何中。基于常见双曲几何模型的双曲嵌入优化方法已有广泛研究。本文考虑标准单纯形上的希尔伯特几何，该几何与赋有变差多面体范数的向量空间等距。我们通过嵌入图的距离矩阵来研究这种希尔伯特单纯形几何的表示能力。我们的研究结果表明，在嵌入任务中，希尔伯特单纯形几何在快速且数值鲁棒的同时，与庞加莱双曲球或欧几里得几何等其他几何相比具有竞争力。