Achieving Hyperbolic-Like Expressiveness with Arbitrary Euclidean Regions: A New Approach to Hierarchical Embeddings

• URL: http://arxiv.org/abs/2501.17518v2
• Date: Wed, 08 Oct 2025 08:26:07 GMT
• Title: Achieving Hyperbolic-Like Expressiveness with Arbitrary Euclidean Regions: A New Approach to Hierarchical Embeddings
• Authors: Hui Yang, Jiaoyan Chen,
• Abstract summary: We present RegD, a flexible Euclidean framework that supports the use of arbitrary geometric regions as embedding representations.<n>RegD achieves hyperbolic-like expressiveness by incorporating a depth-based dissimilarity between regions, enabling it to emulate key properties of hyperbolic geometry.<n>Our empirical evaluation on diverse real-world datasets shows consistent performance gains over state-of-the-art methods.
• Score: 9.614222676567385
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hierarchical data is common in many domains like life sciences and e-commerce, and its embeddings often play a critical role. While hyperbolic embeddings offer a theoretically grounded approach to representing hierarchies in low-dimensional spaces, current methods often rely on specific geometric constructs as embedding candidates. This reliance limits their generalizability and makes it difficult to integrate with techniques that model semantic relationships beyond pure hierarchies, such as ontology embeddings. In this paper, we present RegD, a flexible Euclidean framework that supports the use of arbitrary geometric regions -- such as boxes and balls -- as embedding representations. Although RegD operates entirely in Euclidean space, we formally prove that it achieves hyperbolic-like expressiveness by incorporating a depth-based dissimilarity between regions, enabling it to emulate key properties of hyperbolic geometry, including exponential growth. Our empirical evaluation on diverse real-world datasets shows consistent performance gains over state-of-the-art methods and demonstrates RegD's potential for broader applications such as the ontology embedding task that goes beyond hierarchy.

Related papers

• Position: General Alignment Has Hit a Ceiling; Edge Alignment Must Be Taken Seriously [51.03213216886717]
  We take the position that the dominant paradigm of General Alignment reaches a structural ceiling in settings with conflicting values.<n>We introduce Edge Alignment as a distinct approach in which systems preserve multi dimensional value structure.
  arXiv  Detail & Related papers  (2026-02-23T16:51:43Z)
• An Algebraic Representation Theorem for Linear GENEOs in Geometric Machine Learning [1.3425748364842416]
  Group Equivariant Non-Expansive Operators (GENEOs) have emerged as a powerful class of operators for encoding symmetries.<n>We introduce a new representation theorem for linear GENEOs acting between different perception pairs.<n>We also prove the compactness and convexity of the space of linear GENEOs.
  arXiv  Detail & Related papers  (2026-01-07T13:21:44Z)
• HyperbolicRAG: Enhancing Retrieval-Augmented Generation with Hyperbolic Representations [11.678218711095269]
  Graph-based RAG enables large language models to access external knowledge.<n>We propose HyperbolicRAG, a retrieval framework that integrates hyperbolic geometry into graph-based RAG.
  arXiv  Detail & Related papers  (2025-11-24T06:27:58Z)
• GeoGNN: Quantifying and Mitigating Semantic Drift in Text-Attributed Graphs [59.61242815508687]
  Graph neural networks (GNNs) on text--attributed graphs (TAGs) encode node texts using pretrained language models (PLMs) and propagate these embeddings through linear neighborhood aggregation.<n>This work introduces a local PCA-based metric that measures the degree of semantic drift and provides the first quantitative framework to analyze how different aggregation mechanisms affect manifold structure.
  arXiv  Detail & Related papers  (2025-11-12T06:48:43Z)
• Learning Topology-Driven Multi-Subspace Fusion for Grassmannian Deep Network [31.003374497881968]
  Grassmannian manifold offers a powerful carrier for geometric representation learning.<n>We propose a topology-driven multi-subspace fusion framework that enables adaptive subspace collaboration on the Grassmannian.<n>Our work advances geometric deep learning and adapts the proven multi-channel interaction philosophy of Euclidean networks to non-Euclidean domains.
  arXiv  Detail & Related papers  (2025-11-09T10:33:13Z)
• OpenHype: Hyperbolic Embeddings for Hierarchical Open-Vocabulary Radiance Fields [25.81679730373062]
  We propose OpenHype, a novel approach that represents scene hierarchies using a continuous hyperbolic latent space.<n>By leveraging the properties of hyperbolic geometry, OpenHype naturally encodes multi-scale relationships.<n>Our method outperforms state-of-the-art approaches on standard benchmarks.
  arXiv  Detail & Related papers  (2025-10-24T13:17:56Z)
• A Set-to-Set Distance Measure in Hyperbolic Space [50.134086375286074]
  We propose a hyperbolic set-to-set distance measure for computing dissimilarity between sets in hyperbolic space.<n>By considering the topological differences, HS2SD provides a more nuanced understanding of the relationships between two hyperbolic sets.
  arXiv  Detail & Related papers  (2025-06-23T11:31:40Z)
• Position: Beyond Euclidean -- Foundation Models Should Embrace Non-Euclidean Geometries [42.83280708842304]
  Euclidean space has been the de facto geometric setting for machine learning architectures.<n>At a large scale, real-world data often exhibit inherently non-Euclidean structures, such as multi-way relationships, hierarchies, symmetries, and non-isotropic scaling.<n>This paper argues that moving beyond Euclidean geometry is not merely an optional enhancement but a necessity to maintain the scaling law for the next-generation of foundation models.
  arXiv  Detail & Related papers  (2025-04-11T18:07:33Z)
• Adaptive Locally Linear Embedding [10.331256742632835]
  A novel approach, Adaptive locally linear embedding(ALLE), is introduced to address this limitation. Experimental results demonstrate that ALLE significantly improves the alignment between neighborhoods in the input and feature spaces. This approach advances manifold learning by tailoring distance metrics to the underlying data, providing a robust solution for capturing intricate relationships in high-dimensional datasets.
  arXiv  Detail & Related papers  (2025-04-09T12:40:13Z)
• HierRelTriple: Guiding Indoor Layout Generation with Hierarchical Relationship Triplet Losses [52.70183252341687]
  We present a hierarchical triplet-based indoor relationship learning method, coined HierRelTriple, with a focus on spatial relationship learning.<n>We introduce HierRelTriple, a hierarchical relational triplets modeling framework that first partitions functional regions and then automatically extracts three levels of spatial relationships.<n>Experiments on unconditional layout synthesis, floorplan-conditioned layout generation, and scene rearrangement demonstrate that HierRel improves spatial-relation metrics by over 15%.
  arXiv  Detail & Related papers  (2025-03-26T07:31:52Z)
• RUN: Reversible Unfolding Network for Concealed Object Segmentation [61.13528324971598]
  reversible strategies across both mask and RGB domains. We propose the Reversible Unfolding Network (RUN), which applies reversible strategies across both mask and RGB domains.
  arXiv  Detail & Related papers  (2025-01-30T22:19:15Z)
• Differentiable Reasoning about Knowledge Graphs with Region-based Graph Neural Networks [62.93577376960498]
  Methods for knowledge graph (KG) completion need to capture semantic regularities and use these regularities to infer plausible knowledge that is not explicitly stated. Most embedding-based methods are opaque in the kinds of regularities they can capture, although region-based KG embedding models have emerged as a more transparent alternative. We propose RESHUFFLE, a simple model based on ordering constraints that can faithfully capture a much larger class of rule bases than existing approaches.
  arXiv  Detail & Related papers  (2024-06-13T18:37:24Z)
• Review-Based Hyperbolic Cross-Domain Recommendation [3.4498722449655066]
  Cross-Domain Recommendation (CDR) captures domain-shareable knowledge and transfers it from a richer domain to a sparser one.<n>This paper advocates a hyperbolic CDR approach based on review texts for modeling user-item relationships.
  arXiv  Detail & Related papers  (2024-03-29T17:15:21Z)
• Geometry Interaction Knowledge Graph Embeddings [153.69745042757066]
  We propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities.
  arXiv  Detail & Related papers  (2022-06-24T08:33:43Z)
• Relation Matters: Foreground-aware Graph-based Relational Reasoning for Domain Adaptive Object Detection [81.07378219410182]
  We propose a new and general framework for DomainD, named Foreground-aware Graph-based Reasoning (FGRR) FGRR incorporates graph structures into the detection pipeline to explicitly model the intra- and inter-domain foreground object relations. Empirical results demonstrate that the proposed FGRR exceeds the state-of-the-art on four DomainD benchmarks.
  arXiv  Detail & Related papers  (2022-06-06T05:12:48Z)
• Hyperbolic Graph Neural Networks: A Review of Methods and Applications [61.49208407567829]
  This survey paper provides a comprehensive review of the rapidly evolving field of Hyperbolic Graph Learning (HGL)<n>We systematically categorize and analyze existing methods dividing them into (1) hyperbolic graph embedding-based techniques, (2) graph neural network-based hyperbolic models, and (3) emerging paradigms.<n>We extensively discuss diverse applications of HGL across multiple domains, including recommender systems, knowledge graphs, bioinformatics, and other relevant scenarios.
  arXiv  Detail & Related papers  (2022-02-28T15:08:48Z)
• A Unified Architecture of Semantic Segmentation and Hierarchical Generative Adversarial Networks for Expression Manipulation [52.911307452212256]
  We develop a unified architecture of semantic segmentation and hierarchical GANs. A unique advantage of our framework is that on forward pass the semantic segmentation network conditions the generative model. We evaluate our method on two challenging facial expression translation benchmarks, AffectNet and RaFD, and a semantic segmentation benchmark, CelebAMask-HQ.
  arXiv  Detail & Related papers  (2021-12-08T22:06:31Z)
• Deep Recursive Embedding for High-Dimensional Data [9.611123249318126]
  We propose to combine deep neural networks (DNN) with mathematics-guided embedding rules for high-dimensional data embedding. We introduce a generic deep embedding network (DEN) framework, which is able to learn a parametric mapping from high-dimensional space to low-dimensional space.
  arXiv  Detail & Related papers  (2021-10-31T23:22:33Z)
• GenURL: A General Framework for Unsupervised Representation Learning [58.59752389815001]
  Unsupervised representation learning (URL) learns compact embeddings of high-dimensional data without supervision. We propose a unified similarity-based URL framework, GenURL, which can smoothly adapt to various URL tasks. Experiments demonstrate that GenURL achieves consistent state-of-the-art performance in self-supervised visual learning, unsupervised knowledge distillation (KD), graph embeddings (GE), and dimension reduction.
  arXiv  Detail & Related papers  (2021-10-27T16:24:39Z)
• Neural Distance Embeddings for Biological Sequences [43.07977514121458]
  We present NeuroSEED, a framework to embed sequences in geometric vector spaces. We show the effectiveness of the hyperbolic space that captures the hierarchical structure and provides an average 22% reduction in embedding RMSE. The proposed approaches display significant accuracy and/or runtime improvements on real-world datasets.
  arXiv  Detail & Related papers  (2021-09-20T17:30:58Z)
• HUMAP: Hierarchical Uniform Manifold Approximation and Projection [42.50219822975012]
  This work presents HUMAP, a novel hierarchical dimensionality reduction technique designed to be flexible on preserving local and global structures. We provide empirical evidence of our technique's superiority compared with current hierarchical approaches and show a case study applying HUMAP for dataset labelling.
  arXiv  Detail & Related papers  (2021-06-14T19:27:54Z)
• Sign-Agnostic CONet: Learning Implicit Surface Reconstructions by Sign-Agnostic Optimization of Convolutional Occupancy Networks [39.65056638604885]
  We learn implicit surface reconstruction by sign-agnostic optimization of convolutional occupancy networks. We show this goal can be effectively achieved by a simple yet effective design.
  arXiv  Detail & Related papers  (2021-05-08T03:35:32Z)
• Dual-constrained Deep Semi-Supervised Coupled Factorization Network with Enriched Prior [80.5637175255349]
  We propose a new enriched prior based Dual-constrained Deep Semi-Supervised Coupled Factorization Network, called DS2CF-Net. To ex-tract hidden deep features, DS2CF-Net is modeled as a deep-structure and geometrical structure-constrained neural network. Our network can obtain state-of-the-art performance for representation learning and clustering.
  arXiv  Detail & Related papers  (2020-09-08T13:10:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.