Pith. sign in

REVIEW 6 cited by

Scalable Hyperbolic Recommender Systems

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 1902.08648 v1 pith:BDQYCWTG submitted 2019-02-22 cs.IR cs.LGstat.ML

classification cs.IRcs.LGstat.ML
keywords hyperbolicrecommendergeometrysystemsscalesystemunderlyingallow
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present a large scale hyperbolic recommender system. We discuss why hyperbolic geometry is a more suitable underlying geometry for many recommendation systems and cover the fundamental milestones and insights that we have gained from its development. In doing so, we demonstrate the viability of hyperbolic geometry for recommender systems, showing that they significantly outperform Euclidean models on datasets with the properties of complex networks. Key to the success of our approach are the novel choice of underlying hyperbolic model and the use of the Einstein midpoint to define an asymmetric recommender system in hyperbolic space. These choices allow us to scale to millions of users and hundreds of thousands of items.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 6 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. Hyperbolic Residual Quantization: Discrete Representations for Data with Latent Hierarchies

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Performing residual quantization with hyperbolic operations and distance instead of Euclidean ones yields discrete multitoken representations that improve downstream hypernym generation and recommendation.

  3. Hebbian Graph Embeddings

    cs.LG 2019-08 conditional novelty 5.0 of 10

    Graph node embeddings are learned by repeatedly adding noisy neighbor embeddings weighted by transition probabilities, with variance annealed over iterations, and tested on link prediction, reconstruction, and retail ...

  4. HMamba: Hyperbolic Mamba for Sequential Recommendation

    cs.IR 2025-05 reject novelty 4.0 of 10

    HMamba is an architecture that runs Mamba's selective state space model in hyperbolic space for sequential recommendation, claiming 3-11% gains over baselines on four benchmarks.

  5. Clustering in hyperbolic balls

    cs.LG 2025-01 reject novelty 4.0 of 10

    K-means and EM clustering for points in Poincaré hyperbolic balls are defined via conformal barycenters and Möbius distributions, with synthetic experiments in 2D and 3D.

  6. A group-theoretic framework for machine learning in hyperbolic spaces

    cs.LG 2025-01 reject novelty 4.0 of 10

    Introduces conformal and holomorphic barycenters and Möbius-type probability families on hyperbolic balls, together with hyperbolic gradient and maximum likelihood estimation algorithms.

Pith tools