{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LT532344LSKP4UGZLYEMQ73OMW","short_pith_number":"pith:LT532344","schema_version":"1.0","canonical_sha256":"5cfbbd6f9c5c94fe50d95e08c87f6e65b37487424d3eb6edbd2d5b7256142570","source":{"kind":"arxiv","id":"2409.00901","version":3},"attestation_state":"computed","paper":{"title":"On the optimal approximation of Sobolev and Besov functions using deep ReLU neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"stat.ML","authors_text":"Yunfei Yang","submitted_at":"2024-09-02T02:26:01Z","abstract_excerpt":"This paper studies the problem of how efficiently functions in the Sobolev spaces $\\mathcal{W}^{s,q}([0,1]^d)$ and Besov spaces $\\mathcal{B}^s_{q,r}([0,1]^d)$ can be approximated by deep ReLU neural networks with width $W$ and depth $L$, when the error is measured in the $L^p([0,1]^d)$ norm. This problem has been studied by several recent works, which obtained the approximation rate $\\mathcal{O}((WL)^{-2s/d})$ up to logarithmic factors when $p=q=\\infty$, and the rate $\\mathcal{O}(L^{-2s/d})$ for networks with fixed width when the Sobolev embedding condition $1/q -1/p<s/d$ holds. We generalize "},"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":"2409.00901","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-09-02T02:26:01Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"0605a176d0126d2999878e975d2c24c597269cb7d35a1d566780c49a2a6b9d8b","abstract_canon_sha256":"621062c637cfc69c96965ad988bf81a3eda18db97bacbd428b3fd2e460352853"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:04.070644Z","signature_b64":"bZQJt5nz1Su12AnMrej6y//SJ4+N7OIPUP2qQpTmeWbkMjZarRxmhx3UYzy3F6rqTV8/Z6s8i1XB3o41PI0ZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cfbbd6f9c5c94fe50d95e08c87f6e65b37487424d3eb6edbd2d5b7256142570","last_reissued_at":"2026-07-05T11:39:04.070172Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:04.070172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the optimal approximation of Sobolev and Besov functions using deep ReLU neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"stat.ML","authors_text":"Yunfei Yang","submitted_at":"2024-09-02T02:26:01Z","abstract_excerpt":"This paper studies the problem of how efficiently functions in the Sobolev spaces $\\mathcal{W}^{s,q}([0,1]^d)$ and Besov spaces $\\mathcal{B}^s_{q,r}([0,1]^d)$ can be approximated by deep ReLU neural networks with width $W$ and depth $L$, when the error is measured in the $L^p([0,1]^d)$ norm. This problem has been studied by several recent works, which obtained the approximation rate $\\mathcal{O}((WL)^{-2s/d})$ up to logarithmic factors when $p=q=\\infty$, and the rate $\\mathcal{O}(L^{-2s/d})$ for networks with fixed width when the Sobolev embedding condition $1/q -1/p<s/d$ holds. We generalize "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.00901","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/2409.00901/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":"2409.00901","created_at":"2026-07-05T11:39:04.070228+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.00901v3","created_at":"2026-07-05T11:39:04.070228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.00901","created_at":"2026-07-05T11:39:04.070228+00:00"},{"alias_kind":"pith_short_12","alias_value":"LT532344LSKP","created_at":"2026-07-05T11:39:04.070228+00:00"},{"alias_kind":"pith_short_16","alias_value":"LT532344LSKP4UGZ","created_at":"2026-07-05T11:39:04.070228+00:00"},{"alias_kind":"pith_short_8","alias_value":"LT532344","created_at":"2026-07-05T11:39:04.070228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.11275","citing_title":"Higher Order Approximation Rates for ReLU CNNs in Korobov Spaces","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LT532344LSKP4UGZLYEMQ73OMW","json":"https://pith.science/pith/LT532344LSKP4UGZLYEMQ73OMW.json","graph_json":"https://pith.science/api/pith-number/LT532344LSKP4UGZLYEMQ73OMW/graph.json","events_json":"https://pith.science/api/pith-number/LT532344LSKP4UGZLYEMQ73OMW/events.json","paper":"https://pith.science/paper/LT532344"},"agent_actions":{"view_html":"https://pith.science/pith/LT532344LSKP4UGZLYEMQ73OMW","download_json":"https://pith.science/pith/LT532344LSKP4UGZLYEMQ73OMW.json","view_paper":"https://pith.science/paper/LT532344","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.00901&json=true","fetch_graph":"https://pith.science/api/pith-number/LT532344LSKP4UGZLYEMQ73OMW/graph.json","fetch_events":"https://pith.science/api/pith-number/LT532344LSKP4UGZLYEMQ73OMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LT532344LSKP4UGZLYEMQ73OMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LT532344LSKP4UGZLYEMQ73OMW/action/storage_attestation","attest_author":"https://pith.science/pith/LT532344LSKP4UGZLYEMQ73OMW/action/author_attestation","sign_citation":"https://pith.science/pith/LT532344LSKP4UGZLYEMQ73OMW/action/citation_signature","submit_replication":"https://pith.science/pith/LT532344LSKP4UGZLYEMQ73OMW/action/replication_record"}},"created_at":"2026-07-05T11:39:04.070228+00:00","updated_at":"2026-07-05T11:39:04.070228+00:00"}