{"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/distributionally-adversarial-attack","title":"Distributionally Adversarial Attack","arxiv_id":"1808.05537","date":"2018-08-16","proceeding":null,"authors":["Tianhang Zheng","Changyou Chen","Kui Ren"],"abstract":"Recent work on adversarial attack has shown that Projected Gradient Descent\n(PGD) Adversary is a universal first-order adversary, and the classifier\nadversarially trained by PGD is robust against a wide range of first-order\nattacks. It is worth noting that the original objective of an attack/defense\nmodel relies on a data distribution $p(\\mathbf{x})$, typically in the form of\nrisk maximization/minimization, e.g.,\n$\\max/\\min\\mathbb{E}_{p(\\mathbf(x))}\\mathcal{L}(\\mathbf{x})$ with\n$p(\\mathbf{x})$ some unknown data distribution and $\\mathcal{L}(\\cdot)$ a loss\nfunction. However, since PGD generates attack samples independently for each\ndata sample based on $\\mathcal{L}(\\cdot)$, the procedure does not necessarily\nlead to good generalization in terms of risk optimization. In this paper, we\nachieve the goal by proposing distributionally adversarial attack (DAA), a\nframework to solve an optimal {\\em adversarial-data distribution}, a perturbed\ndistribution that satisfies the $L_\\infty$ constraint but deviates from the\noriginal data distribution to increase the generalization risk maximally.\nAlgorithmically, DAA performs optimization on the space of potential data\ndistributions, which introduces direct dependency between all data points when\ngenerating adversarial samples. DAA is evaluated by attacking state-of-the-art\ndefense models, including the adversarially-trained models provided by {\\em MIT\nMadryLab}. Notably, DAA ranks {\\em the first place} on MadryLab's white-box\nleaderboards, reducing the accuracy of their secret MNIST model to $88.79\\%$\n(with $l_\\infty$ perturbations of $\\epsilon = 0.3$) and the accuracy of their\nsecret CIFAR model to $44.71\\%$ (with $l_\\infty$ perturbations of $\\epsilon =\n8.0$). Code for the experiments is released on\n\\url{https://github.com/tianzheng4/Distributionally-Adversarial-Attack}.","url_abs":"http://arxiv.org/abs/1808.05537v3","url_pdf":"http://arxiv.org/pdf/1808.05537v3.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":"distributionally-adversarial-attack","repo_url":"https://github.com/tianzheng4/Distributionally-Adversarial-Attack","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"distributionally-adversarial-attack","repo_url":"https://github.com/MadryLab/cifar10_challenge","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"distributionally-adversarial-attack","repo_url":"https://github.com/MadryLab/mnist_challenge","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"distributionally-adversarial-attack","repo_url":"https://github.com/shubhamuttam1/Pytorch-DAA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"adversarial-attack","task_name":"Adversarial Attack"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.05537","atlas_url":"https://app.syntology.ai/?focus=1808.05537","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":"1808.05537"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.05537\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.05537"},"call":"get_concepts_for_paper(arxiv_id=\"1808.05537\")"}],"by_repo":[{"repo":"tianzheng4/Distributionally-Adversarial-Attack","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MadryLab/cifar10_challenge","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MadryLab/mnist_challenge","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"shubhamuttam1/Pytorch-DAA","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":"43dd2e2600586eca0e8fb040aa6a28496ff7e5e4a24d39d14e456d7bf0b75add","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}