{"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/generalizing-to-unseen-entities-and-entity","title":"Generalizing to Unseen Entities and Entity Pairs with Row-less Universal Schema","arxiv_id":"1606.05804","date":"2016-06-18","proceeding":"EACL 2017 4","authors":["Patrick Verga","Arvind Neelakantan","Andrew McCallum"],"abstract":"Universal schema predicts the types of entities and relations in a knowledge\nbase (KB) by jointly embedding the union of all available schema types---not\nonly types from multiple structured databases (such as Freebase or Wikipedia\ninfoboxes), but also types expressed as textual patterns from raw text. This\nprediction is typically modeled as a matrix completion problem, with one type\nper column, and either one or two entities per row (in the case of entity types\nor binary relation types, respectively). Factorizing this sparsely observed\nmatrix yields a learned vector embedding for each row and each column. In this\npaper we explore the problem of making predictions for entities or entity-pairs\nunseen at training time (and hence without a pre-learned row embedding). We\npropose an approach having no per-row parameters at all; rather we produce a\nrow vector on the fly using a learned aggregation function of the vectors of\nthe observed columns for that row. We experiment with various aggregation\nfunctions, including neural network attention models. Our approach can be\nunderstood as a natural language database, in that questions about KB entities\nare answered by attending to textual or database evidence. In experiments\npredicting both relations and entity types, we demonstrate that despite having\nan order of magnitude fewer parameters than traditional universal schema, we\ncan match the accuracy of the traditional model, and more importantly, we can\nnow make predictions about unseen rows with nearly the same accuracy as rows\navailable at training time.","url_abs":"http://arxiv.org/abs/1606.05804v2","url_pdf":"http://arxiv.org/pdf/1606.05804v2.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":"generalizing-to-unseen-entities-and-entity","repo_url":"https://github.com/patverga/torch-relation-extraction","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"torch","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"matrix-completion","task_name":"Matrix Completion"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1606.05804","atlas_url":"https://app.syntology.ai/?focus=1606.05804","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.05804"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1606.05804\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1606.05804"},"call":"get_concepts_for_paper(arxiv_id=\"1606.05804\")"}],"by_repo":[{"repo":"patverga/torch-relation-extraction","kind":"official","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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"44dbc347129fbb1e80b96dd4b5177c9856cfb6dd0d6baad99bb921171af91d39","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}