{"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/maximally-invariant-data-perturbation-as","title":"Maximally Invariant Data Perturbation as Explanation","arxiv_id":"1806.07004","date":"2018-06-19","proceeding":null,"authors":["Satoshi Hara","Kouichi Ikeno","Tasuku Soma","Takanori Maehara"],"abstract":"While several feature scoring methods are proposed to explain the output of\ncomplex machine learning models, most of them lack formal mathematical\ndefinitions. In this study, we propose a novel definition of the feature score\nusing the maximally invariant data perturbation, which is inspired from the\nidea of adversarial example. In adversarial example, one seeks the smallest\ndata perturbation that changes the model's output. In our proposed approach, we\nconsider the opposite: we seek the maximally invariant data perturbation that\ndoes not change the model's output. In this way, we can identify important\ninput features as the ones with small allowable data perturbations. To find the\nmaximally invariant data perturbation, we formulate the problem as linear\nprogramming. The experiment on the image classification with VGG16 shows that\nthe proposed method could identify relevant parts of the images effectively.","url_abs":"http://arxiv.org/abs/1806.07004v2","url_pdf":"http://arxiv.org/pdf/1806.07004v2.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":"maximally-invariant-data-perturbation-as","repo_url":"https://github.com/sato9hara/PertMap","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1806.07004","atlas_url":"https://app.syntology.ai/?focus=1806.07004","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":"1806.07004"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.07004\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.07004"},"call":"get_concepts_for_paper(arxiv_id=\"1806.07004\")"}],"by_repo":[{"repo":"sato9hara/PertMap","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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b63b4ecf56c768e12ac1a63cd095a0ec4c4cb36146abf0655122b15cae9b6de4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}