Pith. sign in

REVIEW 2 cited by

Hyperbolic Convolutional Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.15639 v1 pith:N57IFFDJ submitted 2023-08-29 cs.LG cs.AI

classification cs.LGcs.AI
keywords convolutionalnetworksdatahyperbolicneuralspaceabilityparticularly
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep Learning is mostly responsible for the surge of interest in Artificial Intelligence in the last decade. So far, deep learning researchers have been particularly successful in the domain of image processing, where Convolutional Neural Networks are used. Although excelling at image classification, Convolutional Neural Networks are quite naive in that no inductive bias is set on the embedding space for images. Similar flaws are also exhibited by another type of Convolutional Networks - Graph Convolutional Neural Networks. However, using non-Euclidean space for embedding data might result in more robust and explainable models. One example of such a non-Euclidean space is hyperbolic space. Hyperbolic spaces are particularly useful due to their ability to fit more data in a low-dimensional space and tree-likeliness properties. These attractive properties have been previously used in multiple papers which indicated that they are beneficial for building hierarchical embeddings using shallow models and, recently, using MLPs and RNNs. However, no papers have yet suggested a general approach to using Hyperbolic Convolutional Neural Networks for structured data processing, although these are the most common examples of data used. Therefore, the goal of this work is to devise a general recipe for building Hyperbolic Convolutional Neural Networks. We hypothesize that ability of hyperbolic space to capture hierarchy in the data would lead to better performance. This ability should be particularly useful in cases where data has a tree-like structure. Since this is the case for many existing datasets \citep{wordnet, imagenet, fb15k}, we argue that such a model would be advantageous both in terms of applications and future research prospects.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Cartan Networks: Group theoretical Hyperbolic Deep Learning

    cs.LG 2025-05 reject novelty 6.0 of 10

    Cartan networks compose solvable-group homomorphisms with isometries to define hyperbolic layers, and the paper reports competitive benchmark performance.

  2. Navigation through Non-Compact Symmetric Spaces: a mathematical perspective on Cartan Neural Networks

    cs.LG 2025-07 conditional novelty 5.0 of 10

    It derives a covariant, activation-free layer map for neural networks on noncompact symmetric spaces and works out explicit hyperbolic and class-switching examples.

Pith tools