{"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/interpretable-and-compositional-relation","title":"Interpretable and Compositional Relation Learning by Joint Training with an Autoencoder","arxiv_id":"1805.09547","date":"2018-05-24","proceeding":"ACL 2018 7","authors":["Ryo Takahashi","Ran Tian","Kentaro Inui"],"abstract":"Embedding models for entities and relations are extremely useful for\nrecovering missing facts in a knowledge base. Intuitively, a relation can be\nmodeled by a matrix mapping entity vectors. However, relations reside on low\ndimension sub-manifolds in the parameter space of arbitrary matrices---for one\nreason, composition of two relations $\\boldsymbol{M}_1,\\boldsymbol{M}_2$ may\nmatch a third $\\boldsymbol{M}_3$ (e.g. composition of relations\ncurrency_of_country and country_of_film usually matches\ncurrency_of_film_budget), which imposes compositional constraints to be\nsatisfied by the parameters (i.e. $\\boldsymbol{M}_1\\cdot\n\\boldsymbol{M}_2\\approx \\boldsymbol{M}_3$). In this paper we investigate a\ndimension reduction technique by training relations jointly with an\nautoencoder, which is expected to better capture compositional constraints. We\nachieve state-of-the-art on Knowledge Base Completion tasks with strongly\nimproved Mean Rank, and show that joint training with an autoencoder leads to\ninterpretable sparse codings of relations, helps discovering compositional\nconstraints and benefits from compositional training. Our source code is\nreleased at github.com/tianran/glimvec.","url_abs":"http://arxiv.org/abs/1805.09547v1","url_pdf":"http://arxiv.org/pdf/1805.09547v1.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":"interpretable-and-compositional-relation","repo_url":"https://github.com/tianran/glimvec","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"},{"task_slug":"knowledge-base-completion","task_name":"Knowledge Base Completion"},{"task_slug":null,"task_name":"Relation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"tianran/glimvec","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":"b76d09372f41c527bee4585fadcc9d3ad074dceb8a9991af1ea79495d7706e20","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}