{"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/unsupervised-domain-adaptation-for-semantic","title":"Unsupervised Domain Adaptation for Semantic Segmentation via Class-Balanced Self-Training","arxiv_id":null,"date":"2018-09-01","proceeding":"ECCV 2018 9","authors":["Yang Zou","Zhiding Yu","B. V. K. Vijaya Kumar","Jinsong Wang"],"abstract":"Recent deep networks achieved state of the art performanceon a variety of semantic segmentation tasks. Despite such progress, thesemodels often face challenges in real world âwild tasksâ where large differ-ence between labeled training/source data and unseen test/target dataexists. In particular, such difference is often referred to as âdomain gapâ,and  could  cause  significantly  decreased  performance  which  cannot  beeasily remedied by further increasing the representation power. Unsuper-vised domain adaptation (UDA) seeks to overcome such problem withouttarget domain labels. In this paper, we propose a novel UDA frameworkbased  on  an  iterative  self-training  (ST)  procedure,  where  the  problemis formulated as latent variable loss minimization, and can be solved byalternatively generating pseudo labels on target data and re-training themodel with these labels. On top of ST, we also propose a novel class-balanced  self-training  (CBST)  framework  to  avoid  the  gradual  domi-nance of large classes on pseudo-label generation, and introduce spatialpriors to refine generated labels. Comprehensive experiments show thatthe  proposed  methods  achieve  state  of  the  art  semantic  segmentationperformance under multiple major UDA settings.","url_abs":"http://openaccess.thecvf.com/content_ECCV_2018/html/Yang_Zou_Unsupervised_Domain_Adaptation_ECCV_2018_paper.html","url_pdf":"http://openaccess.thecvf.com/content_ECCV_2018/papers/Yang_Zou_Unsupervised_Domain_Adaptation_ECCV_2018_paper.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":"unsupervised-domain-adaptation-for-semantic","repo_url":"https://github.com/yzou2/CBST","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mxnet","reach":null}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"image-to-image-translation","task_name":"Image-to-Image Translation"},{"task_slug":"pseudo-label","task_name":"Pseudo Label"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"semi-supervised-semantic-segmentation","task_name":"Semi-Supervised Semantic Segmentation"},{"task_slug":"unsupervised-domain-adaptation","task_name":"Unsupervised Domain Adaptation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-to-image-translation-on-gtav-to","task":"Image-to-Image Translation","dataset":"GTAV-to-Cityscapes Labels","model":"CBST","rank_in_archive_order":18,"of":22,"metrics":{"mIoU":"47.0"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-semantic-segmentation-on-23","task":"Semi-Supervised Semantic Segmentation","dataset":"ScribbleKITTI","model":"CBST (Range View)","rank_in_archive_order":6,"of":9,"metrics":{"mIoU (1% Labels)":"35.7","mIoU (10% Labels)":"50.7","mIoU (20% Labels)":"52.7","mIoU (50% Labels)":"54.6"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-semantic-segmentation-on-24","task":"Semi-Supervised Semantic Segmentation","dataset":"SemanticKITTI","model":"CBST (Range View)","rank_in_archive_order":9,"of":12,"metrics":{"mIoU (1% Labels)":"39.9","mIoU (10% Labels)":"53.4","mIoU (20% Labels)":"56.1","mIoU (50% Labels)":"56.9"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-semantic-segmentation-on-25","task":"Semi-Supervised Semantic Segmentation","dataset":"nuScenes","model":"CBST (Range View)","rank_in_archive_order":9,"of":11,"metrics":{"mIoU (1% Labels)":"40.9","mIoU (10% Labels)":"60.5","mIoU (20% Labels)":"64.3","mIoU (50% Labels)":"69.3"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"yzou2/CBST","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1810.07911"],"harvested_for_calls":[{"arxiv_id":"1810.07911","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1810.07911"},"call":"get_harvested_code_for_paper(arxiv_id=\"1810.07911\")"}]}],"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":"493bc50d1009e9e02d908bc7d508768aeb609fe529c81925bc0940e2f212a9ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}