{"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/cost-sensitive-robustness-against-adversarial","title":"Cost-Sensitive Robustness against Adversarial Examples","arxiv_id":"1810.09225","date":"2018-10-22","proceeding":"ICLR 2019 5","authors":["Xiao Zhang","David Evans"],"abstract":"Several recent works have developed methods for training classifiers that are\ncertifiably robust against norm-bounded adversarial perturbations. These\nmethods assume that all the adversarial transformations are equally important,\nwhich is seldom the case in real-world applications. We advocate for\ncost-sensitive robustness as the criteria for measuring the classifier's\nperformance for tasks where some adversarial transformation are more important\nthan others. We encode the potential harm of each adversarial transformation in\na cost matrix, and propose a general objective function to adapt the robust\ntraining method of Wong & Kolter (2018) to optimize for cost-sensitive\nrobustness. Our experiments on simple MNIST and CIFAR10 models with a variety\nof cost matrices show that the proposed approach can produce models with\nsubstantially reduced cost-sensitive robust error, while maintaining\nclassification accuracy.","url_abs":"http://arxiv.org/abs/1810.09225v2","url_pdf":"http://arxiv.org/pdf/1810.09225v2.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":"cost-sensitive-robustness-against-adversarial","repo_url":"https://github.com/xiaozhanguva/Cost-Sensitive-Robustness","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.09225","atlas_url":"https://app.syntology.ai/?focus=1810.09225","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":"1810.09225"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.09225\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.09225"},"call":"get_concepts_for_paper(arxiv_id=\"1810.09225\")"}],"by_repo":[{"repo":"xiaozhanguva/Cost-Sensitive-Robustness","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":"cd4021a9189776a692e46aa5e18aa45d05bd7b8c6c3d7c259d147fa26105958e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}