{"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/investigating-robustness-and-interpretability","title":"Investigating Robustness and Interpretability of Link Prediction via Adversarial Modifications","arxiv_id":"1905.00563","date":"2019-05-02","proceeding":"NAACL 2019 6","authors":["Pouya Pezeshkpour","Yifan Tian","Sameer Singh"],"abstract":"Representing entities and relations in an embedding space is a well-studied\napproach for machine learning on relational data. Existing approaches, however,\nprimarily focus on improving accuracy and overlook other aspects such as\nrobustness and interpretability. In this paper, we propose adversarial\nmodifications for link prediction models: identifying the fact to add into or\nremove from the knowledge graph that changes the prediction for a target fact\nafter the model is retrained. Using these single modifications of the graph, we\nidentify the most influential fact for a predicted link and evaluate the\nsensitivity of the model to the addition of fake facts. We introduce an\nefficient approach to estimate the effect of such modifications by\napproximating the change in the embeddings when the knowledge graph changes. To\navoid the combinatorial search over all possible facts, we train a network to\ndecode embeddings to their corresponding graph components, allowing the use of\ngradient-based optimization to identify the adversarial modification. We use\nthese techniques to evaluate the robustness of link prediction models (by\nmeasuring sensitivity to additional facts), study interpretability through the\nfacts most responsible for predictions (by identifying the most influential\nneighbors), and detect incorrect facts in the knowledge base.","url_abs":"http://arxiv.org/abs/1905.00563v1","url_pdf":"http://arxiv.org/pdf/1905.00563v1.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":"investigating-robustness-and-interpretability","repo_url":"https://github.com/pouyapez/criage","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"sensitivity","task_name":"Sensitivity"}],"methods":[{"method_slug":"interpretability","method_name":"Interpretability"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1905.00563","atlas_url":"https://app.syntology.ai/?focus=1905.00563","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":"1905.00563"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1905.00563\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1905.00563"},"call":"get_concepts_for_paper(arxiv_id=\"1905.00563\")"}],"by_repo":[{"repo":"pouyapez/criage","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":"a263511ec50aa57bfd0c2b5e4591d00ec060365a3d2343ee98dfe6ef4fc49c3d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}