atlas

Research map / Graph learning / Graph algorithms and clustering

Hyperbolic Entailment Cones for Learning Hierarchical Embeddings

ICML 2018 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 44 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use hyperbolic entailment cones instead of Order EmbWordNet link prediction, 5 and 10 dimensions · 0% non-basic edgestest F1 (%): 34.4% -> 29.2%; 43.0% -> 32.2%Hurt
Use hyperbolic entailment cones instead of the strongest baselineWordNet link prediction, 5 and 10 dimensions · 10%, 25%, and 50% non-basic edgestest F1 (%): 71.3% -> 80.1%; 75.4% -> 85.9%; 78.2% -> 86.0%; 82.0% -> 91.0%; 83.6% -> 92.8%; 85.3% -> 94.4%Helped
Initialize Euclidean cones with Poincaré embeddings rather than Simple Euclidean embeddings (ablation)Our Euclidean Cones · WordNet link predictiontest F1No clear effect
Use full Riemannian optimization rather than the retraction approximation (ablation)Hyperbolic models · WordNet link predictiontest F1No clear effect
Add transitive-closure edges to trainingOur Hyperbolic Cones · WordNet link predictiontest F1: 80.1% -> 86.0% -> 92.8%; 85.9% -> 91.0% -> 94.4%Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy