{"url":"/sota/domain-adaptation-on-cityscapes-to-acdc","task":{"name":"Domain Adaptation","url":"/task/domain-adaptation","note":null},"dataset":{"name":"Cityscapes to ACDC","url":"/dataset/acdc-adverse-conditions-dataset-with"},"category":"Computer Vision","categories":["Computer Vision","Methodology"],"category_note":null,"description":"**Domain Adaptation** is the task of adapting models across domains. This is motivated by the challenge where the test and training datasets fall from different data distributions due to some factor. Domain adaptation aims to build machine learning models that can be generalized into a target domain and dealing with the discrepancy across domain distributions. \r\n\r\nFurther readings:\r\n\r\n- [A Brief Review of Domain Adaptation](https://paperswithcode.com/paper/a-brief-review-of-domain-adaptation)\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Unsupervised Image-to-Image Translation Networks](https://arxiv.org/pdf/1703.00848v6.pdf) )</span>","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":["mIoU"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"mIoU":null}},"counts":{"rows":16,"rows_with_code":16,"rows_with_paper_page":16,"rows_dated":16,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"SoRA","metrics":{"mIoU":"78.8"},"uses_additional_data":false,"paper_date":"2024-12-05","paper":"/paper/sora-singular-value-decomposed-low-rank","paper_url":"https://arxiv.org/abs/2412.04077v1","paper_title":"SoRA: Singular Value Decomposed Low-Rank Adaptation for Domain Generalizable Representation Learning","code":"https://github.com/ysj9909/DG-SoRA","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"Rein","metrics":{"mIoU":"77.6"},"uses_additional_data":false,"paper_date":"2023-12-07","paper":"/paper/stronger-fewer-superior-harnessing-vision","paper_url":"https://arxiv.org/abs/2312.04265v5","paper_title":"Stronger, Fewer, & Superior: Harnessing Vision Foundation Models for Domain Generalized Semantic Segmentation","code":"https://github.com/w1oves/rein","n_code_links":2,"syntology":null},{"rank_in_archive_order":3,"model":"CoDA","metrics":{"mIoU":"72.6"},"uses_additional_data":false,"paper_date":"2024-03-26","paper":"/paper/coda-instructive-chain-of-domain-adaptation","paper_url":"https://arxiv.org/abs/2403.17369v3","paper_title":"CoDA: Instructive Chain-of-Domain Adaptation with Severity-Aware Visual Prompt Tuning","code":"https://github.com/Cuzyoung/CoDA","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"Refign (HRDA)","metrics":{"mIoU":"72.1"},"uses_additional_data":false,"paper_date":"2022-07-14","paper":"/paper/refign-align-and-refine-for-adaptation-of","paper_url":"https://arxiv.org/abs/2207.06825v3","paper_title":"Refign: Align and Refine for Adaptation of Semantic Segmentation to Adverse Conditions","code":"https://github.com/brdav/refign","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":7,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"HALO","metrics":{"mIoU":"71.9"},"uses_additional_data":false,"paper_date":"2023-06-19","paper":"/paper/hyperbolic-active-learning-for-semantic","paper_url":"https://arxiv.org/abs/2306.11180v5","paper_title":"Hyperbolic Active Learning for Semantic Segmentation under Domain Shift","code":"https://github.com/paolomandica/HALO","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":5,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"MIC","metrics":{"mIoU":"70.4"},"uses_additional_data":false,"paper_date":"2022-12-02","paper":"/paper/mic-masked-image-consistency-for-context","paper_url":"https://arxiv.org/abs/2212.01322v2","paper_title":"MIC: Masked Image Consistency for Context-Enhanced Domain Adaptation","code":"https://github.com/lhoyer/mic","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"HRDA","metrics":{"mIoU":"68.0"},"uses_additional_data":false,"paper_date":"2022-04-27","paper":"/paper/hrda-context-aware-high-resolution-domain","paper_url":"https://arxiv.org/abs/2204.13132v2","paper_title":"HRDA: Context-Aware High-Resolution Domain-Adaptive Semantic Segmentation","code":"https://github.com/lhoyer/hrda","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"Refign (DAFormer)","metrics":{"mIoU":"65.5"},"uses_additional_data":false,"paper_date":"2022-07-14","paper":"/paper/refign-align-and-refine-for-adaptation-of","paper_url":"https://arxiv.org/abs/2207.06825v3","paper_title":"Refign: Align and Refine for Adaptation of Semantic Segmentation to Adverse Conditions","code":"https://github.com/brdav/refign","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":7,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"VBLC (DAFormer)","metrics":{"mIoU":"64.2"},"uses_additional_data":false,"paper_date":"2022-11-22","paper":"/paper/vblc-visibility-boosting-and-logit-constraint","paper_url":"https://arxiv.org/abs/2211.12256v1","paper_title":"VBLC: Visibility Boosting and Logit-Constraint Learning for Domain Adaptive Semantic Segmentation under Adverse Conditions","code":"https://github.com/bit-da/vblc","n_code_links":1,"syntology":null},{"rank_in_archive_order":10,"model":"CMFormer","metrics":{"mIoU":"60.1"},"uses_additional_data":false,"paper_date":"2023-07-01","paper":"/paper/learning-content-enhanced-mask-transformer","paper_url":"https://arxiv.org/abs/2307.00371v5","paper_title":"Learning Content-enhanced Mask Transformer for Domain Generalized Urban-Scene Segmentation","code":"https://github.com/BiQiWHU/CMFormer","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"DAFormer","metrics":{"mIoU":"55.4"},"uses_additional_data":false,"paper_date":"2021-11-29","paper":"/paper/daformer-improving-network-architectures-and","paper_url":"https://arxiv.org/abs/2111.14887v2","paper_title":"DAFormer: Improving Network Architectures and Training Strategies for Domain-Adaptive Semantic Segmentation","code":"https://github.com/lhoyer/DAFormer","n_code_links":3,"syntology":{"n_ran":6,"n_unverified":0,"n_samples":6,"n_pointer_only_licence":6}},{"rank_in_archive_order":12,"model":"DANNet","metrics":{"mIoU":"50.0"},"uses_additional_data":false,"paper_date":"2021-04-22","paper":"/paper/dannet-a-one-stage-domain-adaptation-network","paper_url":"https://arxiv.org/abs/2104.10834v1","paper_title":"DANNet: A One-Stage Domain Adaptation Network for Unsupervised Nighttime Semantic Segmentation","code":"https://github.com/W-zx-Y/DANNet","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"MGCDA","metrics":{"mIoU":"48.7"},"uses_additional_data":false,"paper_date":"2020-05-28","paper":"/paper/map-guided-curriculum-domain-adaptation-and","paper_url":"https://arxiv.org/abs/2005.14553v2","paper_title":"Map-Guided Curriculum Domain Adaptation and Uncertainty-Aware Evaluation for Semantic Nighttime Image Segmentation","code":"https://github.com/sakaridis/MGCDA","n_code_links":1,"syntology":null},{"rank_in_archive_order":14,"model":"VBLC (DeepLabv2)","metrics":{"mIoU":"47.8"},"uses_additional_data":false,"paper_date":"2022-11-22","paper":"/paper/vblc-visibility-boosting-and-logit-constraint","paper_url":"https://arxiv.org/abs/2211.12256v1","paper_title":"VBLC: Visibility Boosting and Logit-Constraint Learning for Domain Adaptive Semantic Segmentation under Adverse Conditions","code":"https://github.com/bit-da/vblc","n_code_links":1,"syntology":null},{"rank_in_archive_order":15,"model":"FDA (DeepLabv2)","metrics":{"mIoU":"45.7"},"uses_additional_data":false,"paper_date":"2020-04-11","paper":"/paper/fda-fourier-domain-adaptation-for-semantic","paper_url":"https://arxiv.org/abs/2004.05498v1","paper_title":"FDA: Fourier Domain Adaptation for Semantic Segmentation","code":"https://github.com/albumentations-team/albumentations","n_code_links":3,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":16,"model":"DACS (DeepLabv2)","metrics":{"mIoU":"41.2"},"uses_additional_data":false,"paper_date":"2020-07-17","paper":"/paper/dacs-domain-adaptation-via-cross-domain-mixed","paper_url":"https://arxiv.org/abs/2007.08702v2","paper_title":"DACS: Domain Adaptation via Cross-domain Mixed Sampling","code":"https://github.com/vikolss/DACS","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":3}}],"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 6,264 of the 9,581 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":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+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":7,"rows_with_any_sample_ran":5,"distinct_papers_with_graph_line":6,"distinct_papers_with_any_sample_ran":5,"samples_over_distinct_papers":{"n_ran":17,"n_unverified":15,"n_samples":32,"n_pointer_only_licence":12,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":17,"n_unverified":22,"n_samples":39,"n_pointer_only_licence":12,"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"}}}