{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2XJ2AIR6YCK5KXVSS3PZQO6ZQT","short_pith_number":"pith:2XJ2AIR6","schema_version":"1.0","canonical_sha256":"d5d3a0223ec095d55eb296df983bd984c7c2ccfb7c262ab28b0f9577b4b3d498","source":{"kind":"arxiv","id":"1803.06523","version":3},"attestation_state":"computed","paper":{"title":"Stochastic model-based minimization of weakly convex functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Damek Davis, Dmitriy Drusvyatskiy","submitted_at":"2018-03-17T15:38:20Z","abstract_excerpt":"We consider a family of algorithms that successively sample and minimize simple stochastic models of the objective function. We show that under reasonable conditions on approximation quality and regularity of the models, any such algorithm drives a natural stationarity measure to zero at the rate $O(k^{-1/4})$. As a consequence, we obtain the first complexity guarantees for the stochastic proximal point, proximal subgradient, and regularized Gauss-Newton methods for minimizing compositions of convex functions with smooth maps. The guiding principle, underlying the complexity guarantees, is tha"},"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":"1803.06523","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T15:38:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c41c3ed6aedef6931223b94bc2c43317ac61b6133caf0813e5c61a941d7e6104","abstract_canon_sha256":"2e3ad96621ca80e53ca311cee61e691c7ba8da8ff1467dcc03dff0cef937ffd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:17.914293Z","signature_b64":"IPVKjLFRuyUuCgXD0/xPwuN1h/Ixmz2fS4V/d75wrzJBRLR3GR2RwqB+T4rL9YEx5IfZF3Uegq8C5mzF2x6MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5d3a0223ec095d55eb296df983bd984c7c2ccfb7c262ab28b0f9577b4b3d498","last_reissued_at":"2026-05-18T00:07:17.913682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:17.913682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic model-based minimization of weakly convex functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Damek Davis, Dmitriy Drusvyatskiy","submitted_at":"2018-03-17T15:38:20Z","abstract_excerpt":"We consider a family of algorithms that successively sample and minimize simple stochastic models of the objective function. We show that under reasonable conditions on approximation quality and regularity of the models, any such algorithm drives a natural stationarity measure to zero at the rate $O(k^{-1/4})$. As a consequence, we obtain the first complexity guarantees for the stochastic proximal point, proximal subgradient, and regularized Gauss-Newton methods for minimizing compositions of convex functions with smooth maps. The guiding principle, underlying the complexity guarantees, is tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06523","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":"1803.06523","created_at":"2026-05-18T00:07:17.913780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06523v3","created_at":"2026-05-18T00:07:17.913780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06523","created_at":"2026-05-18T00:07:17.913780+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XJ2AIR6YCK5","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XJ2AIR6YCK5KXVS","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XJ2AIR6","created_at":"2026-05-18T12:32:02.567920+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/2XJ2AIR6YCK5KXVSS3PZQO6ZQT","json":"https://pith.science/pith/2XJ2AIR6YCK5KXVSS3PZQO6ZQT.json","graph_json":"https://pith.science/api/pith-number/2XJ2AIR6YCK5KXVSS3PZQO6ZQT/graph.json","events_json":"https://pith.science/api/pith-number/2XJ2AIR6YCK5KXVSS3PZQO6ZQT/events.json","paper":"https://pith.science/paper/2XJ2AIR6"},"agent_actions":{"view_html":"https://pith.science/pith/2XJ2AIR6YCK5KXVSS3PZQO6ZQT","download_json":"https://pith.science/pith/2XJ2AIR6YCK5KXVSS3PZQO6ZQT.json","view_paper":"https://pith.science/paper/2XJ2AIR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06523&json=true","fetch_graph":"https://pith.science/api/pith-number/2XJ2AIR6YCK5KXVSS3PZQO6ZQT/graph.json","fetch_events":"https://pith.science/api/pith-number/2XJ2AIR6YCK5KXVSS3PZQO6ZQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XJ2AIR6YCK5KXVSS3PZQO6ZQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XJ2AIR6YCK5KXVSS3PZQO6ZQT/action/storage_attestation","attest_author":"https://pith.science/pith/2XJ2AIR6YCK5KXVSS3PZQO6ZQT/action/author_attestation","sign_citation":"https://pith.science/pith/2XJ2AIR6YCK5KXVSS3PZQO6ZQT/action/citation_signature","submit_replication":"https://pith.science/pith/2XJ2AIR6YCK5KXVSS3PZQO6ZQT/action/replication_record"}},"created_at":"2026-05-18T00:07:17.913780+00:00","updated_at":"2026-05-18T00:07:17.913780+00:00"}