Skip to content
Back to the collection

Poincaré Embeddings for Learning Hierarchical Representations

Maximilian Nickel, Douwe Kiela

2017 · arXiv

Read the paper
HN score
0
Mentions
4
Readers
3
Months
3
What’s in a score?

From the abstract

Representation learning has become an invaluable approach for learning from symbolic data such as text and graphs. However, while complex symbolic datasets often exhibit a latent hierarchical structure, state-of-the-art methods typically learn embeddings in Euclidean vector spaces, which do not account for this property. For this purpose, we introduce a new approach for learning hierarchical representations of symbolic data by embedding them into hyperbolic space -- or more precisely into an n-dimensional Poincaré ball. Due to the underlying hyperbolic geometry, this allows us to learn parsimonious representations of symbolic data by simultaneously capturing hierarchy and similarity. We introduce an efficient algorithm to learn the embeddings based on Riemannian optimization and show experimentally that Poincaré embeddings outperform Euclidean embeddings significantly on data with latent hierarchies, both in terms of representation capacity and in terms of generalization ability.

Metadata: arXiv. Abstracts retain their original authors’ rights.

In the conversation

Original HN comments, with labels from simple text rules. A label describes the whole comment and may miss context or irony. Read the discussion to make up your own mind. About the labels

4 selected excerpts · 4 total mentions

VHRanger
Neutral mention · rule
These exotic (non linear algebra based) embedding representations are often slow to take off unless they have an obvious use case. The other one that I've always been curious of is Poincarré Embeddings [1] - where the embedding also has a hierarchical representation of the space. There's issues with these becoming popular: 1. Querying the embeddings requires more math knowledge than just "lol cosine similarity". This also requires to write code for the query 2. You can often easily match the performance with regular embeddings by just adding dimensions and training more. So the advantage of exotic embeddings has to be with the information in the more complex mathematical abstraction. So they need a killer usecase to become popular, it's hard to move the needle. [1]: https://arxiv.org/abs/1705.08039
andyxor
Neutral mention · rule
that's funny, I was just reading on "Hyperbolic geometry of the olfactory space", it maps nicely to hierarchical knowledge representation: https://advances.sciencemag.org/content/4/8/eaaq1458 also see Tatyana Sharpee' argument for hyperbolic geometry in neural circuits: https://www.sciencedirect.com/science/article/abs/pii/S09594... the paper from 2010 that popularized its applications: "Hyperbolic Geometry of Complex Networks": https://arxiv.org/abs/1006.5169 A related work "Poincare embeddings for learning hierarchical representations" from 2017 is well known in "graph embeddings" space: https://arxiv.org/abs/1705.08039
boltzmannbrain
Neutral mention · rule
Authors learn embeddings in a Poincaré space rather than Euclidean, better for hierarchical relationships. The reference paper is a good read: Nickel & Kiela '17 "Poincaré Embeddings for Learning Hierarchical Representations", https://arxiv.org/abs/1705.08039

Keep following the thread.

More in Algorithms

More from the same topics.

1994arXiv

On proof and progress in mathematics

William P. Thurston

In response to Jaffe and Quinn [math.HO/9307227], the author discusses forms of progress in mathematics that are not captured by formal proofs of theorems, especially in his own work in the theory of foliations and geometrization of 3-manifolds and dynamical systems.

29 mentions21 months
9HN score