{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QYEAEV557T2HNPNJQSTBBNFS25","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ad46365eaff9fceae7aad9b35af6ac1a2e42e10e71b503818d97ae2296233363","cross_cats_sorted":["cs.NE","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-04T05:19:09Z","title_canon_sha256":"4c4d89a834c5fa8336586d746141cb2891e58e8bec63b0d99aba7f8ac12c6608"},"schema_version":"1.0","source":{"id":"2003.01897","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.01897","created_at":"2026-07-05T02:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"2003.01897v2","created_at":"2026-07-05T02:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.01897","created_at":"2026-07-05T02:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"QYEAEV557T2H","created_at":"2026-07-05T02:36:06Z"},{"alias_kind":"pith_short_16","alias_value":"QYEAEV557T2HNPNJ","created_at":"2026-07-05T02:36:06Z"},{"alias_kind":"pith_short_8","alias_value":"QYEAEV55","created_at":"2026-07-05T02:36:06Z"}],"graph_snapshots":[{"event_id":"sha256:4121ca902fe69b87c2880953b0ea6d157850803c44e6aca5403dea3fc3b03088","target":"graph","created_at":"2026-07-05T02:36:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.01897/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent empirical and theoretical studies have shown that many learning algorithms -- from linear regression to neural networks -- can have test performance that is non-monotonic in quantities such the sample size and model size. This striking phenomenon, often referred to as \"double descent\", has raised questions of if we need to re-think our current understanding of generalization. In this work, we study whether the double-descent phenomenon can be avoided by using optimal regularization. Theoretically, we prove that for certain linear regression models with isotropic data distribution, optim","authors_text":"Prayaag Venkat, Preetum Nakkiran, Sham Kakade, Tengyu Ma","cross_cats":["cs.NE","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-04T05:19:09Z","title":"Optimal Regularization Can Mitigate Double Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.01897","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a8e1c48ec18ecdf299b7db767101c1b2fcb664aab1a803850946b0c08baca05f","target":"record","created_at":"2026-07-05T02:36:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ad46365eaff9fceae7aad9b35af6ac1a2e42e10e71b503818d97ae2296233363","cross_cats_sorted":["cs.NE","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-04T05:19:09Z","title_canon_sha256":"4c4d89a834c5fa8336586d746141cb2891e58e8bec63b0d99aba7f8ac12c6608"},"schema_version":"1.0","source":{"id":"2003.01897","kind":"arxiv","version":2}},"canonical_sha256":"86080257bdfcf476bda984a610b4b2d753afa7258192caddf292e5c0820e0d5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86080257bdfcf476bda984a610b4b2d753afa7258192caddf292e5c0820e0d5c","first_computed_at":"2026-07-05T02:36:06.891179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:36:06.891179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xL7AcO6OPGjVPtkmSDgIGKqJnyN/BNnyXGAxNvOuMvtCTp2xl+6Ew+cv6AeafMuVjVsx2IaVJbUWFjFmD0s1BA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:36:06.891612Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.01897","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8e1c48ec18ecdf299b7db767101c1b2fcb664aab1a803850946b0c08baca05f","sha256:4121ca902fe69b87c2880953b0ea6d157850803c44e6aca5403dea3fc3b03088"],"state_sha256":"32033ab7ecc6f8f4d707c7fc421d38afeb2ea7e087b43097e62c410a4028d781"}