{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/hyperbolic-entailment-cones-for-learning","title":"Hyperbolic Entailment Cones for Learning Hierarchical Embeddings","arxiv_id":"1804.01882","date":"2018-04-03","proceeding":"ICML 2018 7","authors":["Octavian-Eugen Ganea","Gary Bécigneul","Thomas Hofmann"],"abstract":"Learning graph representations via low-dimensional embeddings that preserve\nrelevant network properties is an important class of problems in machine\nlearning. We here present a novel method to embed directed acyclic graphs.\nFollowing prior work, we first advocate for using hyperbolic spaces which\nprovably model tree-like structures better than Euclidean geometry. Second, we\nview hierarchical relations as partial orders defined using a family of nested\ngeodesically convex cones. We prove that these entailment cones admit an\noptimal shape with a closed form expression both in the Euclidean and\nhyperbolic spaces, and they canonically define the embedding learning process.\nExperiments show significant improvements of our method over strong recent\nbaselines both in terms of representational capacity and generalization.","url_abs":"http://arxiv.org/abs/1804.01882v3","url_pdf":"http://arxiv.org/pdf/1804.01882v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"hyperbolic-entailment-cones-for-learning","repo_url":"https://github.com/dalab/hyperbolic_cones","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"hyperbolic-entailment-cones-for-learning","repo_url":"https://github.com/dinobby/hypemo","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"hyperbolic-entailment-cones-for-learning","repo_url":"https://github.com/iesl/geometric_graph_embedding","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"hypernym-discovery","task_name":"Hypernym Discovery"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-wordnet","task":"Link Prediction","dataset":"WordNet","model":"Hyperbolic Entailment Cones","rank_in_archive_order":1,"of":7,"metrics":{"Accuracy":"94.4"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1804.01882","atlas_url":"https://app.syntology.ai/?focus=1804.01882","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1804.01882"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1804.01882\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1804.01882"},"call":"get_concepts_for_paper(arxiv_id=\"1804.01882\")"}],"by_repo":[{"repo":"dalab/hyperbolic_cones","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1705.08039"],"harvested_for_calls":[{"arxiv_id":"1705.08039","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1705.08039"},"call":"get_harvested_code_for_paper(arxiv_id=\"1705.08039\")"}]},{"repo":"dinobby/hypemo","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"iesl/geometric_graph_embedding","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2010.04831"],"harvested_for_calls":[{"arxiv_id":"2010.04831","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.04831"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.04831\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"fc9c11333c731bd917f8d180d98ff51d42284b18407f4540d8f16d94d79da1e8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}