Knowledge graph (KG) embeddings learn low-dimensional representations of entities and relations to predict missing facts. KGs often exhibit hierarchical and logical patterns which must be preserved in the embedding space. For hierarchical data, hyperbolic embedding methods have shown promise for high-fidelity and parsimonious representations. However, existing hyperbolic embedding methods do not account for the rich logical patterns in KGs. In this work, we introduce a class of hyperbolic KG embedding models that simultaneously capture hierarchical and logical patterns. Our approach combines hyperbolic reflections and rotations with attention to model complex relational patterns. Experimental results on standard KG benchmarks show that our method improves over previous Euclideanand hyperbolic-based efforts by up to 6.1% in mean reciprocal rank (MRR) in low dimensions. Furthermore, we observe that different geometric transformations capture different types of relations while attention-based transformations generalize to multiple relations. In high dimensions, our approach yields new state-of-the-art MRRs of 49.6% on WN18RR and 57.7% on YAGO3-10. Knowledge graphs (KGs), consisting of ( head entity , relationship , tail entity ) triples, are popular data structures for representing factual knowledge to be queried and used in downstream applications such as word sense disambiguation, question answering, and information extraction. Real-world KGs such as Yago (Suchanek et al., 2007) or Wordnet (Miller, 1995) are usually incomplete, so a common approach to predicting missing links in KGs is via embedding into vector spaces. Embedding  Work partially done during an internship at Google. methods learn representations of entities and relationships that preserve the information found in the graph, and have achieved promising results for many tasks. Relations found in KGs have differing properties: for example, ( Michelle Obama , married to , Barack Obama ) is symmetric, whereas hypernym relations like ( cat , specific type of , feline ), are not (Figure 1). These distinctions present a challenge to embedding methods: preserving each type of behavior requires producing a different geometric pattern in the embedding space. One popular approach is to use extremely high-dimensional embeddings, which offer more flexibility for such patterns. However, given the large number of entities found in KGs, doing so yields very high memory costs. For hierarchical data, hyperbolic geometry offers an exciting approach to learn low-dimensional embeddings while preserving latent hierarchies. Hyperbolic space can embed trees with arbitrarily low distortion in just two dimensions. Recent research has proposed embedding hierarchical graphs into these spaces instead of conventional Euclidean space (Nickel and Kiela, 2017; Sala et al., 2018). However, these works focus on embedding simpler graphs (e.g., weighted trees) and cannot express the diverse and complex relationships in KGs. We propose a new hyperbolic embedding approach that captures such patterns to achieve the best of both worlds. Our proposed approach produces the parsimonious representations offered by hyperbolic space, especially suitable for hierarchical relations, and is effective even with low-dimensional embeddings. It also uses rich transformations to encode logical patterns in KGs, previously only defined in Euclidean space. To accomplish this, we (1) train hyperbolic embeddings with relation-specific curvatures to preserve multiple hierarchies in KGs; (2) parameterize hyperbolic isometries (distance-preserving operations) and leverage their geometric properties to capture relations' logical patterns, such as symmetry or anti-symmetry; (3) and use a notion of hyperbolic attention to combine geometric operators and capture multiple logical patterns. We evaluate the performance of our approach, ATTH, on the KG link prediction task using the standard WN18RR (Dettmers et al., 2018; Bordes et al., 2013), FB15k-237 (Toutanova and Chen, 2015) and YAGO3-10 (Mahdisoltani et al., 2013) benchmarks. (1) In low (32) dimensions, we improve over Euclidean-based models by up to 6.1% in the mean reciprocical rank (MRR) metric. In particular, we find that hierarchical relationships, such as WordNet's hypernym and member meronym , significantly benefit from hyperbolic space; we observe a 16% to 24% relative improvement versus Euclidean baselines. (2) We find that geometric properties of hyperbolic isometries directly map to logical properties of relationships. We study symmetric and anti-symmetric patterns and find that reflections capture symmetric relations while rotations capture anti-symmetry. (3) We show that attention based-transformations have the ability to generalize to multiple logical patterns. For instance, we observe that ATTH recovers reflections for symmetric relations and rotations for the antisymmetric ones. In high (500) dimensions, we find that both hyperbolic and Euclidean embeddings achieve similar performance, and our approach achieves new state-of-the-art results (SotA), obtaining 49.6% MRR on WN18RR and 57.7% YAGO3-10. Our experiments show that trainable curvature is critical to generalize hyperbolic embedding methods to high-dimensions. Finally, we visualize embeddings learned in hyperbolic spaces and show that hyperbolic geometry effectively preserves hierarchies in KGs. Previous methods for KG embeddings also rely on geometric properties. Improvements have been obtained by exploiting either more sophisticated spaces (e.g., going from Euclidean to complex or hyperbolic space) or more sophisticated operations (e.g., from translations to isometries, or to learning graph neural networks). In contrast, our approach takes a step forward in both directions. Euclidean embeddings In the past decade, there has been a rich literature on Euclidean embeddings for KG representation learning. These include translation approaches (Bordes et al., 2013; Ji et al., 2015; Wang et al., 2014; Lin et al., 2015) or tensor factorization methods such as RESCAL (Nickel et al., 2011) or DistMult (Yang et al., 2015). While these methods are fairly simple and have few parameters, they fail to encode important logical properties (e.g., translations can't encode symmetry). Complex embeddings Recently, there has been interest in learning embeddings in complex space, as in the ComplEx (Trouillon et al., 2016) and RotatE (Sun et al., 2019) models. RotatE learns rotations in complex space, which are very effective in capturing logical properties such as symmetry, anti-symmetry, composition or inversion. The recent QuatE model (Zhang et al., 2019) learns KG embeddings using quaternions. However, a downside is that these embeddings require very high-dimensional spaces, leading to high memory costs. Deep neural networks Another family of methods uses neural networks to produce KG embeddings. For instance, R-GCN (Schlichtkrull et al., 2018) extends graph neural networks to the multi-relational setting by adding a relation-specific aggregation step. ConvE and ConvKB (Dettmers et al., 2018; Nguyen et al., 2018) leverage the expressiveness of convolutional neural networks to learn entity embeddings and relation embeddings. More recently, the KBGAT (Nathani et al., 2019) and A2N (Bansal et al., 2019) models use graph attention networks for knowledge graph embeddings. A downside of these methods is that they are computationally expensive as they usually require pre-trained KG embeddings as input for the neural network. only method that learns KG embeddings in hyperbolic space in order to target hierarchical data. MuRP minimizes hyperbolic distances between a re-scaled version of the head entity embedding and a translation of the tail entity embedding. It achieves promising results using hyperbolic embeddings with fewer dimensions than its Euclidean analogues. However, MuRP is a translation model and fails to encode some logical properties of relationships. Furthermore, embeddings are learned in a hyperbolic space with fixed curvature, potentially leading to insufficient precision, and training relies on cumbersome Riemannian optimization. Instead, our proposed method leverages expressive hyperbolic isometries to simultaneously capture logical patterns and hierarchies. Furthermore, embeddings are learned using tangent space (i.e., Euclidean) optimization methods and trainable hyperbolic curvatures per relationship, avoiding precision errors that might arise when using a fixed curvature, and providing flexibility to encode multiple hierarchies. We describe the KG embedding problem setting and give some necessary background on hyperbolic geometry. In the KG embedding problem, we are given a set of triples ( h, r, t )  E  V  R  V , where V and R are entity and relationship sets, respectively. The goal is to map entities v  V to embeddings e v  U d V and relationships r  R to embeddings r r  U d R , for some choice of space U (traditionally R ), such that the KG structure is preserved. Concretely, the data is split into E Train and E Test triples. Embeddings are learned by optimizing a scoring function s : V  R  V  R , which measures triples' likelihoods. s (  ,  ,  ) is trained using triples in E Train and the learned embeddings are then used to predict scores for triples in E Test . The goal is to learn embeddings such that the scores of triples in E Test are high compared to triples that are not present in E . We briefly review key notions from hyperbolic geometry; a more in-depth treatment is available in standard texts (Robbin and Salamon). Hyperbolic geometry is a non-Euclidean geometry with con-stant negative curvature. In this work, we use the d T x M M exp x ( v ) v x Figure 2: An illustration of the exponential map exp x ( v ) , which maps the tangent space T x M at the point x to the hyperbolic manifold M . dimensional Poincare ball model with negative curvature  c ( c > 0 ): B d,c = { x  R d : || x || 2 < 1 c } , where ||  || denotes the L 2 norm. For each point x  B d,c , the tangent space T c x is a d -dimensional vector space containing all possible directions of paths in B d,c leaving from x . The tangent space T c x maps to B d,c via the exponential map (Figure 2), and conversely, the logarithmic map maps B d,c to T c x . In particular, we have closed-form expressions for these maps at the origin: exp c 0 ( v ) = tanh(  c || v || ) v  c || v || , (1) log c 0 ( y ) = arctanh(  c || y || ) y  c || y || . (2) Vector addition is not well-defined in the hyperbolic space (adding two points in the Poincare ball might result in a point outside the ball). Instead, Mobius addition  c (Ganea et al., 2018) provides an analogue to Euclidean addition for hyperbolic space. We give its closed-form expression in Appendix A.1. Finally, the hyperbolic distance on B d,c has the explicit formula: d c ( x , y ) = 2  c arctanh(  c ||  x  c y || ) . The goal of this work is to learn parsimonious hyperbolic embeddings that can encode complex logical patterns such as symmetry, anti-symmetry, or inversion while preserving latent hierarchies. Our model, ATTH, (1) learns KG embeddings in hyperbolic space in order to preserve hierarchies (Sec-tion 4.1), (2) uses a class of hyperbolic isometries parameterized by compositions of Givens transformations to encode logical patterns (Section 4.2), (3) combines these isometries with hyperbolic attention (Section 4.3). We describe the full model in Section 4.4. As described, hyperbolic embeddings enable us to represent hierarchies even when we limit ourselves to low-dimensional spaces. In fact, two-dimensional hyperbolic space can represent any tree with arbitrarily small error (Sala et al., 2018). It is important to set the curvature of the hyperbolic space correctly. This parameter provides flexibility to the model, as it determines whether to embed relations into a more curved hyperbolic space (more tree-like), or into a flatter, more Euclidean-like geometry. For each relation, we learn a relation-specific absolute curvature c r , enabling us to represent a variety of hierarchies. As we show in Section 5.5, fixing, rather than learning curvatures can lead to significant performance degradation. Relationships often satisfy particular properties, such as symmetry: e.g., if ( Michelle Obama , married to , Barack Obama ) holds, then ( Barack Obama , married to , Michelle Obama ) does as well. These rules are not universal. For instance, ( Barack Obama , born in , Hawaii ) is not symmetric. Creating and curating a set of deterministic rules is infeasible for large-scale KGs; instead, embedding methods represent relations as parameterized geometric operations that directly map to logical properties. We use two such operations in hyperbolic space: rotations , which effectively capture compositions or anti-symmetric patterns, and reflections , which naturally encode symmetric patterns. Rotations Rotations have been successfully used to encode compositions in complex space with the RotatE model (Sun et al., 2019); we lift these to hyperbolic space. Compared to translations or tensor factorization approaches which can only infer some logical patterns, rotations can simultaneously model and infer inversion , composition , symmetric or anti-symmetric patterns. Reflections These isometries reflect along a fixed subspace. While some rotations can represent symmetric relations (more specifically   rotations), any reflection can naturally represent symmetric relations, since their second power is the identity. They provide a way to fill-in missing entries in symmetric triples, by applying the same operation to both the tail and the head entity. For instance, by modelling sibling of with a reflection, we can 0 0 Parameterization Unlike RotatE which models rotations via unitary complex numbers, we learn relationship-specific isometries using Givens transformations, 2  2 matrices commonly used in numerical linear algebra. Let  r := (  r,i ) i { 1 ,... d 2 } and  r := (  r,i ) i { 1 ,... d 2 } denote relation-specific parameters. Using an even number of dimensions d , our model parameterizes rotations and reflections with block-diagonal matrices of the form: Rot( r ) = diag( G + (  r, 1 ) , . . . , G + (  r, d 2 )) , (4) Ref( r ) = diag( G  (  r, 1 ) , . . . , G  (  r, n 2 )) , (5) where G  (  ) := (cid:20) cos(  )  sin(  ) sin(  )  cos(  ) (cid:21) . (6) Rotations and reflections of this form are hyperbolic isometries (distance-preserving). We can therefore directly apply them to hyperbolic embeddings while preserving the underlying geometry. Additionally, these transformations are computationally efficient and can be computed in linear time in the dimension. We illustrate two-dimensional isometries in both Euclidean and hyperbolic spaces in Figure 3. Of our two classes of hyperbolic isometries, one or the other may better represent a particular relation. To handle this, we use an attention mechanism to learn the right isometry. Thus we can represent symmetric, anti-symmetric or mixed-behaviour relations (i.e. neither symmetric nor anti-symmetric) as a combination of rotations and reflections. Let x H and y H be hyperbolic points (e.g., reflection and rotation embeddings), and a be an attention vector. Our approach maps hyperbolic representations to tangent space representations, x E = log c 0 ( x H ) and y E = log c 0 ( y H ) , and computes attention scores: (  x ,  y ) = Softmax( a T x E , a T y E ) . We then compute a weighted average using the recently proposed tangent space average (Chami et al., 2019; Liu et al., 2019): Att( x H , y H ; a ) := exp c 0 (  x x E +  y y E ) . We have all of the building blocks for ATTH, and can now describe the model architecture. Let ( e Hv ) v V and ( r Hr ) r R denote entity and relationship hyperbolic embeddings respectively. For a triple ( h, r, t )  V  R  V , ATTH applies relation-specific rotations (Equation 4) and reflections (Equation 5) to the head embedding: q H Rot = Rot( r ) e Hh , q H ref = Ref( r ) e Hh . Intuitively, rotations and reflections encode logical patterns while translations capture tree-like structures by moving between levels of the hierarchy. Finally, query embeddings are compared to target tail embeddings via the hyperbolic distance (Equation 3). The resulting scoring function is: s ( h, r, t ) =  d c r ( Q ( h, r ) , e Ht ) 2 + b h + b t , (10) where ( b v ) v V are entity biases which act as margins in the scoring function (Tifrea et al., 2019; Balazevic et al., 2019). The model parameters are then { ( r ,  r , r Hr , a r , c r ) r R , ( e Hv , b v ) v V } . Note that the total number of parameters in ATTH is O ( |V| d ) , similar to traditional models that do not use attention or geometric operations. The extra cost is proportional to the number of relations, which is usually much smaller than the number of entities. (2) We expect the performance of relation-specific geometric operations to vary based on the relation's logical patterns (Section 5.3). (3) In cases where the relations are neither purely symmetric nor antisymmetric, we anticipate that hyperbolic attention outperforms the models which are based on solely reflections or rotations (Section 5.4). Finally, in high dimensions, we expect hyperbolic models with trainable curvature to learn the best geometry, and perform similarly to their Euclidean analogues (Section 5.5). Datasets We evaluate our approach on the link prediction task using three standard competition benchmarks, namely WN18RR (Bordes et al., 2013; Dettmers et al., 2018), FB15k-237 (Bor-des et al., 2013; Toutanova and Chen, 2015) and YAGO3-10 (Mahdisoltani et al., 2013). WN18RR is a subset of WordNet containing 11 lexical relationships between 40,943 word senses, and has a natural hierarchical structure, e.g., ( car , hypernym of , sedan ). FB15k-237 is a subset of Freebase, a collaborative KB of general world knowledge. FB15k-237 has 14,541 entities and 237 relationships, some of which are non-hierarchical, such as born-in or nationality , while others have natural hierarchies, such as part-of (for organiza-tions). YAGO3-10 is a subset of YAGO3, containing 123,182 entities and 37 relations, where most relations provide descriptions of people. Some relationships have a hierarchical structure such as playsFor or actedIn , while others induce logical patterns, like isMarriedTo . For each KG, we follow the standard data augmentation protocol by adding inverse relations (Lacroix et al., 2018) to the datasets. Additionally, we estimate the global graph curvature  G (Gu et al., 2019) (see Appendix A.2 for more details), WN18RR FB15k-237 YAGO3-10 U Model MRR H@1 H@3 H@10 MRR H@1 H@3 H@10 MRR H@1 H@3 H@10 R d RotatE .387 .330 .417 .491 .290 .208 .316 .458 --MuRE .458 .421 .471 .525 .313 .226 .340 .489 .283 .187 .317 .478 C d ComplEx-N3 .420 .390 .420 .460 .294 .211 .322 .463 .336 .259 .367 .484 B d, 1 MuRP .465 .420 .484 .544 .323 .235 .353 .501 .230 .150 .247 .392 R d REFE .455 .419 .470 .521 .302 .216 .330 .474 .370 .289 .403 .527 ROTE .463 .426 .477 .529 .307 .220 .337 .482 .381 .295 .417 .548 ATTE .456 .419 .471 .526 .311 .223 .339 .488 .374 .290 .410 .537 B d,c REFH .447 .408 .464 .518 .312 .224 .342 .489 .381 .302 .415 .530 ROTH .472 .428 .490 .553 .314 .223 .346 .497 .393 .307 .435 559 ATTH .466 .419 .484 .551 .324 .236 .354 .501 .397 .310 .437 .566 Table 2: Link prediction results for low-dimensional embeddings ( d = 32 ) in the filtered setting. which is a distance-based measure of how close a given graph is to being a tree. We summarize the datasets' statistics in Table 1. Baselines We compare our method to SotA models, including MurP (Balazevic et al., 2019), MurE (which is the Euclidean analogue or MurP), RotatE (Sun et al., 2019), ComplEx-N3 (Lacroix et al., 2018) and TuckER (Balazevic et al., 2019). Baseline numbers in high dimensions (Table 5) are taken from the original papers, while baseline numbers in the low-dimensional setting (Table 2) are computed using open-source implementations of each model. In particular, we run hyper-parameter searches over the same parameters as the ones in the original papers to compute baseline numbers in the low-dimensional setting. Ablations To analyze the benefits of hyperbolic geometry, we evaluate the performance of ATTE, which is equivalent to ATTH with curvatures set to zero. Additionally, to better understand the role of attention, we report scores for variants of ATT E/H using only rotations (ROT E/H) or reflections (REF E/H). Evaluation metrics At test time, we use the scoring function in Equation 10 to rank the correct tail or head entity against all possible entities, and use in use inverse relations for head prediction (Lacroix et al., 2018). Similar to previous work, we compute two ranking-based metrics: (1) mean reciprocal rank (MRR), which measures the mean of inverse ranks assigned to correct entities, and (2) hits at K (H@ K , K  { 1 , 3 , 10 } ), which measures the proportion of correct triples among the top K predicted triples. We follow the standard evaluation protocol in the filtered setting (Bordes et al., 2013): all true triples in the KG are filtered out during evaluation, since predicting a low rank for these triples should not be penalized. Training procedure and implementation We train ATTH by minimizing the full cross-entropy loss with uniform negative sampling, where negative examples for a triple ( h, r, t ) are sampled uniformly from all possible triples obtained by perturbing the tail entity: L = (cid:88) t (cid:48) U ( V ) log(1+exp( y t (cid:48) s ( h, r, t (cid:48) ))) , (11) where y t (cid:48) = (cid:40)  1 if t (cid:48) = t 1 otherwise . Since optimization in hyperbolic space is practically challenging, we instead define all parameters in the tangent space at the origin, optimize embeddings using standard Euclidean techniques, and use the exponential map to recover the hyperbolic parameters (Chami et al., 2019). We provide more details on tangent space optimization in Appendix A.4. We conducted a grid search to select the learning rate, optimizer, negative sample size, and batch size, using the validation set to select the best hy-Relation Khs G  GROTE ROTH Improvement member meronym 1.00 -2.90 .320 .399 24.7% hypernym 1.00 -2.46 .237 .276 16.5% has part 1.00 -1.43 .291 .346 18.9% instance hypernym 1.00 -0.82 .488 .520 6.56% member of domain region 1.00 -0.78 .385 .365 -5.19% member of domain usage 1.00 -0.74 .458 .438 -4.37% synset domain topic of 0.99 -0.69 .425 .447 5.17% also see 0.36 -2.09 .634 .705 11.2% derivationally related form 0.07 -3.84 .960 .968 0.83% similar to 0.07 -1.00 1.00 1.00 0.00% verb group 0.07 -0.50 .974 .974 0.00% Table 3: Comparison of H@10 for WN18RR relations. perparameters. Our best model hyperparameters are detailed in Appendix A.3. We conducted all our experiments on NVIDIA Tesla P100 GPUs and make our implementation publicly available  . We first evaluate our approach in the low-dimensional setting for d = 32 , which is approximately one order of magnitude smaller than SotA Euclidean methods. Table 2 compares the performance of ATTH to that of other baselines, including the recent hyperbolic (but not rotation-based) MuRP model. In low dimensions, hyperbolic embeddings offer much better representations for hierarchical relations, confirming our hypothesis. ATTH improves over previous Euclidean and hyperbolic methods by 0.7% and 6.1% points in MRR on WN18RR and YAGO3-10 respectively. Both datasets have multiple hierarchical relationships, suggesting that the hierarchical structure imposed by hyperbolic geometry leads to better embeddings. On FB15k-237, ATTH and MurP achieve similar performance, both improving over Euclidean baselines. We conjecture that translations are sufficient to model relational patterns in FB15k-237. To understand the role of dimensionality, we also conduct experiments on WN18RR against SotA methods under varied low-dimensional settings (Figure 4). We include error bars for our method with average MRR and standard deviation computed over 10 runs. Our approach consistently outperforms all baselines, suggesting that hyperbolic embeddings still attain high-accuracy across a broad range of dimensions. Additionally, we measure performance per relation on WN18RR in Table 3 to understand the benefits of hyperbolic geometric on hierarchical relations. We report the Krackhardt hierarchy score  Code available at https://github.com/ tensorflow/neural-structured-learning/tree/master/research/kg_hyp_emb Relation Anti-symmetric Symmetric ROTH REFH ATTH hasNeighbor (cid:55) (cid:51) .750 1.00 1.00 isMarriedTo (cid:55) (cid:51) .941 .941 1.00 actedIn (cid:51) (cid:55) .145 .110 .150 hasMusicalRole (cid:51) (cid:55) .431 .375 .458 directed (cid:51) (cid:55) .500 .450 .567 graduatedFrom (cid:51) (cid:55) .262 .167 .274 playsFor (cid:51) (cid:55) .671 .642 .664 wroteMusicFor (cid:51) (cid:55) .281 .188 .266 hasCapital (cid:51) (cid:55) .692 .731 .731 dealsWith (cid:55) (cid:55) .286 .286 .429 isLocatedIn (cid:55) (cid:55) .404 .399 .420 Table 4: Comparison of geometric transformations on a subset of YAGO3-10 relations. (Khs G ) (Balazevic et al., 2019) and estimated curvature per relation (see Appendix A.2 for more details). We consider a relation to be hierarchical when its corresponding graph is close to tree-like (low curvature, high Khs G ). We observe that hyperbolic embeddings offer much better performance on hierarchical relations such as hypernym or has part , while Euclidean and hyperbolic embeddings have similar performance on non-hierarchical relations such as verb group . We also plot the learned curvature per relation versus the embedding dimension in Figure 5b. We note that the learned curvature in low dimensions directly correlates with the estimated graph curvature  G in Table 3, suggesting that the model with learned curvatures learns more curved embedding spaces for tree-like relations. Finally, we observe that MurP achieves lower performance than MurE on YAGO3-10, while ATTH improves over ATTE by 2.3% in MRR. This suggests that trainable curvature is critical to learn embeddings with the right amount of curvature, while fixed curvature might degrade performance. We elaborate further on this point in Section 5.5. In our experiments, we find that rotations work well on WN18RR, which contains multiple hierarchical and anti-symmetric relations, while reflections work better for YAGO3-10 (Table 5). To better understand the mechanisms behind these observations, we analyze two specific patterns: relation symmetry and anti-symmetry. We report performance per-relation on a subset of YAGO3-10 relations in Table 4. We categorize relations into symmetric, anti-symmetric, or neither symmetric nor anti-symmetric categories using data statistics. More concretely, we consider a relation to satisfy a logical pattern when the logical condition is satis-fied by most of the triplets (e.g., a relation r is symmetric if for most KG triples ( h, r, t ) , ( t, r, h ) is also in the KG). We observe that reflections encode 10 1 10 2 10 3 Embedding dimension 0 . symmetric relations particularly well, while rotations are well suited for anti-symmetric relations. This confirms our intuitionand the motivation for our approachthat particular geometric properties capture different kinds of logical properties. One advantage of using relation-specific transformations is that each relation can learn the right geometric operators based on the logical properties it has to satisfy. In particular, we observe that in both lowand high-dimensional settings, attention-based models can recover the performance of the best transformation on all datasets (Tables 2 and 5). Additionally, per-relationship results on YAGO3-10 in Table 4 suggest that ATTH indeed recovers the best geometric operation. Furthermore, for relations that are neither symmetric nor anti-symmetric, we find that ATTH can outperform rotations and reflections, suggesting that combining multiple operators with attention can learn more expressive operators to model mixed logical patterns. In other words, attention-based transformations alleviate the need to conduct experiments with multiple geometric transformations by simply allowing the model to choose which one is best for a given relation. In high dimensions (Table 5), we compare against a variety of other models and achieve new SotA results on WN18RR and YAGO3-10, and third-best results on FB15k-237. As we expected, when the embedding dimension is large, Euclidean and hyperbolic embedding methods perform similarly across all datasets. We explain this behavior by noting that when the dimension is sufficiently large, both Euclidean and hyperbolic spaces have enough capacity to represent complex hierarchies in KGs. This is further supported by Figure 5b, which shows the learned absolute curvature versus the dimension. We observe that curvatures are close to zero in high dimensions, confirming our expectation that ROTH with trainable curvatures learns a roughly Euclidean geometry in this setting. In contrast, fixed curvature degrades performance in high dimensions (Figure 5a), confirming the importance of trainable curvatures and its im-pact on precision and capacity (previously studied by (Sala et al., 2018)). Additionally, we show the embeddings' norms distribution in the Appendix (Figure 7). Fixed curvature results in embeddings being clustered near the boundary of the ball while trainable curvatures adjusts the embedding space to better distribute points throughout the ball. Precision issues that might arise with fixed curvature could also explain MurP's low performance in high dimensions. Trainable curvatures allow ROTH to perform as well or better than previous methods in both low and high dimensions. In Figure 6, we visualize the embeddings learned by ROTE versus ROTH for a sub-tree of the organism entity in WN18RR. To better visualize the hierarchy, we apply k inverse rotations for all nodes at level k in the tree. By contrast to ROTE, ROTH preserves the tree structure in the embedding space. Furthermore, we note that ROTE cannot simultaneously preserve the tree structure and make non-neighboring nodes far from each other. For instance, virus should be far from male , but preserving the tree structure (by going one level down in the tree) while making WN18RR FB15k-237 YAGO3-10 U Model MRR H@1 H@3 H@10 MRR H@1 H@3 H@10 MRR H@1 H@3 H@10 R d DistMult .430 .390 .440 .490 .241 .155 .263 .419 .340 .240 .380 .540 ConvE .430 .400 .440 .520 .325 .237 .356 .501 .440 .350 .490 .620 TuckER .470 .443 .482 .526 .358 .266 .394 .544 --MurE .475 .436 .487 .554 .336 .245 .370 .521 .532 .444 .584 .694 C d ComplEx-N3 .480 .435 .495 .572 .357 .264 .392 .547 .569 .498 .609 .701 RotatE .476 .428 .492 .571 .338 .241 .375 .533 .495 .402 .550 .670 H d Quaternion .488 .438 .508 .582 .348 .248 .382 .550 ---B d, 1 MurP .481 .440 .495 .566 .335 .243 .367 .518 .354 .249 .400 567 R d REFE .473 .430 .485 .561 .351 .256 .390 .541 .577 .503 .621 .712 ROTE .494 .446 .512 .585 .346 .251 .381 .538 .574 .498 .621 .711 ATTE .490 .443 .508 .581 .351 .255 .386 .543 .575 .500 .621 .709 B d,c REFH .461 .404 .485 .568 .346 .252 .383 .536 .576 .502 .619 .711 ROTH .496 .449 .514 .586 .344 .246 .380 .535 .570 .495 .612 .706 ATTH .486 .443 .499 .573 .348 .252 .384 .540 .568 .493 .612 .702 Table 5: Link prediction results for high-dimensional embeddings (best for d  { 200 , 400 , 500 } ) in the filtered setting. (a) ROTE embeddings. these two nodes far from each other is difficult in Euclidean space. In hyperbolic space, however, we observe that going one level down in the tree is achieved by translating embeddings towards the left. This pattern essentially illustrates the translation component in ROTH, allowing the model to simultaneously preserve hierarchies while making non-neighbouring nodes far from each other. We introduce ATTH, a hyperbolic KG embedding model that leverages the expressiveness of hyperbolic space and attention-based geometric transformations to learn improved KG representations in low-dimensions. ATTH learns embeddings with trainable hyperbolic curvatures, allowing it to learn the right geometry for each relationship and generalize across multiple embedding dimensions. ATTH achieves new SotA on WN18RR and YAGO3-10, real-world KGs which exhibit hierarchical structures. Future directions for this work include exploring other tasks that might benefit from hyperbolic geometry, such as hypernym detection. The proposed attention-based transformations can also be extended to other geometric operations. We thank Avner May for their helpful feedback and discussions. We gratefully acknowledge the support of DARPA under Nos. FA86501827865 (SDH) and FA86501827882 (ASED); NIH under No. U54EB020405 (Mobilize), NSF under Nos. CCF1763315 (Beyond Sparsity), CCF1563078 (Volume to Velocity), and 1937301 (RTML); ONR under No. N000141712266 (Unifying Weak Super-vision); the Moore Foundation, NXP, Xilinx, LETI-CEA, Intel, IBM, Microsoft, NEC, Toshiba, TSMC, ARM, Hitachi, BASF, Accenture, Ericsson, Qual-comm, Analog Devices, the Okawa Foundation, American Family Insurance, Google Cloud, Swiss Re, the HAI-AWS Cloud Credits for Research program, TOTAL, and members of the Stanford DAWN project: Teradata, Facebook, Google, Ant Financial, NEC, VMWare, and Infosys. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views, policies, or endorsements, either expressed or implied, of DARPA, NIH, ONR, or the U.S. Government.
abstain abstain abstain abstain method method result result objective abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain objective objective abstain method method result result result result result result objective result result other other objective other other other other other other other other other other other other abstain abstain abstain abstain abstain abstain abstain method method other other other other other abstain other method other other other abstain other other abstain other abstain method abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain method method abstain abstain abstain abstain abstain method abstain method abstain method abstain abstain abstain method abstain abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method method abstain abstain abstain abstain abstain method method abstain method method abstain method method method method method method method method method method abstain method method abstain abstain abstain abstain abstain abstain abstain result abstain result abstain other abstain abstain result abstain abstain result abstain abstain abstain method abstain abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain result abstain result abstain abstain abstain abstain method abstain abstain other abstain abstain abstain abstain method abstain abstain objective abstain other other other other other other other other