{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FTEYHLSKEU7ZM2KUEBBIYCVZJ2","short_pith_number":"pith:FTEYHLSK","schema_version":"1.0","canonical_sha256":"2cc983ae4a253f96695420428c0ab94ea802998f4531748bb0ad794da1d045f4","source":{"kind":"arxiv","id":"1902.07672","version":4},"attestation_state":"computed","paper":{"title":"Non-asymptotic Analysis of Stochastic Methods for Non-Smooth Non-Convex Regularized Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Rong Jin, Tianbao Yang, Yi Xu","submitted_at":"2019-02-20T17:37:00Z","abstract_excerpt":"Stochastic Proximal Gradient (SPG) methods have been widely used for solving optimization problems with a simple (possibly non-smooth) regularizer in machine learning and statistics. However, to the best of our knowledge no non-asymptotic convergence analysis of SPG exists for non-convex optimization with a non-smooth and non-convex regularizer. All existing non-asymptotic analysis of SPG for solving non-smooth non-convex problems require the non-smooth regularizer to be a convex function, and hence are not applicable to a non-smooth non-convex regularized problem. This work initiates the anal"},"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":"1902.07672","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-20T17:37:00Z","cross_cats_sorted":[],"title_canon_sha256":"328b46dff24a149aa8bc48b16e7ddc89a58e33301cd985331f70783f9a2447ce","abstract_canon_sha256":"ff72d369ef0b8844a12b788e3f9ad2483f56e9fb6b3faab7eb384f81725313ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:59.371484Z","signature_b64":"k7hp0ldsY4LJTqonBuRSRMneaDFh0aAEg4fV4qiGi+olnIs9l5T4wcQgghslQ4dTjlMDMPGujvPDYOghJukYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cc983ae4a253f96695420428c0ab94ea802998f4531748bb0ad794da1d045f4","last_reissued_at":"2026-07-05T00:19:59.370986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:59.370986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-asymptotic Analysis of Stochastic Methods for Non-Smooth Non-Convex Regularized Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Rong Jin, Tianbao Yang, Yi Xu","submitted_at":"2019-02-20T17:37:00Z","abstract_excerpt":"Stochastic Proximal Gradient (SPG) methods have been widely used for solving optimization problems with a simple (possibly non-smooth) regularizer in machine learning and statistics. However, to the best of our knowledge no non-asymptotic convergence analysis of SPG exists for non-convex optimization with a non-smooth and non-convex regularizer. All existing non-asymptotic analysis of SPG for solving non-smooth non-convex problems require the non-smooth regularizer to be a convex function, and hence are not applicable to a non-smooth non-convex regularized problem. This work initiates the anal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07672","kind":"arxiv","version":4},"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/1902.07672/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":"1902.07672","created_at":"2026-07-05T00:19:59.371050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07672v4","created_at":"2026-07-05T00:19:59.371050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07672","created_at":"2026-07-05T00:19:59.371050+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTEYHLSKEU7Z","created_at":"2026-07-05T00:19:59.371050+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTEYHLSKEU7ZM2KU","created_at":"2026-07-05T00:19:59.371050+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTEYHLSK","created_at":"2026-07-05T00:19:59.371050+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09941","citing_title":"Stochastic Optimization for Non-convex Inf-Projection Problems","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FTEYHLSKEU7ZM2KUEBBIYCVZJ2","json":"https://pith.science/pith/FTEYHLSKEU7ZM2KUEBBIYCVZJ2.json","graph_json":"https://pith.science/api/pith-number/FTEYHLSKEU7ZM2KUEBBIYCVZJ2/graph.json","events_json":"https://pith.science/api/pith-number/FTEYHLSKEU7ZM2KUEBBIYCVZJ2/events.json","paper":"https://pith.science/paper/FTEYHLSK"},"agent_actions":{"view_html":"https://pith.science/pith/FTEYHLSKEU7ZM2KUEBBIYCVZJ2","download_json":"https://pith.science/pith/FTEYHLSKEU7ZM2KUEBBIYCVZJ2.json","view_paper":"https://pith.science/paper/FTEYHLSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07672&json=true","fetch_graph":"https://pith.science/api/pith-number/FTEYHLSKEU7ZM2KUEBBIYCVZJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/FTEYHLSKEU7ZM2KUEBBIYCVZJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTEYHLSKEU7ZM2KUEBBIYCVZJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTEYHLSKEU7ZM2KUEBBIYCVZJ2/action/storage_attestation","attest_author":"https://pith.science/pith/FTEYHLSKEU7ZM2KUEBBIYCVZJ2/action/author_attestation","sign_citation":"https://pith.science/pith/FTEYHLSKEU7ZM2KUEBBIYCVZJ2/action/citation_signature","submit_replication":"https://pith.science/pith/FTEYHLSKEU7ZM2KUEBBIYCVZJ2/action/replication_record"}},"created_at":"2026-07-05T00:19:59.371050+00:00","updated_at":"2026-07-05T00:19:59.371050+00:00"}