Pith. sign in

REVIEW 1 cited by

A group-theoretic framework for machine learning in hyperbolic spaces

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 2501.06934 v1 pith:6I6M44PP submitted 2025-01-12 cs.LG

classification cs.LG
keywords hyperbolicalgorithmslearningbarycenterdatafurthergroup-theoreticmachine
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Embedding the data in hyperbolic spaces can preserve complex relationships in very few dimensions, thus enabling compact models and improving efficiency of machine learning (ML) algorithms. The underlying idea is that hyperbolic representations can prevent the loss of important structural information for certain ubiquitous types of data. However, further advances in hyperbolic ML require more principled mathematical approaches and adequate geometric methods. The present study aims at enhancing mathematical foundations of hyperbolic ML by combining group-theoretic and conformal-geometric arguments with optimization and statistical techniques. Precisely, we introduce the notion of the mean (barycenter) and the novel family of probability distributions on hyperbolic balls. We further propose efficient optimization algorithms for computation of the barycenter and for maximum likelihood estimation. One can build upon basic concepts presented here in order to design more demanding algorithms and implement hyperbolic deep learning pipelines.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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.

Pith tools