{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BXGUG2NDDWYUXJU4ZS7L5DUG7C","short_pith_number":"pith:BXGUG2ND","schema_version":"1.0","canonical_sha256":"0dcd4369a31db14ba69cccbebe8e86f88fbac1d9ca25ab7d002a5afea841359d","source":{"kind":"arxiv","id":"1706.09156","version":4},"attestation_state":"computed","paper":{"title":"Non-convex Finite-Sum Optimization Via SCSG Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Cheng Ju, Jianbo Chen, Lihua Lei, Michael I. Jordan","submitted_at":"2017-06-28T07:54:02Z","abstract_excerpt":"We develop a class of algorithms, as variants of the stochastically controlled stochastic gradient (SCSG) methods (Lei and Jordan, 2016), for the smooth non-convex finite-sum optimization problem. Assuming the smoothness of each component, the complexity of SCSG to reach a stationary point with $\\mathbb{E} \\|\\nabla f(x)\\|^{2}\\le \\epsilon$ is $O\\left (\\min\\{\\epsilon^{-5/3}, \\epsilon^{-1}n^{2/3}\\}\\right)$, which strictly outperforms the stochastic gradient descent. Moreover, SCSG is never worse than the state-of-the-art methods based on variance reduction and it significantly outperforms them wh"},"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":"1706.09156","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-28T07:54:02Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7bb5c547e0ee11b4e7054a55e2354298f1100d850af8e1df977f61ad186a108c","abstract_canon_sha256":"2aeeaecf2201c060de80499997953f3e666f895f494fce94dfe5b5855113fbae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:04.565728Z","signature_b64":"WJD/AI1ZiQTJHnG8/FfdV3mDhmHVs6LGjKFMbcF8L45rsQxmovvTncLqtPrIjTy1iZ080Cx1+9ezBOrnEHH4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dcd4369a31db14ba69cccbebe8e86f88fbac1d9ca25ab7d002a5afea841359d","last_reissued_at":"2026-05-17T23:46:04.565000Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:04.565000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-convex Finite-Sum Optimization Via SCSG Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Cheng Ju, Jianbo Chen, Lihua Lei, Michael I. Jordan","submitted_at":"2017-06-28T07:54:02Z","abstract_excerpt":"We develop a class of algorithms, as variants of the stochastically controlled stochastic gradient (SCSG) methods (Lei and Jordan, 2016), for the smooth non-convex finite-sum optimization problem. Assuming the smoothness of each component, the complexity of SCSG to reach a stationary point with $\\mathbb{E} \\|\\nabla f(x)\\|^{2}\\le \\epsilon$ is $O\\left (\\min\\{\\epsilon^{-5/3}, \\epsilon^{-1}n^{2/3}\\}\\right)$, which strictly outperforms the stochastic gradient descent. Moreover, SCSG is never worse than the state-of-the-art methods based on variance reduction and it significantly outperforms them wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09156","kind":"arxiv","version":4},"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":"1706.09156","created_at":"2026-05-17T23:46:04.565112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09156v4","created_at":"2026-05-17T23:46:04.565112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09156","created_at":"2026-05-17T23:46:04.565112+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXGUG2NDDWYU","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXGUG2NDDWYUXJU4","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXGUG2ND","created_at":"2026-05-18T12:31:08.081275+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/BXGUG2NDDWYUXJU4ZS7L5DUG7C","json":"https://pith.science/pith/BXGUG2NDDWYUXJU4ZS7L5DUG7C.json","graph_json":"https://pith.science/api/pith-number/BXGUG2NDDWYUXJU4ZS7L5DUG7C/graph.json","events_json":"https://pith.science/api/pith-number/BXGUG2NDDWYUXJU4ZS7L5DUG7C/events.json","paper":"https://pith.science/paper/BXGUG2ND"},"agent_actions":{"view_html":"https://pith.science/pith/BXGUG2NDDWYUXJU4ZS7L5DUG7C","download_json":"https://pith.science/pith/BXGUG2NDDWYUXJU4ZS7L5DUG7C.json","view_paper":"https://pith.science/paper/BXGUG2ND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09156&json=true","fetch_graph":"https://pith.science/api/pith-number/BXGUG2NDDWYUXJU4ZS7L5DUG7C/graph.json","fetch_events":"https://pith.science/api/pith-number/BXGUG2NDDWYUXJU4ZS7L5DUG7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXGUG2NDDWYUXJU4ZS7L5DUG7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXGUG2NDDWYUXJU4ZS7L5DUG7C/action/storage_attestation","attest_author":"https://pith.science/pith/BXGUG2NDDWYUXJU4ZS7L5DUG7C/action/author_attestation","sign_citation":"https://pith.science/pith/BXGUG2NDDWYUXJU4ZS7L5DUG7C/action/citation_signature","submit_replication":"https://pith.science/pith/BXGUG2NDDWYUXJU4ZS7L5DUG7C/action/replication_record"}},"created_at":"2026-05-17T23:46:04.565112+00:00","updated_at":"2026-05-17T23:46:04.565112+00:00"}