{"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/interpretable-machine-learning/papers/ran/1","list_of":"/task/interpretable-machine-learning","task":"Interpretable Machine 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,47],"of":47,"counts":{"archive_papers_tagged":537,"with_a_code_link":226,"where_syntology_ran_a_sample":47,"not_listed_spam_title":0,"listed":537,"listed_where_code_ran":47,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":37,"every_run_a_failure_of_syntologys_instrument":10,"listed_with_a_run_with_no_instrument_failure":37,"listed_every_run_a_failure_of_syntologys_instrument":10,"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/interpretable-machine-learning/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/leveraging-predictive-equivalence-in-decision","slug":"leveraging-predictive-equivalence-in-decision","title":"Leveraging Predictive Equivalence in Decision Trees","date":"2025-06-17","arxiv_id":"2506.14143","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/leveraging-predictive-equivalence-in-decision#ran","syntology_url":"https://syntology.ai/paper/2506.14143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.14143"}},"official":{"repos":["haydenmct/predictive-equivalence"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/prompt-cam-a-simpler-interpretable","slug":"prompt-cam-a-simpler-interpretable","title":"Prompt-CAM: A Simpler Interpretable Transformer for Fine-Grained Analysis","date":"2025-01-16","arxiv_id":"2501.09333","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":0,"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/prompt-cam-a-simpler-interpretable#ran","syntology_url":"https://syntology.ai/paper/2501.09333","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09333"}},"official":null}},{"url":"/paper/graph-learning-for-numeric-planning","slug":"graph-learning-for-numeric-planning","title":"Graph Learning for Numeric Planning","date":"2024-10-31","arxiv_id":"2410.24080","repositories_listed":1,"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":0,"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/graph-learning-for-numeric-planning#ran","syntology_url":"https://syntology.ai/paper/2410.24080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.24080"}},"official":{"repos":["DillonZChen/goose"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/local-feature-selection-without-label-or","slug":"local-feature-selection-without-label-or","title":"Local Feature Selection without Label or Feature Leakage for Interpretable Machine Learning Predictions","date":"2024-07-16","arxiv_id":"2407.11778","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/local-feature-selection-without-label-or#ran","syntology_url":"https://syntology.ai/paper/2407.11778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11778"}},"official":{"repos":["garfieldlyu/suwr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/branches-a-fast-dynamic-programming-and","slug":"branches-a-fast-dynamic-programming-and","title":"Branches: Efficiently Seeking Optimal Sparse Decision Trees with AO*","date":"2024-06-04","arxiv_id":"2406.02175","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 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","sample_list":"/paper/branches-a-fast-dynamic-programming-and#ran","syntology_url":"https://syntology.ai/paper/2406.02175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02175"}},"official":{"repos":["Chaoukia/branches"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unveiling-the-cycloid-trajectory-of-em","slug":"unveiling-the-cycloid-trajectory-of-em","title":"Unveiling the Cycloid Trajectory of EM Iterations in Mixed Linear Regression","date":"2024-05-28","arxiv_id":"2405.18237","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unveiling-the-cycloid-trajectory-of-em#ran","syntology_url":"https://syntology.ai/paper/2405.18237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18237"}},"official":{"repos":["dassein/cycloid_em_mlr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/interpretable-machine-learning-for-tabpfn","slug":"interpretable-machine-learning-for-tabpfn","title":"Interpretable Machine Learning for TabPFN","date":"2024-03-16","arxiv_id":"2403.10923","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/interpretable-machine-learning-for-tabpfn#ran","syntology_url":"https://syntology.ai/paper/2403.10923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.10923"}},"official":{"repos":["david-rundel/tabpfn_iml"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-concept-bottleneck-models-how-to-make","slug":"beyond-concept-bottleneck-models-how-to-make","title":"Beyond Concept Bottleneck Models: How to Make Black Boxes Intervenable?","date":"2024-01-24","arxiv_id":"2401.13544","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/beyond-concept-bottleneck-models-how-to-make#ran","syntology_url":"https://syntology.ai/paper/2401.13544","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.13544"}},"official":{"repos":["sonialagunac/beyond-cbm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/x-hacking-the-threat-of-misguided-automl","slug":"x-hacking-the-threat-of-misguided-automl","title":"X Hacking: The Threat of Misguided AutoML","date":"2024-01-16","arxiv_id":"2401.08513","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/x-hacking-the-threat-of-misguided-automl#ran","syntology_url":"https://syntology.ai/paper/2401.08513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.08513"}},"official":{"repos":["selbosh/p-hacking"],"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":["official"]}}},{"url":"/paper/interpreting-and-correcting-medical-image","slug":"interpreting-and-correcting-medical-image","title":"Interpreting and Correcting Medical Image Classification with PIP-Net","date":"2023-07-19","arxiv_id":"2307.10404","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":13,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/interpreting-and-correcting-medical-image#ran","syntology_url":"https://syntology.ai/paper/2307.10404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.10404"}},"official":{"repos":["m-nauta/pipnet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/genomic-interpreter-a-hierarchical-genomic","slug":"genomic-interpreter-a-hierarchical-genomic","title":"Genomic Interpreter: A Hierarchical Genomic Deep Neural Network with 1D Shifted Window Transformer","date":"2023-06-08","arxiv_id":"2306.05143","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/genomic-interpreter-a-hierarchical-genomic#ran","syntology_url":"https://syntology.ai/paper/2306.05143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.05143"}},"official":{"repos":["zehui127/1d-swin"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-transformer-programs-1","slug":"learning-transformer-programs-1","title":"Learning Transformer Programs","date":"2023-06-01","arxiv_id":"2306.01128","repositories_listed":1,"syntology":{"n":21,"n_ran":16,"n_constructed":12,"n_ran_checked":13,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":21,"phrase":"16 ran (of which 12 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-transformer-programs-1#ran","syntology_url":"https://syntology.ai/paper/2306.01128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.01128"}},"official":{"repos":["princeton-nlp/transformerprograms"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":12,"n_ran_no_instrument_failure":13,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/interpretable-machine-learning-for-science","slug":"interpretable-machine-learning-for-science","title":"Interpretable Machine Learning for Science with PySR and SymbolicRegression.jl","date":"2023-05-02","arxiv_id":"2305.01582","repositories_listed":4,"syntology":{"n":29,"n_ran":22,"n_constructed":0,"n_ran_checked":21,"n_instrument":1,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":20,"n_pointer_only":0,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 1 honoured, 0 violated, 20 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/interpretable-machine-learning-for-science#ran","syntology_url":"https://syntology.ai/paper/2305.01582","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.01582"}},"official":{"repos":["MilesCranmer/PySR","milescranmer/pysr_paper","milescranmer/symbolicregression.jl"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/ceflow-a-robust-and-efficient-counterfactual","slug":"ceflow-a-robust-and-efficient-counterfactual","title":"CeFlow: A Robust and Efficient Counterfactual Explanation Framework for Tabular Data using Normalizing Flows","date":"2023-03-26","arxiv_id":"2303.14668","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 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) · 3 unverified","sample_list":"/paper/ceflow-a-robust-and-efficient-counterfactual#ran","syntology_url":"https://syntology.ai/paper/2303.14668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.14668"}},"official":{"repos":["tridungduong16/fairce"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/hospital-length-of-stay-prediction-based-on","slug":"hospital-length-of-stay-prediction-based-on","title":"Interpretable machine learning for time-to-event prediction in medicine and healthcare","date":"2023-03-17","arxiv_id":"2303.09817","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hospital-length-of-stay-prediction-based-on#ran","syntology_url":"https://syntology.ai/paper/2303.09817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.09817"}},"official":{"repos":["mi2datalab/xlungs-trustworthy-los-prediction","modeloriented/survex","mi2datalab/interpret-time-to-event"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/margin-optimal-classification-trees","slug":"margin-optimal-classification-trees","title":"Margin Optimal Classification Trees","date":"2022-10-19","arxiv_id":"2210.10567","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/margin-optimal-classification-trees#ran","syntology_url":"https://syntology.ai/paper/2210.10567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.10567"}},"official":{"repos":["m-monaci/MARGOT"],"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/higher-order-neural-additive-models-an","slug":"higher-order-neural-additive-models-an","title":"Higher-order Neural Additive Models: An Interpretable Machine Learning Model with Feature Interactions","date":"2022-09-30","arxiv_id":"2209.15409","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/higher-order-neural-additive-models-an#ran","syntology_url":"https://syntology.ai/paper/2209.15409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15409"}},"official":{"repos":["gim4855744/honam"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"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/gam-changer-editing-generalized-additive","slug":"gam-changer-editing-generalized-additive","title":"GAM Changer: Editing Generalized Additive Models with Interactive Visualization","date":"2021-12-06","arxiv_id":"2112.03245","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 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) · 2 unverified","sample_list":"/paper/gam-changer-editing-generalized-additive#ran","syntology_url":"https://syntology.ai/paper/2112.03245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03245"}},"official":{"repos":["interpretml/gam-changer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/optimal-counterfactual-explanations-in-tree","slug":"optimal-counterfactual-explanations-in-tree","title":"Optimal Counterfactual Explanations in Tree Ensembles","date":"2021-06-11","arxiv_id":"2106.06631","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimal-counterfactual-explanations-in-tree#ran","syntology_url":"https://syntology.ai/paper/2106.06631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06631"}},"official":{"repos":["vidalt/OCEAN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/two4two-evaluating-interpretable-machine","slug":"two4two-evaluating-interpretable-machine","title":"Two4Two: Evaluating Interpretable Machine Learning - A Synthetic Dataset For Controlled Experiments","date":"2021-05-06","arxiv_id":"2105.02825","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/two4two-evaluating-interpretable-machine#ran","syntology_url":"https://syntology.ai/paper/2105.02825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02825"}},"official":{"repos":["mschuessler/two4two"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/do-feature-attribution-methods-correctly","slug":"do-feature-attribution-methods-correctly","title":"Do Feature Attribution Methods Correctly Attribute Features?","date":"2021-04-27","arxiv_id":"2104.14403","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/do-feature-attribution-methods-correctly#ran","syntology_url":"https://syntology.ai/paper/2104.14403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14403"}},"official":{"repos":["YilunZhou/feature-attribution-evaluation"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-rigorous-interpretations-a","slug":"towards-rigorous-interpretations-a","title":"Towards Rigorous Interpretations: a Formalisation of Feature Attribution","date":"2021-04-26","arxiv_id":"2104.12437","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-rigorous-interpretations-a#ran","syntology_url":"https://syntology.ai/paper/2104.12437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12437"}},"official":{"repos":["DariusAf/functional_attribution"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"url":"/paper/making-neural-networks-interpretable-with","slug":"making-neural-networks-interpretable-with","title":"Making Neural Networks Interpretable with Attribution: Application to Implicit Signals Prediction","date":"2020-08-26","arxiv_id":"2008.11406","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-neural-networks-interpretable-with#ran","syntology_url":"https://syntology.ai/paper/2008.11406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.11406"}},"official":{"repos":["deezer/interpretable_nn_attribution"],"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/generalized-optimal-sparse-decision-trees","slug":"generalized-optimal-sparse-decision-trees","title":"Generalized and Scalable Optimal Sparse Decision Trees","date":"2020-06-15","arxiv_id":"2006.08690","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/generalized-optimal-sparse-decision-trees#ran","syntology_url":"https://syntology.ai/paper/2006.08690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08690"}},"official":{"repos":["Jimmy-Lin/GeneralizedOptimalSparseDecisionTrees"],"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/how-interpretable-and-trustworthy-are-gams","slug":"how-interpretable-and-trustworthy-are-gams","title":"How Interpretable and Trustworthy are GAMs?","date":"2020-06-11","arxiv_id":"2006.06466","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-interpretable-and-trustworthy-are-gams#ran","syntology_url":"https://syntology.ai/paper/2006.06466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06466"}},"official":{"repos":["zzzace2000/GAMs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/explaining-how-deep-neural-networks-forget-by","slug":"explaining-how-deep-neural-networks-forget-by","title":"Explaining How Deep Neural Networks Forget by Deep Visualization","date":"2020-05-03","arxiv_id":"2005.01004","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/explaining-how-deep-neural-networks-forget-by#ran","syntology_url":"https://syntology.ai/paper/2005.01004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01004"}},"official":{"repos":["giangnguyen2412/dissect_catastrophic_forgetting"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-additive-models-interpretable-machine","slug":"neural-additive-models-interpretable-machine","title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","date":"2020-04-29","arxiv_id":"2004.13912","repositories_listed":8,"syntology":{"n":33,"n_ran":26,"n_constructed":14,"n_ran_checked":26,"n_instrument":0,"n_unverified":7,"n_honours":5,"n_violates":0,"n_no_contract":21,"n_pointer_only":14,"phrase":"26 ran (of which 14 constructed an object rather than computing a result; 26 with no instrument failure: 5 honoured, 0 violated, 21 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/neural-additive-models-interpretable-machine#ran","syntology_url":"https://syntology.ai/paper/2004.13912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13912"}},"official":{"repos":["lemeln/nam"],"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/born-again-tree-ensembles","slug":"born-again-tree-ensembles","title":"Born-Again Tree Ensembles","date":"2020-03-24","arxiv_id":"2003.11132","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/born-again-tree-ensembles#ran","syntology_url":"https://syntology.ai/paper/2003.11132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11132"}},"official":{"repos":["vidalt/BA-Trees"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-fusion-transformers-for","slug":"temporal-fusion-transformers-for","title":"Temporal Fusion Transformers for Interpretable Multi-horizon Time Series Forecasting","date":"2019-12-19","arxiv_id":"1912.09363","repositories_listed":36,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/temporal-fusion-transformers-for#ran","syntology_url":"https://syntology.ai/paper/1912.09363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.09363"}},"official":null}},{"url":"/paper/understanding-deep-networks-via-extremal","slug":"understanding-deep-networks-via-extremal","title":"Understanding Deep Networks via Extremal Perturbations and Smooth Masks","date":"2019-10-18","arxiv_id":"1910.08485","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/understanding-deep-networks-via-extremal#ran","syntology_url":"https://syntology.ai/paper/1910.08485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.08485"}},"official":{"repos":["facebookresearch/TorchRay"],"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/learning-explainable-models-using-attribution","slug":"learning-explainable-models-using-attribution","title":"Improving performance of deep learning models with axiomatic attribution priors and expected gradients","date":"2019-06-25","arxiv_id":"1906.10670","repositories_listed":3,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-explainable-models-using-attribution#ran","syntology_url":"https://syntology.ai/paper/1906.10670","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.10670"}},"official":{"repos":["suinleelab/attributionpriors"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/disentangled-attribution-curves-for","slug":"disentangled-attribution-curves-for","title":"Disentangled Attribution Curves for Interpreting Random Forests and Boosted Trees","date":"2019-05-18","arxiv_id":"1905.07631","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/disentangled-attribution-curves-for#ran","syntology_url":"https://syntology.ai/paper/1905.07631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07631"}},"official":{"repos":["csinva/disentangled-attribution-curves"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/explaining-a-black-box-using-deep-variational","slug":"explaining-a-black-box-using-deep-variational","title":"Explaining a black-box using Deep Variational Information Bottleneck Approach","date":"2019-02-19","arxiv_id":"1902.06918","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/explaining-a-black-box-using-deep-variational#ran","syntology_url":"https://syntology.ai/paper/1902.06918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06918"}},"official":{"repos":["SeojinBang/VIBI"],"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/regularizing-black-box-models-for-improved","slug":"regularizing-black-box-models-for-improved","title":"Regularizing Black-box Models for Improved Interpretability","date":"2019-02-18","arxiv_id":"1902.06787","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/regularizing-black-box-models-for-improved#ran","syntology_url":"https://syntology.ai/paper/1902.06787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06787"}},"official":{"repos":["GDPlumb/ExpO"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/attention-based-prototypical-learning-towards","slug":"attention-based-prototypical-learning-towards","title":"ProtoAttend: Attention-Based Prototypical Learning","date":"2019-02-17","arxiv_id":"1902.06292","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attention-based-prototypical-learning-towards#ran","syntology_url":"https://syntology.ai/paper/1902.06292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06292"}},"official":null}},{"url":"/paper/interpretable-machine-learning-definitions","slug":"interpretable-machine-learning-definitions","title":"Interpretable machine learning: definitions, methods, and applications","date":"2019-01-14","arxiv_id":"1901.04592","repositories_listed":6,"syntology":{"n":27,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":16,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 16 unverified","sample_list":"/paper/interpretable-machine-learning-definitions#ran","syntology_url":"https://syntology.ai/paper/1901.04592","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.04592"}},"official":{"repos":["csinva/imodels"],"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/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/contrastive-explanations-with-local-foil","slug":"contrastive-explanations-with-local-foil","title":"Contrastive Explanations with Local Foil Trees","date":"2018-06-19","arxiv_id":"1806.07470","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/contrastive-explanations-with-local-foil#ran","syntology_url":"https://syntology.ai/paper/1806.07470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07470"}},"official":null}},{"url":"/paper/explaining-recurrent-neural-network","slug":"explaining-recurrent-neural-network","title":"Explaining Recurrent Neural Network Predictions in Sentiment Analysis","date":"2017-06-22","arxiv_id":"1706.07206","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/explaining-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/1706.07206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.07206"}},"official":{"repos":["ArrasL/LRP_for_LSTM"],"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/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/interpretable-explanations-of-black-boxes-by","slug":"interpretable-explanations-of-black-boxes-by","title":"Interpretable Explanations of Black Boxes by Meaningful Perturbation","date":"2017-04-11","arxiv_id":"1704.03296","repositories_listed":13,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/interpretable-explanations-of-black-boxes-by#ran","syntology_url":"https://syntology.ai/paper/1704.03296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.03296"}},"official":{"repos":["ruthcfong/perturb_explanations"],"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/learning-important-features-through","slug":"learning-important-features-through","title":"Learning Important Features Through Propagating Activation Differences","date":"2017-04-10","arxiv_id":"1704.02685","repositories_listed":14,"syntology":{"n":15,"n_ran":8,"n_constructed":2,"n_ran_checked":5,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":2,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/learning-important-features-through#ran","syntology_url":"https://syntology.ai/paper/1704.02685","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.02685"}},"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/understanding-neural-networks-through-deep","slug":"understanding-neural-networks-through-deep","title":"Understanding Neural Networks Through Deep Visualization","date":"2015-06-22","arxiv_id":"1506.06579","repositories_listed":7,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/understanding-neural-networks-through-deep#ran","syntology_url":"https://syntology.ai/paper/1506.06579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.06579"}},"official":null}}],"record_sha256":"75f591fd75fac328865ee80d868ac276f47d17957016a9b40adeb697abfa3496","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}