{"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-adversarial-robustness-of-ensembles","title":"Improving Adversarial Robustness of Ensembles with Diversity Training","arxiv_id":"1901.09981","date":"2019-01-28","proceeding":null,"authors":["Sanjay Kariyappa","Moinuddin K. Qureshi"],"abstract":"Deep Neural Networks are vulnerable to adversarial attacks even in settings\nwhere the attacker has no direct access to the model being attacked. Such\nattacks usually rely on the principle of transferability, whereby an attack\ncrafted on a surrogate model tends to transfer to the target model. We show\nthat an ensemble of models with misaligned loss gradients can provide an\neffective defense against transfer-based attacks. Our key insight is that an\nadversarial example is less likely to fool multiple models in the ensemble if\ntheir loss functions do not increase in a correlated fashion. To this end, we\npropose Diversity Training, a novel method to train an ensemble of models with\nuncorrelated loss functions. We show that our method significantly improves the\nadversarial robustness of ensembles and can also be combined with existing\nmethods to create a stronger defense.","url_abs":"http://arxiv.org/abs/1901.09981v1","url_pdf":"http://arxiv.org/pdf/1901.09981v1.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-adversarial-robustness-of-ensembles","repo_url":"https://github.com/AI-secure/Transferability-Reduced-Smooth-Ensemble","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"adversarial-robustness","task_name":"Adversarial Robustness"},{"task_slug":"diversity","task_name":"Diversity"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.09981","atlas_url":"https://app.syntology.ai/?focus=1901.09981","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":"1901.09981"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.09981\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.09981"},"call":"get_concepts_for_paper(arxiv_id=\"1901.09981\")"}],"by_repo":[{"repo":"AI-secure/Transferability-Reduced-Smooth-Ensemble","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2009.14720","2104.00671"],"harvested_for_calls":[{"arxiv_id":"2009.14720","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2009.14720"},"call":"get_harvested_code_for_paper(arxiv_id=\"2009.14720\")"},{"arxiv_id":"2104.00671","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.00671"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.00671\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"d2de06f575bd4d79fd737d75a9f3e00051fb6cf81cf08fa8af4b4304ee61e0e2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}