{"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/discriminative-gaifman-models","title":"Discriminative Gaifman Models","arxiv_id":"1610.09369","date":"2016-10-28","proceeding":"NeurIPS 2016 12","authors":["Mathias Niepert"],"abstract":"We present discriminative Gaifman models, a novel family of relational\nmachine learning models. Gaifman models learn feature representations bottom up\nfrom representations of locally connected and bounded-size regions of knowledge\nbases (KBs). Considering local and bounded-size neighborhoods of knowledge\nbases renders logical inference and learning tractable, mitigates the problem\nof overfitting, and facilitates weight sharing. Gaifman models sample\nneighborhoods of knowledge bases so as to make the learned relational models\nmore robust to missing objects and relations which is a common situation in\nopen-world KBs. We present the core ideas of Gaifman models and apply them to\nlarge-scale relational learning problems. We also discuss the ways in which\nGaifman models relate to some existing relational machine learning approaches.","url_abs":"http://arxiv.org/abs/1610.09369v1","url_pdf":"http://arxiv.org/pdf/1610.09369v1.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":[],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"relational-reasoning","task_name":"Relational Reasoning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-wn18","task":"Link Prediction","dataset":"WN18","model":"Gaifman","rank_in_archive_order":28,"of":37,"metrics":{"Hits@1":"0.761","Hits@10":"0.939","MR":"352"},"uses_additional_data":false}],"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":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1321467b0b716ae391e0c00095c30308a35400ccb015934a175fa68a200ed640","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}