{"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/plop-learning-without-forgetting-for","title":"PLOP: Learning without Forgetting for Continual Semantic Segmentation","arxiv_id":"2011.11390","date":"2020-11-23","proceeding":"CVPR 2021 1","authors":["Arthur Douillard","Yifu Chen","Arnaud Dapogny","Matthieu Cord"],"abstract":"Deep learning approaches are nowadays ubiquitously used to tackle computer vision tasks such as semantic segmentation, requiring large datasets and substantial computational power. Continual learning for semantic segmentation (CSS) is an emerging trend that consists in updating an old model by sequentially adding new classes. However, continual learning methods are usually prone to catastrophic forgetting. This issue is further aggravated in CSS where, at each step, old classes from previous iterations are collapsed into the background. In this paper, we propose Local POD, a multi-scale pooling distillation scheme that preserves long- and short-range spatial relationships at feature level. Furthermore, we design an entropy-based pseudo-labelling of the background w.r.t. classes predicted by the old model to deal with background shift and avoid catastrophic forgetting of the old classes. Our approach, called PLOP, significantly outperforms state-of-the-art methods in existing CSS scenarios, as well as in newly proposed challenging benchmarks.","url_abs":"https://arxiv.org/abs/2011.11390v3","url_pdf":"https://arxiv.org/pdf/2011.11390v3.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":"plop-learning-without-forgetting-for","repo_url":"https://github.com/arthurdouillard/CVPR2021_PLOP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"plop-learning-without-forgetting-for","repo_url":"https://github.com/mostafaelaraby/bacs-continual-semantic-segmentation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"class-incremental-learning","task_name":"Class Incremental Learning"},{"task_slug":"continual-learning","task_name":"Continual Learning"},{"task_slug":"continual-semantic-segmentation","task_name":"Continual Semantic Segmentation"},{"task_slug":"disjoint-10-1","task_name":"Disjoint 10-1"},{"task_slug":"disjoint-15-1","task_name":"Disjoint 15-1"},{"task_slug":"disjoint-15-5","task_name":"Disjoint 15-5"},{"task_slug":"domain-1-1","task_name":"Domain 1-1"},{"task_slug":"domain-11-1","task_name":"Domain 11-1"},{"task_slug":"domain-11-5","task_name":"Domain 11-5"},{"task_slug":"overlapped-10-1","task_name":"Overlapped 10-1"},{"task_slug":"overlapped-100-10","task_name":"Overlapped 100-10"},{"task_slug":"overlapped-100-5","task_name":"Overlapped 100-5"},{"task_slug":"overlapped-100-50","task_name":"Overlapped 100-50"},{"task_slug":"overlapped-15-1","task_name":"Overlapped 15-1"},{"task_slug":"overlapped-15-5","task_name":"Overlapped 15-5"},{"task_slug":null,"task_name":"Overlapped 19-1"},{"task_slug":"overlapped-50-50","task_name":"Overlapped 50-50"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/disjoint-10-1-on-pascal-voc-2012","task":"Disjoint 10-1","dataset":"PASCAL VOC 2012","model":"PLOP","rank_in_archive_order":5,"of":8,"metrics":{"mIoU":"8.4"},"uses_additional_data":false},{"leaderboard":"/sota/disjoint-15-1-on-pascal-voc-2012","task":"Disjoint 15-1","dataset":"PASCAL VOC 2012","model":"PLOP","rank_in_archive_order":6,"of":9,"metrics":{"mIoU":"46.5"},"uses_additional_data":false},{"leaderboard":"/sota/disjoint-15-5-on-pascal-voc-2012","task":"Disjoint 15-5","dataset":"PASCAL VOC 2012","model":"PLOP","rank_in_archive_order":7,"of":9,"metrics":{"Mean IoU":"64.3"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-10-1-on-pascal-voc-2012","task":"Overlapped 10-1","dataset":"PASCAL VOC 2012","model":"PLOP","rank_in_archive_order":9,"of":13,"metrics":{"mIoU":"30.45"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-100-10-on-ade20k","task":"Overlapped 100-10","dataset":"ADE20K","model":"PLOP","rank_in_archive_order":5,"of":6,"metrics":{"Mean IoU (test) ":"31.59"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-100-10-on-ade20k","task":"Overlapped 100-10","dataset":"ADE20K","model":"MiB","rank_in_archive_order":6,"of":6,"metrics":{"Mean IoU (test) ":"29.24"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-100-5-on-ade20k","task":"Overlapped 100-5","dataset":"ADE20K","model":"PLOP","rank_in_archive_order":6,"of":8,"metrics":{"mIoU":"28.75"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-100-5-on-ade20k","task":"Overlapped 100-5","dataset":"ADE20K","model":"MiB","rank_in_archive_order":7,"of":8,"metrics":{"mIoU":"25.96"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-100-50-on-ade20k","task":"Overlapped 100-50","dataset":"ADE20K","model":"PLOP","rank_in_archive_order":6,"of":7,"metrics":{"mIoU":"32.94"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-100-50-on-ade20k","task":"Overlapped 100-50","dataset":"ADE20K","model":"MiB","rank_in_archive_order":7,"of":7,"metrics":{"mIoU":"32.79"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-15-1-on-pascal-voc-2012","task":"Overlapped 15-1","dataset":"PASCAL VOC 2012","model":"PLOP","rank_in_archive_order":9,"of":13,"metrics":{"mIoU":"54.64"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-15-1-on-pascal-voc-2012","task":"Overlapped 15-1","dataset":"PASCAL VOC 2012","model":"MiB","rank_in_archive_order":11,"of":13,"metrics":{"mIoU":"29.29"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-15-5-on-pascal-voc-2012","task":"Overlapped 15-5","dataset":"PASCAL VOC 2012","model":"PLOP","rank_in_archive_order":9,"of":13,"metrics":{"Mean IoU (val)":"70.09"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-15-5-on-pascal-voc-2012","task":"Overlapped 15-5","dataset":"PASCAL VOC 2012","model":"MiB","rank_in_archive_order":10,"of":13,"metrics":{"Mean IoU (val)":"70.08"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-50-50-on-ade20k","task":"Overlapped 50-50","dataset":"ADE20K","model":"PLOP","rank_in_archive_order":4,"of":7,"metrics":{"mIoU":"30.4"},"uses_additional_data":false},{"leaderboard":"/sota/overlapped-50-50-on-ade20k","task":"Overlapped 50-50","dataset":"ADE20K","model":"MiB","rank_in_archive_order":7,"of":7,"metrics":{"mIoU":"29.31"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2011.11390","atlas_url":"https://app.syntology.ai/?focus=2011.11390","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2011.11390"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2011.11390\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2011.11390"},"call":"get_concepts_for_paper(arxiv_id=\"2011.11390\")"}],"by_repo":[{"repo":"arthurdouillard/CVPR2021_PLOP","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mostafaelaraby/bacs-continual-semantic-segmentation","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"bf12b01319743df2e2e3c342ef956c18dce71938b84ff1959bebfaf06be64d96","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}