Pith. sign in

REVIEW 1 cited by

HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for 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 1809.01703 v3 pith:CGL2MNWS submitted 2018-09-05 cs.IR cs.LGstat.ML

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

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This paper investigates the notion of learning user and item representations in non-Euclidean space. Specifically, we study the connection between metric learning in hyperbolic space and collaborative filtering by exploring Mobius gyrovector spaces where the formalism of the spaces could be utilized to generalize the most common Euclidean vector operations. Overall, this work aims to bridge the gap between Euclidean and hyperbolic geometry in recommender systems through metric learning approach. We propose HyperML (Hyperbolic Metric Learning), a conceptually simple but highly effective model for boosting the performance. Via a series of extensive experiments, we show that our proposed HyperML not only outperforms their Euclidean counterparts, but also achieves state-of-the-art performance on multiple benchmark datasets, demonstrating the effectiveness of personalized recommendation in hyperbolic geometry.

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. 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 ...

Pith tools