{"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/advent-adversarial-entropy-minimization-for","title":"ADVENT: Adversarial Entropy Minimization for Domain Adaptation in Semantic Segmentation","arxiv_id":"1811.12833","date":"2018-11-30","proceeding":"CVPR 2019 6","authors":["Tuan-Hung Vu","Himalaya Jain","Maxime Bucher","Matthieu Cord","Patrick Pérez"],"abstract":"Semantic segmentation is a key problem for many computer vision tasks. While\napproaches based on convolutional neural networks constantly break new records\non different benchmarks, generalizing well to diverse testing environments\nremains a major challenge. In numerous real world applications, there is indeed\na large gap between data distributions in train and test domains, which results\nin severe performance loss at run-time. In this work, we address the task of\nunsupervised domain adaptation in semantic segmentation with losses based on\nthe entropy of the pixel-wise predictions. To this end, we propose two novel,\ncomplementary methods using (i) entropy loss and (ii) adversarial loss\nrespectively. We demonstrate state-of-the-art performance in semantic\nsegmentation on two challenging \"synthetic-2-real\" set-ups and show that the\napproach can also be used for detection.","url_abs":"http://arxiv.org/abs/1811.12833v2","url_pdf":"http://arxiv.org/pdf/1811.12833v2.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":"advent-adversarial-entropy-minimization-for","repo_url":"https://github.com/valeoai/ADVENT","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"advent-adversarial-entropy-minimization-for","repo_url":"https://github.com/attm/tensorflow_advent","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"advent-adversarial-entropy-minimization-for","repo_url":"https://github.com/thuml/Transfer-Learning-Library","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"advent-adversarial-entropy-minimization-for","repo_url":"https://github.com/yuan-zm/dgt-st","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"image-to-image-translation","task_name":"Image-to-Image Translation"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"synthetic-to-real-translation","task_name":"Synthetic-to-Real Translation"},{"task_slug":"unsupervised-domain-adaptation","task_name":"Unsupervised Domain Adaptation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/domain-adaptation-on-panoptic-synthia-to","task":"Domain Adaptation","dataset":"Panoptic SYNTHIA-to-Cityscapes","model":"ADVENT","rank_in_archive_order":5,"of":5,"metrics":{"mPQ":"28.1"},"uses_additional_data":false},{"leaderboard":"/sota/domain-adaptation-on-panoptic-synthia-to-1","task":"Domain Adaptation","dataset":"Panoptic SYNTHIA-to-Mapillary","model":"ADVENT","rank_in_archive_order":5,"of":5,"metrics":{"mPQ":"18.3"},"uses_additional_data":false},{"leaderboard":"/sota/domain-adaptation-on-synthia-to-cityscapes","task":"Domain Adaptation","dataset":"SYNTHIA-to-Cityscapes","model":"ADVENT (ResNet-101)","rank_in_archive_order":27,"of":33,"metrics":{"mIoU":"41.2"},"uses_additional_data":false},{"leaderboard":"/sota/image-to-image-translation-on-gtav-to","task":"Image-to-Image Translation","dataset":"GTAV-to-Cityscapes Labels","model":"ADVENT","rank_in_archive_order":19,"of":22,"metrics":{"mIoU":"44.8"},"uses_additional_data":false},{"leaderboard":"/sota/image-to-image-translation-on-synthia-to","task":"Image-to-Image Translation","dataset":"SYNTHIA-to-Cityscapes","model":"ADVENT","rank_in_archive_order":20,"of":28,"metrics":{"mIoU (13 classes)":"48"},"uses_additional_data":false},{"leaderboard":"/sota/synthetic-to-real-translation-on-gtav-to","task":"Synthetic-to-Real Translation","dataset":"GTAV-to-Cityscapes Labels","model":"AdvEnt(with MinEnt)","rank_in_archive_order":59,"of":73,"metrics":{"mIoU":"45.5"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.12833","atlas_url":"https://app.syntology.ai/?focus=1811.12833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12833"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1811.12833"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1811.12833"},"call":"get_harvested_code_for_paper(arxiv_id=\"1811.12833\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1811.12833"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.12833\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.12833"},"call":"get_concepts_for_paper(arxiv_id=\"1811.12833\")"}],"by_repo":[{"repo":"valeoai/ADVENT","kind":"official","samples":1,"ran":0,"instrument":0,"unverified":1},{"repo":"attm/tensorflow_advent","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"thuml/Transfer-Learning-Library","kind":"listed","samples":2,"ran":1,"instrument":1,"unverified":1},{"repo":"yuan-zm/dgt-st","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2403.18469"],"harvested_for_calls":[{"arxiv_id":"2403.18469","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2403.18469"},"call":"get_harvested_code_for_paper(arxiv_id=\"2403.18469\")"}]}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1811.12833.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1811.12833.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/thuml/Transfer-Learning-Library","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/valeoai/ADVENT","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/yuan-zm/dgt-st","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/attm/tensorflow_advent","reach":{"status":"ok"}}],"summary":{"ran_fixture":1,"unverified":2},"n_samples":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":true,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":1,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1},"listed":{"samples":2,"ran":1,"n_ran_checked":0,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":1,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"30cf477369f2f5ec","code_sha256_prefix":"30cf477369f2f5ec","entry":"prob_2_entropy","repo":"thuml/Transfer-Learning-Library","repo_kind":"listed","path":"tllib/alignment/advent.py","file_url":"https://github.com/thuml/Transfer-Learning-Library/blob/HEAD/tllib/alignment/advent.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"prob:Tensor/4/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"30cf477369f2f5ec"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"30cf477369f2f5ec"}},{"code_sha256":"8141e2a33f8c62a2","code_sha256_prefix":"8141e2a33f8c62a2","entry":"bce_loss","repo":"thuml/Transfer-Learning-Library","repo_kind":"listed","path":"tllib/alignment/advent.py","file_url":"https://github.com/thuml/Transfer-Learning-Library/blob/HEAD/tllib/alignment/advent.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/bce-loss","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8141e2a33f8c62a2"}},{"code_sha256":"91291dfac136d4a8","code_sha256_prefix":"91291dfac136d4a8","entry":"get_deeplab_v2","repo":"valeoai/ADVENT","repo_kind":"official","path":"advent/model/deeplabv2.py","file_url":"https://github.com/valeoai/ADVENT/blob/HEAD/advent/model/deeplabv2.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, valeoai/ADVENT (NOASSERTION)","mcp_get_code":{"code_sha256":"91291dfac136d4a8"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"10756b6be6332834e15ba5abecc14c9cd09a8668d5a3470bb5feb9bde96c4d8f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}