{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XA6NEFLKWAJB5OLT42LJHI5PRE","short_pith_number":"pith:XA6NEFLK","schema_version":"1.0","canonical_sha256":"b83cd2156ab0121eb973e69693a3af890d8ef633361c0f3aae1e96873bcc5743","source":{"kind":"arxiv","id":"2302.06032","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimal Non-Convex Stochastic Optimization under Generalized Smoothness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Srikanth Jagabathula, Zhengyuan Zhou, Zijian Liu","submitted_at":"2023-02-13T00:22:28Z","abstract_excerpt":"The generalized smooth condition, $(L_{0},L_{1})$-smoothness, has triggered people's interest since it is more realistic in many optimization problems shown by both empirical and theoretical evidence. Two recent works established the $O(\\epsilon^{-3})$ sample complexity to obtain an $O(\\epsilon)$-stationary point. However, both require a large batch size on the order of $\\mathrm{ploy}(\\epsilon^{-1})$, which is not only computationally burdensome but also unsuitable for streaming applications. Additionally, these existing convergence bounds are established only for the expected rate, which is i"},"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":"2302.06032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-13T00:22:28Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9086d9de0569e62152f71ba5f160b384dbd9de2134d54e60d249a20b67103463","abstract_canon_sha256":"47d6283f0532af59c1652b9dce3636069a6dfb81743ff41bf6ea206bd8bf89b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:06:01.913295Z","signature_b64":"iaVEdzL86HcVMg9mQt13haUmf0iBpDEm/QlqWZsbhcUm36pUZX3Pfly8SnWLL3BbkkoVxSIO8mOnbW/hWdttCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b83cd2156ab0121eb973e69693a3af890d8ef633361c0f3aae1e96873bcc5743","last_reissued_at":"2026-07-05T07:06:01.912885Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:06:01.912885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Non-Convex Stochastic Optimization under Generalized Smoothness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Srikanth Jagabathula, Zhengyuan Zhou, Zijian Liu","submitted_at":"2023-02-13T00:22:28Z","abstract_excerpt":"The generalized smooth condition, $(L_{0},L_{1})$-smoothness, has triggered people's interest since it is more realistic in many optimization problems shown by both empirical and theoretical evidence. Two recent works established the $O(\\epsilon^{-3})$ sample complexity to obtain an $O(\\epsilon)$-stationary point. However, both require a large batch size on the order of $\\mathrm{ploy}(\\epsilon^{-1})$, which is not only computationally burdensome but also unsuitable for streaming applications. Additionally, these existing convergence bounds are established only for the expected rate, which is i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06032","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/2302.06032/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":"2302.06032","created_at":"2026-07-05T07:06:01.912944+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06032v2","created_at":"2026-07-05T07:06:01.912944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06032","created_at":"2026-07-05T07:06:01.912944+00:00"},{"alias_kind":"pith_short_12","alias_value":"XA6NEFLKWAJB","created_at":"2026-07-05T07:06:01.912944+00:00"},{"alias_kind":"pith_short_16","alias_value":"XA6NEFLKWAJB5OLT","created_at":"2026-07-05T07:06:01.912944+00:00"},{"alias_kind":"pith_short_8","alias_value":"XA6NEFLK","created_at":"2026-07-05T07:06:01.912944+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19529","citing_title":"Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XA6NEFLKWAJB5OLT42LJHI5PRE","json":"https://pith.science/pith/XA6NEFLKWAJB5OLT42LJHI5PRE.json","graph_json":"https://pith.science/api/pith-number/XA6NEFLKWAJB5OLT42LJHI5PRE/graph.json","events_json":"https://pith.science/api/pith-number/XA6NEFLKWAJB5OLT42LJHI5PRE/events.json","paper":"https://pith.science/paper/XA6NEFLK"},"agent_actions":{"view_html":"https://pith.science/pith/XA6NEFLKWAJB5OLT42LJHI5PRE","download_json":"https://pith.science/pith/XA6NEFLKWAJB5OLT42LJHI5PRE.json","view_paper":"https://pith.science/paper/XA6NEFLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06032&json=true","fetch_graph":"https://pith.science/api/pith-number/XA6NEFLKWAJB5OLT42LJHI5PRE/graph.json","fetch_events":"https://pith.science/api/pith-number/XA6NEFLKWAJB5OLT42LJHI5PRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XA6NEFLKWAJB5OLT42LJHI5PRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XA6NEFLKWAJB5OLT42LJHI5PRE/action/storage_attestation","attest_author":"https://pith.science/pith/XA6NEFLKWAJB5OLT42LJHI5PRE/action/author_attestation","sign_citation":"https://pith.science/pith/XA6NEFLKWAJB5OLT42LJHI5PRE/action/citation_signature","submit_replication":"https://pith.science/pith/XA6NEFLKWAJB5OLT42LJHI5PRE/action/replication_record"}},"created_at":"2026-07-05T07:06:01.912944+00:00","updated_at":"2026-07-05T07:06:01.912944+00:00"}