{"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","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","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","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","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,"unverified":0,"pointer_only":2}}],"papers_shown":4,"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-09-24T18:15:14+00:00"}