{"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/learnable-boundary-guided-adversarial","title":"Learnable Boundary Guided Adversarial Training","arxiv_id":"2011.11164","date":"2020-11-23","proceeding":"ICCV 2021 10","authors":["Jiequan Cui","Shu Liu","LiWei Wang","Jiaya Jia"],"abstract":"Previous adversarial training raises model robustness under the compromise of accuracy on natural data. In this paper, we reduce natural accuracy degradation. We use the model logits from one clean model to guide learning of another one robust model, taking into consideration that logits from the well trained clean model embed the most discriminative features of natural data, {\\it e.g.}, generalizable classifier boundary. Our solution is to constrain logits from the robust model that takes adversarial examples as input and makes it similar to those from the clean model fed with corresponding natural data. It lets the robust model inherit the classifier boundary of the clean model. Moreover, we observe such boundary guidance can not only preserve high natural accuracy but also benefit model robustness, which gives new insights and facilitates progress for the adversarial community. Finally, extensive experiments on CIFAR-10, CIFAR-100, and Tiny ImageNet testify to the effectiveness of our method. We achieve new state-of-the-art robustness on CIFAR-100 without additional real or synthetic data with auto-attack benchmark \\footnote{\\url{https://github.com/fra31/auto-attack}}. Our code is available at \\url{https://github.com/dvlab-research/LBGAT}.","url_abs":"https://arxiv.org/abs/2011.11164v2","url_pdf":"https://arxiv.org/pdf/2011.11164v2.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":"learnable-boundary-guided-adversarial","repo_url":"https://github.com/dvlab-research/LBGAT","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learnable-boundary-guided-adversarial","repo_url":"https://github.com/fra31/auto-attack","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learnable-boundary-guided-adversarial","repo_url":"https://github.com/jiequancui/LBGAT","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"adversarial-defense","task_name":"Adversarial Defense"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/adversarial-defense-on-cifar-100","task":"Adversarial Defense","dataset":"CIFAR-100","model":"wideresnet-34-20","rank_in_archive_order":1,"of":3,"metrics":{"autoattack":"62.55/30.20"},"uses_additional_data":false},{"leaderboard":"/sota/adversarial-defense-on-cifar-100","task":"Adversarial Defense","dataset":"CIFAR-100","model":"wideresnet-34-10","rank_in_archive_order":2,"of":3,"metrics":{"autoattack":"70.25/27.16"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2011.11164","atlas_url":"https://app.syntology.ai/?focus=2011.11164","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":"2011.11164"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2011.11164\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2011.11164"},"call":"get_concepts_for_paper(arxiv_id=\"2011.11164\")"}],"by_repo":[{"repo":"dvlab-research/LBGAT","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2305.13948"],"harvested_for_calls":[{"arxiv_id":"2305.13948","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.13948"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.13948\")"}]},{"repo":"fra31/auto-attack","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2103.01208","2203.05154"],"harvested_for_calls":[{"arxiv_id":"2103.01208","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.01208"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.01208\")"},{"arxiv_id":"2203.05154","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.05154"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.05154\")"}]},{"repo":"jiequancui/LBGAT","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2305.13948"],"harvested_for_calls":[{"arxiv_id":"2305.13948","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.13948"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.13948\")"}]}],"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":"4d888756d9750af5840f204be4747c8e4002623c4e9fb794d1805051ecbdc598","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}