Minimizing Hyperbolic Embedding Distortion with LLM-Guided Hierarchy Restructuring
Melika Ayoughi, Pascal Mettes, Paul Groth

TL;DR
This paper explores using Large Language Models to automatically restructure hierarchical data to optimize hyperbolic embedding quality, demonstrating improved embeddings and explainability across diverse datasets.
Contribution
It introduces a prompt-based method leveraging LLMs to reorganize hierarchies for better hyperbolic embeddings, a novel approach in hierarchy optimization.
Findings
LLM-restructured hierarchies improve embedding quality metrics
The approach is effective across 16 diverse hierarchies
Provides explainable justifications for hierarchy reorganizations
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Topological and Geometric Data Analysis · Topic Modeling
