{"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/convolutional-2d-knowledge-graph-embeddings","title":"Convolutional 2D Knowledge Graph Embeddings","arxiv_id":"1707.01476","date":"2017-07-05","proceeding":null,"authors":["Tim Dettmers","Pasquale Minervini","Pontus Stenetorp","Sebastian Riedel"],"abstract":"Link prediction for knowledge graphs is the task of predicting missing\nrelationships between entities. Previous work on link prediction has focused on\nshallow, fast models which can scale to large knowledge graphs. However, these\nmodels learn less expressive features than deep, multi-layer models -- which\npotentially limits performance. In this work, we introduce ConvE, a multi-layer\nconvolutional network model for link prediction, and report state-of-the-art\nresults for several established datasets. We also show that the model is highly\nparameter efficient, yielding the same performance as DistMult and R-GCN with\n8x and 17x fewer parameters. Analysis of our model suggests that it is\nparticularly effective at modelling nodes with high indegree -- which are\ncommon in highly-connected, complex knowledge graphs such as Freebase and\nYAGO3. In addition, it has been noted that the WN18 and FB15k datasets suffer\nfrom test set leakage, due to inverse relations from the training set being\npresent in the test set -- however, the extent of this issue has so far not\nbeen quantified. We find this problem to be severe: a simple rule-based model\ncan achieve state-of-the-art results on both WN18 and FB15k. To ensure that\nmodels are evaluated on datasets where simply exploiting inverse relations\ncannot yield competitive results, we investigate and validate several commonly\nused datasets -- deriving robust variants where necessary. We then perform\nexperiments on these robust datasets for our own and several previously\nproposed models and find that ConvE achieves state-of-the-art Mean Reciprocal\nRank across most datasets.","url_abs":"http://arxiv.org/abs/1707.01476v6","url_pdf":"http://arxiv.org/pdf/1707.01476v6.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":"convolutional-2d-knowledge-graph-embeddings","repo_url":"https://github.com/TimDettmers/ConvE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"convolutional-2d-knowledge-graph-embeddings","repo_url":"https://github.com/INK-USC/RE-Net","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"convolutional-2d-knowledge-graph-embeddings","repo_url":"https://github.com/LB0828/conve_reproduce","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"convolutional-2d-knowledge-graph-embeddings","repo_url":"https://github.com/bi-graph/emgraph","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"convolutional-2d-knowledge-graph-embeddings","repo_url":"https://github.com/facebookresearch/ssl-relation-prediction","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"convolutional-2d-knowledge-graph-embeddings","repo_url":"https://github.com/oliver-lloyd/kge_param_sens","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"convolutional-2d-knowledge-graph-embeddings","repo_url":"https://github.com/thu-keg/eakit","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"convolutional-2d-knowledge-graph-embeddings","repo_url":"https://github.com/uma-pi1/kge-iclr20","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"knowledge-graph-embeddings","task_name":"Knowledge Graph Embeddings"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"link-prediction","task_name":"Link Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-fb15k","task":"Link Prediction","dataset":"FB15k","model":"Inverse Model","rank_in_archive_order":19,"of":23,"metrics":{"Hits@1":"0.658","Hits@10":"0.660","Hits@3":"0.659","MR":"2501","MRR":"0.660"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-fb15k","task":"Link Prediction","dataset":"FB15k","model":"ConvE","rank_in_archive_order":20,"of":23,"metrics":{"Hits@1":"0.558","Hits@10":"0.831","Hits@3":"0.723","MR":"51","MRR":"0.657"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-fb15k-237","task":"Link Prediction","dataset":"FB15k-237","model":"ConvE","rank_in_archive_order":45,"of":75,"metrics":{"Hits@1":"0.237","Hits@10":"0.501","Hits@3":"0.356","MRR":"0.325"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-fb15k-237","task":"Link Prediction","dataset":"FB15k-237","model":"Inverse Model","rank_in_archive_order":56,"of":75,"metrics":{"Hits@1":"0.007","Hits@10":"0.014","Hits@3":"0.011","MR":"7030","MRR":"0.010"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-umls","task":"Link Prediction","dataset":"UMLS","model":"ConvE","rank_in_archive_order":6,"of":10,"metrics":{"Hits@10":"0.990","MR":"1.51"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wn18","task":"Link Prediction","dataset":"WN18","model":"Inverse Model","rank_in_archive_order":1,"of":37,"metrics":{"Hits@1":"0.953","Hits@10":"0.964","Hits@3":"0.964","MR":"740","MRR":"0.963"},"uses_additional_data":true},{"leaderboard":"/sota/link-prediction-on-wn18","task":"Link Prediction","dataset":"WN18","model":"ConvE","rank_in_archive_order":17,"of":37,"metrics":{"Hits@1":"0.935","Hits@10":"0.956","Hits@3":"0.946","MR":"374","MRR":"0.943"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wn18rr","task":"Link Prediction","dataset":"WN18RR","model":"ConvE","rank_in_archive_order":64,"of":75,"metrics":{"Hits@1":"0.400","Hits@10":"0.520","Hits@3":"0.440","MRR":"0.430"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wn18rr","task":"Link Prediction","dataset":"WN18RR","model":"Inverse Model","rank_in_archive_order":71,"of":75,"metrics":{"Hits@1":"0.35","Hits@10":"0.35","Hits@3":"0.35","MR":"13526","MRR":"0.35"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-yago3-10","task":"Link Prediction","dataset":"YAGO3-10","model":"ConvE","rank_in_archive_order":16,"of":18,"metrics":{"Hits@10":"0.62","MRR":"0.44"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1707.01476","atlas_url":"https://app.syntology.ai/?focus=1707.01476","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":"1707.01476"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1707.01476\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1707.01476"},"call":"get_concepts_for_paper(arxiv_id=\"1707.01476\")"}],"by_repo":[{"repo":"TimDettmers/ConvE","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2111.06345"],"harvested_for_calls":[{"arxiv_id":"2111.06345","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.06345"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.06345\")"}]},{"repo":"INK-USC/RE-Net","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1703.06103"],"harvested_for_calls":[{"arxiv_id":"1703.06103","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1703.06103"},"call":"get_harvested_code_for_paper(arxiv_id=\"1703.06103\")"}]},{"repo":"LB0828/conve_reproduce","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"bi-graph/emgraph","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"facebookresearch/ssl-relation-prediction","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"oliver-lloyd/kge_param_sens","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"thu-keg/eakit","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1911.09419"],"harvested_for_calls":[{"arxiv_id":"1911.09419","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1911.09419"},"call":"get_harvested_code_for_paper(arxiv_id=\"1911.09419\")"}]},{"repo":"uma-pi1/kge-iclr20","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"7f190d78a9d4eb4d4c4c8a2414f6550e52bdd8fcc30a3b99bb254033a2cb7fc4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}