{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YFGRGOWOIOWR7A43JWNMTND7YL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1d7c2189669394bdd31df7be902f0c2df2c718149c392bf7b1249da491ca862f","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-01T02:08:32Z","title_canon_sha256":"f5cb6dda6bfe7a20657f9f367e335f20c33a5949dc0ac910ebb3b75a81feead3"},"schema_version":"1.0","source":{"id":"1703.00102","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00102","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00102v2","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00102","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"pith_short_12","alias_value":"YFGRGOWOIOWR","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YFGRGOWOIOWR7A43","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YFGRGOWO","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:87a3a9552d0b3852e505ef5e2ba0ecd36e87c89093ae07bceeab9d546d41010a","target":"graph","created_at":"2026-05-18T00:35:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we propose a StochAstic Recursive grAdient algoritHm (SARAH), as well as its practical variant SARAH+, as a novel approach to the finite-sum minimization problems. Different from the vanilla SGD and other modern stochastic methods such as SVRG, S2GD, SAG and SAGA, SARAH admits a simple recursive framework for updating stochastic gradient estimates; when comparing to SAG/SAGA, SARAH does not require a storage of past gradients. The linear convergence rate of SARAH is proven under strong convexity assumption. We also prove a linear convergence rate (in the strongly convex case) fo","authors_text":"Jie Liu, Katya Scheinberg, Lam M. Nguyen, Martin Tak\\'a\\v{c}","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-01T02:08:32Z","title":"SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00102","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:caea596e865d8be4c1f2477cda5dc89db95f303dbf15318eb479fe356814dd6b","target":"record","created_at":"2026-05-18T00:35:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1d7c2189669394bdd31df7be902f0c2df2c718149c392bf7b1249da491ca862f","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-01T02:08:32Z","title_canon_sha256":"f5cb6dda6bfe7a20657f9f367e335f20c33a5949dc0ac910ebb3b75a81feead3"},"schema_version":"1.0","source":{"id":"1703.00102","kind":"arxiv","version":2}},"canonical_sha256":"c14d133ace43ad1f839b4d9ac9b47fc2db9bc12075e704e3914cef9eb9f752a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c14d133ace43ad1f839b4d9ac9b47fc2db9bc12075e704e3914cef9eb9f752a0","first_computed_at":"2026-05-18T00:35:51.488019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:51.488019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MShVH+rPDwby0J+qvjYJg9xGvv1UKHgoKNMBaQDv2j4HqJQv3v8880bc5sWWHzYnpkiVqxCnSdfeLIBb25MdAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:51.488569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00102","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:caea596e865d8be4c1f2477cda5dc89db95f303dbf15318eb479fe356814dd6b","sha256:87a3a9552d0b3852e505ef5e2ba0ecd36e87c89093ae07bceeab9d546d41010a"],"state_sha256":"8c54b6e1ce96d8189714c48be801043ecf26d998f9ac3ee379ca88b07858c2b6"}