Hyperbolic Delaunay Geometric Alignment
Aniss Aiman Medbouhi, Giovanni Luca Marchetti, Vladislav Polianskii, Alexander Kravberg, Petra Poklukar, Anastasia Varava, Danica Kragic
TL;DR
This work tackles the lack of evaluation tools for hyperbolic embeddings by introducing HyperDGA, a geometry-aware similarity score between two sets embedded in hyperbolic space. HyperDGA is computed from the hyperbolic Delaunay graph via the ratio of heterogeneous to total edges, leveraging the Klein-Beltrami model to reduce hyperbolic computations to Euclidean power diagrams. Through synthetic experiments with a Hyperbolic VAE and real single-cell RNA data embedded in hyperbolic space, HyperDGA demonstrates strong correlation with data perturbations and latent representation quality, often outperforming hyperbolic Chamfer and matching or exceeding hyperbolic Wasserstein. The work provides a practical tool for evaluating and comparing hyperbolic representations and suggests future directions toward differentiable variants and broader biomedical applications.
Abstract
Hyperbolic machine learning is an emerging field aimed at representing data with a hierarchical structure. However, there is a lack of tools for evaluation and analysis of the resulting hyperbolic data representations. To this end, we propose Hyperbolic Delaunay Geometric Alignment (HyperDGA) -- a similarity score for comparing datasets in a hyperbolic space. The core idea is counting the edges of the hyperbolic Delaunay graph connecting datapoints across the given sets. We provide an empirical investigation on synthetic and real-life biological data and demonstrate that HyperDGA outperforms the hyperbolic version of classical distances between sets. Furthermore, we showcase the potential of HyperDGA for evaluating latent representations inferred by a Hyperbolic Variational Auto-Encoder.
