{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7TQP5ZDGF2YNQPYSAZOC4JA6MU","short_pith_number":"pith:7TQP5ZDG","schema_version":"1.0","canonical_sha256":"fce0fee4662eb0d83f12065c2e241e6513ce74280d6823b4cb622b3f65e1610a","source":{"kind":"arxiv","id":"1802.04477","version":4},"attestation_state":"computed","paper":{"title":"A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Jian Li, Zhize Li","submitted_at":"2018-02-13T06:34:22Z","abstract_excerpt":"We analyze stochastic gradient algorithms for optimizing nonconvex, nonsmooth finite-sum problems. In particular, the objective function is given by the summation of a differentiable (possibly nonconvex) component, together with a possibly non-differentiable but convex component. We propose a proximal stochastic gradient algorithm based on variance reduction, called ProxSVRG+. Our main contribution lies in the analysis of ProxSVRG+. It recovers several existing convergence results and improves/generalizes them (in terms of the number of stochastic gradient oracle calls and proximal oracle call"},"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":"1802.04477","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-13T06:34:22Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"a6ece4e919bf66586794623b987033c7c31d57985bdf9d626aa648453d7284fb","abstract_canon_sha256":"05cfd05628b2088164d6002fa787ab3087a3346270230c14617685a2c0ad1384"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:22.940619Z","signature_b64":"lsJ8RpWta1grU5nh8qFdung9h8jHSALC+UuUhWiRIjVnA2fjlSFIJfEOf3pLZecZ+aEUxUdrF4zcKdVWW4aXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fce0fee4662eb0d83f12065c2e241e6513ce74280d6823b4cb622b3f65e1610a","last_reissued_at":"2026-05-17T23:59:22.940189Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:22.940189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Jian Li, Zhize Li","submitted_at":"2018-02-13T06:34:22Z","abstract_excerpt":"We analyze stochastic gradient algorithms for optimizing nonconvex, nonsmooth finite-sum problems. In particular, the objective function is given by the summation of a differentiable (possibly nonconvex) component, together with a possibly non-differentiable but convex component. We propose a proximal stochastic gradient algorithm based on variance reduction, called ProxSVRG+. Our main contribution lies in the analysis of ProxSVRG+. It recovers several existing convergence results and improves/generalizes them (in terms of the number of stochastic gradient oracle calls and proximal oracle call"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04477","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":""},"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":"1802.04477","created_at":"2026-05-17T23:59:22.940248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04477v4","created_at":"2026-05-17T23:59:22.940248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04477","created_at":"2026-05-17T23:59:22.940248+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TQP5ZDGF2YN","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TQP5ZDGF2YNQPYS","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TQP5ZDG","created_at":"2026-05-18T12:32:11.075285+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/7TQP5ZDGF2YNQPYSAZOC4JA6MU","json":"https://pith.science/pith/7TQP5ZDGF2YNQPYSAZOC4JA6MU.json","graph_json":"https://pith.science/api/pith-number/7TQP5ZDGF2YNQPYSAZOC4JA6MU/graph.json","events_json":"https://pith.science/api/pith-number/7TQP5ZDGF2YNQPYSAZOC4JA6MU/events.json","paper":"https://pith.science/paper/7TQP5ZDG"},"agent_actions":{"view_html":"https://pith.science/pith/7TQP5ZDGF2YNQPYSAZOC4JA6MU","download_json":"https://pith.science/pith/7TQP5ZDGF2YNQPYSAZOC4JA6MU.json","view_paper":"https://pith.science/paper/7TQP5ZDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04477&json=true","fetch_graph":"https://pith.science/api/pith-number/7TQP5ZDGF2YNQPYSAZOC4JA6MU/graph.json","fetch_events":"https://pith.science/api/pith-number/7TQP5ZDGF2YNQPYSAZOC4JA6MU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TQP5ZDGF2YNQPYSAZOC4JA6MU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TQP5ZDGF2YNQPYSAZOC4JA6MU/action/storage_attestation","attest_author":"https://pith.science/pith/7TQP5ZDGF2YNQPYSAZOC4JA6MU/action/author_attestation","sign_citation":"https://pith.science/pith/7TQP5ZDGF2YNQPYSAZOC4JA6MU/action/citation_signature","submit_replication":"https://pith.science/pith/7TQP5ZDGF2YNQPYSAZOC4JA6MU/action/replication_record"}},"created_at":"2026-05-17T23:59:22.940248+00:00","updated_at":"2026-05-17T23:59:22.940248+00:00"}