{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RVVZECDHQHHI744RXG4VWG2EUQ","short_pith_number":"pith:RVVZECDH","schema_version":"1.0","canonical_sha256":"8d6b92086781ce8ff391b9b95b1b44a42a20367b35775b5e7788a67a4e026f27","source":{"kind":"arxiv","id":"1804.11285","version":2},"attestation_state":"computed","paper":{"title":"Adversarially Robust Generalization Requires More Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aleksander M\\k{a}dry, Dimitris Tsipras, Kunal Talwar, Ludwig Schmidt, Shibani Santurkar","submitted_at":"2018-04-30T15:55:59Z","abstract_excerpt":"Machine learning models are often susceptible to adversarial perturbations of their inputs. Even small perturbations can cause state-of-the-art classifiers with high \"standard\" accuracy to produce an incorrect prediction with high confidence. To better understand this phenomenon, we study adversarially robust learning from the viewpoint of generalization. We show that already in a simple natural data model, the sample complexity of robust learning can be significantly larger than that of \"standard\" learning. This gap is information theoretic and holds irrespective of the training algorithm or "},"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":"1804.11285","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-30T15:55:59Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"6713295ced96b2246b5873843a63d273b587837011fd039ddf017d48a44aa9ee","abstract_canon_sha256":"9a3c7eafeb8f582f7e3153594e190bbc27a32baa23fc2e972fecc8b89842df57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:58.787416Z","signature_b64":"nZuNDhMORdEX15+Qzt8dILRs7hPW1NlL9cTPpcHzgrUOwhu8SCc3tl1bAMBJudYZb3HokiV9yPNzy9Lw+mgJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d6b92086781ce8ff391b9b95b1b44a42a20367b35775b5e7788a67a4e026f27","last_reissued_at":"2026-05-18T00:16:58.786666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:58.786666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarially Robust Generalization Requires More Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aleksander M\\k{a}dry, Dimitris Tsipras, Kunal Talwar, Ludwig Schmidt, Shibani Santurkar","submitted_at":"2018-04-30T15:55:59Z","abstract_excerpt":"Machine learning models are often susceptible to adversarial perturbations of their inputs. Even small perturbations can cause state-of-the-art classifiers with high \"standard\" accuracy to produce an incorrect prediction with high confidence. To better understand this phenomenon, we study adversarially robust learning from the viewpoint of generalization. We show that already in a simple natural data model, the sample complexity of robust learning can be significantly larger than that of \"standard\" learning. This gap is information theoretic and holds irrespective of the training algorithm or "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11285","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":""},"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":"1804.11285","created_at":"2026-05-18T00:16:58.786779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.11285v2","created_at":"2026-05-18T00:16:58.786779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11285","created_at":"2026-05-18T00:16:58.786779+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVVZECDHQHHI","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVVZECDHQHHI744R","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVVZECDH","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.15416","citing_title":"Margin-Adaptive Confidence Ranking for Reliable LLM Judgement","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RVVZECDHQHHI744RXG4VWG2EUQ","json":"https://pith.science/pith/RVVZECDHQHHI744RXG4VWG2EUQ.json","graph_json":"https://pith.science/api/pith-number/RVVZECDHQHHI744RXG4VWG2EUQ/graph.json","events_json":"https://pith.science/api/pith-number/RVVZECDHQHHI744RXG4VWG2EUQ/events.json","paper":"https://pith.science/paper/RVVZECDH"},"agent_actions":{"view_html":"https://pith.science/pith/RVVZECDHQHHI744RXG4VWG2EUQ","download_json":"https://pith.science/pith/RVVZECDHQHHI744RXG4VWG2EUQ.json","view_paper":"https://pith.science/paper/RVVZECDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.11285&json=true","fetch_graph":"https://pith.science/api/pith-number/RVVZECDHQHHI744RXG4VWG2EUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RVVZECDHQHHI744RXG4VWG2EUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVVZECDHQHHI744RXG4VWG2EUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVVZECDHQHHI744RXG4VWG2EUQ/action/storage_attestation","attest_author":"https://pith.science/pith/RVVZECDHQHHI744RXG4VWG2EUQ/action/author_attestation","sign_citation":"https://pith.science/pith/RVVZECDHQHHI744RXG4VWG2EUQ/action/citation_signature","submit_replication":"https://pith.science/pith/RVVZECDHQHHI744RXG4VWG2EUQ/action/replication_record"}},"created_at":"2026-05-18T00:16:58.786779+00:00","updated_at":"2026-05-18T00:16:58.786779+00:00"}