{"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/a-strong-baseline-for-generalized-few-shot","title":"A Strong Baseline for Generalized Few-Shot Semantic Segmentation","arxiv_id":"2211.14126","date":"2022-11-25","proceeding":"CVPR 2023 1","authors":["Sina Hajimiri","Malik Boudiaf","Ismail Ben Ayed","Jose Dolz"],"abstract":"This paper introduces a generalized few-shot segmentation framework with a straightforward training process and an easy-to-optimize inference phase. In particular, we propose a simple yet effective model based on the well-known InfoMax principle, where the Mutual Information (MI) between the learned feature representations and their corresponding predictions is maximized. In addition, the terms derived from our MI-based formulation are coupled with a knowledge distillation term to retain the knowledge on base classes. With a simple training process, our inference model can be applied on top of any segmentation network trained on base classes. The proposed inference yields substantial improvements on the popular few-shot segmentation benchmarks, PASCAL-$5^i$ and COCO-$20^i$. Particularly, for novel classes, the improvement gains range from 7% to 26% (PASCAL-$5^i$) and from 3% to 12% (COCO-$20^i$) in the 1-shot and 5-shot scenarios, respectively. Furthermore, we propose a more challenging setting, where performance gaps are further exacerbated. Our code is publicly available at https://github.com/sinahmr/DIaM.","url_abs":"https://arxiv.org/abs/2211.14126v2","url_pdf":"https://arxiv.org/pdf/2211.14126v2.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":"a-strong-baseline-for-generalized-few-shot","repo_url":"https://github.com/sinahmr/diam","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-strong-baseline-for-generalized-few-shot","repo_url":"https://github.com/cliffbb/oem-fewshot-challenge","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"few-shot-image-segmentation","task_name":"Few-Shot Semantic Segmentation"},{"task_slug":"generalized-few-shot-semantic-segmentation","task_name":"Generalized Few-Shot Semantic Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[{"method_slug":"auxiliary-classifier","method_name":"Auxiliary Classifier"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dilated-convolution","method_name":"Dilated Convolution"},{"method_slug":"knowledge-distillation","method_name":"Knowledge Distillation"},{"method_slug":"pspnet","method_name":"PSPNet"},{"method_slug":"pyramid-pooling-module","method_name":"Pyramid Pooling Module"},{"method_slug":"relu","method_name":"ReLU"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/generalized-few-shot-semantic-segmentation-on-2","task":"Generalized Few-Shot Semantic Segmentation","dataset":"COCO-20i (1-shot)","model":"DIaM (ResNet-50)","rank_in_archive_order":4,"of":6,"metrics":{"Mean Base and Novel":"32.75","Mean IoU":"40.52"},"uses_additional_data":false},{"leaderboard":"/sota/generalized-few-shot-semantic-segmentation-on-3","task":"Generalized Few-Shot Semantic Segmentation","dataset":"COCO-20i (5-shot)","model":"DIaM (ResNet-50)","rank_in_archive_order":4,"of":5,"metrics":{"Mean Base and Novel":"38.55","Mean IoU":"43.46"},"uses_additional_data":false},{"leaderboard":"/sota/generalized-few-shot-semantic-segmentation-on","task":"Generalized Few-Shot Semantic Segmentation","dataset":"PASCAL-5i (1-Shot)","model":"DIaM (ResNet-50)","rank_in_archive_order":4,"of":5,"metrics":{"Mean Base and Novel":"53","Mean IoU":"61.95"},"uses_additional_data":false},{"leaderboard":"/sota/generalized-few-shot-semantic-segmentation-on-1","task":"Generalized Few-Shot Semantic Segmentation","dataset":"PASCAL-5i (5-Shot)","model":"DIaM (ResNet-50)","rank_in_archive_order":4,"of":6,"metrics":{"Mean Base and Novel":"63.08","Mean IoU":"66.97"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2211.14126","atlas_url":"https://app.syntology.ai/?focus=2211.14126","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":"2211.14126"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2211.14126\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2211.14126"},"call":"get_concepts_for_paper(arxiv_id=\"2211.14126\")"}],"by_repo":[{"repo":"sinahmr/diam","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["Hajimiri_A_Strong_Baseline_for_Generalized_Few-Shot_Semantic_Segmentation_CVPR_2023_paper"],"harvested_for_calls":[]},{"repo":"cliffbb/oem-fewshot-challenge","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"a7cf75597bf0656977563274e44a0d364fd90c329b334c7625d97dca9960706e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}