{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QHXBZFZ772AET5YU2L5GD5ZNED","short_pith_number":"pith:QHXBZFZ7","schema_version":"1.0","canonical_sha256":"81ee1c973ffe8049f714d2fa61f72d20edd613f05cb9db540abfb1fb56878497","source":{"kind":"arxiv","id":"1907.11687","version":2},"attestation_state":"computed","paper":{"title":"Incremental Methods for Weakly Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Anthony Man-Cho So, Jason D Lee, Xiao Li, Zhihui Zhu","submitted_at":"2019-07-26T17:39:32Z","abstract_excerpt":"Incremental methods are widely utilized for solving finite-sum optimization problems in machine learning and signal processing. In this paper, we study a family of incremental methods -- including incremental subgradient, incremental proximal point, and incremental prox-linear methods -- for solving weakly convex optimization problems. Such a problem class covers many nonsmooth nonconvex instances that arise in engineering fields. We show that the three said incremental methods have an iteration complexity of $O(\\varepsilon^{-4})$ for driving a natural stationarity measure to below $\\varepsilo"},"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":"1907.11687","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-26T17:39:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5362c379219230132124e9b7c6d9cdc8955f3c95b0b13f85cceb3b5410bf7af1","abstract_canon_sha256":"c654100ace82a5449848762753c7df291e183a083a3daf743d2d7ba50c841ad7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:27:58.265432Z","signature_b64":"NQle5qF9Qhu2Ix4ldhexe6jfRtqqCSZM9scFn/8cWEo2VzJZROextOXIqncHsqMkkycEZU/gcco0j0ivE4IUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81ee1c973ffe8049f714d2fa61f72d20edd613f05cb9db540abfb1fb56878497","last_reissued_at":"2026-07-05T05:27:58.265018Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:27:58.265018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Methods for Weakly Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Anthony Man-Cho So, Jason D Lee, Xiao Li, Zhihui Zhu","submitted_at":"2019-07-26T17:39:32Z","abstract_excerpt":"Incremental methods are widely utilized for solving finite-sum optimization problems in machine learning and signal processing. In this paper, we study a family of incremental methods -- including incremental subgradient, incremental proximal point, and incremental prox-linear methods -- for solving weakly convex optimization problems. Such a problem class covers many nonsmooth nonconvex instances that arise in engineering fields. We show that the three said incremental methods have an iteration complexity of $O(\\varepsilon^{-4})$ for driving a natural stationarity measure to below $\\varepsilo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11687","kind":"arxiv","version":2},"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/1907.11687/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":"1907.11687","created_at":"2026-07-05T05:27:58.265066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.11687v2","created_at":"2026-07-05T05:27:58.265066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11687","created_at":"2026-07-05T05:27:58.265066+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHXBZFZ772AE","created_at":"2026-07-05T05:27:58.265066+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHXBZFZ772AET5YU","created_at":"2026-07-05T05:27:58.265066+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHXBZFZ7","created_at":"2026-07-05T05:27:58.265066+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14345","citing_title":"Convergence of difference inclusions via a diameter criterion","ref_index":300,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHXBZFZ772AET5YU2L5GD5ZNED","json":"https://pith.science/pith/QHXBZFZ772AET5YU2L5GD5ZNED.json","graph_json":"https://pith.science/api/pith-number/QHXBZFZ772AET5YU2L5GD5ZNED/graph.json","events_json":"https://pith.science/api/pith-number/QHXBZFZ772AET5YU2L5GD5ZNED/events.json","paper":"https://pith.science/paper/QHXBZFZ7"},"agent_actions":{"view_html":"https://pith.science/pith/QHXBZFZ772AET5YU2L5GD5ZNED","download_json":"https://pith.science/pith/QHXBZFZ772AET5YU2L5GD5ZNED.json","view_paper":"https://pith.science/paper/QHXBZFZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.11687&json=true","fetch_graph":"https://pith.science/api/pith-number/QHXBZFZ772AET5YU2L5GD5ZNED/graph.json","fetch_events":"https://pith.science/api/pith-number/QHXBZFZ772AET5YU2L5GD5ZNED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHXBZFZ772AET5YU2L5GD5ZNED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHXBZFZ772AET5YU2L5GD5ZNED/action/storage_attestation","attest_author":"https://pith.science/pith/QHXBZFZ772AET5YU2L5GD5ZNED/action/author_attestation","sign_citation":"https://pith.science/pith/QHXBZFZ772AET5YU2L5GD5ZNED/action/citation_signature","submit_replication":"https://pith.science/pith/QHXBZFZ772AET5YU2L5GD5ZNED/action/replication_record"}},"created_at":"2026-07-05T05:27:58.265066+00:00","updated_at":"2026-07-05T05:27:58.265066+00:00"}