Poincaré Embeddings for Learning Hierarchical Representations

05/22/2017 ∙ by Maximilian Nickel, et al. ∙ Facebook 0

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.



There are no comments yet.


page 1

page 2

page 3

page 4

Code Repositories


Poincaré Embedding

view repo


Poincare Embeddings for Word Vector Representations

view repo


The Year in Review 2017 | open guide to natural language processing

view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Learning representations of symbolic data such as text, graphs and multi-relational data has become a central paradigm in machine learning and artificial intelligence. For instance, word embeddings such as

word2vec Mikolov et al. (2013), GloVe Pennington et al. (2014) and FastText Bojanowski et al. (2016)

are widely used for tasks ranging from machine translation to sentiment analysis. Similarly, embeddings of graphs such as latent space embeddings

Hoff et al. (2002), node2vec Grover and Leskovec (2016), and DeepWalk Perozzi et al. (2014) have found important applications for community detection and link prediction in social networks. Embeddings of multi-relational data such as Rescal Nickel et al. (2011), TransE Bordes et al. (2013), and Universal Schema Riedel et al. (2013)

are being used for knowledge graph completion and information extraction.

Typically, the objective of embedding methods is to organize symbolic objects (e.g., words, entities, concepts) in a way such that their similarity in the embedding space reflects their semantic or functional similarity. For this purpose, the similarity of objects is usually measured either by their distance or by their inner product in the embedding space. For instance, Mikolov et al. (2013) embed words in such that their inner product is maximized when words co-occur within similar contexts in text corpora. This is motivated by the distributional hypothesis Harris (1954); Firth (1957), i.e., that the meaning of words can be derived from the contexts in which they appear. Similarly, Hoff et al. (2002) embed social networks such that the distance between social actors is minimized if they are connected in the network. This reflects the homophily property found in many real-world networks, i.e. that similar actors tend to associate with each other.

Although embedding methods have proven successful in numerous applications, they suffer from a fundamental limitation: their ability to model complex patterns is inherently bounded by the dimensionality of the embedding space. For instance, Nickel et al. (2014) showed that linear embeddings of graphs can require a prohibitively large dimensionality to model certain types of relations. Although non-linear embeddings can mitigate this problem Bouchard et al. (2015), complex graph patterns can still require a computationally infeasible embedding dimensionality. As a consequence, no method yet exists that is able to compute embeddings of large graph-structured data – such as social networks, knowledge graphs or taxonomies – without loss of information. Since the ability to express information is a precondition for learning and generalization, it is therefore important to increase the representation capacity of embedding methods such that they can realistically be used to model complex patterns on a large scale. In this work, we focus on mitigating this problem for a certain class of symbolic data, i.e., large datasets whose objects can be organized according to a latent hierarchy – a property that is inherent in many complex datasets. For instance, the existence of power-law distributions in datasets can often be traced back to hierarchical structures Ravasz and Barabási (2003). Prominent examples of power-law distributed data include natural language (Zipf’s law Zipf (1949)) and scale-free networks such as social and semantic networks Steyvers and Tenenbaum (2005). Similarly, the empirical analysis of Adcock et al. (2013) indicated that many real-world networks exhibit an underlying tree-like structure.

To exploit this structural property for learning more efficient representations, we propose to compute embeddings not in Euclidean but in hyperbolic space, i.e., space with constant negative curvature. Informally, hyperbolic space can be thought of as a continuous version of trees and as such it is naturally equipped to model hierarchical structures. For instance, it has been shown that any finite tree can be embedded into a finite hyperbolic space such that distances are preserved approximately Gromov (1987). We base our approach on a particular model of hyperbolic space, i.e., the Poincaré ball model, as it is well-suited for gradient-based optimization. This allows us to develop an efficient algorithm for computing the embeddings based on Riemannian optimization, which is easily parallelizable and scales to large datasets. Experimentally, we show that our approach can provide high quality embeddings of large taxonomies – both with and without missing data. Moreover, we show that embeddings trained on WordNet provide state-of-the-art performance for lexical entailment. On collaboration networks, we also show that Poincaré embeddings are successful in predicting links in graphs where they outperform Euclidean embeddings, especially in low dimensions.

The remainder of this paper is organized as follows: In Section 2 we briefly review hyperbolic geometry and discuss related work regarding hyperbolic embeddings. In Section 3 we introduce Poincaré embeddings and discuss how to compute them. In Section 4 we evaluate our approach on tasks such as taxonomy embedding, link prediction in networks and predicting lexical entailment.

2 Embeddings and Hyperbolic Geometry

Hyperbolic geometry is a non-Euclidean geometry which studies spaces of constant negative curvature. It is, for instance, associated with Minkowski spacetime in special relativity. In network science, hyperbolic spaces have started to receive attention as they are well-suited to model hierarchical data. For instance, consider the task of embedding a tree into a metric space such that its structure is reflected in the embedding. A regular tree with branching factor has nodes at level and nodes on a level less or equal than . Hence, the number of children grows exponentially with their distance to the root of the tree. In hyperbolic geometry this kind of tree structure can be modeled easily in two dimensions: nodes that are exactly levels below the root are placed on a sphere in hyperbolic space with radius and nodes that are less than levels below the root are located within this sphere. This type of construction is possible as hyperbolic disc area and circle length grow exponentially with their radius.111For instance, in a two dimensional hyperbolic space with constant curvature , the length of a circle is given as while the area of a disc is given as . Since and , both disc area and circle length grow exponentially with . See Figure 1 for an example. Intuitively, hyperbolic spaces can be thought of as continuous versions of trees or vice versa, trees can be thought of as "discrete hyperbolic spaces" Krioukov et al. (2010). In , a similar construction is not possible as circle length () and disc area () grow only linearly and quadratically with regard to in Euclidean geometry. Instead, it is necessary to increase the dimensionality of the embedding to model increasingly complex hierarchies. As the number of parameters increases, this can lead to computational problems in terms of runtime and memory complexity as well as to overfitting.

(a) Geodesics of the Poincaré disk
(b) Embedding of a tree in
(c) Growth of Poincaré distance
Figure 1: fig:geodesics Due to the negative curvature of , the distance of points increases exponentially (relative to their Euclidean distance) the closer they are to the boundary. fig:poin-dist Growth of the Poincaré distance relative to the Euclidean distance and the norm of (for fixed ). fig:tree-embedding-example Embedding of a regular tree in such that all connected nodes are spaced equally far apart (i.e., all black line segments have identical hyperbolic length).

Due to these properties, hyperbolic space has recently been considered to model complex networks. For instance, Kleinberg (2007) introduced hyperbolic geometry for greedy routing in geographic communication networks. Similarly, Boguñá et al. (2010) proposed hyperbolic embeddings of the AS Internet topology to perform greedy shortest path routing in the embedding space. Krioukov et al. (2010) developed a framework to model complex networks using hyperbolic spaces and discussed how typical properties such as heterogeneous degree distributions and strong clustering emerges by assuming an underlying hyperbolic geometry to these networks. Adcock et al. (2013) proposed a measure based on Gromov’s -hyperbolicity Gromov (1987) to characterize the tree-likeness of graphs.

In machine learning and artificial intelligence on the other hand, Euclidean embeddings have become a popular approach for learning from symbolic data. For instance, in addition to the methods discussed in Section 1, Paccanaro and Hinton (2001) proposed one of the first embedding methods to learn from relational data. More recently, Holographic Nickel et al. (2016) and Complex Embeddings Trouillon et al. (2016) have shown state-of-the-art performance in Knowledge Graph completion. In relation to hierarchical representations, Vilnis and McCallum (2015) proposed to learn density-based word representations, i.e., Gaussian embeddings, to capture uncertainty and asymmetry. Given information about hierarchical relations in the form of ordered input pairs, Vendrov et al. (2015) proposed Order Embeddings to model visual-semantic hierarchies over words, sentences, and images.

3 Poincaré Embeddings

In the following, we are interested in finding embeddings of symbolic data such that their distance in the embedding space reflects their semantic similarity. We assume that there exists a latent hierarchy in which the symbols can be organized. In addition to the similarity of objects, we intend to also reflect this hierarchy in the embedding space to improve over existing methods in two ways:

  1. By inducing an appropriate bias on the structure of the embedding space, we aim at learning more parsimonious embeddings for superior generalization performance and decreased runtime and memory complexity.

  2. By capturing the hierarchy explicitly in the embedding space, we aim at gaining additional insights about the relationships between symbols and the importance of individual symbols.

However, we do not assume that we have direct access to information about the hierarchy, e.g., via ordered input pairs. Instead, we consider the task of inferring the hierarchical relationships fully unsupervised, as is, for instance, necessary for text and network data. For these reasons – and motivated by the discussion in Section 2 – we embed symbolic data into hyperbolic space . In contrast to Euclidean space , there exist multiple, equivalent models of such as the Beltrami-Klein model, the hyperboloid model, and the Poincaré half-plane model. In the following, we will base our approach on the Poincaré ball model, as it is well-suited for gradient-based optimization.222It can be seen easily that the distance function of the Poincare ball in Equation 1 is differentiable. Hence, for this model, an optimization algorithm only needs to maintain the constraint that for all embeddings. Other models of hyperbolic space however, would be more more difficult to optimize, either due to the form of their distance function or due to the constraints that they introduce. For instance, the hyperboloid model is constrained to points where , while the distance function of the Beltrami-Klein model requires to compute the location of ideal points on the boundary of the unit ball. In particular, let be the open -dimensional unit ball, where denotes the Euclidean norm. The Poincaré ball model of hyperbolic space corresponds then to the Riemannian manifold

, i.e., the open unit ball equipped with the Riemannian metric tensor

where and denotes the Euclidean metric tensor. Furthermore, the distance between points is given as


The boundary of the ball is denoted by . It corresponds to the sphere and is not part of the hyperbolic space, but represents infinitely distant points. Geodesics in are then circles that are orthogonal to (as well as all diameters). See Figure 1 for an illustration.

It can be seen from Equation 1, that the distance within the Poincaré ball changes smoothly with respect to the location of and . This locality property of the Poincaré distance is key for finding continuous embeddings of hierarchies. For instance, by placing the root node of a tree at the origin of it would have a relatively small distance to all other nodes as its Euclidean norm is zero. On the other hand, leaf nodes can be placed close to the boundary of the Poincaré ball as the distance grows very fast between points with a norm close to one. Furthermore, please note that Equation 1 is symmetric and that the hierarchical organization of the space is solely determined by the distance of points to the origin. Due to this self-organizing property, Equation 1 is applicable in an unsupervised setting where the hierarchical order of objects is not specified in advance such as text and networks. Remarkably, Equation 1 allows us therefore to learn embeddings that simultaneously capture the hierarchy of objects (through their norm) as well a their similarity (through their distance).

Since a single hierarchical structure can already be represented in two dimensions, the Poincaré disk () is typically used to represent hyperbolic geometry. In our method, we instead use the Poincaré ball (

), for two main reasons: First, in many datasets such as text corpora, multiple latent hierarchies can co-exist, which can not always be modeled in two dimensions. Second, a larger embedding dimension can decrease the difficulty for an optimization method to find a good embedding (also for single hierarchies) as it allows for more degrees of freedom during the optimization process.

To compute Poincaré embeddings for a set of symbols , we are then interested in finding embeddings , where

. We assume we are given a problem-specific loss function

which encourages semantically similar objects to be close in the embedding space according to their Poincaré distance. To estimate

, we then solve the optimization problem


We will discuss specific loss functions in Section 4.

3.1 Optimization

Since the Poincaré Ball has a Riemannian manifold structure, we can optimize Equation 2 via stochastic Riemannian optimization methods such as RSGD Bonnabel (2013) or RSVRG Zhang et al. (2016). In particular, let denote the tangent space of a point . Furthermore, let denote the Riemannian gradient of and let denote the Euclidean gradient of . Using RSGD, parameter updates to minimize Equation 2 are then of the form

where denotes the retraction onto at and denotes the learning rate at time . Hence, for the minimization of Equation 2, we require the Riemannian gradient and a suitable retraction. Since the Poincaré ball is a conformal model of hyperbolic space, the angles between adjacent vectors are identical to their angles in the Euclidean space. The length of vectors however might differ. To derive the Riemannian gradient from the Euclidean gradient, it is sufficient to rescale with the inverse of the Poincaré ball metric tensor, i.e., . Since is a scalar matrix, the inverse is trivial to compute. Furthermore, since Equation 1 is fully differentiable, the Euclidean gradient can easily be derived using standard calculus. In particular, the Euclidean gradient depends on the gradient of , which we assume is known, and the partial derivatives of the Poincaré distance, which can be computed as follows: Let , and let


The partial derivate of the Poincaré distance with respect to is then given as


Since is symmetric, the partial derivative can be derived analogously. As retraction operation we use . In combination with the Riemannian gradient, this corresponds then to the well-known natural gradient method Amari (1998). Furthermore, we constrain the embeddings to remain within the Poincaré ball via the projection

where is a small constant to ensure numerical stability. In all experiments we used . In summary, the full update for a single embedding is then of the form


It can be seen from Equations 5 and 4 that this algorithm scales well to large datasets, as the computational and memory complexity of an update depends linearly on the embedding dimension. Moreover, the algorithm is straightforward to parallelize via methods such as Hogwild Recht et al. (2011), as the updates are sparse (only a small number of embeddings are modified in an update) and collisions are very unlikely on large-scale data.

3.2 Training Details

In addition to this optimization procedure, we found that the following training details were helpful for obtaining good representations: First, we initialize all embeddings randomly from the uniform distribution

. This causes embeddings to be initialized close to the origin of . Second, we found that a good initial angular layout can be helpful to find good embeddings. For this reason, we train during an initial "burn-in" phase with a reduced learning rate . In combination with initializing close to the origin, this can improve the angular layout without moving too far towards the boundary. In our experiments, we set

and the duration of the burn-in to 10 epochs.

4 Evaluation

In this section, we evaluate the quality of Poincaré embeddings for a variety of tasks, i.e., for the embedding of taxonomies, for link prediction in networks, and for modeling lexical entailment. We compare the Poincaré distance as defined in Equation 1 to the following two distance functions:


In all cases, we include the Euclidean distance . As the Euclidean distance is flat and symmetric, we expect that it requires a large dimensionality to model the hierarchical structure of the data.


For asymmetric data, we also include the score function , as proposed by Bordes et al. (2013) for modeling large-scale graph-structured data. For this score function, we also learn the global translation vector during training.

Note that the translational score function has, due to its asymmetry, more information about the nature of an embedding problem than a symmetric distance when the order of indicates the hierarchy of elements. This is, for instance, the case for relations in taxonomies. For the Poincaré distance and the Euclidean distance we could randomly permute the order of and obtain the identical embedding, while this is not the case for the translational score function. As such, it is not fully unsupervised and only applicable where this hierarchical information is available.

4.1 Embedding Taxonomies

In the first set of experiments, we are interested in evaluating the ability of Poincaré embeddings to embed data that exhibits a clear latent hierarchical structure. For this purpose, we conduct experiments on the transitive closure of the WordNet noun hierarchy Miller and Fellbaum (1998) in two settings:


To evaluate representation capacity, we embed fully observed data and reconstruct it from the embedding. The reconstruction error in relation to the embedding dimension is then a measure for the capacity of the model.

Link Prediction

To test generalization performance, we split the data into a train, validation and test set by randomly holding out observed links. Links in the validation and test set do not include the root or leaf nodes as these links would either be trivial to predict or impossible to predict reliably.

Since we are using the transitive closure, the hypernymy relations form a directed acyclic graph such that the hierarchical structure is not directly visible from the raw data but has to be inferred. The transitive closure of the WordNet noun hierarchy consists of 82,115 nouns and 743,241 hypernymy relations. On this data, we learn embeddings in both settings as follows: Let be the set of observed hypernymy relations between noun pairs. We then learn embeddings of all symbols in such that related objects are close in the embedding space. In particular, we minimize the loss function


where is the set of negative examples for (including ). For training, we randomly sample 10 negative examples per positive example. Equation 6 can be interpreted as a soft ranking loss where related objects should be closer than objects for which we didn’t observe a relationship. This choice of loss function is motivated by the fact that we don’t want to push symbols belonging to distinct subtrees arbitrarily far apart as their subtrees might still be close. Instead we want them to be farther apart than symbols with an observed relation.

5 10 20 50 100 200
WordNet Reconstruction Euclidean Rank 3542.3 2286.9 1685.9 1281.7 1187.3 1157.3
MAP 0.024 0.059 0.087 0.140 0.162 0.168
Translational Rank 205.9 179.4 95.3 92.8 92.7 91.0
MAP 0.517 0.503 0.563 0.566 0.562 0.565
Poincaré Rank 4.9 4.02 3.84 3.98 3.9 3.83
MAP 0.823 0.851 0.855 0.86 0.857 0.87
WordNet Link Pred. Euclidean Rank 3311.1 2199.5 952.3 351.4 190.7 81.5
MAP 0.024 0.059 0.176 0.286 0.428 0.490
Translational Rank 65.7 56.6 52.1 47.2 43.2 40.4
MAP 0.545 0.554 0.554 0.56 0.562 0.559
Poincaré Rank 5.7 4.3 4.9 4.6 4.6 4.6
MAP 0.825 0.852 0.861 0.863 0.856 0.855
Table 1: Experimental results on the transitive closure of the WordNet noun hierarchy. Highlighted cells indicate the best Euclidean embeddings as well as the Poincaré embeddings which acheive equal or better results. Bold numbers indicate absolute best results.

We evaluate the quality of the embeddings as commonly done for graph embeddings Bordes et al. (2013); Nickel et al. (2016): For each observed relationship , we rank its distance among the ground-truth negative examples for , i.e., among the set . In the Reconstruction setting, we evaluate the ranking on all nouns in the dataset. We then record the mean rank of as well as the mean average precision (MAP) of the ranking. The results of these experiments are shown in Table 1. It can be seen that Poincaré embeddings are very successful in the embedding of large taxonomies – both with regard to their representation capacity and their generalization performance. Even compared to Translational embeddings, which have more information about the structure of the task, Poincaré embeddings show a greatly improved performance while using an embedding that is smaller by an order of magnitude. Furthermore, the results of Poincaré embeddings in the link prediction task are very robust with regard to the embedding dimension. We attribute this result to the structural bias of Poincaré embeddings, what could lead to reduced overfitting on this kind of data with a clear latent hierarchy. In Figure 2 we show additionally a visualization of a two-dimensional Poincaré embedding. For purpose of clarity, this embedding has been trained only on the mammals subtree of WordNet.

(a) Intermediate embedding after 20 epochs
(b) Embedding after convergence
Figure 2: Two-dimensional Poincaré embeddings of transitive closure of the WordNet mammals subtree. Ground-truth is-a relations of the original WordNet tree are indicated via blue edges. A Poincaré embedding with achieves mean rank 1.26 and MAP 0.927 on this subtree.

4.2 Network Embeddings

Next, we evaluated the performance of Poincaré embeddings for link prediction in networks. Since edges in complex networks can often be explained via latent hierarchies over their nodes Clauset et al. (2008), we are interested in the benefits of Poincaré embeddings both in terms representation size and generalization performance. We performed our experiments on four commonly used social networks, i.e, AstroPh, CondMat, GrQc, and HepPh

. These networks represent scientific collaborations such that there exists an undirected edge between two persons if they co-authored a paper. For these networks, we model the probability of an edge as proposed by

Krioukov et al. (2010) via the Fermi-Dirac distribution



are hyperparameters. Here,

corresponds to the radius around each point such that points within this radius are likely to have an edge with . The parameter specifies the steepness of the logistic function and influences both average clustering as well as the degree distribution Krioukov et al. (2010). We use the cross-entropy loss to learn the embeddings and sample negatives as in Section 4.1.

For evaluation, we split each dataset randomly into train, validation, and test set. The hyperparameters and where tuned for each method on the validation set. Table 2 lists the MAP score of Poincaré and Euclidean embeddings on the test set for the hyperparameters with the best validation score. Additionally, we again list the reconstruction performance without missing data. Translational embeddings are not applicable to these datasets as they consist of undirected edges. It can be seen that Poincaré embeddings perform again very well on these datasets and – especially in the low-dimensional regime – outperform Euclidean embeddings.

Reconstruction Link Prediction
10 20 50 100 10 20 50 100
AstroPh Euclidean 0.376 0.788 0.969 0.989 0.508 0.815 0.946 0.960
N=18,772; E=198,110 Poincaré 0.703 0.897 0.982 0.990 0.671 0.860 0.977 0.988
CondMat Euclidean 0.356 0.860 0.991 0.998 0.308 0.617 0.725 0.736
N=23,133; E=93,497 Poincaré 0.799 0.963 0.996 0.998 0.539 0.718 0.756 0.758
GrQc Euclidean 0.522 0.931 0.994 0.998 0.438 0.584 0.673 0.683
N=5,242; E=14,496 Poincaré 0.990 0.999 0.999 0.999 0.660 0.691 0.695 0.697
HepPh Euclidean 0.434 0.742 0.937 0.966 0.642 0.749 0.779 0.783
N=12,008; E=118,521 Poincaré 0.811 0.960 0.994 0.997 0.683 0.743 0.770 0.774
Table 2: Mean average precision for Reconstruction and Link Prediction on network data.

4.3 Lexical Entailment

An interesting aspect of Poincaré embeddings is that they allow us to make graded assertions about hierarchical relationships as hierarchies are represented in a continuous space. We test this property on HyperLex Vulić et al. (2016), which is a gold standard resource for evaluating how well semantic models capture graded lexical entailment by quantifying to what degree is a type of via ratings on a scale of . Using the noun part of HyperLex, which consists of 2163 rated noun pairs, we then evaluated how well Poincaré embeddings reflect these graded assertions. For this purpose, we used the Poincaré embeddings that were obtained in Section 4.1 by embedding WordNet with a dimensionality . Note that these embeddings were not specifically trained for this task. To determine to what extent is true, we used the score function:


Here, the term acts as a penalty when is lower in the embedding hierarchy, i.e., when has a higher norm than . The hyperparameter determines the severity of the penalty. In our experiments we set .

Using Equation 8, we scored all noun pairs in HyperLex and recorded Spearman’s rank correlation with the ground-truth ranking. The results of this experiment are shown in Table 3. It can be seen that the ranking based on Poincaré embeddings clearly outperforms all state-of-the-art methods evaluated in Vulić et al. (2016). Methods in Table 3 that are prefixed with WN also use WordNet as a basis and therefore are most comparable. The same embeddings also achieved a state-of-the-art accuracy of on Wbless Weeds et al. (2014); Kiela et al. (2015), which evaluates non-graded lexical entailment.

FR SLQS-Sim WN-Basic WN-WuP WN-LCh Vis-ID Euclidean Poincaré
0.283 0.229 0.240 0.214 0.214 0.253 0.389 0.512
Table 3: Spearman’s for Lexical Entailment on HyperLex.

5 Discussion and Future Work

In this paper, we introduced Poincaré embeddings for learning representations of symbolic data and showed how they can simultaneously learn the similarity and the hierarchy of objects. Furthermore, we proposed an efficient algorithm to compute the embeddings and showed experimentally, that Poincaré embeddings provide important advantages over Euclidean embeddings on hierarchical data: First, Poincaré embeddings enable very parsimonious representations whats allows us to learn high-quality embeddings of large-scale taxonomies. Second, excellent link prediction results indicate that hyperbolic geometry can introduce an important structural bias for the embedding of complex symbolic data. Third, state-of-the-art results for predicting lexical entailment suggest that the hierarchy in the embedding space corresponds well to the underlying semantics of the data.

The main focus of this work was to evaluate the general properties of hyperbolic geometry for the embedding of symbolic data. In future work, we intend, to both expand the applications of Poincaré embeddings – for instance to multi-relational data – and also to derive models that are tailored to specific applications such as word embeddings. Furthermore, we have shown that natural gradient based optimization already produces very good embeddings and scales to large datasets. We expect that a full Riemannian optimization approach can further increase the quality of the embeddings and lead to faster convergence.


  • Adcock et al. [2013] Aaron B Adcock, Blair D Sullivan, and Michael W Mahoney. Tree-like structure in large social and information networks. In Data Mining (ICDM), 2013 IEEE 13th International Conference on, pages 1–10. IEEE, 2013.
  • Amari [1998] Shun-ichi Amari. Natural gradient works efficiently in learning. Neural Computation, 10(2):251–276, 1998.
  • Boguñá et al. [2010] M Boguñá, F Papadopoulos, and D Krioukov. Sustaining the internet with hyperbolic mapping. Nature communications, 1:62, 2010.
  • Bojanowski et al. [2016] Piotr Bojanowski, Edouard Grave, Armand Joulin, and Tomas Mikolov. Enriching word vectors with subword information. arXiv preprint arXiv:1607.04606, 2016.
  • Bonnabel [2013] Silvere Bonnabel. Stochastic gradient descent on riemannian manifolds. IEEE Trans. Automat. Contr., 58(9):2217–2229, 2013.
  • Bordes et al. [2013] Antoine Bordes, Nicolas Usunier, Alberto García-Durán, Jason Weston, and Oksana Yakhnenko. Translating embeddings for modeling multi-relational data. In Advances in Neural Information Processing Systems 26, pages 2787–2795, 2013.
  • Bouchard et al. [2015] Guillaume Bouchard, Sameer Singh, and Theo Trouillon. On approximate reasoning capabilities of low-rank vector spaces. AAAI Spring Syposium on Knowledge Representation and Reasoning (KRR): Integrating Symbolic and Neural Approaches, 2015.
  • Clauset et al. [2008] Aaron Clauset, Cristopher Moore, and Mark EJ Newman. Hierarchical structure and the prediction of missing links in networks. Nature, 453(7191):98–101, 2008.
  • Firth [1957] John Rupert Firth. A synopsis of linguistic theory, 1930-1955. Studies in linguistic analysis, 1957.
  • Gromov [1987] Mikhael Gromov. Hyperbolic groups. In Essays in group theory, pages 75–263. Springer, 1987.
  • Grover and Leskovec [2016] Aditya Grover and Jure Leskovec. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 855–864. ACM, 2016.
  • Harris [1954] Zellig S Harris. Distributional structure. Word, 10(2-3):146–162, 1954.
  • Hoff et al. [2002] Peter D Hoff, Adrian E Raftery, and Mark S Handcock. Latent space approaches to social network analysis. Journal of the american Statistical association, 97(460):1090–1098, 2002.
  • Kiela et al. [2015] Douwe Kiela, Laura Rimell, Ivan Vulic, and Stephen Clark. Exploiting image generality for lexical entailment detection. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics (ACL 2015), pages 119–124. ACL, 2015.
  • Kleinberg [2007] Robert Kleinberg. Geographic routing using hyperbolic space. In INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE, pages 1902–1909. IEEE, 2007.
  • Krioukov et al. [2010] Dmitri Krioukov, Fragkiskos Papadopoulos, Maksim Kitsak, Amin Vahdat, and Marián Boguná. Hyperbolic geometry of complex networks. Physical Review E, 82(3):036106, 2010.
  • Mikolov et al. [2013] Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg Corrado, and Jeffrey Dean. Distributed representations of words and phrases and their compositionality. CoRR, abs/1310.4546, 2013.
  • Miller and Fellbaum [1998] George Miller and Christiane Fellbaum. Wordnet: An electronic lexical database, 1998.
  • Nickel et al. [2011] Maximilian Nickel, Volker Tresp, and Hans-Peter Kriegel. A three-way model for collective learning on multi-relational data. In Proceedings of the 28th International Conference on Machine Learning, ICML, pages 809–816, 2011.
  • Nickel et al. [2014] Maximilian Nickel, Xueyan Jiang, and Volker Tresp. Reducing the rank in relational factorization models by including observable patterns. In Advances in Neural Information Processing Systems 27, pages 1179–1187, 2014.
  • Nickel et al. [2016] Maximilian Nickel, Lorenzo Rosasco, and Tomaso A. Poggio. Holographic embeddings of knowledge graphs. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pages 1955–1961, 2016.
  • Paccanaro and Hinton [2001] Alberto Paccanaro and Geoffrey E. Hinton.

    Learning distributed representations of concepts using linear relational embedding.

    IEEE Trans. Knowl. Data Eng., 13(2):232–244, 2001.
  • Pennington et al. [2014] Jeffrey Pennington, Richard Socher, and Christopher D Manning. Glove: Global vectors for word representation. In EMNLP, volume 14, pages 1532–1543, 2014.
  • Perozzi et al. [2014] Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 701–710. ACM, 2014.
  • Ravasz and Barabási [2003] Erzsébet Ravasz and Albert-László Barabási. Hierarchical organization in complex networks. Physical Review E, 67(2):026112, 2003.
  • Recht et al. [2011] Benjamin Recht, Christopher Ré, Stephen J. Wright, and Feng Niu. Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In Advances in Neural Information Processing Systems 24, pages 693–701, 2011.
  • Riedel et al. [2013] Sebastian Riedel, Limin Yao, Andrew McCallum, and Benjamin M Marlin. Relation extraction with matrix factorization and universal schemas. In Proceedings of NAACL-HLT, pages 74–84, 2013.
  • Steyvers and Tenenbaum [2005] Mark Steyvers and Joshua B Tenenbaum. The large-scale structure of semantic networks: Statistical analyses and a model of semantic growth. Cognitive science, 29(1):41–78, 2005.
  • Trouillon et al. [2016] Théo Trouillon, Johannes Welbl, Sebastian Riedel, Éric Gaussier, and Guillaume Bouchard. Complex embeddings for simple link prediction. In Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, June 19-24, 2016, pages 2071–2080, 2016.
  • Vendrov et al. [2015] Ivan Vendrov, Ryan Kiros, Sanja Fidler, and Raquel Urtasun. Order-embeddings of images and language. arXiv preprint arXiv:1511.06361, 2015.
  • Vilnis and McCallum [2015] Luke Vilnis and Andrew McCallum. Word representations via gaussian embedding. In International Conference on Learning Representations (ICLR), 2015.
  • Vulić et al. [2016] Ivan Vulić, Daniela Gerz, Douwe Kiela, Felix Hill, and Anna Korhonen. Hyperlex: A large-scale evaluation of graded lexical entailment. arXiv preprint arXiv:1608.02117, 2016.
  • Weeds et al. [2014] Julie Weeds, Daoud Clarke, Jeremy Reffin, David Weir, and Bill Keller. Learning to distinguish hypernyms and co-hyponyms. In Proceedings of the 25th International Conference on Computational Linguistics COLING, pages 2249–2259. Dublin City University and Association for Computational Linguistics, 2014.
  • Zhang et al. [2016] Hongyi Zhang, Sashank J. Reddi, and Suvrit Sra. Riemannian SVRG: fast stochastic optimization on riemannian manifolds. In Advances in Neural Information Processing Systems 29, pages 4592–4600, 2016.
  • Zipf [1949] George Kingsley Zipf. Human Behaviour and the Principle of Least Effort: an Introduction to Human Ecology. Addison-Wesley, 1949.