{"url":"/sota/image-attribution-on-cub-200-2011-1","task":{"name":"Image Attribution","url":"/task/image-attribution","note":null},"dataset":{"name":"CUB-200-2011","url":"/dataset/cub-200-2011"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":"Image attribution algorithms aim to identify important regions that are highly relevant to model decisions.","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Insertion AUC score (ResNet-101)","Deletion AUC score (ResNet-101)"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Insertion AUC score (ResNet-101)":"higher","Deletion AUC score (ResNet-101)":"higher"}},"counts":{"rows":8,"rows_with_code":8,"rows_with_paper_page":8,"rows_dated":8,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"SMDL-Attribution (ICLR version)","metrics":{"Deletion AUC score (ResNet-101)":"0.0613","Insertion AUC score (ResNet-101)":"0.7262"},"uses_additional_data":false,"paper_date":"2024-02-14","paper":"/paper/less-is-more-fewer-interpretable-region-via","paper_url":"https://arxiv.org/abs/2402.09164v3","paper_title":"Less is More: Fewer Interpretable Region via Submodular Subset Selection","code":"https://github.com/ruoyuchen10/smdl-attribution","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":2,"model":"Grad-CAM","metrics":{"Deletion AUC score (ResNet-101)":"0.0810","Insertion AUC score (ResNet-101)":"0.7224"},"uses_additional_data":false,"paper_date":"2016-10-07","paper":"/paper/grad-cam-visual-explanations-from-deep","paper_url":"https://arxiv.org/abs/1610.02391v4","paper_title":"Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localization","code":"https://github.com/jacobgil/pytorch-grad-cam","n_code_links":126,"syntology":{"n_ran":82,"n_unverified":59,"n_samples":141,"n_pointer_only_licence":68}},{"rank_in_archive_order":3,"model":"RISE","metrics":{"Deletion AUC score (ResNet-101)":"0.0665","Insertion AUC score (ResNet-101)":"0.7193"},"uses_additional_data":false,"paper_date":"2018-06-19","paper":"/paper/rise-randomized-input-sampling-for","paper_url":"http://arxiv.org/abs/1806.07421v3","paper_title":"RISE: Randomized Input Sampling for Explanation of Black-box Models","code":"https://github.com/openvinotoolkit/datumaro","n_code_links":13,"syntology":{"n_ran":1,"n_unverified":33,"n_samples":34,"n_pointer_only_licence":10}},{"rank_in_archive_order":4,"model":"HSIC-Attribution","metrics":{"Deletion AUC score (ResNet-101)":"0.0647","Insertion AUC score (ResNet-101)":"0.6843"},"uses_additional_data":false,"paper_date":"2022-06-13","paper":"/paper/making-sense-of-dependence-efficient-black","paper_url":"https://arxiv.org/abs/2206.06219v3","paper_title":"Making Sense of Dependence: Efficient Black-box Explanations Using Dependence Measure","code":"https://github.com/paulnovello/hsic-attribution-method","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":5,"model":"LIME","metrics":{"Deletion AUC score (ResNet-101)":"0.1070","Insertion AUC score (ResNet-101)":"0.6812"},"uses_additional_data":false,"paper_date":"2016-02-16","paper":"/paper/why-should-i-trust-you-explaining-the","paper_url":"http://arxiv.org/abs/1602.04938v3","paper_title":"\"Why Should I Trust You?\": Explaining the Predictions of Any Classifier","code":"https://github.com/marcotcr/lime","n_code_links":27,"syntology":{"n_ran":5,"n_unverified":14,"n_samples":19,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"Kernel SHAP","metrics":{"Deletion AUC score (ResNet-101)":"0.1016","Insertion AUC score (ResNet-101)":"0.6763"},"uses_additional_data":false,"paper_date":"2017-05-22","paper":"/paper/a-unified-approach-to-interpreting-model","paper_url":"http://arxiv.org/abs/1705.07874v2","paper_title":"A Unified Approach to Interpreting Model Predictions","code":"https://github.com/slundberg/shap","n_code_links":17,"syntology":{"n_ran":3,"n_unverified":5,"n_samples":8,"n_pointer_only_licence":6}},{"rank_in_archive_order":7,"model":"Saliency","metrics":{"Deletion AUC score (ResNet-101)":"0.0682","Insertion AUC score (ResNet-101)":"0.6585"},"uses_additional_data":false,"paper_date":"2013-12-20","paper":"/paper/deep-inside-convolutional-networks","paper_url":"http://arxiv.org/abs/1312.6034v2","paper_title":"Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Maps","code":"https://github.com/pytorch/captum","n_code_links":23,"syntology":{"n_ran":1,"n_unverified":3,"n_samples":4,"n_pointer_only_licence":1}},{"rank_in_archive_order":8,"model":"Integrated Gradients","metrics":{"Deletion AUC score (ResNet-101)":"0.0728","Insertion AUC score (ResNet-101)":"0.0422"},"uses_additional_data":false,"paper_date":"2017-03-04","paper":"/paper/axiomatic-attribution-for-deep-networks","paper_url":"http://arxiv.org/abs/1703.01365v2","paper_title":"Axiomatic Attribution for Deep Networks","code":"https://github.com/shap/shap","n_code_links":40,"syntology":{"n_ran":36,"n_unverified":20,"n_samples":56,"n_pointer_only_licence":17}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 7,081 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":7081,"papers_extracted_not_yet_verified":217,"boards_without_verdict":27,"papers_not_yet_extracted":2325},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":8,"rows_with_any_sample_ran":8,"distinct_papers_with_graph_line":8,"distinct_papers_with_any_sample_ran":8,"samples_over_distinct_papers":{"n_ran":132,"n_unverified":134,"n_samples":266,"n_pointer_only_licence":106,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":132,"n_unverified":134,"n_samples":266,"n_pointer_only_licence":106,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}