{"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/adrmx-additive-disentanglement-of-domain","title":"ADRMX: Additive Disentanglement of Domain Features with Remix Loss","arxiv_id":"2308.06624","date":"2023-08-12","proceeding":null,"authors":["Berker Demirel","Erchan Aptoula","Huseyin Ozkan"],"abstract":"The common assumption that train and test sets follow similar distributions is often violated in deployment settings. Given multiple source domains, domain generalization aims to create robust models capable of generalizing to new unseen domains. To this end, most of existing studies focus on extracting domain invariant features across the available source domains in order to mitigate the effects of inter-domain distributional changes. However, this approach may limit the model's generalization capacity by relying solely on finding common features among the source domains. It overlooks the potential presence of domain-specific characteristics that could be prevalent in a subset of domains, potentially containing valuable information. In this work, a novel architecture named Additive Disentanglement of Domain Features with Remix Loss (ADRMX) is presented, which addresses this limitation by incorporating domain variant features together with the domain invariant ones using an original additive disentanglement strategy. Moreover, a new data augmentation technique is introduced to further support the generalization capacity of ADRMX, where samples from different domains are mixed within the latent space. Through extensive experiments conducted on DomainBed under fair conditions, ADRMX is shown to achieve state-of-the-art performance. Code will be made available at GitHub after the revision process.","url_abs":"https://arxiv.org/abs/2308.06624v1","url_pdf":"https://arxiv.org/pdf/2308.06624v1.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":"adrmx-additive-disentanglement-of-domain","repo_url":"https://github.com/facebookresearch/DomainBed","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"data-augmentation","task_name":"Data Augmentation"},{"task_slug":"disentanglement","task_name":"Disentanglement"},{"task_slug":"domain-generalization","task_name":"Domain Generalization"}],"methods":[{"method_slug":"focus","method_name":"Focus"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"facebookresearch/DomainBed","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":11,"harvested_for":["1505.07818","1512.03385","1607.01719","1907.02893","1911.08731","2003.00688","2007.01434","2011.09468","2106.03632","2106.07847","2201.00057"],"harvested_for_calls":[{"arxiv_id":"1505.07818","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1505.07818"},"call":"get_harvested_code_for_paper(arxiv_id=\"1505.07818\")"},{"arxiv_id":"1512.03385","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1512.03385"},"call":"get_harvested_code_for_paper(arxiv_id=\"1512.03385\")"},{"arxiv_id":"1607.01719","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.01719"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.01719\")"},{"arxiv_id":"1907.02893","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1907.02893"},"call":"get_harvested_code_for_paper(arxiv_id=\"1907.02893\")"},{"arxiv_id":"1911.08731","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1911.08731"},"call":"get_harvested_code_for_paper(arxiv_id=\"1911.08731\")"},{"arxiv_id":"2003.00688","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.00688"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.00688\")"},{"arxiv_id":"2007.01434","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.01434"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.01434\")"},{"arxiv_id":"2011.09468","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2011.09468"},"call":"get_harvested_code_for_paper(arxiv_id=\"2011.09468\")"},{"arxiv_id":"2106.03632","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03632"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03632\")"},{"arxiv_id":"2106.07847","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.07847"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.07847\")"},{"arxiv_id":"2201.00057","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.00057"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.00057\")"}]}],"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":"525c333c0d9c709112f455dbf8e42cc35216bc5dcaecd47f23ef5d33c6858f40","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}