{"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/jointly-optimize-data-augmentation-and","title":"Jointly Optimize Data Augmentation and Network Training: Adversarial Data Augmentation in Human Pose Estimation","arxiv_id":"1805.09707","date":"2018-05-24","proceeding":"CVPR 2018 6","authors":["Xi Peng","Zhiqiang Tang","Fei Yang","Rogerio Feris","Dimitris Metaxas"],"abstract":"Random data augmentation is a critical technique to avoid overfitting in\ntraining deep neural network models. However, data augmentation and network\ntraining are usually treated as two isolated processes, limiting the\neffectiveness of network training. Why not jointly optimize the two? We propose\nadversarial data augmentation to address this limitation. The main idea is to\ndesign an augmentation network (generator) that competes against a target\nnetwork (discriminator) by generating `hard' augmentation operations online.\nThe augmentation network explores the weaknesses of the target network, while\nthe latter learns from `hard' augmentations to achieve better performance. We\nalso design a reward/penalty strategy for effective joint training. We\ndemonstrate our approach on the problem of human pose estimation and carry out\na comprehensive experimental analysis, showing that our method can\nsignificantly improve state-of-the-art models without additional data efforts.","url_abs":"http://arxiv.org/abs/1805.09707v1","url_pdf":"http://arxiv.org/pdf/1805.09707v1.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":[],"tasks":[{"task_slug":"data-augmentation","task_name":"Data Augmentation"},{"task_slug":"pose-estimation","task_name":"Pose Estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/pose-estimation-on-leeds-sports-poses","task":"Pose Estimation","dataset":"Leeds Sports Poses","model":"Residual Hourglass + ASR + AHO","rank_in_archive_order":4,"of":18,"metrics":{"PCK":"94.5%"},"uses_additional_data":false},{"leaderboard":"/sota/pose-estimation-on-mpii-human-pose","task":"Pose Estimation","dataset":"MPII Human Pose","model":"Residual Hourglass +ASR+AHO","rank_in_archive_order":18,"of":46,"metrics":{"PCKh-0.5":"91.5"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.09707","atlas_url":"https://app.syntology.ai/?focus=1805.09707","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.09707"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.09707\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.09707"},"call":"get_concepts_for_paper(arxiv_id=\"1805.09707\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0f70376594c30403ebec6f0af8a0f039d0604f2cf74c90af6a975e7c3d6a2df4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}