{"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/inductive-entity-representations-from-text","title":"Inductive Entity Representations from Text via Link Prediction","arxiv_id":"2010.03496","date":"2020-10-07","proceeding":null,"authors":["Daniel Daza","Michael Cochez","Paul Groth"],"abstract":"Knowledge Graphs (KG) are of vital importance for multiple applications on the web, including information retrieval, recommender systems, and metadata annotation. Regardless of whether they are built manually by domain experts or with automatic pipelines, KGs are often incomplete. Recent work has begun to explore the use of textual descriptions available in knowledge graphs to learn vector representations of entities in order to preform link prediction. However, the extent to which these representations learned for link prediction generalize to other tasks is unclear. This is important given the cost of learning such representations. Ideally, we would prefer representations that do not need to be trained again when transferring to a different task, while retaining reasonable performance. In this work, we propose a holistic evaluation protocol for entity representations learned via a link prediction objective. We consider the inductive link prediction and entity classification tasks, which involve entities not seen during training. We also consider an information retrieval task for entity-oriented search. We evaluate an architecture based on a pretrained language model, that exhibits strong generalization to entities not observed during training, and outperforms related state-of-the-art methods (22% MRR improvement in link prediction on average). We further provide evidence that the learned representations transfer well to other tasks without fine-tuning. In the entity classification task we obtain an average improvement of 16% in accuracy compared with baselines that also employ pre-trained models. In the information retrieval task, we obtain significant improvements of up to 8.8% in NDCG@10 for natural language queries. We thus show that the learned representations are not limited KG-specific tasks, and have greater generalization properties than evaluated in previous work.","url_abs":"https://arxiv.org/abs/2010.03496v3","url_pdf":"https://arxiv.org/pdf/2010.03496v3.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":"inductive-entity-representations-from-text","repo_url":"https://github.com/dfdazac/blp","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"inductive-entity-representations-from-text","repo_url":"https://github.com/raphaelsty/mkb","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"inductive-link-prediction","task_name":"Inductive Link Prediction"},{"task_slug":"inductive-knowledge-graph-completion","task_name":"Inductive knowledge graph completion"},{"task_slug":"information-retrieval","task_name":"Information Retrieval"},{"task_slug":"knowledge-graph-embeddings","task_name":"Knowledge Graph Embeddings"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"natural-language-queries","task_name":"Natural Language Queries"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/inductive-knowledge-graph-completion-on-fb15k","task":"Inductive knowledge graph completion","dataset":"FB15k-237-ind","model":"BLP-TransE","rank_in_archive_order":1,"of":1,"metrics":{"Hit@1":"0.113","Hits@10":"0.363","Hits@3":"0.213","MRR":"0.195"},"uses_additional_data":false},{"leaderboard":"/sota/inductive-knowledge-graph-completion-on","task":"Inductive knowledge graph completion","dataset":"WN18RR-ind","model":"BLP-TransE","rank_in_archive_order":1,"of":2,"metrics":{"Hit@10":"0.58","Hits@3":"0.361","MRR":"0.285"},"uses_additional_data":false},{"leaderboard":"/sota/inductive-knowledge-graph-completion-on","task":"Inductive knowledge graph completion","dataset":"WN18RR-ind","model":"BLP-ComplEx","rank_in_archive_order":2,"of":2,"metrics":{"Hits@1":"0.156"},"uses_additional_data":false},{"leaderboard":"/sota/inductive-knowledge-graph-completion-on-1","task":"Inductive knowledge graph completion","dataset":"Wikidata5m-ind","model":"BLP-SimplE","rank_in_archive_order":1,"of":3,"metrics":{"Hits@1":"0.289","MRR":"0.493"},"uses_additional_data":false},{"leaderboard":"/sota/inductive-knowledge-graph-completion-on-1","task":"Inductive knowledge graph completion","dataset":"Wikidata5m-ind","model":"BLP-ComplEx","rank_in_archive_order":3,"of":3,"metrics":{"Hits@10":"0.877","Hits@3":"0.664"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2010.03496","atlas_url":"https://app.syntology.ai/?focus=2010.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03496"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.03496"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.03496"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.03496\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2010.03496"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2010.03496\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2010.03496"},"call":"get_concepts_for_paper(arxiv_id=\"2010.03496\")"}],"by_repo":[{"repo":"dfdazac/blp","kind":"official","samples":7,"ran":7,"instrument":0,"unverified":0},{"repo":"raphaelsty/mkb","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2010.03496.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2010.03496.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/raphaelsty/mkb","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/dfdazac/blp","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":7},"n_samples":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":7,"ran":7,"n_ran_checked":7,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":7,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-25","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"samples":[{"code_sha256":"1ab7d265b717db60","code_sha256_prefix":"1ab7d265b717db60","entry":"complex_score","repo":"dfdazac/blp","repo_kind":"official","path":"models.py","file_url":"https://github.com/dfdazac/blp/blob/HEAD/models.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"heads:Tensor/2/float, tails:Tensor/2/float, rels:Tensor/2/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","retrieve_with":{"tool":"get_code","code_sha256":"1ab7d265b717db60"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"1ab7d265b717db60"}},{"code_sha256":"4de8ec87799ab1b4","code_sha256_prefix":"4de8ec87799ab1b4","entry":"distmult_score","repo":"dfdazac/blp","repo_kind":"official","path":"models.py","file_url":"https://github.com/dfdazac/blp/blob/HEAD/models.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"heads:Tensor/2/float, tails:Tensor/2/float, rels:Tensor/2/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","retrieve_with":{"tool":"get_code","code_sha256":"4de8ec87799ab1b4"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4de8ec87799ab1b4"}},{"code_sha256":"4205ada232da5c54","code_sha256_prefix":"4205ada232da5c54","entry":"file_to_ids","repo":"dfdazac/blp","repo_kind":"official","path":"data.py","file_url":"https://github.com/dfdazac/blp/blob/HEAD/data.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"file_path:str/0/str","fixture_out_type":"dict","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4205ada232da5c54"}},{"code_sha256":"a3936f53f9d93ed1","code_sha256_prefix":"a3936f53f9d93ed1","entry":"get_negative_sampling_indices","repo":"dfdazac/blp","repo_kind":"official","path":"data.py","file_url":"https://github.com/dfdazac/blp/blob/HEAD/data.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"batch_size:int/0/int, num_negatives:int/0/int, repeats:int/0/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a3936f53f9d93ed1"}},{"code_sha256":"8f2e45be8b37061d","code_sha256_prefix":"8f2e45be8b37061d","entry":"get_triple_filters","repo":"dfdazac/blp","repo_kind":"official","path":"utils.py","file_url":"https://github.com/dfdazac/blp/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"triples:Tensor/2/int, graph:MultiDiGraph/0/?, num_ents:int/0/int, ent2idx:Tensor/1/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8f2e45be8b37061d"}},{"code_sha256":"aa62acaf56a8519a","code_sha256_prefix":"aa62acaf56a8519a","entry":"make_ent2idx","repo":"dfdazac/blp","repo_kind":"official","path":"utils.py","file_url":"https://github.com/dfdazac/blp/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"entities:Tensor/1/int, max_ent_id:int/0/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"aa62acaf56a8519a"}},{"code_sha256":"3f0f68e2573aecf3","code_sha256_prefix":"3f0f68e2573aecf3","entry":"transe_score","repo":"dfdazac/blp","repo_kind":"official","path":"models.py","file_url":"https://github.com/dfdazac/blp/blob/HEAD/models.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"heads:Tensor/2/float, tails:Tensor/2/float, rels:Tensor/2/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","retrieve_with":{"tool":"get_code","code_sha256":"3f0f68e2573aecf3"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3f0f68e2573aecf3"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"c0c5a5a336a1fb13f3b696cbd968eac9385e52604834a93b0250e79900f21e80","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}