{"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/generalizing-to-unseen-domains-via","title":"Generalizing to Unseen Domains via Adversarial Data Augmentation","arxiv_id":"1805.12018","date":"2018-05-30","proceeding":"NeurIPS 2018 12","authors":["Riccardo Volpi","Hongseok Namkoong","Ozan Sener","John Duchi","Vittorio Murino","Silvio Savarese"],"abstract":"We are concerned with learning models that generalize well to different\n\\emph{unseen} domains. We consider a worst-case formulation over data\ndistributions that are near the source domain in the feature space. Only using\ntraining data from a single source distribution, we propose an iterative\nprocedure that augments the dataset with examples from a fictitious target\ndomain that is \"hard\" under the current model. We show that our iterative\nscheme is an adaptive data augmentation method where we append adversarial\nexamples at each iteration. For softmax losses, we show that our method is a\ndata-dependent regularization scheme that behaves differently from classical\nregularizers that regularize towards zero (e.g., ridge or lasso). On digit\nrecognition and semantic segmentation tasks, our method learns models improve\nperformance across a range of a priori unknown target domains.","url_abs":"http://arxiv.org/abs/1805.12018v2","url_pdf":"http://arxiv.org/pdf/1805.12018v2.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":"generalizing-to-unseen-domains-via","repo_url":"https://github.com/ricvolpi/generalize-unseen-domains","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"data-augmentation","task_name":"Data Augmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.12018","atlas_url":"https://app.syntology.ai/?focus=1805.12018","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":"1805.12018"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.12018\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.12018"},"call":"get_concepts_for_paper(arxiv_id=\"1805.12018\")"}],"by_repo":[{"repo":"ricvolpi/generalize-unseen-domains","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"3ef5d83c700c23ff323e80478d3c604e49396ed99daa691e1c85539faf1f6699","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}