{"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/less-is-more-efficient-black-box-attribution","title":"Less is More: Efficient Black-box Attribution via Minimal Interpretable Subset Selection","arxiv_id":"2504.00470","date":"2025-04-01","proceeding":null,"authors":["Ruoyu Chen","Siyuan Liang","Jingzhi Li","Shiming Liu","Li Liu","Hua Zhang","Xiaochun Cao"],"abstract":"To develop a trustworthy AI system, which aim to identify the input regions that most influence the models decisions. The primary task of existing attribution methods lies in efficiently and accurately identifying the relationships among input-prediction interactions. Particularly when the input data is discrete, such as images, analyzing the relationship between inputs and outputs poses a significant challenge due to the combinatorial explosion. In this paper, we propose a novel and efficient black-box attribution mechanism, LiMA (Less input is More faithful for Attribution), which reformulates the attribution of important regions as an optimization problem for submodular subset selection. First, to accurately assess interactions, we design a submodular function that quantifies subset importance and effectively captures their impact on decision outcomes. Then, efficiently ranking input sub-regions by their importance for attribution, we improve optimization efficiency through a novel bidirectional greedy search algorithm. LiMA identifies both the most and least important samples while ensuring an optimal attribution boundary that minimizes errors. Extensive experiments on eight foundation models demonstrate that our method provides faithful interpretations with fewer regions and exhibits strong generalization, shows an average improvement of 36.3% in Insertion and 39.6% in Deletion. Our method also outperforms the naive greedy search in attribution efficiency, being 1.6 times faster. Furthermore, when explaining the reasons behind model prediction errors, the average highest confidence achieved by our method is, on average, 86.1% higher than that of state-of-the-art attribution algorithms. The code is available at https://github.com/RuoyuChen10/LIMA.","url_abs":"https://arxiv.org/abs/2504.00470v1","url_pdf":"https://arxiv.org/pdf/2504.00470v1.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":"less-is-more-efficient-black-box-attribution","repo_url":"https://github.com/RuoyuChen10/LIMA","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"less-is-more-efficient-black-box-attribution","repo_url":"https://github.com/ruoyuchen10/smdl-attribution","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2504.00470","atlas_url":"https://app.syntology.ai/?focus=2504.00470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.00470"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2504.00470"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2504.00470"},"call":"get_harvested_code_for_paper(arxiv_id=\"2504.00470\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2504.00470"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2504.00470\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2504.00470"},"call":"get_concepts_for_paper(arxiv_id=\"2504.00470\")"}],"by_repo":[{"repo":"RuoyuChen10/LIMA","kind":"official","samples":7,"ran":7,"instrument":0,"unverified":0},{"repo":"ruoyuchen10/smdl-attribution","kind":"listed","samples":1,"ran":1,"instrument":1,"unverified":0,"placed_by_identical_code":1}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2504.00470.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2504.00470.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/RuoyuChen10/LIMA","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ruoyuchen10/smdl-attribution","reach":null}],"summary":{"ran_draft_wrong":1,"ran":7},"n_samples":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":7,"ran":7,"n_ran_checked":7,"n_instrument":0,"repositories":1},"listed":{"samples":1,"ran":1,"n_ran_checked":0,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":7,"n_ran_without_level_date":1,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"4e71c97a79591777","code_sha256_prefix":"4e71c97a79591777","entry":"Partition_by_patch","repo":null,"repo_kind":"listed","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"image:ndarray/2/float, partition_size:int/0/int","fixture_out_type":"list","retrieve_with":{"tool":"get_code","code_sha256":"4e71c97a79591777"},"code_page":null,"census":null,"placed_by_identical_code":{"repo":"ruoyuchen10/smdl-attribution","path":"submodular_attribution/smdl_explanation_celeba.py","file_url":"https://github.com/RuoyuChen10/SMDL-Attribution/blob/HEAD/submodular_attribution/smdl_explanation_celeba.py","papers":["2402.09164"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","mcp_get_code":{"code_sha256":"4e71c97a79591777"}},{"code_sha256":"4f3fa09e8a7e6b02","code_sha256_prefix":"4f3fa09e8a7e6b02","entry":"perturbed","repo":"RuoyuChen10/LIMA","repo_kind":"official","path":"baseline_attribution/debug_org_attribution_method_clip_rn101.py","file_url":"https://github.com/RuoyuChen10/LIMA/blob/HEAD/baseline_attribution/debug_org_attribution_method_clip_rn101.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"image:ndarray/3/int, mask:ndarray/2/float, rate:float/0/float, mode:str/0/str","fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T00:28:05.031210+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4f3fa09e8a7e6b02"}},{"code_sha256":"9254d53eb1047f0e","code_sha256_prefix":"9254d53eb1047f0e","entry":"perturbed","repo":"RuoyuChen10/LIMA","repo_kind":"official","path":"baseline_attribution/debug_org_attribution_method_imagebind_vggsound.py","file_url":"https://github.com/RuoyuChen10/LIMA/blob/HEAD/baseline_attribution/debug_org_attribution_method_imagebind_vggsound.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"image:ndarray/3/float, mask:ndarray/2/float, rate:float/0/float, mode:str/0/str","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T23:57:41.519889+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"9254d53eb1047f0e"}},{"code_sha256":"9c033200afa5fa21","code_sha256_prefix":"9c033200afa5fa21","entry":"preprocess_input","repo":"RuoyuChen10/LIMA","repo_kind":"official","path":"baseline_attribution/debug_org_attribution_method_clip_rn101.py","file_url":"https://github.com/RuoyuChen10/LIMA/blob/HEAD/baseline_attribution/debug_org_attribution_method_clip_rn101.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"images:list/1/ndarray","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T23:57:41.519889+00:00","code_page":"/code/preprocess-input","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"9c033200afa5fa21"}},{"code_sha256":"91a062e7f2b9ebcc","code_sha256_prefix":"91a062e7f2b9ebcc","entry":"preprocess_input","repo":"RuoyuChen10/LIMA","repo_kind":"official","path":"baseline_attribution/debug_org_attribution_method_imagebind_vggsound.py","file_url":"https://github.com/RuoyuChen10/LIMA/blob/HEAD/baseline_attribution/debug_org_attribution_method_imagebind_vggsound.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"images:list/1/ndarray","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T23:57:41.519889+00:00","code_page":"/code/preprocess-input","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"91a062e7f2b9ebcc"}},{"code_sha256":"26868c1d763a8351","code_sha256_prefix":"26868c1d763a8351","entry":"preprocess_input","repo":"RuoyuChen10/LIMA","repo_kind":"official","path":"baseline_attribution/debug_org_attribution_method_mambavision.py","file_url":"https://github.com/RuoyuChen10/LIMA/blob/HEAD/baseline_attribution/debug_org_attribution_method_mambavision.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"images:list/1/ndarray","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T00:28:05.031210+00:00","code_page":"/code/preprocess-input","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"26868c1d763a8351"}},{"code_sha256":"68be2c3ac63cb2ac","code_sha256_prefix":"68be2c3ac63cb2ac","entry":"preprocess_input","repo":"RuoyuChen10/LIMA","repo_kind":"official","path":"baseline_attribution/debug_org_attribution_method_swin.py","file_url":"https://github.com/RuoyuChen10/LIMA/blob/HEAD/baseline_attribution/debug_org_attribution_method_swin.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"images:list/1/ndarray","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T04:30:57.282821+00:00","code_page":"/code/preprocess-input","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"68be2c3ac63cb2ac"}},{"code_sha256":"d0c52e0acd45603b","code_sha256_prefix":"d0c52e0acd45603b","entry":"processing_sam_concepts","repo":"RuoyuChen10/LIMA","repo_kind":"official","path":"SAM_mask_generate.py","file_url":"https://github.com/RuoyuChen10/LIMA/blob/HEAD/SAM_mask_generate.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"sam_masks:list/1/dict, image:ndarray/3/int","fixture_out_type":"list","level_recorded_at":"2026-09-24T23:57:41.519889+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d0c52e0acd45603b"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e2b86f6d0e7dde7a11cbdf6a7ad06ef90302ddb968544d90b5c6a78f2ec0a262","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}