{"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/boundary-attack-query-efficient-decision","title":"HopSkipJumpAttack: A Query-Efficient Decision-Based Attack","arxiv_id":"1904.02144","date":"2019-04-03","proceeding":null,"authors":["Jianbo Chen","Michael. I. Jordan","Martin J. Wainwright"],"abstract":"The goal of a decision-based adversarial attack on a trained model is to generate adversarial examples based solely on observing output labels returned by the targeted model. We develop HopSkipJumpAttack, a family of algorithms based on a novel estimate of the gradient direction using binary information at the decision boundary. The proposed family includes both untargeted and targeted attacks optimized for $\\ell_2$ and $\\ell_\\infty$ similarity metrics respectively. Theoretical analysis is provided for the proposed algorithms and the gradient direction estimate. Experiments show HopSkipJumpAttack requires significantly fewer model queries than Boundary Attack. It also achieves competitive performance in attacking several widely-used defense mechanisms. (HopSkipJumpAttack was named Boundary Attack++ in a previous version of the preprint.)","url_abs":"https://arxiv.org/abs/1904.02144v5","url_pdf":"https://arxiv.org/pdf/1904.02144v5.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":"boundary-attack-query-efficient-decision","repo_url":"https://github.com/Jianbo-Lab/BAPP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"boundary-attack-query-efficient-decision","repo_url":"https://github.com/Jianbo-Lab/HSJA","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"boundary-attack-query-efficient-decision","repo_url":"https://github.com/nmcdermo/AdvML","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"adversarial-attack","task_name":"Adversarial Attack"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1904.02144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02144"}},"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/Jianbo-Lab/BAPP","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/nmcdermo/AdvML","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Jianbo-Lab/HSJA","reach":null}],"summary":{"ran_violates":1,"ran_fixture":1,"unverified":1},"by_repo_kind":{"official":{"samples":3,"ran":2,"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":3,"samples":[{"code_sha256_prefix":"1f16d5a388ae0e78","entry":"clip_image","repo":"Jianbo-Lab/HSJA","repo_kind":"official","path":"hsja.py","file_url":"https://github.com/Jianbo-Lab/HSJA/blob/HEAD/hsja.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"1f16d5a388ae0e78"}},{"code_sha256_prefix":"9da78d6fcc0bca79","entry":"decision_function","repo":"Jianbo-Lab/HSJA","repo_kind":"official","path":"hsja.py","file_url":"https://github.com/Jianbo-Lab/HSJA/blob/HEAD/hsja.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9da78d6fcc0bca79"}},{"code_sha256_prefix":"eb9f032b08cd0797","entry":"hsja","repo":"Jianbo-Lab/HSJA","repo_kind":"official","path":"hsja.py","file_url":"https://github.com/Jianbo-Lab/HSJA/blob/HEAD/hsja.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"eb9f032b08cd0797"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}