{"url":"/sota/overlapped-15-5-on-pascal-voc-2012","task":{"name":"Overlapped 15-5","url":"/task/overlapped-15-5","note":null},"dataset":{"name":"PASCAL VOC 2012","url":null},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":null,"description_from":null,"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":["Mean IoU (val)"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Mean IoU (val)":"higher"}},"counts":{"rows":13,"rows_with_code":12,"rows_with_paper_page":13,"rows_dated":13,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"MBS","metrics":{"Mean IoU (val)":"82.6"},"uses_additional_data":false,"paper_date":"2024-07-16","paper":"/paper/mitigating-background-shift-in-class","paper_url":"https://arxiv.org/abs/2407.11859v1","paper_title":"Mitigating Background Shift in Class-Incremental Semantic Segmentation","code":"https://github.com/roadonep/eccv2024_mbs","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"SATS-M","metrics":{"Mean IoU (val)":"78.72"},"uses_additional_data":false,"paper_date":"2022-03-15","paper":"/paper/sats-self-attention-transfer-for-continual","paper_url":"https://arxiv.org/abs/2203.07667v3","paper_title":"SATS: Self-Attention Transfer for Continual Semantic Segmentation","code":"https://github.com/QIU023/SATS_Continual_Semantic_Seg","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"SATS","metrics":{"Mean IoU (val)":"75.70"},"uses_additional_data":false,"paper_date":"2022-03-15","paper":"/paper/sats-self-attention-transfer-for-continual","paper_url":"https://arxiv.org/abs/2203.07667v3","paper_title":"SATS: Self-Attention Transfer for Continual Semantic Segmentation","code":"https://github.com/QIU023/SATS_Continual_Semantic_Seg","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"SSUL-M","metrics":{"Mean IoU (val)":"73.02"},"uses_additional_data":false,"paper_date":"2021-06-22","paper":"/paper/ssul-semantic-segmentation-with-unknown-label","paper_url":"https://arxiv.org/abs/2106.11562v3","paper_title":"SSUL: Semantic Segmentation with Unknown Label for Exemplar-based Class-Incremental Learning","code":"https://github.com/clovaai/SSUL","n_code_links":1,"syntology":{"n_ran":6,"n_unverified":6,"n_samples":12,"n_pointer_only_licence":12}},{"rank_in_archive_order":5,"model":"RCNet-101","metrics":{"Mean IoU (val)":"72.4"},"uses_additional_data":false,"paper_date":"2022-03-10","paper":"/paper/representation-compensation-networks-for","paper_url":"https://arxiv.org/abs/2203.05402v1","paper_title":"Representation Compensation Networks for Continual Semantic Segmentation","code":"https://github.com/zhangchbin/rcil","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"SSUL+AWT","metrics":{"Mean IoU (val)":"71.4"},"uses_additional_data":false,"paper_date":"2022-10-13","paper":"/paper/attribution-aware-weight-transfer-a-warm","paper_url":"https://arxiv.org/abs/2210.07207v1","paper_title":"Attribution-aware Weight Transfer: A Warm-Start Initialization for Class-Incremental Semantic Segmentation","code":"https://github.com/dfki-av/awt-for-ciss","n_code_links":1,"syntology":{"n_ran":6,"n_unverified":2,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"SSUL","metrics":{"Mean IoU (val)":"71.22"},"uses_additional_data":false,"paper_date":"2021-06-22","paper":"/paper/ssul-semantic-segmentation-with-unknown-label","paper_url":"https://arxiv.org/abs/2106.11562v3","paper_title":"SSUL: Semantic Segmentation with Unknown Label for Exemplar-based Class-Incremental Learning","code":"https://github.com/clovaai/SSUL","n_code_links":1,"syntology":{"n_ran":6,"n_unverified":6,"n_samples":12,"n_pointer_only_licence":12}},{"rank_in_archive_order":8,"model":"SDR","metrics":{"Mean IoU (val)":"70.1"},"uses_additional_data":false,"paper_date":"2021-03-10","paper":"/paper/continual-semantic-segmentation-via-repulsion","paper_url":"https://arxiv.org/abs/2103.06342v3","paper_title":"Continual Semantic Segmentation via Repulsion-Attraction of Sparse and Disentangled Latent Representations","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":9,"model":"PLOP","metrics":{"Mean IoU (val)":"70.09"},"uses_additional_data":false,"paper_date":"2020-11-23","paper":"/paper/plop-learning-without-forgetting-for","paper_url":"https://arxiv.org/abs/2011.11390v3","paper_title":"PLOP: Learning without Forgetting for Continual Semantic Segmentation","code":"https://github.com/arthurdouillard/CVPR2021_PLOP","n_code_links":2,"syntology":null},{"rank_in_archive_order":10,"model":"MiB","metrics":{"Mean IoU (val)":"70.08"},"uses_additional_data":false,"paper_date":"2020-11-23","paper":"/paper/plop-learning-without-forgetting-for","paper_url":"https://arxiv.org/abs/2011.11390v3","paper_title":"PLOP: Learning without Forgetting for Continual Semantic Segmentation","code":"https://github.com/arthurdouillard/CVPR2021_PLOP","n_code_links":2,"syntology":null},{"rank_in_archive_order":11,"model":"PLOPLong","metrics":{"Mean IoU (val)":"69.37"},"uses_additional_data":false,"paper_date":"2021-06-29","paper":"/paper/tackling-catastrophic-forgetting-and","paper_url":"https://arxiv.org/abs/2106.15287v1","paper_title":"Tackling Catastrophic Forgetting and Background Shift in Continual Semantic Segmentation","code":"https://github.com/arthurdouillard/CVPR2021_PLOP","n_code_links":2,"syntology":null},{"rank_in_archive_order":12,"model":"ILT","metrics":{"Mean IoU (val)":"61.3"},"uses_additional_data":false,"paper_date":"2019-07-31","paper":"/paper/incremental-learning-techniques-for-semantic","paper_url":"https://arxiv.org/abs/1907.13372v4","paper_title":"Incremental Learning Techniques for Semantic Segmentation","code":"https://github.com/LTTM/IL-SemSegm","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":2,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"LWF","metrics":{"Mean IoU (val)":"55.0"},"uses_additional_data":false,"paper_date":"2016-06-29","paper":"/paper/learning-without-forgetting","paper_url":"http://arxiv.org/abs/1606.09282v3","paper_title":"Learning without Forgetting","code":"https://github.com/ContinualAI/avalanche","n_code_links":12,"syntology":{"n_ran":9,"n_unverified":6,"n_samples":15,"n_pointer_only_licence":1}}],"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":6,"rows_with_any_sample_ran":5,"distinct_papers_with_graph_line":5,"distinct_papers_with_any_sample_ran":4,"samples_over_distinct_papers":{"n_ran":22,"n_unverified":17,"n_samples":39,"n_pointer_only_licence":13,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":28,"n_unverified":23,"n_samples":51,"n_pointer_only_licence":25,"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"}}}