{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WKA57EZJTLMD72RZHVH35D4QL6","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":"d0d1d50295920cd1a12b713e1eb4a03990345235c136910fdd935800049145ca","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T06:16:45Z","title_canon_sha256":"deed7ed28a5c7f8db142380042079f54d6a8e7af0ee498a1a8023cc7f7d6a0b7"},"schema_version":"1.0","source":{"id":"1901.11224","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.11224","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.11224v1","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11224","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"pith_short_12","alias_value":"WKA57EZJTLMD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WKA57EZJTLMD72RZ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WKA57EZJ","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:28571c504b9adf069b478f7654e14248f1097c34142671b6fda2f9eec91622fb","target":"graph","created_at":"2026-05-17T23:55:02Z","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"},"paper":{"abstract_excerpt":"Smooth finite-sum optimization has been widely studied in both convex and nonconvex settings. However, existing lower bounds for finite-sum optimization are mostly limited to the setting where each component function is (strongly) convex, while the lower bounds for nonconvex finite-sum optimization remain largely unsolved. In this paper, we study the lower bounds for smooth nonconvex finite-sum optimization, where the objective function is the average of $n$ nonconvex component functions. We prove tight lower bounds for the complexity of finding $\\epsilon$-suboptimal point and $\\epsilon$-appro","authors_text":"Dongruo Zhou, Quanquan Gu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T06:16:45Z","title":"Lower Bounds for Smooth Nonconvex Finite-Sum Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11224","kind":"arxiv","version":1},"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:a0b4be44ee82ca1bb6ee20bbfdca5a7baa3789b1b902a4ac276ff1703e183e2c","target":"record","created_at":"2026-05-17T23:55:02Z","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":"d0d1d50295920cd1a12b713e1eb4a03990345235c136910fdd935800049145ca","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T06:16:45Z","title_canon_sha256":"deed7ed28a5c7f8db142380042079f54d6a8e7af0ee498a1a8023cc7f7d6a0b7"},"schema_version":"1.0","source":{"id":"1901.11224","kind":"arxiv","version":1}},"canonical_sha256":"b281df93299ad83fea393d4fbe8f905f8252207a9ee8777647798c2b15291bd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b281df93299ad83fea393d4fbe8f905f8252207a9ee8777647798c2b15291bd9","first_computed_at":"2026-05-17T23:55:02.394357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:02.394357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QYpupLvSWebiI3Lnhj6I8gXJHOfG0kk0LBbapXfwFLrGJX05/OKS90k7jRs5TAbAgeA8i6LzWVugggkSE163CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:02.394963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.11224","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0b4be44ee82ca1bb6ee20bbfdca5a7baa3789b1b902a4ac276ff1703e183e2c","sha256:28571c504b9adf069b478f7654e14248f1097c34142671b6fda2f9eec91622fb"],"state_sha256":"c5f0041273adb7679dcbecf42ec6cf38085af67c8e29227d02767154e40bfc23"}