{"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/knowledge-graph-completion-via-complex-tensor","title":"Knowledge Graph Completion via Complex Tensor Factorization","arxiv_id":"1702.06879","date":"2017-02-22","proceeding":null,"authors":["Théo Trouillon","Christopher R. Dance","Johannes Welbl","Sebastian Riedel","Éric Gaussier","Guillaume Bouchard"],"abstract":"In statistical relational learning, knowledge graph completion deals with\nautomatically understanding the structure of large knowledge graphs---labeled\ndirected graphs---and predicting missing relationships---labeled edges.\nState-of-the-art embedding models propose different trade-offs between modeling\nexpressiveness, and time and space complexity. We reconcile both expressiveness\nand complexity through the use of complex-valued embeddings and explore the\nlink between such complex-valued embeddings and unitary diagonalization. We\ncorroborate our approach theoretically and show that all real square\nmatrices---thus all possible relation/adjacency matrices---are the real part of\nsome unitarily diagonalizable matrix. This results opens the door to a lot of\nother applications of square matrices factorization. Our approach based on\ncomplex embeddings is arguably simple, as it only involves a Hermitian dot\nproduct, the complex counterpart of the standard dot product between real\nvectors, whereas other methods resort to more and more complicated composition\nfunctions to increase their expressiveness. The proposed complex embeddings are\nscalable to large data sets as it remains linear in both space and time, while\nconsistently outperforming alternative approaches on standard link prediction\nbenchmarks.","url_abs":"http://arxiv.org/abs/1702.06879v2","url_pdf":"http://arxiv.org/pdf/1702.06879v2.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":"knowledge-graph-completion-via-complex-tensor","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":"knowledge-graph-completion-via-complex-tensor","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"}}],"tasks":[{"task_slug":"knowledge-graph-completion","task_name":"Knowledge Graph Completion"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"relational-reasoning","task_name":"Relational Reasoning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/knowledge-graphs-on-fb15k","task":"Knowledge Graphs","dataset":"FB15k","model":"COMPLEX","rank_in_archive_order":2,"of":2,"metrics":{"MRR":"0.587"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-fb15k","task":"Link Prediction","dataset":"FB15k","model":"Complex","rank_in_archive_order":18,"of":23,"metrics":{"Hits@1":"0.599","Hits@10":"0.840","Hits@3":"0.759","MRR":"0.692"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1702.06879","atlas_url":"https://app.syntology.ai/?focus=1702.06879","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":"1702.06879"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1702.06879\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1702.06879"},"call":"get_concepts_for_paper(arxiv_id=\"1702.06879\")"}],"by_repo":[{"repo":"ttrouill/complex","kind":"official","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\")"}]}],"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":"5d4be41baf8709fb5f555624232a5aaee2ecd08ba69721eb8709f127ea67c119","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}