{"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/patch-mix-transformer-for-unsupervised-domain","title":"Patch-Mix Transformer for Unsupervised Domain Adaptation: A Game Perspective","arxiv_id":"2303.13434","date":"2023-03-23","proceeding":"CVPR 2023 1","authors":["Jinjing Zhu","Haotian Bai","Lin Wang"],"abstract":"Endeavors have been recently made to leverage the vision transformer (ViT) for the challenging unsupervised domain adaptation (UDA) task. They typically adopt the cross-attention in ViT for direct domain alignment. However, as the performance of cross-attention highly relies on the quality of pseudo labels for targeted samples, it becomes less effective when the domain gap becomes large. We solve this problem from a game theory's perspective with the proposed model dubbed as PMTrans, which bridges source and target domains with an intermediate domain. Specifically, we propose a novel ViT-based module called PatchMix that effectively builds up the intermediate domain, i.e., probability distribution, by learning to sample patches from both domains based on the game-theoretical models. This way, it learns to mix the patches from the source and target domains to maximize the cross entropy (CE), while exploiting two semi-supervised mixup losses in the feature and label spaces to minimize it. As such, we interpret the process of UDA as a min-max CE game with three players, including the feature extractor, classifier, and PatchMix, to find the Nash Equilibria. Moreover, we leverage attention maps from ViT to re-weight the label of each patch by its importance, making it possible to obtain more domain-discriminative feature representations. We conduct extensive experiments on four benchmark datasets, and the results show that PMTrans significantly surpasses the ViT-based and CNN-based SoTA methods by +3.6% on Office-Home, +1.4% on Office-31, and +17.7% on DomainNet, respectively.","url_abs":"https://arxiv.org/abs/2303.13434v2","url_pdf":"https://arxiv.org/pdf/2303.13434v2.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":[],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"unsupervised-domain-adaptation","task_name":"Unsupervised Domain Adaptation"}],"methods":[{"method_slug":"attention","method_name":"Attention"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"mixup","method_name":"Mixup"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"vision-transformer","method_name":"Vision Transformer"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/domain-adaptation-on-domainnet-1","task":"Domain Adaptation","dataset":"DomainNet","model":"PMTrans","rank_in_archive_order":4,"of":4,"metrics":{"Accuracy":"52.4"},"uses_additional_data":false},{"leaderboard":"/sota/domain-adaptation-on-office-31","task":"Domain Adaptation","dataset":"Office-31","model":"PMTrans","rank_in_archive_order":2,"of":40,"metrics":{"Average Accuracy":"95.3"},"uses_additional_data":false},{"leaderboard":"/sota/domain-adaptation-on-office-home","task":"Domain Adaptation","dataset":"Office-Home","model":"PMTrans","rank_in_archive_order":4,"of":29,"metrics":{"Accuracy":"89.0"},"uses_additional_data":false},{"leaderboard":"/sota/domain-adaptation-on-visda2017","task":"Domain Adaptation","dataset":"VisDA2017","model":"PMtrans","rank_in_archive_order":9,"of":28,"metrics":{"Accuracy":"88.8"},"uses_additional_data":false},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-domainnet-1","task":"Unsupervised Domain Adaptation","dataset":"DomainNet","model":"PMTrans","rank_in_archive_order":2,"of":4,"metrics":{"Accuracy":"52.4"},"uses_additional_data":false},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-office-31","task":"Unsupervised Domain Adaptation","dataset":"Office-31","model":"PMTrans","rank_in_archive_order":1,"of":5,"metrics":{"Accuracy":"95.3"},"uses_additional_data":false},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-office-home","task":"Unsupervised Domain Adaptation","dataset":"Office-Home","model":"PMTrans","rank_in_archive_order":4,"of":20,"metrics":{"Accuracy":"89.0"},"uses_additional_data":false},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-visda2017","task":"Unsupervised Domain Adaptation","dataset":"VisDA2017","model":"PMTrans","rank_in_archive_order":7,"of":13,"metrics":{"Accuracy":"88.8"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2303.13434","atlas_url":"https://app.syntology.ai/?focus=2303.13434","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":"2303.13434"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2303.13434\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2303.13434"},"call":"get_concepts_for_paper(arxiv_id=\"2303.13434\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"440ad02779a7fff75aacb5211ecc7e88963ee24f28eddc357a45c3d246ff7047","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}