{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YCFMLFP4OTEUIPQ46CUTDELZOQ","short_pith_number":"pith:YCFMLFP4","schema_version":"1.0","canonical_sha256":"c08ac595fc74c9443e1cf0a931917974081d921b6917fa9384a95afc750224bd","source":{"kind":"arxiv","id":"2112.12376","version":6},"attestation_state":"computed","paper":{"title":"Revisiting and Advancing Fast Adversarial Training Through The Lens of Bi-Level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guanhua Zhang, Mingyi Hong, Prashant Khanduri, Shiyu Chang, Sijia Liu, Yihua Zhang","submitted_at":"2021-12-23T06:25:36Z","abstract_excerpt":"Adversarial training (AT) is a widely recognized defense mechanism to gain the robustness of deep neural networks against adversarial attacks. It is built on min-max optimization (MMO), where the minimizer (i.e., defender) seeks a robust model to minimize the worst-case training loss in the presence of adversarial examples crafted by the maximizer (i.e., attacker). However, the conventional MMO method makes AT hard to scale. Thus, Fast-AT (Wong et al., 2020) and other recent algorithms attempt to simplify MMO by replacing its maximization step with the single gradient sign-based attack generat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2112.12376","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-23T06:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"7c6d92790b75f1ad0802d13ab40726ac72e4396180142c339cb434f187b3ea4a","abstract_canon_sha256":"0ee474879bb86ff9e512846959ef04f0c324198fe63b0afc8d16550f0332fa0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:03:34.408583Z","signature_b64":"O1wMNfNdd85M7g38EkTL9Z7hh5jjqNjpegkh+CpLkCvrV8D83t8PZL5hsPboWI7kAeAp/x4dj7fGsW7vmJStCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c08ac595fc74c9443e1cf0a931917974081d921b6917fa9384a95afc750224bd","last_reissued_at":"2026-07-05T05:03:34.408150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:03:34.408150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting and Advancing Fast Adversarial Training Through The Lens of Bi-Level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guanhua Zhang, Mingyi Hong, Prashant Khanduri, Shiyu Chang, Sijia Liu, Yihua Zhang","submitted_at":"2021-12-23T06:25:36Z","abstract_excerpt":"Adversarial training (AT) is a widely recognized defense mechanism to gain the robustness of deep neural networks against adversarial attacks. It is built on min-max optimization (MMO), where the minimizer (i.e., defender) seeks a robust model to minimize the worst-case training loss in the presence of adversarial examples crafted by the maximizer (i.e., attacker). However, the conventional MMO method makes AT hard to scale. Thus, Fast-AT (Wong et al., 2020) and other recent algorithms attempt to simplify MMO by replacing its maximization step with the single gradient sign-based attack generat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.12376","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.12376/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2112.12376","created_at":"2026-07-05T05:03:34.408206+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.12376v6","created_at":"2026-07-05T05:03:34.408206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.12376","created_at":"2026-07-05T05:03:34.408206+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCFMLFP4OTEU","created_at":"2026-07-05T05:03:34.408206+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCFMLFP4OTEUIPQ4","created_at":"2026-07-05T05:03:34.408206+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCFMLFP4","created_at":"2026-07-05T05:03:34.408206+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00738","citing_title":"SORA: Free Second-Order Attacks in Fast Adversarial Training","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YCFMLFP4OTEUIPQ46CUTDELZOQ","json":"https://pith.science/pith/YCFMLFP4OTEUIPQ46CUTDELZOQ.json","graph_json":"https://pith.science/api/pith-number/YCFMLFP4OTEUIPQ46CUTDELZOQ/graph.json","events_json":"https://pith.science/api/pith-number/YCFMLFP4OTEUIPQ46CUTDELZOQ/events.json","paper":"https://pith.science/paper/YCFMLFP4"},"agent_actions":{"view_html":"https://pith.science/pith/YCFMLFP4OTEUIPQ46CUTDELZOQ","download_json":"https://pith.science/pith/YCFMLFP4OTEUIPQ46CUTDELZOQ.json","view_paper":"https://pith.science/paper/YCFMLFP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.12376&json=true","fetch_graph":"https://pith.science/api/pith-number/YCFMLFP4OTEUIPQ46CUTDELZOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/YCFMLFP4OTEUIPQ46CUTDELZOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCFMLFP4OTEUIPQ46CUTDELZOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCFMLFP4OTEUIPQ46CUTDELZOQ/action/storage_attestation","attest_author":"https://pith.science/pith/YCFMLFP4OTEUIPQ46CUTDELZOQ/action/author_attestation","sign_citation":"https://pith.science/pith/YCFMLFP4OTEUIPQ46CUTDELZOQ/action/citation_signature","submit_replication":"https://pith.science/pith/YCFMLFP4OTEUIPQ46CUTDELZOQ/action/replication_record"}},"created_at":"2026-07-05T05:03:34.408206+00:00","updated_at":"2026-07-05T05:03:34.408206+00:00"}