{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WEESY2F5ZBZJENLUQOOTMM4UYZ","short_pith_number":"pith:WEESY2F5","schema_version":"1.0","canonical_sha256":"b1092c68bdc872923574839d363394c673e9fba62427e45ba514abc2a09a99c2","source":{"kind":"arxiv","id":"2207.11727","version":2},"attestation_state":"computed","paper":{"title":"Can we achieve robustness from data alone?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Jingtong Su, Julia Kempe, Nikolaos Tsilivis","submitted_at":"2022-07-24T12:14:48Z","abstract_excerpt":"We introduce a meta-learning algorithm for adversarially robust classification. The proposed method tries to be as model agnostic as possible and optimizes a dataset prior to its deployment in a machine learning system, aiming to effectively erase its non-robust features. Once the dataset has been created, in principle no specialized algorithm (besides standard gradient descent) is needed to train a robust model. We formulate the data optimization procedure as a bi-level optimization problem on kernel regression, with a class of kernels that describe infinitely wide neural nets (Neural Tangent"},"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":"2207.11727","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-24T12:14:48Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"3205c7ab4363d2e91852e3b1d3f924e90bcfa0bb98ec9a5d73a1a4d91fc6b506","abstract_canon_sha256":"bfae001bf57391a953d9aa52ef01b84235440f19d66bfa9c1f28979670161ca3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:37:07.203696Z","signature_b64":"lQii0cYo8U+cxKBWoHkTsmWLwK2ztwMesF7C7ZM0CUSvN0cOldGZfXmWeQpRDzFsrpydkxOHXbDLjIia40jdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1092c68bdc872923574839d363394c673e9fba62427e45ba514abc2a09a99c2","last_reissued_at":"2026-07-05T05:37:07.203259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:37:07.203259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can we achieve robustness from data alone?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Jingtong Su, Julia Kempe, Nikolaos Tsilivis","submitted_at":"2022-07-24T12:14:48Z","abstract_excerpt":"We introduce a meta-learning algorithm for adversarially robust classification. The proposed method tries to be as model agnostic as possible and optimizes a dataset prior to its deployment in a machine learning system, aiming to effectively erase its non-robust features. Once the dataset has been created, in principle no specialized algorithm (besides standard gradient descent) is needed to train a robust model. We formulate the data optimization procedure as a bi-level optimization problem on kernel regression, with a class of kernels that describe infinitely wide neural nets (Neural Tangent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11727","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/2207.11727/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":"2207.11727","created_at":"2026-07-05T05:37:07.203344+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.11727v2","created_at":"2026-07-05T05:37:07.203344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11727","created_at":"2026-07-05T05:37:07.203344+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEESY2F5ZBZJ","created_at":"2026-07-05T05:37:07.203344+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEESY2F5ZBZJENLU","created_at":"2026-07-05T05:37:07.203344+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEESY2F5","created_at":"2026-07-05T05:37:07.203344+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20606","citing_title":"Mind Your Margin and Boundary: Are Your Distilled Datasets Truly Robust?","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WEESY2F5ZBZJENLUQOOTMM4UYZ","json":"https://pith.science/pith/WEESY2F5ZBZJENLUQOOTMM4UYZ.json","graph_json":"https://pith.science/api/pith-number/WEESY2F5ZBZJENLUQOOTMM4UYZ/graph.json","events_json":"https://pith.science/api/pith-number/WEESY2F5ZBZJENLUQOOTMM4UYZ/events.json","paper":"https://pith.science/paper/WEESY2F5"},"agent_actions":{"view_html":"https://pith.science/pith/WEESY2F5ZBZJENLUQOOTMM4UYZ","download_json":"https://pith.science/pith/WEESY2F5ZBZJENLUQOOTMM4UYZ.json","view_paper":"https://pith.science/paper/WEESY2F5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.11727&json=true","fetch_graph":"https://pith.science/api/pith-number/WEESY2F5ZBZJENLUQOOTMM4UYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WEESY2F5ZBZJENLUQOOTMM4UYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEESY2F5ZBZJENLUQOOTMM4UYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEESY2F5ZBZJENLUQOOTMM4UYZ/action/storage_attestation","attest_author":"https://pith.science/pith/WEESY2F5ZBZJENLUQOOTMM4UYZ/action/author_attestation","sign_citation":"https://pith.science/pith/WEESY2F5ZBZJENLUQOOTMM4UYZ/action/citation_signature","submit_replication":"https://pith.science/pith/WEESY2F5ZBZJENLUQOOTMM4UYZ/action/replication_record"}},"created_at":"2026-07-05T05:37:07.203344+00:00","updated_at":"2026-07-05T05:37:07.203344+00:00"}