Pith. sign in

REVIEW 2 cited by

Klein Model for Hyperbolic 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 2410.16813 v1 pith:GPAHU72W submitted 2024-10-22 cs.LG cs.ITmath.ITstat.ML

classification cs.LGcs.ITmath.ITstat.ML
keywords modelkleinhyperbolicballeinsteinnetworksneuralpoincar
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Hyperbolic neural networks (HNNs) have been proved effective in modeling complex data structures. However, previous works mainly focused on the Poincar\'e ball model and the hyperboloid model as coordinate representations of the hyperbolic space, often neglecting the Klein model. Despite this, the Klein model offers its distinct advantages thanks to its straight-line geodesics, which facilitates the well-known Einstein midpoint construction, previously leveraged to accompany HNNs in other models. In this work, we introduce a framework for hyperbolic neural networks based on the Klein model. We provide detailed formulation for representing useful operations using the Klein model. We further study the Klein linear layer and prove that the "tangent space construction" of the scalar multiplication and parallel transport are exactly the Einstein scalar multiplication and the Einstein addition, analogous to the M\"obius operations used in the Poincar\'e ball model. We show numerically that the Klein HNN performs on par with the Poincar\'e ball model, providing a third option for HNN that works as a building block for more complicated architectures.

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. Learning Along the Arrow of Time: Hyperbolic Geometry for Backward-Compatible Representation Learning

    cs.LG 2025-06 conditional novelty 6.0 of 10

    HBCT lifts embeddings into Lorentz hyperbolic space, uses entailment cones to keep new embeddings inside old ones' cones, and weights contrastive alignment by an uncertainty estimate, improving backward-compatible ret...

  2. Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Fast-HyperDT reexpresses HyperDT as pre- and post-processing around standard Euclidean trees, making hyperbolic random forests practical.

Pith tools