{"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/complex-embeddings-for-simple-link-prediction","title":"Complex Embeddings for Simple Link Prediction","arxiv_id":"1606.06357","date":"2016-06-20","proceeding":null,"authors":["Théo Trouillon","Johannes Welbl","Sebastian Riedel","Éric Gaussier","Guillaume Bouchard"],"abstract":"In statistical relational learning, the link prediction problem is key to\nautomatically understand the structure of large knowledge bases. As in previous\nstudies, we propose to solve this problem through latent factorization.\nHowever, here we make use of complex valued embeddings. The composition of\ncomplex embeddings can handle a large variety of binary relations, among them\nsymmetric and antisymmetric relations. Compared to state-of-the-art models such\nas Neural Tensor Network and Holographic Embeddings, our approach based on\ncomplex embeddings is arguably simpler, as it only uses the Hermitian dot\nproduct, the complex counterpart of the standard dot product between real\nvectors. Our approach is scalable to large datasets as it remains linear in\nboth space and time, while consistently outperforming alternative approaches on\nstandard link prediction benchmarks.","url_abs":"http://arxiv.org/abs/1606.06357v1","url_pdf":"http://arxiv.org/pdf/1606.06357v1.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":"complex-embeddings-for-simple-link-prediction","repo_url":"https://github.com/ttrouill/complex","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"complex-embeddings-for-simple-link-prediction","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":"complex-embeddings-for-simple-link-prediction","repo_url":"https://github.com/dayanayuan/raa-kgc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"complex-embeddings-for-simple-link-prediction","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"}},{"paper_slug":"complex-embeddings-for-simple-link-prediction","repo_url":"https://github.com/pykeen/pykeen","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"complex-embeddings-for-simple-link-prediction","repo_url":"https://github.com/sntcristian/and-kge","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"complex-embeddings-for-simple-link-prediction","repo_url":"https://github.com/Accenture/AmpliGraph","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"complex-embeddings-for-simple-link-prediction","repo_url":"https://github.com/pyg-team/pytorch_geometric/blob/2947af7733d87315a9218a0bfabbfda10b595f0e/torch_geometric/nn/kge/complex.py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"complex-embeddings-for-simple-link-prediction","repo_url":"https://github.com/stellargraph/stellargraph","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"relational-reasoning","task_name":"Relational Reasoning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-fb122","task":"Link Prediction","dataset":"FB122","model":"ComplEx","rank_in_archive_order":4,"of":5,"metrics":{"HITS@3":"67.3","Hits@10":"71.9","Hits@5":"69.5","MRR":"64.1"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-fb15k-237","task":"Link Prediction","dataset":"FB15k-237","model":"ComplEx","rank_in_archive_order":70,"of":75,"metrics":{"Hits@10":"0.428"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-umls","task":"Link Prediction","dataset":"UMLS","model":"ComplEx","rank_in_archive_order":9,"of":10,"metrics":{"Hits@10":"0.967","MR":"2.59"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wn18","task":"Link Prediction","dataset":"WN18","model":"ComplEx","rank_in_archive_order":26,"of":37,"metrics":{"Hits@1":"0.936","Hits@10":"0.947","Hits@3":"0.936","MRR":"0.941"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-wn18rr","task":"Link Prediction","dataset":"WN18RR","model":"ComplEx","rank_in_archive_order":66,"of":75,"metrics":{"Hits@1":"0.410","Hits@10":"0.510","MRR":"0.440"},"uses_additional_data":false},{"leaderboard":"/sota/link-property-prediction-on-ogbl-biokg","task":"Link Property Prediction","dataset":"ogbl-biokg","model":"ComplEx","rank_in_archive_order":13,"of":16,"metrics":{"Ext. data":"No","Number of params":"187648000","Test MRR":"0.8095 ± 0.0007","Validation MRR":"0.8105 ± 0.0001"},"uses_additional_data":false},{"leaderboard":"/sota/link-property-prediction-on-ogbl-wikikg2","task":"Link Property Prediction","dataset":"ogbl-wikikg2","model":"ComplEx (250dim)","rank_in_archive_order":25,"of":30,"metrics":{"Ext. data":"No","Number of params":"1250569500","Test MRR":"0.4027 ± 0.0027","Validation MRR":"0.3759 ± 0.0016"},"uses_additional_data":false},{"leaderboard":"/sota/link-property-prediction-on-ogbl-wikikg2","task":"Link Property Prediction","dataset":"ogbl-wikikg2","model":"ComplEx (50dim)","rank_in_archive_order":26,"of":30,"metrics":{"Ext. data":"No","Number of params":"250113900","Test MRR":"0.3804 ± 0.0022","Validation MRR":"0.3534 ± 0.0052"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1606.06357","atlas_url":"https://app.syntology.ai/?focus=1606.06357","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":"1606.06357"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1606.06357\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1606.06357"},"call":"get_concepts_for_paper(arxiv_id=\"1606.06357\")"}],"by_repo":[{"repo":"ttrouill/complex","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"bi-graph/emgraph","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"dayanayuan/raa-kgc","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\")"}]},{"repo":"pykeen/pykeen","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2203.07544"],"harvested_for_calls":[{"arxiv_id":"2203.07544","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.07544"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.07544\")"}]},{"repo":"sntcristian/and-kge","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Accenture/AmpliGraph","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2105.08683"],"harvested_for_calls":[{"arxiv_id":"2105.08683","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.08683"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.08683\")"}]},{"repo":"pyg-team/pytorch_geometric","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2606.17022"],"harvested_for_calls":[{"arxiv_id":"2606.17022","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2606.17022"},"call":"get_harvested_code_for_paper(arxiv_id=\"2606.17022\")"}]},{"repo":"stellargraph/stellargraph","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1903.01610"],"harvested_for_calls":[{"arxiv_id":"1903.01610","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1903.01610"},"call":"get_harvested_code_for_paper(arxiv_id=\"1903.01610\")"}]}],"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":"1e539b159330165fa93b92fb1dc0e947ae9975eb45dbddfd576906dedb504090","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}