{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZCH4OLRZNNVO5JXGPLSHLXIWN7","short_pith_number":"pith:ZCH4OLRZ","schema_version":"1.0","canonical_sha256":"c88fc72e396b6aeea6e67ae475dd166fe23ebdb3f3a4ee80059e913eea1487fc","source":{"kind":"arxiv","id":"1608.04414","version":3},"attestation_state":"computed","paper":{"title":"Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Vitaly Feldman","submitted_at":"2016-08-15T21:19:51Z","abstract_excerpt":"In stochastic convex optimization the goal is to minimize a convex function $F(x) \\doteq {\\mathbf E}_{{\\mathbf f}\\sim D}[{\\mathbf f}(x)]$ over a convex set $\\cal K \\subset {\\mathbb R}^d$ where $D$ is some unknown distribution and each $f(\\cdot)$ in the support of $D$ is convex over $\\cal K$. The optimization is commonly based on i.i.d.~samples $f^1,f^2,\\ldots,f^n$ from $D$. A standard approach to such problems is empirical risk minimization (ERM) that optimizes $F_S(x) \\doteq \\frac{1}{n}\\sum_{i\\leq n} f^i(x)$. Here we consider the question of how many samples are necessary for ERM to succeed a"},"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":"1608.04414","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-15T21:19:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"52c852b2d338b99a4438413b31fc4b678446b7944b7d6b6481b6f8a3826a10d5","abstract_canon_sha256":"d4bb7e7e026774fe74a43d039e3653417fddc9ffe684a113dbd5a255a9423815"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:59.306208Z","signature_b64":"EWPe33XkW5qwVmJus5l12XcSulF71BqJ4e86Yc75jzfjhoOah4D72KDF1dkfQReag+BSCjXOOAkkuiD0xXTXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c88fc72e396b6aeea6e67ae475dd166fe23ebdb3f3a4ee80059e913eea1487fc","last_reissued_at":"2026-05-18T00:53:59.305567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:59.305567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Vitaly Feldman","submitted_at":"2016-08-15T21:19:51Z","abstract_excerpt":"In stochastic convex optimization the goal is to minimize a convex function $F(x) \\doteq {\\mathbf E}_{{\\mathbf f}\\sim D}[{\\mathbf f}(x)]$ over a convex set $\\cal K \\subset {\\mathbb R}^d$ where $D$ is some unknown distribution and each $f(\\cdot)$ in the support of $D$ is convex over $\\cal K$. The optimization is commonly based on i.i.d.~samples $f^1,f^2,\\ldots,f^n$ from $D$. A standard approach to such problems is empirical risk minimization (ERM) that optimizes $F_S(x) \\doteq \\frac{1}{n}\\sum_{i\\leq n} f^i(x)$. Here we consider the question of how many samples are necessary for ERM to succeed a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04414","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":""},"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":"1608.04414","created_at":"2026-05-18T00:53:59.305683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04414v3","created_at":"2026-05-18T00:53:59.305683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04414","created_at":"2026-05-18T00:53:59.305683+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCH4OLRZNNVO","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCH4OLRZNNVO5JXG","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCH4OLRZ","created_at":"2026-05-18T12:30:53.716459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7","json":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7.json","graph_json":"https://pith.science/api/pith-number/ZCH4OLRZNNVO5JXGPLSHLXIWN7/graph.json","events_json":"https://pith.science/api/pith-number/ZCH4OLRZNNVO5JXGPLSHLXIWN7/events.json","paper":"https://pith.science/paper/ZCH4OLRZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7","download_json":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7.json","view_paper":"https://pith.science/paper/ZCH4OLRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04414&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCH4OLRZNNVO5JXGPLSHLXIWN7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCH4OLRZNNVO5JXGPLSHLXIWN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7/action/storage_attestation","attest_author":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7/action/author_attestation","sign_citation":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7/action/citation_signature","submit_replication":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7/action/replication_record"}},"created_at":"2026-05-18T00:53:59.305683+00:00","updated_at":"2026-05-18T00:53:59.305683+00:00"}