{"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":"/task/interpretability-techniques-for-deep-learning/papers/ran/1","list_of":"/task/interpretability-techniques-for-deep-learning","task":"Interpretability Techniques for Deep Learning","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,11],"of":11,"counts":{"archive_papers_tagged":25,"with_a_code_link":22,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":25,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":8,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":8,"listed_every_run_a_failure_of_syntologys_instrument":3,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/interpretability-techniques-for-deep-learning/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/dissecting-and-mitigating-diffusion-bias-via","slug":"dissecting-and-mitigating-diffusion-bias-via","title":"Dissecting and Mitigating Diffusion Bias via Mechanistic Interpretability","date":"2025-03-26","arxiv_id":"2503.20483","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/dissecting-and-mitigating-diffusion-bias-via#ran","syntology_url":"https://syntology.ai/paper/2503.20483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.20483"}},"official":null}},{"url":"/paper/causalgym-benchmarking-causal","slug":"causalgym-benchmarking-causal","title":"CausalGym: Benchmarking causal interpretability methods on linguistic tasks","date":"2024-02-19","arxiv_id":"2402.12560","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/causalgym-benchmarking-causal#ran","syntology_url":"https://syntology.ai/paper/2402.12560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12560"}},"official":{"repos":["aryamanarora/causalgym"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/less-is-more-fewer-interpretable-region-via","slug":"less-is-more-fewer-interpretable-region-via","title":"Less is More: Fewer Interpretable Region via Submodular Subset Selection","date":"2024-02-14","arxiv_id":"2402.09164","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/less-is-more-fewer-interpretable-region-via#ran","syntology_url":"https://syntology.ai/paper/2402.09164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.09164"}},"official":{"repos":["ruoyuchen10/smdl-attribution"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/making-sense-of-dependence-efficient-black","slug":"making-sense-of-dependence-efficient-black","title":"Making Sense of Dependence: Efficient Black-box Explanations Using Dependence Measure","date":"2022-06-13","arxiv_id":"2206.06219","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/making-sense-of-dependence-efficient-black#ran","syntology_url":"https://syntology.ai/paper/2206.06219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.06219"}},"official":{"repos":["paulnovello/hsic-attribution-method"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-the-dynamics-of-physical-systems-1","slug":"learning-the-dynamics-of-physical-systems-1","title":"Learning the Dynamics of Physical Systems from Sparse Observations with Finite Element Networks","date":"2022-03-16","arxiv_id":"2203.08852","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-the-dynamics-of-physical-systems-1#ran","syntology_url":"https://syntology.ai/paper/2203.08852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08852"}},"official":{"repos":["martenlienen/finite-element-networks"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/rise-randomized-input-sampling-for","slug":"rise-randomized-input-sampling-for","title":"RISE: Randomized Input Sampling for Explanation of Black-box Models","date":"2018-06-19","arxiv_id":"1806.07421","repositories_listed":13,"syntology":{"n":34,"n_ran":32,"n_constructed":0,"n_ran_checked":32,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":31,"n_pointer_only":10,"phrase":"32 ran (of which 0 constructed an object rather than computing a result; 32 with no instrument failure: 1 honoured, 0 violated, 31 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rise-randomized-input-sampling-for#ran","syntology_url":"https://syntology.ai/paper/1806.07421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07421"}},"official":{"repos":["eclique/RISE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-unified-approach-to-interpreting-model","slug":"a-unified-approach-to-interpreting-model","title":"A Unified Approach to Interpreting Model Predictions","date":"2017-05-22","arxiv_id":"1705.07874","repositories_listed":17,"syntology":{"n":8,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":6,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/a-unified-approach-to-interpreting-model#ran","syntology_url":"https://syntology.ai/paper/1705.07874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07874"}},"official":null}},{"url":"/paper/axiomatic-attribution-for-deep-networks","slug":"axiomatic-attribution-for-deep-networks","title":"Axiomatic Attribution for Deep Networks","date":"2017-03-04","arxiv_id":"1703.01365","repositories_listed":40,"syntology":{"n":56,"n_ran":36,"n_constructed":13,"n_ran_checked":21,"n_instrument":15,"n_unverified":20,"n_honours":3,"n_violates":1,"n_no_contract":17,"n_pointer_only":17,"phrase":"36 ran (of which 13 constructed an object rather than computing a result; 21 with no instrument failure: 3 honoured, 1 violated, 17 with no contract checked; 15 where Syntology's instrument failed) · 20 unverified","sample_list":"/paper/axiomatic-attribution-for-deep-networks#ran","syntology_url":"https://syntology.ai/paper/1703.01365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01365"}},"official":{"repos":["ankurtaly/Attributions"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/grad-cam-visual-explanations-from-deep","slug":"grad-cam-visual-explanations-from-deep","title":"Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localization","date":"2016-10-07","arxiv_id":"1610.02391","repositories_listed":126,"syntology":{"n":141,"n_ran":90,"n_constructed":32,"n_ran_checked":65,"n_instrument":25,"n_unverified":51,"n_honours":5,"n_violates":4,"n_no_contract":56,"n_pointer_only":69,"phrase":"90 ran (of which 32 constructed an object rather than computing a result; 65 with no instrument failure: 5 honoured, 4 violated, 56 with no contract checked; 25 where Syntology's instrument failed) · 51 unverified","sample_list":"/paper/grad-cam-visual-explanations-from-deep#ran","syntology_url":"https://syntology.ai/paper/1610.02391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.02391"}},"official":{"repos":["ramprs/grad-cam"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/why-should-i-trust-you-explaining-the","slug":"why-should-i-trust-you-explaining-the","title":"\"Why Should I Trust You?\": Explaining the Predictions of Any Classifier","date":"2016-02-16","arxiv_id":"1602.04938","repositories_listed":27,"syntology":{"n":19,"n_ran":13,"n_constructed":4,"n_ran_checked":13,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"13 ran (of which 4 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/why-should-i-trust-you-explaining-the#ran","syntology_url":"https://syntology.ai/paper/1602.04938","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.04938"}},"official":{"repos":["marcotcr/lime-experiments"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deep-inside-convolutional-networks","slug":"deep-inside-convolutional-networks","title":"Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Maps","date":"2013-12-20","arxiv_id":"1312.6034","repositories_listed":23,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/deep-inside-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1312.6034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1312.6034"}},"official":null}}],"record_sha256":"a64e193532c3907aff9d2453909a4971ba3e40dbf9f2bbf5e0318b9dd89ec709","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}