{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IAXP55U22TQDKXXXZAMLZTYW6J","short_pith_number":"pith:IAXP55U2","schema_version":"1.0","canonical_sha256":"402efef69ad4e0355ef7c818bccf16f26e9e65fcddfa1ad1391287088c1af396","source":{"kind":"arxiv","id":"2401.13971","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Qi Deng, Wenzhi Gao","submitted_at":"2024-01-25T06:06:31Z","abstract_excerpt":"This paper considers stochastic weakly convex optimization without the standard Lipschitz continuity assumption. Based on new adaptive regularization (stepsize) strategies, we show that a wide class of stochastic algorithms, including the stochastic subgradient method, preserve the $\\mathcal{O} ( 1 / \\sqrt{K})$ convergence rate with constant failure rate. Our analyses rest on rather weak assumptions: the Lipschitz parameter can be either bounded by a general growth function of $\\|x\\|$ or locally estimated through independent random samples."},"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":"2401.13971","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-01-25T06:06:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"67bb091ca08072dfbe9b2b3d9fbdb59e0bfb9f4bebb640b67b7c46232960a3f8","abstract_canon_sha256":"4f518623b8651b2db2a0a436b259bd5dea7a5bfd930ad576c5996d35af34b199"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:29.438174Z","signature_b64":"8gtnSbQbv+GNQau5L0fOGNa6QEK4RkpotoD18rsEiqShV2/U8D3KocdZWv0cc0ZTEvqps0BeLLgw9UEfOlI7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"402efef69ad4e0355ef7c818bccf16f26e9e65fcddfa1ad1391287088c1af396","last_reissued_at":"2026-07-05T09:31:29.437652Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:29.437652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Qi Deng, Wenzhi Gao","submitted_at":"2024-01-25T06:06:31Z","abstract_excerpt":"This paper considers stochastic weakly convex optimization without the standard Lipschitz continuity assumption. Based on new adaptive regularization (stepsize) strategies, we show that a wide class of stochastic algorithms, including the stochastic subgradient method, preserve the $\\mathcal{O} ( 1 / \\sqrt{K})$ convergence rate with constant failure rate. Our analyses rest on rather weak assumptions: the Lipschitz parameter can be either bounded by a general growth function of $\\|x\\|$ or locally estimated through independent random samples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.13971","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/2401.13971/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":"2401.13971","created_at":"2026-07-05T09:31:29.437712+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.13971v2","created_at":"2026-07-05T09:31:29.437712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.13971","created_at":"2026-07-05T09:31:29.437712+00:00"},{"alias_kind":"pith_short_12","alias_value":"IAXP55U22TQD","created_at":"2026-07-05T09:31:29.437712+00:00"},{"alias_kind":"pith_short_16","alias_value":"IAXP55U22TQDKXXX","created_at":"2026-07-05T09:31:29.437712+00:00"},{"alias_kind":"pith_short_8","alias_value":"IAXP55U2","created_at":"2026-07-05T09:31:29.437712+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17285","citing_title":"An Adaptive Proximal Framework for Stochastic Weakly Convex Optimization","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IAXP55U22TQDKXXXZAMLZTYW6J","json":"https://pith.science/pith/IAXP55U22TQDKXXXZAMLZTYW6J.json","graph_json":"https://pith.science/api/pith-number/IAXP55U22TQDKXXXZAMLZTYW6J/graph.json","events_json":"https://pith.science/api/pith-number/IAXP55U22TQDKXXXZAMLZTYW6J/events.json","paper":"https://pith.science/paper/IAXP55U2"},"agent_actions":{"view_html":"https://pith.science/pith/IAXP55U22TQDKXXXZAMLZTYW6J","download_json":"https://pith.science/pith/IAXP55U22TQDKXXXZAMLZTYW6J.json","view_paper":"https://pith.science/paper/IAXP55U2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.13971&json=true","fetch_graph":"https://pith.science/api/pith-number/IAXP55U22TQDKXXXZAMLZTYW6J/graph.json","fetch_events":"https://pith.science/api/pith-number/IAXP55U22TQDKXXXZAMLZTYW6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IAXP55U22TQDKXXXZAMLZTYW6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IAXP55U22TQDKXXXZAMLZTYW6J/action/storage_attestation","attest_author":"https://pith.science/pith/IAXP55U22TQDKXXXZAMLZTYW6J/action/author_attestation","sign_citation":"https://pith.science/pith/IAXP55U22TQDKXXXZAMLZTYW6J/action/citation_signature","submit_replication":"https://pith.science/pith/IAXP55U22TQDKXXXZAMLZTYW6J/action/replication_record"}},"created_at":"2026-07-05T09:31:29.437712+00:00","updated_at":"2026-07-05T09:31:29.437712+00:00"}