{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XOWFD3SGLRU4KALTP3WQD4CDWA","short_pith_number":"pith:XOWFD3SG","schema_version":"1.0","canonical_sha256":"bbac51ee465c69c501737eed01f043b03874f75a0975ccfa9ba8571fa31b5930","source":{"kind":"arxiv","id":"2106.15357","version":1},"attestation_state":"computed","paper":{"title":"Multi-stage Optimization based Adversarial Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Chuanbiao Song, Kun He, Liwei Wang, Xiaosen Wang","submitted_at":"2021-06-26T07:59:52Z","abstract_excerpt":"In the field of adversarial robustness, there is a common practice that adopts the single-step adversarial training for quickly developing adversarially robust models. However, the single-step adversarial training is most likely to cause catastrophic overfitting, as after a few training epochs it will be hard to generate strong adversarial examples to continuously boost the adversarial robustness. In this work, we aim to avoid the catastrophic overfitting by introducing multi-step adversarial examples during the single-step adversarial training. Then, to balance the large training overhead of "},"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":"2106.15357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-26T07:59:52Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"513c36d6b3d68d33c203a8709400a16148b233784d75aa57d7c57bed1e1945de","abstract_canon_sha256":"4566abd11b4cb6f10aa30f980a14fd4edce56e58a76b943aefb351f9fbf51579"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:53:16.778619Z","signature_b64":"Z5k7vJrYc33CC4QvGTq8jr/h0Glv+dx4t62tEuFJbzNTfVqAykX+V1wFu5iMHebeDf0OTqvJHw9T0vpbAr4RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbac51ee465c69c501737eed01f043b03874f75a0975ccfa9ba8571fa31b5930","last_reissued_at":"2026-07-05T02:53:16.778223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:53:16.778223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-stage Optimization based Adversarial Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Chuanbiao Song, Kun He, Liwei Wang, Xiaosen Wang","submitted_at":"2021-06-26T07:59:52Z","abstract_excerpt":"In the field of adversarial robustness, there is a common practice that adopts the single-step adversarial training for quickly developing adversarially robust models. However, the single-step adversarial training is most likely to cause catastrophic overfitting, as after a few training epochs it will be hard to generate strong adversarial examples to continuously boost the adversarial robustness. In this work, we aim to avoid the catastrophic overfitting by introducing multi-step adversarial examples during the single-step adversarial training. Then, to balance the large training overhead of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.15357","kind":"arxiv","version":1},"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/2106.15357/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":"2106.15357","created_at":"2026-07-05T02:53:16.778277+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.15357v1","created_at":"2026-07-05T02:53:16.778277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.15357","created_at":"2026-07-05T02:53:16.778277+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOWFD3SGLRU4","created_at":"2026-07-05T02:53:16.778277+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOWFD3SGLRU4KALT","created_at":"2026-07-05T02:53:16.778277+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOWFD3SG","created_at":"2026-07-05T02:53:16.778277+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11901","citing_title":"Enhancing Adversarial Transferability via Component-Wise Transformation","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XOWFD3SGLRU4KALTP3WQD4CDWA","json":"https://pith.science/pith/XOWFD3SGLRU4KALTP3WQD4CDWA.json","graph_json":"https://pith.science/api/pith-number/XOWFD3SGLRU4KALTP3WQD4CDWA/graph.json","events_json":"https://pith.science/api/pith-number/XOWFD3SGLRU4KALTP3WQD4CDWA/events.json","paper":"https://pith.science/paper/XOWFD3SG"},"agent_actions":{"view_html":"https://pith.science/pith/XOWFD3SGLRU4KALTP3WQD4CDWA","download_json":"https://pith.science/pith/XOWFD3SGLRU4KALTP3WQD4CDWA.json","view_paper":"https://pith.science/paper/XOWFD3SG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.15357&json=true","fetch_graph":"https://pith.science/api/pith-number/XOWFD3SGLRU4KALTP3WQD4CDWA/graph.json","fetch_events":"https://pith.science/api/pith-number/XOWFD3SGLRU4KALTP3WQD4CDWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOWFD3SGLRU4KALTP3WQD4CDWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOWFD3SGLRU4KALTP3WQD4CDWA/action/storage_attestation","attest_author":"https://pith.science/pith/XOWFD3SGLRU4KALTP3WQD4CDWA/action/author_attestation","sign_citation":"https://pith.science/pith/XOWFD3SGLRU4KALTP3WQD4CDWA/action/citation_signature","submit_replication":"https://pith.science/pith/XOWFD3SGLRU4KALTP3WQD4CDWA/action/replication_record"}},"created_at":"2026-07-05T02:53:16.778277+00:00","updated_at":"2026-07-05T02:53:16.778277+00:00"}