{"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/dada-deep-adversarial-data-augmentation-for","title":"DADA: Deep Adversarial Data Augmentation for Extremely Low Data Regime Classification","arxiv_id":"1809.00981","date":"2018-08-29","proceeding":null,"authors":["Xiaofeng Zhang","Zhangyang Wang","Dong Liu","Qing Ling"],"abstract":"Deep learning has revolutionized the performance of classification, but\nmeanwhile demands sufficient labeled data for training. Given insufficient\ndata, while many techniques have been developed to help combat overfitting, the\nchallenge remains if one tries to train deep networks, especially in the\nill-posed extremely low data regimes: only a small set of labeled data are\navailable, and nothing -- including unlabeled data -- else. Such regimes arise\nfrom practical situations where not only data labeling but also data collection\nitself is expensive. We propose a deep adversarial data augmentation (DADA)\ntechnique to address the problem, in which we elaborately formulate data\naugmentation as a problem of training a class-conditional and supervised\ngenerative adversarial network (GAN). Specifically, a new discriminator loss is\nproposed to fit the goal of data augmentation, through which both real and\naugmented samples are enforced to contribute to and be consistent in finding\nthe decision boundaries. Tailored training techniques are developed\naccordingly. To quantitatively validate its effectiveness, we first perform\nextensive simulations to show that DADA substantially outperforms both\ntraditional data augmentation and a few GAN-based options. We then extend\nexperiments to three real-world small labeled datasets where existing data\naugmentation and/or transfer learning strategies are either less effective or\ninfeasible. All results endorse the superior capability of DADA in enhancing\nthe generalization ability of deep networks trained in practical extremely low\ndata regimes. Source code is available at\nhttps://github.com/SchafferZhang/DADA.","url_abs":"http://arxiv.org/abs/1809.00981v1","url_pdf":"http://arxiv.org/pdf/1809.00981v1.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":"dada-deep-adversarial-data-augmentation-for","repo_url":"https://github.com/SchafferZhang/DADA","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"dada-deep-adversarial-data-augmentation-for","repo_url":"https://github.com/daixiangzi/DADA-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"data-augmentation","task_name":"Data Augmentation"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":null,"task_name":"Generative Adversarial Network"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.00981","atlas_url":"https://app.syntology.ai/?focus=1809.00981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00981"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1809.00981"},"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":"1809.00981"},"call":"get_harvested_code_for_paper(arxiv_id=\"1809.00981\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1809.00981"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.00981\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.00981"},"call":"get_concepts_for_paper(arxiv_id=\"1809.00981\")"}],"by_repo":[{"repo":"SchafferZhang/DADA","kind":"official","samples":1,"ran":0,"instrument":0,"unverified":1},{"repo":"daixiangzi/DADA-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","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/1809.00981.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/1809.00981.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/daixiangzi/DADA-pytorch","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/SchafferZhang/DADA","reach":null}],"summary":{"unverified":1},"n_samples":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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}},"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,"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":"5a2aa745c05f5871","code_sha256_prefix":"5a2aa745c05f5871","entry":"merge","repo":"SchafferZhang/DADA","repo_kind":"official","path":"cifar10-svhn/train_cifar_svhn.py","file_url":"https://github.com/SchafferZhang/DADA/blob/HEAD/cifar10-svhn/train_cifar_svhn.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/merge","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SchafferZhang/DADA when it was checked","mcp_get_code":{"code_sha256":"5a2aa745c05f5871"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7c6e9bdda6c3b6dfb7c62572e29a591070115a8c5fc9875b3a920fda0c0b9d4f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}