{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/adversarial-robustness-via-robust-low-rank","title":"Adversarial robustness via robust low rank representations","arxiv_id":"2007.06555","date":"2020-07-13","proceeding":"NeurIPS 2020 12","authors":["Pranjal Awasthi","Himanshu Jain","Ankit Singh Rawat","Aravindan Vijayaraghavan"],"abstract":"Adversarial robustness measures the susceptibility of a classifier to imperceptible perturbations made to the inputs at test time. In this work we highlight the benefits of natural low rank representations that often exist for real data such as images, for training neural networks with certified robustness guarantees. Our first contribution is for certified robustness to perturbations measured in $\\ell_2$ norm. We exploit low rank data representations to provide improved guarantees over state-of-the-art randomized smoothing-based approaches on standard benchmark datasets such as CIFAR-10 and CIFAR-100. Our second contribution is for the more challenging setting of certified robustness to perturbations measured in $\\ell_\\infty$ norm. We demonstrate empirically that natural low rank representations have inherent robustness properties, that can be leveraged to provide significantly better guarantees for certified robustness to $\\ell_\\infty$ perturbations in those representations. Our certificate of $\\ell_\\infty$ robustness relies on a natural quantity involving the $\\infty \\to 2$ matrix operator norm associated with the representation, to translate robustness guarantees from $\\ell_2$ to $\\ell_\\infty$ perturbations. A key technical ingredient for our certification guarantees is a fast algorithm with provable guarantees based on the multiplicative weights update method to provide upper bounds on the above matrix norm. Our algorithmic guarantees improve upon the state of the art for this problem, and may be of independent interest.","url_abs":"https://arxiv.org/abs/2007.06555v2","url_pdf":"https://arxiv.org/pdf/2007.06555v2.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-via-robust-low-rank","repo_url":"https://github.com/pranjalawasthi/adv_robust_low_rank","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"adversarial-robustness","task_name":"Adversarial Robustness"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2007.06555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06555"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/pranjalawasthi/adv_robust_low_rank","reach":null}],"summary":{"ran_fixture":3},"by_repo_kind":{"listed":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"5feadbdd653e9961","entry":"checkCondition","repo":"pranjalawasthi/adv_robust_low_rank","repo_kind":"listed","path":"mw.py","file_url":"https://github.com/pranjalawasthi/adv_robust_low_rank/blob/HEAD/mw.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5feadbdd653e9961"}},{"code_sha256_prefix":"adca1acd268a4c03","entry":"updateWeights","repo":"pranjalawasthi/adv_robust_low_rank","repo_kind":"listed","path":"mw.py","file_url":"https://github.com/pranjalawasthi/adv_robust_low_rank/blob/HEAD/mw.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"adca1acd268a4c03"}},{"code_sha256_prefix":"ce0e94999357bda1","entry":"updateWeights_2","repo":"pranjalawasthi/adv_robust_low_rank","repo_kind":"listed","path":"mw.py","file_url":"https://github.com/pranjalawasthi/adv_robust_low_rank/blob/HEAD/mw.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ce0e94999357bda1"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}