{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QO762SNXO6UDSRSKJTMZYUCD6N","short_pith_number":"pith:QO762SNX","schema_version":"1.0","canonical_sha256":"83bfed49b777a839464a4cd99c5043f35587c6fa1783f766a55e7523db39eeac","source":{"kind":"arxiv","id":"2205.13863","version":3},"attestation_state":"computed","paper":{"title":"Why Robust Generalization in Deep Learning is Difficult: Perspective of Expressive Power","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Binghui Li, Han Zhong, Jikai Jin, John E. Hopcroft, Liwei Wang","submitted_at":"2022-05-27T09:53:04Z","abstract_excerpt":"It is well-known that modern neural networks are vulnerable to adversarial examples. To mitigate this problem, a series of robust learning algorithms have been proposed. However, although the robust training error can be near zero via some methods, all existing algorithms lead to a high robust generalization error. In this paper, we provide a theoretical understanding of this puzzling phenomenon from the perspective of expressive power for deep neural networks. Specifically, for binary classification problems with well-separated data, we show that, for ReLU networks, while mild over-parameteri"},"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":"2205.13863","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-27T09:53:04Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"931708a0d11dfb43f46c2716507e1fd3db7fc1a075e5317d51fb9033ea9f33cf","abstract_canon_sha256":"40b31e4d9e3dc255d0862f3d93bc3b0aec8c70218204e7a22fd8368066221b9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:31.737642Z","signature_b64":"AwIl7fQ61VGw0OzXfynaudPKgbpLKqnJML+6Nwafk9x7N61zZrx42Ty7tt8d3tOcvZ7mY+NnPsQLp1qfCc89Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83bfed49b777a839464a4cd99c5043f35587c6fa1783f766a55e7523db39eeac","last_reissued_at":"2026-07-05T05:06:31.737133Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:31.737133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Why Robust Generalization in Deep Learning is Difficult: Perspective of Expressive Power","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Binghui Li, Han Zhong, Jikai Jin, John E. Hopcroft, Liwei Wang","submitted_at":"2022-05-27T09:53:04Z","abstract_excerpt":"It is well-known that modern neural networks are vulnerable to adversarial examples. To mitigate this problem, a series of robust learning algorithms have been proposed. However, although the robust training error can be near zero via some methods, all existing algorithms lead to a high robust generalization error. In this paper, we provide a theoretical understanding of this puzzling phenomenon from the perspective of expressive power for deep neural networks. Specifically, for binary classification problems with well-separated data, we show that, for ReLU networks, while mild over-parameteri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.13863","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/2205.13863/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":"2205.13863","created_at":"2026-07-05T05:06:31.737192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.13863v3","created_at":"2026-07-05T05:06:31.737192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.13863","created_at":"2026-07-05T05:06:31.737192+00:00"},{"alias_kind":"pith_short_12","alias_value":"QO762SNXO6UD","created_at":"2026-07-05T05:06:31.737192+00:00"},{"alias_kind":"pith_short_16","alias_value":"QO762SNXO6UDSRSK","created_at":"2026-07-05T05:06:31.737192+00:00"},{"alias_kind":"pith_short_8","alias_value":"QO762SNX","created_at":"2026-07-05T05:06:31.737192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.12823","citing_title":"To Measure or Not: A Cost-Sensitive, Selective Measuring Environment for Agricultural Management Decisions with Reinforcement Learning","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QO762SNXO6UDSRSKJTMZYUCD6N","json":"https://pith.science/pith/QO762SNXO6UDSRSKJTMZYUCD6N.json","graph_json":"https://pith.science/api/pith-number/QO762SNXO6UDSRSKJTMZYUCD6N/graph.json","events_json":"https://pith.science/api/pith-number/QO762SNXO6UDSRSKJTMZYUCD6N/events.json","paper":"https://pith.science/paper/QO762SNX"},"agent_actions":{"view_html":"https://pith.science/pith/QO762SNXO6UDSRSKJTMZYUCD6N","download_json":"https://pith.science/pith/QO762SNXO6UDSRSKJTMZYUCD6N.json","view_paper":"https://pith.science/paper/QO762SNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.13863&json=true","fetch_graph":"https://pith.science/api/pith-number/QO762SNXO6UDSRSKJTMZYUCD6N/graph.json","fetch_events":"https://pith.science/api/pith-number/QO762SNXO6UDSRSKJTMZYUCD6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QO762SNXO6UDSRSKJTMZYUCD6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QO762SNXO6UDSRSKJTMZYUCD6N/action/storage_attestation","attest_author":"https://pith.science/pith/QO762SNXO6UDSRSKJTMZYUCD6N/action/author_attestation","sign_citation":"https://pith.science/pith/QO762SNXO6UDSRSKJTMZYUCD6N/action/citation_signature","submit_replication":"https://pith.science/pith/QO762SNXO6UDSRSKJTMZYUCD6N/action/replication_record"}},"created_at":"2026-07-05T05:06:31.737192+00:00","updated_at":"2026-07-05T05:06:31.737192+00:00"}