{"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/augmented-cyclic-adversarial-learning-for-low","title":"Augmented Cyclic Adversarial Learning for Low Resource Domain Adaptation","arxiv_id":"1807.00374","date":"2018-07-01","proceeding":"ICLR 2019 5","authors":["Ehsan Hosseini-Asl","Yingbo Zhou","Caiming Xiong","Richard Socher"],"abstract":"Training a model to perform a task typically requires a large amount of data\nfrom the domains in which the task will be applied. However, it is often the\ncase that data are abundant in some domains but scarce in others. Domain\nadaptation deals with the challenge of adapting a model trained from a\ndata-rich source domain to perform well in a data-poor target domain. In\ngeneral, this requires learning plausible mappings between domains. CycleGAN is\na powerful framework that efficiently learns to map inputs from one domain to\nanother using adversarial training and a cycle-consistency constraint. However,\nthe conventional approach of enforcing cycle-consistency via reconstruction may\nbe overly restrictive in cases where one or more domains have limited training\ndata. In this paper, we propose an augmented cyclic adversarial learning model\nthat enforces the cycle-consistency constraint via an external task specific\nmodel, which encourages the preservation of task-relevant content as opposed to\nexact reconstruction. We explore digit classification in a low-resource setting\nin supervised, semi and unsupervised situation, as well as high resource\nunsupervised. In low-resource supervised setting, the results show that our\napproach improves absolute performance by 14% and 4% when adapting SVHN to\nMNIST and vice versa, respectively, which outperforms unsupervised domain\nadaptation methods that require high-resource unlabeled target domain.\nMoreover, using only few unsupervised target data, our approach can still\noutperforms many high-resource unsupervised models. In speech domains, we\nsimilarly adopt a speech recognition model from each domain as the task\nspecific model. Our approach improves absolute performance of speech\nrecognition by 2% for female speakers in the TIMIT dataset, where the majority\nof training samples are from male voices.","url_abs":"http://arxiv.org/abs/1807.00374v4","url_pdf":"http://arxiv.org/pdf/1807.00374v4.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":"augmented-cyclic-adversarial-learning-for-low","repo_url":"https://github.com/kiniavinash/ACAL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"augmented-cyclic-adversarial-learning-for-low","repo_url":"https://github.com/ms903-github/ACAL-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"speech-recognition","task_name":"Speech Recognition"},{"task_slug":"unsupervised-domain-adaptation","task_name":"Unsupervised Domain Adaptation"},{"task_slug":"speech-recognition-1","task_name":"speech-recognition"}],"methods":[{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"cycle-consistency-loss","method_name":"Cycle Consistency Loss"},{"method_slug":"gan-least-squares-loss","method_name":"GAN Least Squares Loss"},{"method_slug":"instance-normalization","method_name":"Instance Normalization"},{"method_slug":"patchgan","method_name":"PatchGAN"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1807.00374","atlas_url":"https://app.syntology.ai/?focus=1807.00374","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":"1807.00374"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1807.00374\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1807.00374"},"call":"get_concepts_for_paper(arxiv_id=\"1807.00374\")"}],"by_repo":[{"repo":"kiniavinash/ACAL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ms903-github/ACAL-pytorch","kind":"listed","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":"9530843e5b77ca318911969b85d494e4366a46ba35d3aab48923b0e62592aee5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}