{"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/adversarial-data-programming-using-gans-to","title":"Adversarial Data Programming: Using GANs to Relax the Bottleneck of Curated Labeled Data","arxiv_id":"1803.05137","date":"2018-03-14","proceeding":"CVPR 2018 6","authors":["Arghya Pal","Vineeth N. Balasubramanian"],"abstract":"Paucity of large curated hand-labeled training data for every\ndomain-of-interest forms a major bottleneck in the deployment of machine\nlearning models in computer vision and other fields. Recent work (Data\nProgramming) has shown how distant supervision signals in the form of labeling\nfunctions can be used to obtain labels for given data in near-constant time. In\nthis work, we present Adversarial Data Programming (ADP), which presents an\nadversarial methodology to generate data as well as a curated aggregated label\nhas given a set of weak labeling functions. We validated our method on the\nMNIST, Fashion MNIST, CIFAR 10 and SVHN datasets, and it outperformed many\nstate-of-the-art models. We conducted extensive experiments to study its\nusefulness, as well as showed how the proposed ADP framework can be used for\ntransfer learning as well as multi-task learning, where data from two domains\nare generated simultaneously using the framework along with the label\ninformation. Our future work will involve understanding the theoretical\nimplications of this new framework from a game-theoretic perspective, as well\nas explore the performance of the method on more complex datasets.","url_abs":"http://arxiv.org/abs/1803.05137v1","url_pdf":"http://arxiv.org/pdf/1803.05137v1.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":"adversarial-data-programming-using-gans-to","repo_url":"https://github.com/ArghyaPal/Adversarial-Data-Programming","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1803.05137","atlas_url":"https://app.syntology.ai/?focus=1803.05137","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":"1803.05137"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1803.05137\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1803.05137"},"call":"get_concepts_for_paper(arxiv_id=\"1803.05137\")"}],"by_repo":[{"repo":"ArghyaPal/Adversarial-Data-Programming","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":"f7425192dd95f7ca5070f9a0fe7e554c7fa5818935d3d0d73168188d8a9114fd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}