In plain words: Hyperbolic embeddings map hierarchical data into curved space where distance shows rank, fitting best when each item has one parent and wide branches. A language model rewrites hierarchies to meet those rules, and on 16 hierarchies new trees gave more accurate embeddings than the originals.
Abstract · Minimizing Hyperbolic Embedding Distortion with LLM-Guided Hierarchy Restructuring
Hyperbolic geometry is an effective geometry for embedding hierarchical data structures. Hyperbolic learning has therefore become increasingly prominent in machine learning applications where data is hierarchically organized or governed by hierarchical semantics, ranging from recommendation systems to computer vision. The quality of hyperbolic embeddings is tightly coupled to the structure of the input hierarchy, which is often derived from knowledge graphs or ontologies. Recent work has uncovered that for an optimal hyperbolic embedding, a high branching factor and single inheritance are key, while embedding algorithms are robust to imbalance and hierarchy size. To assist knowledge engineers in reorganizing hierarchical knowledge, this paper investigates whether Large Language Models (LLMs) have the ability to automatically restructure hierarchies to meet these criteria. We propose a prompt-based approach to transform existing hierarchies using LLMs, guided by known desiderata for hyperbolic embeddings. Experiments on 16 diverse hierarchies show that LLM-restructured hierarchies consistently yield higher-quality hyperbolic embeddings across several standard embedding quality metrics. Moreover, we show how LLM-guided hierarchy restructuring enables explainable reorganizations, providing justifications to knowledge engineers.
Melika Ayoughi, Pascal Mettes, Paul Groth
arXiv:2511.20679 · cs.AI, cs.LG · submitted Nov 16, 2025
abstract · pdf · html