{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:USV6JTCPJVPQDGWM4PQSQ7CRUG","short_pith_number":"pith:USV6JTCP","schema_version":"1.0","canonical_sha256":"a4abe4cc4f4d5f019acce3e1287c51a1b08a75c38d28ade1175a28c166b21f62","source":{"kind":"arxiv","id":"2202.05488","version":2},"attestation_state":"computed","paper":{"title":"Fast Adversarial Training with Noise Augmentation: A Unified Perspective on RandStart and GradAlign","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Axi Niu, Chang D. Yoo, Chaoning Zhang, Chenshuang Zhang, In So Kweon, Kang Zhang, Yanning Zhang","submitted_at":"2022-02-11T07:37:55Z","abstract_excerpt":"PGD-based and FGSM-based are two popular adversarial training (AT) approaches for obtaining adversarially robust models. Compared with PGD-based AT, FGSM-based one is significantly faster but fails with catastrophic overfitting (CO). For mitigating CO in such Fast AT, there are two popular existing strategies: random start (RandStart) and Gradient Alignment (GradAlign). The former works only for a relatively small perturbation 8/255 with the l_\\infty constraint, and GradAlign improves it by extending the perturbation size to 16/255 (with the l_\\infty constraint) but at the cost of being 3 to 4"},"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":"2202.05488","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-11T07:37:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4257cb7213f8fad33ad7eb5db65456ab669de552ce30e24bee2088048dacd248","abstract_canon_sha256":"c3685dc2d7f7d3365c7628230946ab4d3172a0a1e5395ff7b85a1c5072c336c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:03:35.303073Z","signature_b64":"qV5HqHrC0NSEhqLTklVKvimOAm+k/UUaxCZLhJVpd14IOvYun/kY+D1VVJjQM2vj8AOhtuxzu4PCIToYHuFKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4abe4cc4f4d5f019acce3e1287c51a1b08a75c38d28ade1175a28c166b21f62","last_reissued_at":"2026-07-05T05:03:35.302639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:03:35.302639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Adversarial Training with Noise Augmentation: A Unified Perspective on RandStart and GradAlign","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Axi Niu, Chang D. Yoo, Chaoning Zhang, Chenshuang Zhang, In So Kweon, Kang Zhang, Yanning Zhang","submitted_at":"2022-02-11T07:37:55Z","abstract_excerpt":"PGD-based and FGSM-based are two popular adversarial training (AT) approaches for obtaining adversarially robust models. Compared with PGD-based AT, FGSM-based one is significantly faster but fails with catastrophic overfitting (CO). For mitigating CO in such Fast AT, there are two popular existing strategies: random start (RandStart) and Gradient Alignment (GradAlign). The former works only for a relatively small perturbation 8/255 with the l_\\infty constraint, and GradAlign improves it by extending the perturbation size to 16/255 (with the l_\\infty constraint) but at the cost of being 3 to 4"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05488","kind":"arxiv","version":2},"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/2202.05488/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":"2202.05488","created_at":"2026-07-05T05:03:35.302697+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.05488v2","created_at":"2026-07-05T05:03:35.302697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05488","created_at":"2026-07-05T05:03:35.302697+00:00"},{"alias_kind":"pith_short_12","alias_value":"USV6JTCPJVPQ","created_at":"2026-07-05T05:03:35.302697+00:00"},{"alias_kind":"pith_short_16","alias_value":"USV6JTCPJVPQDGWM","created_at":"2026-07-05T05:03:35.302697+00:00"},{"alias_kind":"pith_short_8","alias_value":"USV6JTCP","created_at":"2026-07-05T05:03:35.302697+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24332","citing_title":"Mitigating Error Amplification in Fast Adversarial Training","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USV6JTCPJVPQDGWM4PQSQ7CRUG","json":"https://pith.science/pith/USV6JTCPJVPQDGWM4PQSQ7CRUG.json","graph_json":"https://pith.science/api/pith-number/USV6JTCPJVPQDGWM4PQSQ7CRUG/graph.json","events_json":"https://pith.science/api/pith-number/USV6JTCPJVPQDGWM4PQSQ7CRUG/events.json","paper":"https://pith.science/paper/USV6JTCP"},"agent_actions":{"view_html":"https://pith.science/pith/USV6JTCPJVPQDGWM4PQSQ7CRUG","download_json":"https://pith.science/pith/USV6JTCPJVPQDGWM4PQSQ7CRUG.json","view_paper":"https://pith.science/paper/USV6JTCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.05488&json=true","fetch_graph":"https://pith.science/api/pith-number/USV6JTCPJVPQDGWM4PQSQ7CRUG/graph.json","fetch_events":"https://pith.science/api/pith-number/USV6JTCPJVPQDGWM4PQSQ7CRUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USV6JTCPJVPQDGWM4PQSQ7CRUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USV6JTCPJVPQDGWM4PQSQ7CRUG/action/storage_attestation","attest_author":"https://pith.science/pith/USV6JTCPJVPQDGWM4PQSQ7CRUG/action/author_attestation","sign_citation":"https://pith.science/pith/USV6JTCPJVPQDGWM4PQSQ7CRUG/action/citation_signature","submit_replication":"https://pith.science/pith/USV6JTCPJVPQDGWM4PQSQ7CRUG/action/replication_record"}},"created_at":"2026-07-05T05:03:35.302697+00:00","updated_at":"2026-07-05T05:03:35.302697+00:00"}