mlsanityData to 14 Oct 2026

HyperExpan: Taxonomy Expansion with Hyperbolic Representation Learning

arXiv 2109.10500 ↗First posted 22 Sep 2021cs.CL cs.AIcited by 14

Not on the map. Why?

Abstract (arXiv)

Taxonomies are valuable resources for many applications, but the limited coverage due to the expensive manual curation process hinders their general applicability. Prior works attempt to automatically expand existing taxonomies to improve their coverage by learning concept embeddings in Euclidean space, while taxonomies, inherently hierarchical, more naturally align with the geometric properties of a hyperbolic space. In this paper, we present HyperExpan, a taxonomy expansion algorithm that seeks to preserve the structure of a taxonomy in a more expressive hyperbolic embedding space and learn to represent concepts and their relations with a Hyperbolic Graph Neural Network (HGNN). Specifically, HyperExpan leverages position embeddings to exploit the structure of the existing taxonomies, and characterizes the concept profile information to support the inference on unseen concepts during training. Experiments show that our proposed HyperExpan outperforms baseline models with representation learning in a Euclidean feature space and achieves state-of-the-art performance on the taxonomy expansion benchmarks.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 31 of its 59 references that are in the map. First posted on arXiv 22 Sep 2021.

Builds on

31 of 59 references.

References · 31

  1. 2017Graph Attention Networkscited by 8,923
  2. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  3. 2016Enriching Word Vectors with Subword Informationcited by 1,583
  4. 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 684
  5. 2018Hyperbolic Neural Networkscited by 402
  6. 2019Hyperbolic Graph Convolutional Neural Networkscited by 402
  7. 2019Hyperbolic Graph Neural Networkscited by 244
  8. 2019Position-aware Graph Neural Networkscited by 203
  9. 2018Poincar'e GloVe: Hyperbolic Word Embeddingscited by 156
  10. 2021Hyperbolic Deep Neural Networks: A Surveycited by 139
  11. 2019Multi-relational Poincar'e Graph Embeddingscited by 126
  12. 2018Hyperbolic Attention Networkscited by 122
19 more
  1. 2020Geoopt: Riemannian Optimization in PyTorchcited by 114
  2. 2019Constant Curvature Graph Convolutional Networkscited by 108
  3. 2020Learning from History: Modeling Temporal Knowledge Graphs with Sequential Copy-Generation Networkscited by 84
  4. 2018Embedding Text in Hyperbolic Spacescited by 76
  5. 2019Inferring Concept Hierarchies from Text Corpora via Hyperbolic Embeddingscited by 49
  6. 2021Learning the Predictability of the Futurecited by 49
  7. 2020TaxoExpan: Self-supervised Taxonomy Expansion with Position-Enhanced Graph Neural Networkcited by 37
  8. 2020STEAM: Self-Supervised Taxonomy Expansion with Mini-Pathscited by 31
  9. 2020Knowledge Association with Hyperbolic Knowledge Graph Embeddingscited by 31
  10. 2019Hyperbolic Interaction Model For Hierarchical Multi-Label Classificationcited by 30
  11. 2020HyperText: Endowing FastText with Hyperbolic Geometrycited by 28
  12. 2016Improving Hypernymy Detection with an Integrated Path-based and Distributional Methodcited by 27
  13. 2019Every child should have parents: a taxonomy refinement algorithm based on hyperbolic term embeddingscited by 23
  14. 2020A Fully Hyperbolic Neural Model for Hierarchical Multi-Class Classificationcited by 23
  15. 2019Self-Attention with Structural Position Representationscited by 21
  16. 2021Taxonomy Completion via Triplet Matching Networkcited by 21
  17. 2021Enquire One's Parent and Child Before Decision: Fully Exploit Hierarchical Structure for Self-Supervised Taxonomy Expansioncited by 13
  18. 2017MetaPAD: Meta Pattern Discovery from Massive Text Corporacited by 12
  19. 2019A User-Centered Concept Mining System for Query and Document Understanding at Tencentcited by 11

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 4; 2023: 3; 2024: 1; 2025: 4; 2026: 2.

14 papers.

Sort: