mlsanityData to 7 Oct 2026

Nested Hyperbolic Spaces for Dimensionality Reduction and Hyperbolic NN Design

arXiv 2112.03402 ↗First posted 3 Dec 2021cs.LG cs.AI stat.MLcited by 14

Not on the map. Why?

Abstract (arXiv)

Hyperbolic neural networks have been popular in the recent past due to their ability to represent hierarchical data sets effectively and efficiently. The challenge in developing these networks lies in the nonlinearity of the embedding space namely, the Hyperbolic space. Hyperbolic space is a homogeneous Riemannian manifold of the Lorentz group. Most existing methods (with some exceptions) use local linearization to define a variety of operations paralleling those used in traditional deep neural networks in Euclidean spaces. In this paper, we present a novel fully hyperbolic neural network which uses the concept of projections (embeddings) followed by an intrinsic aggregation and a nonlinearity all within the hyperbolic space. The novelty here lies in the projection which is designed to project data on to a lower-dimensional embedded hyperbolic space and hence leads to a nested hyperbolic space representation independently useful for dimensionality reduction. The main theoretical contribution is that the proposed embedding is proved to be isometric and equivariant under the Lorentz transformations. This projection is computationally efficient since it can be expressed by simple linear operations, and, due to the aforementioned equivariance property, it allows for weight sharing. The nested hyperbolic space representation is the core component of our network and therefore, we first compare this ensuing nested hyperbolic space representation with other dimensionality reduction methods such as tangent PCA, principal geodesic analysis (PGA) and HoroPCA. Based on this equivariant embedding, we develop a novel fully hyperbolic graph convolutional neural network architecture to learn the parameters of the projection. Finally, we present experiments demonstrating comparative performance of our network on several publicly available data sets.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 23 of its 52 references that are in the map. First posted on arXiv 3 Dec 2021.

Builds on

23 of 52 references.

References · 23

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2019Simplifying Graph Convolutional Networkscited by 1,470
  5. 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 674
  6. 2019Hyperbolic Graph Convolutional Neural Networkscited by 400
  7. 2018Hyperbolic Neural Networkscited by 393
  8. 2018Learning Continuous Hierarchies in the Lorentz Model of Hyperbolic Geometrycited by 261
  9. 2019Hyperbolic Graph Neural Networkscited by 244
  10. 2019Hyperbolic Image Embeddingscited by 219
  11. 2018Representation Tradeoffs for Hyperbolic Embeddingscited by 204
  12. 2018Poincar'e GloVe: Hyperbolic Word Embeddingscited by 155
11 more
  1. 2018Hyperbolic Attention Networkscited by 122
  2. 2019Continuous Hierarchical Representations with Poincar'e Variational Auto-Encoderscited by 111
  3. 2021Fully Hyperbolic Neural Networkscited by 107
  4. 2016Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiationcited by 93
  5. 2019Trivializations for Gradient-Based Optimization on Manifoldscited by 78
  6. 2021Lorentzian Graph Convolutional Networkscited by 66
  7. 2021A Hyperbolic-to-Hyperbolic Graph Convolutional Networkcited by 53
  8. 2021HoroPCA: Hyperbolic Dimensionality Reduction via Horospherical Projectionscited by 47
  9. 2016Dimensionality Reduction on SPD Manifolds: The Emergence of Geometry-Aware Methodscited by 29
  10. 2018Semi-Riemannian Manifold Optimizationcited by 4
  11. 2016An efficient Exact-PGA algorithm for constant curvature manifoldscited by 3

Built on by

Cited by year

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

14 papers.

Sort: