{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NITU4XH3LOS3GNTYUDFHOVOEAT","short_pith_number":"pith:NITU4XH3","schema_version":"1.0","canonical_sha256":"6a274e5cfb5ba5b33678a0ca7755c404d74c1484b9f0dfdabce9de9396e93f79","source":{"kind":"arxiv","id":"1905.09209","version":1},"attestation_state":"computed","paper":{"title":"Convergence and Margin of Adversarial Training on Separable Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dimitris Papailiopoulos, Shashank Rajput, Stephen Wright, Zachary Charles","submitted_at":"2019-05-22T16:00:25Z","abstract_excerpt":"Adversarial training is a technique for training robust machine learning models. To encourage robustness, it iteratively computes adversarial examples for the model, and then re-trains on these examples via some update rule. This work analyzes the performance of adversarial training on linearly separable data, and provides bounds on the number of iterations required for large margin. We show that when the update rule is given by an arbitrary empirical risk minimizer, adversarial training may require exponentially many iterations to obtain large margin. However, if gradient or stochastic gradie"},"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":"1905.09209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-22T16:00:25Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"3335578404d538ea8d8d77b73885c5dd27fcf473ed16edc7f9e66caee34c664e","abstract_canon_sha256":"2679a686f1876568ca37080fb557cf5b47f225cc5670ec9b1527054bddcbc3ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:21.619111Z","signature_b64":"6uJVxEZIfxCgyj6QAOw6wdQVSLu+ULr2kYVQ104mYYGX1WKw8Dv7qQPwsePPn6oJNuHLapl6zBjy828yxhsWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a274e5cfb5ba5b33678a0ca7755c404d74c1484b9f0dfdabce9de9396e93f79","last_reissued_at":"2026-05-17T23:45:21.618433Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:21.618433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence and Margin of Adversarial Training on Separable Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dimitris Papailiopoulos, Shashank Rajput, Stephen Wright, Zachary Charles","submitted_at":"2019-05-22T16:00:25Z","abstract_excerpt":"Adversarial training is a technique for training robust machine learning models. To encourage robustness, it iteratively computes adversarial examples for the model, and then re-trains on these examples via some update rule. This work analyzes the performance of adversarial training on linearly separable data, and provides bounds on the number of iterations required for large margin. We show that when the update rule is given by an arbitrary empirical risk minimizer, adversarial training may require exponentially many iterations to obtain large margin. However, if gradient or stochastic gradie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09209","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":""},"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":"1905.09209","created_at":"2026-05-17T23:45:21.618554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.09209v1","created_at":"2026-05-17T23:45:21.618554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09209","created_at":"2026-05-17T23:45:21.618554+00:00"},{"alias_kind":"pith_short_12","alias_value":"NITU4XH3LOS3","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NITU4XH3LOS3GNTY","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NITU4XH3","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NITU4XH3LOS3GNTYUDFHOVOEAT","json":"https://pith.science/pith/NITU4XH3LOS3GNTYUDFHOVOEAT.json","graph_json":"https://pith.science/api/pith-number/NITU4XH3LOS3GNTYUDFHOVOEAT/graph.json","events_json":"https://pith.science/api/pith-number/NITU4XH3LOS3GNTYUDFHOVOEAT/events.json","paper":"https://pith.science/paper/NITU4XH3"},"agent_actions":{"view_html":"https://pith.science/pith/NITU4XH3LOS3GNTYUDFHOVOEAT","download_json":"https://pith.science/pith/NITU4XH3LOS3GNTYUDFHOVOEAT.json","view_paper":"https://pith.science/paper/NITU4XH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.09209&json=true","fetch_graph":"https://pith.science/api/pith-number/NITU4XH3LOS3GNTYUDFHOVOEAT/graph.json","fetch_events":"https://pith.science/api/pith-number/NITU4XH3LOS3GNTYUDFHOVOEAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NITU4XH3LOS3GNTYUDFHOVOEAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NITU4XH3LOS3GNTYUDFHOVOEAT/action/storage_attestation","attest_author":"https://pith.science/pith/NITU4XH3LOS3GNTYUDFHOVOEAT/action/author_attestation","sign_citation":"https://pith.science/pith/NITU4XH3LOS3GNTYUDFHOVOEAT/action/citation_signature","submit_replication":"https://pith.science/pith/NITU4XH3LOS3GNTYUDFHOVOEAT/action/replication_record"}},"created_at":"2026-05-17T23:45:21.618554+00:00","updated_at":"2026-05-17T23:45:21.618554+00:00"}