paper-with-me

홈 › Papers

Learning Continuous Hierarchies in the Lorentz Model of Hyperbolic Geometry

2018-06-09 · ICML 2018 7 · Maximilian Nickel, Douwe Kiela

We are concerned with the discovery of hierarchical relationships from large-scale unstructured similarity scores. For this purpose, we study different models of hyperbolic space and find that learning embeddings in the Lorentz model is substantially more efficient than in the Poincar\'e-ball model. We show that the proposed approach allows us to learn high-quality embeddings of large taxonomies which yield improvements over Poincar\'e embeddings, especially in low dimensions. Lastly, we apply our model to discover hierarchies in two real-world datasets: we show that an embedding in hyperbolic space can reveal important aspects of a company's organizational structure as well as reveal historical relationships between language families.

📄 PDF Abstract BibTeX arXiv:1806.03417

Code (3)

facebookresearch/poincare-embeddings 공식 구현 pytorch
mtbarta/hyperbolic tf
thesage21/lorentz-embeddings pytorch

Similar Papers 제목 키워드 기반

Lorentzian Distance Learning

2018-09-27 · Marc T Law, Jake Snell, Richard S Zemel

This paper introduces an approach to learn representations based on the Lorentzian distance in hyperbolic geometry. Hyperbolic geometry is especially suited to hierarchically-structured datasets, which are prevalent in t…

Representation LearningRetrieval

Fast and Geometrically Grounded Lorentz Neural Networks

2026-01-29 · Robert van der Klis, Ricardo Chávez Torres, Max van Spengler, Yuhui Ding 외 arxiv

Hyperbolic space is quickly gaining traction as a promising geometry for hierarchical and robust representation learning. A core open challenge is the development of a mathematical formulation of hyperbolic neural networ…

Representation Learning

Comparing Euclidean and Hyperbolic K-Means for Generalized Category Discovery

2026-02-04 · Mohamad Dalal, Thomas B. Moeslund, Joakim Bruslund Haurum arxiv

Hyperbolic representation learning has been widely used to extract implicit hierarchies within data, and recently it has found its way to the open-world classification task of Generalized Category Discovery (GCD). Howeve…

Representation Learning

Lorentzian Graph Convolutional Networks

2021-04-15 · Yiding Zhang, Xiao Wang, Chuan Shi, Nian Liu 외

Graph convolutional networks (GCNs) have received considerable research attention recently. Most GCNs learn the node representations in Euclidean geometry, but that could have a high distortion in the case of embedding g…

Fully Hyperbolic Rotation for Knowledge Graph Embedding

2024-11-06 · Qiuyu Liang, Weihua Wang, Feilong Bao, Guanglai Gao

Hyperbolic rotation is commonly used to effectively model knowledge graphs and their inherent hierarchies. However, existing hyperbolic rotation models rely on logarithmic and exponential mappings for feature transformat…

Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingKnowledge Graphs