{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:COWTAQI4NPFUV2HMIEOCPIADMN","short_pith_number":"pith:COWTAQI4","schema_version":"1.0","canonical_sha256":"13ad30411c6bcb4ae8ec411c27a00363620c607fa438ffecf207166fdabd100d","source":{"kind":"arxiv","id":"2012.15699","version":3},"attestation_state":"computed","paper":{"title":"Better Robustness by More Coverage: Adversarial Training with Mixup Augmentation for Robust Fine-tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chenglei Si, Fanchao Qi, Maosong Sun, Qun Liu, Yasheng Wang, Zhengyan Zhang, Zhiyuan Liu","submitted_at":"2020-12-31T16:28:07Z","abstract_excerpt":"Pretrained language models (PLMs) perform poorly under adversarial attacks. To improve the adversarial robustness, adversarial data augmentation (ADA) has been widely adopted to cover more search space of adversarial attacks by adding textual adversarial examples during training. However, the number of adversarial examples for text augmentation is still extremely insufficient due to the exponentially large attack search space. In this work, we propose a simple and effective method to cover a much larger proportion of the attack search space, called Adversarial and Mixup Data Augmentation (AMDA"},"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":"2012.15699","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2020-12-31T16:28:07Z","cross_cats_sorted":[],"title_canon_sha256":"c183685f9c8ec9812df44d03629f07c2170c5bed7a76980a079118de0f40bb03","abstract_canon_sha256":"749388830464a4e93dce7678aeb32332c676003758c7c642f655717217855054"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:26.102955Z","signature_b64":"SRI36hN+jsp6Sqn9dbBPDtt7Vezr6HILGo1AZurwVckT40mH+wpuPzK5x2RZU5pLdi4OLnXh4E2u47+ip1DMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13ad30411c6bcb4ae8ec411c27a00363620c607fa438ffecf207166fdabd100d","last_reissued_at":"2026-07-05T02:46:26.102505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:26.102505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Robustness by More Coverage: Adversarial Training with Mixup Augmentation for Robust Fine-tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chenglei Si, Fanchao Qi, Maosong Sun, Qun Liu, Yasheng Wang, Zhengyan Zhang, Zhiyuan Liu","submitted_at":"2020-12-31T16:28:07Z","abstract_excerpt":"Pretrained language models (PLMs) perform poorly under adversarial attacks. To improve the adversarial robustness, adversarial data augmentation (ADA) has been widely adopted to cover more search space of adversarial attacks by adding textual adversarial examples during training. However, the number of adversarial examples for text augmentation is still extremely insufficient due to the exponentially large attack search space. In this work, we propose a simple and effective method to cover a much larger proportion of the attack search space, called Adversarial and Mixup Data Augmentation (AMDA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15699","kind":"arxiv","version":3},"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/2012.15699/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":"2012.15699","created_at":"2026-07-05T02:46:26.102566+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.15699v3","created_at":"2026-07-05T02:46:26.102566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15699","created_at":"2026-07-05T02:46:26.102566+00:00"},{"alias_kind":"pith_short_12","alias_value":"COWTAQI4NPFU","created_at":"2026-07-05T02:46:26.102566+00:00"},{"alias_kind":"pith_short_16","alias_value":"COWTAQI4NPFUV2HM","created_at":"2026-07-05T02:46:26.102566+00:00"},{"alias_kind":"pith_short_8","alias_value":"COWTAQI4","created_at":"2026-07-05T02:46:26.102566+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10330","citing_title":"Bridging Robustness and Generalization Against Word Substitution Attacks in NLP via the Growth Bound Matrix Approach","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/COWTAQI4NPFUV2HMIEOCPIADMN","json":"https://pith.science/pith/COWTAQI4NPFUV2HMIEOCPIADMN.json","graph_json":"https://pith.science/api/pith-number/COWTAQI4NPFUV2HMIEOCPIADMN/graph.json","events_json":"https://pith.science/api/pith-number/COWTAQI4NPFUV2HMIEOCPIADMN/events.json","paper":"https://pith.science/paper/COWTAQI4"},"agent_actions":{"view_html":"https://pith.science/pith/COWTAQI4NPFUV2HMIEOCPIADMN","download_json":"https://pith.science/pith/COWTAQI4NPFUV2HMIEOCPIADMN.json","view_paper":"https://pith.science/paper/COWTAQI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.15699&json=true","fetch_graph":"https://pith.science/api/pith-number/COWTAQI4NPFUV2HMIEOCPIADMN/graph.json","fetch_events":"https://pith.science/api/pith-number/COWTAQI4NPFUV2HMIEOCPIADMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COWTAQI4NPFUV2HMIEOCPIADMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COWTAQI4NPFUV2HMIEOCPIADMN/action/storage_attestation","attest_author":"https://pith.science/pith/COWTAQI4NPFUV2HMIEOCPIADMN/action/author_attestation","sign_citation":"https://pith.science/pith/COWTAQI4NPFUV2HMIEOCPIADMN/action/citation_signature","submit_replication":"https://pith.science/pith/COWTAQI4NPFUV2HMIEOCPIADMN/action/replication_record"}},"created_at":"2026-07-05T02:46:26.102566+00:00","updated_at":"2026-07-05T02:46:26.102566+00:00"}