{"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":"/method/complex-n3","slug":"complex-n3","name":"ComplEx-N3","full_name":"ComplEx with N3 Regularizer","full_name_withheld":false,"description_markdown":"ComplEx model trained with a nuclear norm regularizer","description_state":"present","introduced_year":null,"introduced_by":{"title":"Canonical Tensor Decomposition for Knowledge Base Completion","paper":"/paper/canonical-tensor-decomposition-for-knowledge","first_author":"Timothée Lacroix","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/canonical-tensor-decomposition-for-knowledge"},"source":{"url":"http://arxiv.org/abs/1806.07297v1","title":"Canonical Tensor Decomposition for Knowledge Base Completion","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":4,"archive_num_papers":4,"papers_newest_first":[{"paper":"/paper/twig-towards-pre-hoc-hyperparameter","slug":"twig-towards-pre-hoc-hyperparameter","title":"TWIG: Towards pre-hoc Hyperparameter Optimisation and Cross-Graph Generalisation via Simulated KGE Models","date":"2024-02-08","arxiv_id":"2402.06097","n_code_links":1,"syntology":null},{"paper":"/paper/relation-prediction-as-an-auxiliary-training","slug":"relation-prediction-as-an-auxiliary-training","title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","date":"2021-10-06","arxiv_id":"2110.02834","n_code_links":1,"syntology":null},{"paper":"/paper/multi-relational-embedding-for-knowledge","slug":"multi-relational-embedding-for-knowledge","title":"Multi-Relational Embedding for Knowledge Graph Representation and Analysis","date":"2020-09-28","arxiv_id":null,"n_code_links":4,"syntology":null},{"paper":"/paper/canonical-tensor-decomposition-for-knowledge","slug":"canonical-tensor-decomposition-for-knowledge","title":"Canonical Tensor Decomposition for Knowledge Base Completion","date":"2018-06-19","arxiv_id":"1806.07297","n_code_links":3,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["facebookresearch/kbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}}],"papers_shown":4,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":4,"with_a_code_link":4,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":4,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/complex-n3/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/complex-n3/papers/ran/1","json":"/method/complex-n3/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/link-prediction","name":"Link Prediction","papers":4},{"task":"/task/knowledge-base-completion","name":"Knowledge Base Completion","papers":2},{"task":"/task/knowledge-graph-completion","name":"Knowledge Graph Completion","papers":2},{"task":"/task/knowledge-graph-embedding","name":"Knowledge Graph Embedding","papers":2},{"task":"/task/knowledge-graph-embeddings","name":"Knowledge Graph Embeddings","papers":2},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":1},{"task":"/task/dynamic-link-prediction","name":"Dynamic Link Prediction","papers":1},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":1},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":1},{"task":"/task/knowledge-graphs","name":"Knowledge Graphs","papers":1},{"task":"/task/language-modeling","name":"Language Modeling","papers":1},{"task":"/task/language-modelling","name":"Language Modelling","papers":1},{"task":"/task/link-property-prediction","name":"Link Property Prediction","papers":1},{"task":"/task/question-answering","name":"Question Answering","papers":1},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":1},{"task":null,"name":"Relation","papers":1},{"task":"/task/relation-prediction","name":"Relation Prediction","papers":1},{"task":"/task/relational-reasoning","name":"Relational Reasoning","papers":1},{"task":"/task/tensor-decomposition","name":"Tensor Decomposition","papers":1},{"task":"/task/word-embeddings","name":"Word Embeddings","papers":1}],"tasks_shown":20,"n_tasks":20,"usage_by_year":[{"year":"2018","papers":1},{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2024","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/complex-n3"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=ComplEx-N3","read_at":"2026-10-05T00:53:52+00:00","query":"ComplEx-N3","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1806.07297","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'ComplEx-N3' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["CompLex","COMPLEX","EHR-Complex","complex SGD","COMPLEX KDA"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"229d6e3fa8e763ca4355d19109b5d58936738c778f94998343e211d4a0fe261c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}