{"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-dropout-for-recurrent-neural","title":"Adversarial Dropout for Recurrent Neural Networks","arxiv_id":"1904.09816","date":"2019-04-22","proceeding":null,"authors":["Sungrae Park","Kyungwoo Song","Mingi Ji","Wonsung Lee","Il-Chul Moon"],"abstract":"Successful application processing sequential data, such as text and speech,\nrequires an improved generalization performance of recurrent neural networks\n(RNNs). Dropout techniques for RNNs were introduced to respond to these\ndemands, but we conjecture that the dropout on RNNs could have been improved by\nadopting the adversarial concept. This paper investigates ways to improve the\ndropout for RNNs by utilizing intentionally generated dropout masks.\nSpecifically, the guided dropout used in this research is called as adversarial\ndropout, which adversarially disconnects neurons that are dominantly used to\npredict correct targets over time. Our analysis showed that our regularizer,\nwhich consists of a gap between the original and the reconfigured RNNs, was the\nupper bound of the gap between the training and the inference phases of the\nrandom dropout. We demonstrated that minimizing our regularizer improved the\neffectiveness of the dropout for RNNs on sequential MNIST tasks,\nsemi-supervised text classification tasks, and language modeling tasks.","url_abs":"http://arxiv.org/abs/1904.09816v1","url_pdf":"http://arxiv.org/pdf/1904.09816v1.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-dropout-for-recurrent-neural","repo_url":"https://github.com/sungraepark/AdvDrop-sMNIST","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"adversarial-dropout-for-recurrent-neural","repo_url":"https://github.com/sungraepark/adversarial_dropout_text_classification","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"semi-supervised-text-classification-1","task_name":"Semi-Supervised Text Classification"},{"task_slug":"text-classification","task_name":"Text Classification"}],"methods":[{"method_slug":"dropout","method_name":"Dropout"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"sungraepark/AdvDrop-sMNIST","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sungraepark/adversarial_dropout_text_classification","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":"c16e8d6a6bd977ad9e288c3c982b81714b1c3a711bc8652dda6cb57855bfe28d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}