{"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/improving-back-propagation-by-adding-an","title":"Improving Back-Propagation by Adding an Adversarial Gradient","arxiv_id":"1510.04189","date":"2015-10-14","proceeding":null,"authors":["Arild Nøkland"],"abstract":"The back-propagation algorithm is widely used for learning in artificial\nneural networks. A challenge in machine learning is to create models that\ngeneralize to new data samples not seen in the training data. Recently, a\ncommon flaw in several machine learning algorithms was discovered: small\nperturbations added to the input data lead to consistent misclassification of\ndata samples. Samples that easily mislead the model are called adversarial\nexamples. Training a \"maxout\" network on adversarial examples has shown to\ndecrease this vulnerability, but also increase classification performance. This\npaper shows that adversarial training has a regularizing effect also in\nnetworks with logistic, hyperbolic tangent and rectified linear units. A simple\nextension to the back-propagation method is proposed, that adds an adversarial\ngradient to the training. The extension requires an additional forward and\nbackward pass to calculate a modified input sample, or mini batch, used as\ninput for standard back-propagation learning. The first experimental results on\nMNIST show that the \"adversarial back-propagation\" method increases the\nresistance to adversarial examples and boosts the classification performance.\nThe extension reduces the classification error on the permutation invariant\nMNIST from 1.60% to 0.95% in a logistic network, and from 1.40% to 0.78% in a\nnetwork with rectified linear units. Results on CIFAR-10 indicate that the\nmethod has a regularizing effect similar to dropout in fully connected\nnetworks. Based on these promising results, adversarial back-propagation is\nproposed as a stand-alone regularizing method that should be further\ninvestigated.","url_abs":"http://arxiv.org/abs/1510.04189v2","url_pdf":"http://arxiv.org/pdf/1510.04189v2.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":"improving-back-propagation-by-adding-an","repo_url":"https://github.com/axelbrando/Mixture-Density-Networks-for-distribution-and-uncertainty-estimation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[{"method_slug":"dropout","method_name":"Dropout"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1510.04189","atlas_url":"https://app.syntology.ai/?focus=1510.04189","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":"1510.04189"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1510.04189\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1510.04189"},"call":"get_concepts_for_paper(arxiv_id=\"1510.04189\")"}],"by_repo":[{"repo":"axelbrando/Mixture-Density-Networks-for-distribution-and-uncertainty-estimation","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":"30c7979292fe3a28093bb8041340b114c735fa469e0e6e2962e1319c45a48602","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}