{"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-robustness-toolbox-v040","title":"Adversarial Robustness Toolbox v1.0.0","arxiv_id":"1807.01069","date":"2018-07-03","proceeding":null,"authors":["Maria-Irina Nicolae","Mathieu Sinn","Minh Ngoc Tran","Beat Buesser","Ambrish Rawat","Martin Wistuba","Valentina Zantedeschi","Nathalie Baracaldo","Bryant Chen","Heiko Ludwig","Ian M. Molloy","Ben Edwards"],"abstract":"Adversarial Robustness Toolbox (ART) is a Python library supporting developers and researchers in defending Machine Learning models (Deep Neural Networks, Gradient Boosted Decision Trees, Support Vector Machines, Random Forests, Logistic Regression, Gaussian Processes, Decision Trees, Scikit-learn Pipelines, etc.) against adversarial threats and helps making AI systems more secure and trustworthy. Machine Learning models are vulnerable to adversarial examples, which are inputs (images, texts, tabular data, etc.) deliberately modified to produce a desired response by the Machine Learning model. ART provides the tools to build and deploy defences and test them with adversarial attacks. Defending Machine Learning models involves certifying and verifying model robustness and model hardening with approaches such as pre-processing inputs, augmenting training data with adversarial samples, and leveraging runtime detection methods to flag any inputs that might have been modified by an adversary. The attacks implemented in ART allow creating adversarial attacks against Machine Learning models which is required to test defenses with state-of-the-art threat models. Supported Machine Learning Libraries include TensorFlow (v1 and v2), Keras, PyTorch, MXNet, Scikit-learn, XGBoost, LightGBM, CatBoost, and GPy. The source code of ART is released with MIT license at https://github.com/IBM/adversarial-robustness-toolbox. The release includes code examples, notebooks with tutorials and documentation (http://adversarial-robustness-toolbox.readthedocs.io).","url_abs":"https://arxiv.org/abs/1807.01069v4","url_pdf":"https://arxiv.org/pdf/1807.01069v4.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-robustness-toolbox-v040","repo_url":"https://github.com/IBM/adversarial-robustness-toolbox","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"adversarial-robustness-toolbox-v040","repo_url":"https://github.com/Abhishek2271/TransferabilityAnalysis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"adversarial-robustness-toolbox-v040","repo_url":"https://github.com/IBM/AIF360","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"adversarial-robustness-toolbox-v040","repo_url":"https://github.com/sforsyth6/transfer_adversarial","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"adversarial-robustness-toolbox-v040","repo_url":"https://github.com/sgxcj777/Adversarial-testing-toolbox-with-CLEVER","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"adversarial-robustness-toolbox-v040","repo_url":"https://github.com/sgxcj777/Advesarial-robustess-evaluation-Framework","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"adversarial-robustness-toolbox-v040","repo_url":"https://github.com/salomonhotegni/MOREL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"adversarial-robustness","task_name":"Adversarial Robustness"},{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"},{"task_slug":"time-series","task_name":"Time Series Analysis"}],"methods":[{"method_slug":"logistic-regression","method_name":"Logistic Regression"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1807.01069","atlas_url":"https://app.syntology.ai/?focus=1807.01069","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":"1807.01069"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1807.01069\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1807.01069"},"call":"get_concepts_for_paper(arxiv_id=\"1807.01069\")"}],"by_repo":[{"repo":"IBM/adversarial-robustness-toolbox","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2002.05463"],"harvested_for_calls":[{"arxiv_id":"2002.05463","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2002.05463"},"call":"get_harvested_code_for_paper(arxiv_id=\"2002.05463\")"}]},{"repo":"Abhishek2271/TransferabilityAnalysis","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"IBM/AIF360","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1810.01943"],"harvested_for_calls":[{"arxiv_id":"1810.01943","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1810.01943"},"call":"get_harvested_code_for_paper(arxiv_id=\"1810.01943\")"}]},{"repo":"sforsyth6/transfer_adversarial","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sgxcj777/Adversarial-testing-toolbox-with-CLEVER","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sgxcj777/Advesarial-robustess-evaluation-Framework","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"salomonhotegni/MOREL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1901.08573"],"harvested_for_calls":[{"arxiv_id":"1901.08573","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1901.08573"},"call":"get_harvested_code_for_paper(arxiv_id=\"1901.08573\")"}]}],"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":"d5ddf2a075cbbd7cc42e9861d0c690813ce3f2b4925560d2e0b0d9b1aa54c9b6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}