{"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-playground-a-visualization-suite-1","title":"Adversarial-Playground: A Visualization Suite for Adversarial Sample Generation","arxiv_id":"1706.01763","date":"2017-06-06","proceeding":null,"authors":["Andrew Norton","Yanjun Qi"],"abstract":"With growing interest in adversarial machine learning, it is important for\nmachine learning practitioners and users to understand how their models may be\nattacked. We propose a web-based visualization tool, Adversarial-Playground, to\ndemonstrate the efficacy of common adversarial methods against a deep neural\nnetwork (DNN) model, built on top of the TensorFlow library.\nAdversarial-Playground provides users an efficient and effective experience in\nexploring techniques generating adversarial examples, which are inputs crafted\nby an adversary to fool a machine learning system. To enable\nAdversarial-Playground to generate quick and accurate responses for users, we\nuse two primary tactics: (1) We propose a faster variant of the\nstate-of-the-art Jacobian saliency map approach that maintains a comparable\nevasion rate. (2) Our visualization does not transmit the generated adversarial\nimages to the client, but rather only the matrix describing the sample and the\nvector representing classification likelihoods.\n  The source code along with the data from all of our experiments are available\nat \\url{https://github.com/QData/AdversarialDNN-Playground}.","url_abs":"http://arxiv.org/abs/1706.01763v2","url_pdf":"http://arxiv.org/pdf/1706.01763v2.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-playground-a-visualization-suite-1","repo_url":"https://github.com/QData/AdversarialDNN-Playground","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"}],"methods":[],"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":"QData/AdversarialDNN-Playground","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":"b2df3bec60d5b87b0aa4ed1eb0432856dea82eace9c61158ad4f83516fc2e4dd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}