{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OEU2TEKCGHBKQF3F5AJ4KTWBXD","short_pith_number":"pith:OEU2TEKC","schema_version":"1.0","canonical_sha256":"7129a9914231c2a81765e813c54ec1b8e76f3c553fccc86c0fc6783200454b82","source":{"kind":"arxiv","id":"1908.08394","version":1},"attestation_state":"computed","paper":{"title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Guangzeng Xie, Luo Luo, Zhihua Zhang","submitted_at":"2019-08-22T14:02:46Z","abstract_excerpt":"This paper studies the lower bound complexity for the optimization problem whose objective function is the average of $n$ individual smooth convex functions. We consider the algorithm which gets access to gradient and proximal oracle for each individual component. For the strongly-convex case, we prove such an algorithm can not reach an $\\varepsilon$-suboptimal point in fewer than $\\Omega((n+\\sqrt{\\kappa n})\\log(1/\\varepsilon))$ iterations, where $\\kappa$ is the condition number of the objective function. This lower bound is tighter than previous results and perfectly matches the upper bound o"},"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":"1908.08394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-22T14:02:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"f7b981f2754e3ce870c0e404f040716dad418839401d11fb892098aed5f3e31b","abstract_canon_sha256":"fea594aa85bf55f54bc7132bb0067763708569ae96765ced5858ea677e3d0c9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:12.474601Z","signature_b64":"rNHjQKOnUa/rEhEuXqF2Jnul+3t/SvJQ7wFstjbeUSv9QllNDn/ybzRV4aUfsFB9aQdKyAiDWST34vEHW8MHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7129a9914231c2a81765e813c54ec1b8e76f3c553fccc86c0fc6783200454b82","last_reissued_at":"2026-07-04T23:59:12.474212Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:12.474212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Guangzeng Xie, Luo Luo, Zhihua Zhang","submitted_at":"2019-08-22T14:02:46Z","abstract_excerpt":"This paper studies the lower bound complexity for the optimization problem whose objective function is the average of $n$ individual smooth convex functions. We consider the algorithm which gets access to gradient and proximal oracle for each individual component. For the strongly-convex case, we prove such an algorithm can not reach an $\\varepsilon$-suboptimal point in fewer than $\\Omega((n+\\sqrt{\\kappa n})\\log(1/\\varepsilon))$ iterations, where $\\kappa$ is the condition number of the objective function. This lower bound is tighter than previous results and perfectly matches the upper bound o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08394","kind":"arxiv","version":1},"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/1908.08394/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":"1908.08394","created_at":"2026-07-04T23:59:12.474279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08394v1","created_at":"2026-07-04T23:59:12.474279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08394","created_at":"2026-07-04T23:59:12.474279+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEU2TEKCGHBK","created_at":"2026-07-04T23:59:12.474279+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEU2TEKCGHBKQF3F","created_at":"2026-07-04T23:59:12.474279+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEU2TEKC","created_at":"2026-07-04T23:59:12.474279+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/OEU2TEKCGHBKQF3F5AJ4KTWBXD","json":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD.json","graph_json":"https://pith.science/api/pith-number/OEU2TEKCGHBKQF3F5AJ4KTWBXD/graph.json","events_json":"https://pith.science/api/pith-number/OEU2TEKCGHBKQF3F5AJ4KTWBXD/events.json","paper":"https://pith.science/paper/OEU2TEKC"},"agent_actions":{"view_html":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD","download_json":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD.json","view_paper":"https://pith.science/paper/OEU2TEKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08394&json=true","fetch_graph":"https://pith.science/api/pith-number/OEU2TEKCGHBKQF3F5AJ4KTWBXD/graph.json","fetch_events":"https://pith.science/api/pith-number/OEU2TEKCGHBKQF3F5AJ4KTWBXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD/action/storage_attestation","attest_author":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD/action/author_attestation","sign_citation":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD/action/citation_signature","submit_replication":"https://pith.science/pith/OEU2TEKCGHBKQF3F5AJ4KTWBXD/action/replication_record"}},"created_at":"2026-07-04T23:59:12.474279+00:00","updated_at":"2026-07-04T23:59:12.474279+00:00"}