{"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/the-limitations-of-deep-learning-in","title":"The Limitations of Deep Learning in Adversarial Settings","arxiv_id":"1511.07528","date":"2015-11-24","proceeding":null,"authors":["Nicolas Papernot","Patrick McDaniel","Somesh Jha","Matt Fredrikson","Z. Berkay Celik","Ananthram Swami"],"abstract":"Deep learning takes advantage of large datasets and computationally efficient\ntraining algorithms to outperform other approaches at various machine learning\ntasks. However, imperfections in the training phase of deep neural networks\nmake them vulnerable to adversarial samples: inputs crafted by adversaries with\nthe intent of causing deep neural networks to misclassify. In this work, we\nformalize the space of adversaries against deep neural networks (DNNs) and\nintroduce a novel class of algorithms to craft adversarial samples based on a\nprecise understanding of the mapping between inputs and outputs of DNNs. In an\napplication to computer vision, we show that our algorithms can reliably\nproduce samples correctly classified by human subjects but misclassified in\nspecific targets by a DNN with a 97% adversarial success rate while only\nmodifying on average 4.02% of the input features per sample. We then evaluate\nthe vulnerability of different sample classes to adversarial perturbations by\ndefining a hardness measure. Finally, we describe preliminary work outlining\ndefenses against adversarial samples by defining a predictive measure of\ndistance between a benign input and a target classification.","url_abs":"http://arxiv.org/abs/1511.07528v1","url_pdf":"http://arxiv.org/pdf/1511.07528v1.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":"the-limitations-of-deep-learning-in","repo_url":"https://github.com/AngusG/cleverhans-attacking-bnns","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"the-limitations-of-deep-learning-in","repo_url":"https://github.com/HowToMakeABomb101/Hot2MakeAB0mbSite","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"the-limitations-of-deep-learning-in","repo_url":"https://github.com/cleverhans-lab/cleverhans","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"the-limitations-of-deep-learning-in","repo_url":"https://github.com/elites2k19/prism-attack","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"the-limitations-of-deep-learning-in","repo_url":"https://github.com/formal-verification-research/NJSMA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"the-limitations-of-deep-learning-in","repo_url":"https://github.com/iirishikaii/cleverhans","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"the-limitations-of-deep-learning-in","repo_url":"https://github.com/johnsonkee/graduate_design","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"the-limitations-of-deep-learning-in","repo_url":"https://github.com/openai/cleverhans","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"the-limitations-of-deep-learning-in","repo_url":"https://github.com/shijiel2/cleverhans","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"the-limitations-of-deep-learning-in","repo_url":"https://github.com/tensorflow/cleverhans","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"the-limitations-of-deep-learning-in","repo_url":"https://github.com/yaq007/cleverhans","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"adversarial-attack","task_name":"Adversarial Attack"},{"task_slug":"adversarial-defense","task_name":"Adversarial Defense"},{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1511.07528","atlas_url":"https://app.syntology.ai/?focus=1511.07528","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":"1511.07528"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1511.07528\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1511.07528"},"call":"get_concepts_for_paper(arxiv_id=\"1511.07528\")"}],"by_repo":[{"repo":"AngusG/cleverhans-attacking-bnns","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1711.00449"],"harvested_for_calls":[{"arxiv_id":"1711.00449","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1711.00449"},"call":"get_harvested_code_for_paper(arxiv_id=\"1711.00449\")"}]},{"repo":"HowToMakeABomb101/Hot2MakeAB0mbSite","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1610.00768"],"harvested_for_calls":[{"arxiv_id":"1610.00768","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1610.00768"},"call":"get_harvested_code_for_paper(arxiv_id=\"1610.00768\")"}]},{"repo":"cleverhans-lab/cleverhans","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2402.03951"],"harvested_for_calls":[{"arxiv_id":"2402.03951","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.03951"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.03951\")"}]},{"repo":"elites2k19/prism-attack","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1610.00768"],"harvested_for_calls":[{"arxiv_id":"1610.00768","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1610.00768"},"call":"get_harvested_code_for_paper(arxiv_id=\"1610.00768\")"}]},{"repo":"formal-verification-research/NJSMA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"iirishikaii/cleverhans","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"johnsonkee/graduate_design","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1610.00768"],"harvested_for_calls":[{"arxiv_id":"1610.00768","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1610.00768"},"call":"get_harvested_code_for_paper(arxiv_id=\"1610.00768\")"}]},{"repo":"openai/cleverhans","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"shijiel2/cleverhans","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1412.6572"],"harvested_for_calls":[{"arxiv_id":"1412.6572","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1412.6572"},"call":"get_harvested_code_for_paper(arxiv_id=\"1412.6572\")"}]},{"repo":"tensorflow/cleverhans","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2006.16375"],"harvested_for_calls":[{"arxiv_id":"2006.16375","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.16375"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.16375\")"}]},{"repo":"yaq007/cleverhans","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"2964b3753303d21b710d137f3005e88bd586b476d0cffa503d6f05009a28d780","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}