{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VVJAVDJHTLC44UUVMBXGYEZEUZ","short_pith_number":"pith:VVJAVDJH","schema_version":"1.0","canonical_sha256":"ad520a8d279ac5ce5295606e6c1324a67fbb2ac5c281e44f318f02f0015f69a8","source":{"kind":"arxiv","id":"1707.03505","version":5},"attestation_state":"computed","paper":{"title":"Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Benjamin Grimmer, Damek Davis","submitted_at":"2017-07-12T00:35:43Z","abstract_excerpt":"In this paper, we introduce a stochastic projected subgradient method for weakly convex (i.e., uniformly prox-regular) nonsmooth, nonconvex functions---a wide class of functions which includes the additive and convex composite classes. At a high-level, the method is an inexact proximal point iteration in which the strongly convex proximal subproblems are quickly solved with a specialized stochastic projected subgradient method. The primary contribution of this paper is a simple proof that the proposed algorithm converges at the same rate as the stochastic gradient method for smooth nonconvex p"},"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":"1707.03505","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-12T00:35:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d95f2b00c2134bc1a37a175efe05f87c779f6f18905d046c33272c3a81b3682c","abstract_canon_sha256":"3cfca8416206f8f18cdda04077195fb5ed54c03413c1f5cdf04d1b809a7eb9df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:34.421491Z","signature_b64":"xjhC4zFZRW6cbhclRXThSsKxNzCweDfZpr936Qu08GD0ASLrZeZ+GhLmi8z9x5tDi9LW08hdQpFfBDUk0hAxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad520a8d279ac5ce5295606e6c1324a67fbb2ac5c281e44f318f02f0015f69a8","last_reissued_at":"2026-05-18T00:05:34.421083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:34.421083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Benjamin Grimmer, Damek Davis","submitted_at":"2017-07-12T00:35:43Z","abstract_excerpt":"In this paper, we introduce a stochastic projected subgradient method for weakly convex (i.e., uniformly prox-regular) nonsmooth, nonconvex functions---a wide class of functions which includes the additive and convex composite classes. At a high-level, the method is an inexact proximal point iteration in which the strongly convex proximal subproblems are quickly solved with a specialized stochastic projected subgradient method. The primary contribution of this paper is a simple proof that the proposed algorithm converges at the same rate as the stochastic gradient method for smooth nonconvex p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03505","kind":"arxiv","version":5},"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":"1707.03505","created_at":"2026-05-18T00:05:34.421145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03505v5","created_at":"2026-05-18T00:05:34.421145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03505","created_at":"2026-05-18T00:05:34.421145+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVJAVDJHTLC4","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVJAVDJHTLC44UUV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVJAVDJH","created_at":"2026-05-18T12:31:49.984773+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/VVJAVDJHTLC44UUVMBXGYEZEUZ","json":"https://pith.science/pith/VVJAVDJHTLC44UUVMBXGYEZEUZ.json","graph_json":"https://pith.science/api/pith-number/VVJAVDJHTLC44UUVMBXGYEZEUZ/graph.json","events_json":"https://pith.science/api/pith-number/VVJAVDJHTLC44UUVMBXGYEZEUZ/events.json","paper":"https://pith.science/paper/VVJAVDJH"},"agent_actions":{"view_html":"https://pith.science/pith/VVJAVDJHTLC44UUVMBXGYEZEUZ","download_json":"https://pith.science/pith/VVJAVDJHTLC44UUVMBXGYEZEUZ.json","view_paper":"https://pith.science/paper/VVJAVDJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03505&json=true","fetch_graph":"https://pith.science/api/pith-number/VVJAVDJHTLC44UUVMBXGYEZEUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VVJAVDJHTLC44UUVMBXGYEZEUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVJAVDJHTLC44UUVMBXGYEZEUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVJAVDJHTLC44UUVMBXGYEZEUZ/action/storage_attestation","attest_author":"https://pith.science/pith/VVJAVDJHTLC44UUVMBXGYEZEUZ/action/author_attestation","sign_citation":"https://pith.science/pith/VVJAVDJHTLC44UUVMBXGYEZEUZ/action/citation_signature","submit_replication":"https://pith.science/pith/VVJAVDJHTLC44UUVMBXGYEZEUZ/action/replication_record"}},"created_at":"2026-05-18T00:05:34.421145+00:00","updated_at":"2026-05-18T00:05:34.421145+00:00"}