{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6DISIHWMSXLSWE3QPD3FK5TEUK","short_pith_number":"pith:6DISIHWM","canonical_record":{"source":{"id":"1905.05920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-15T02:38:03Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d542134fa1e5f437aa063a7c456b06d3331ba85a74d16cc0f757d91707815cd9","abstract_canon_sha256":"6c024577c21dc97f92e02a4b017adc3bddca5fa1eeb2e08e0690dfdc11ff75bd"},"schema_version":"1.0"},"canonical_sha256":"f0d1241ecc95d72b137078f6557664a28b15cef0d8ea55f8680eed7f959721da","source":{"kind":"arxiv","id":"1905.05920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05920","created_at":"2026-05-17T23:46:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05920v1","created_at":"2026-05-17T23:46:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05920","created_at":"2026-05-17T23:46:08Z"},{"alias_kind":"pith_short_12","alias_value":"6DISIHWMSXLS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6DISIHWMSXLSWE3Q","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6DISIHWM","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6DISIHWMSXLSWE3QPD3FK5TEUK","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-15T02:38:03Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d542134fa1e5f437aa063a7c456b06d3331ba85a74d16cc0f757d91707815cd9","abstract_canon_sha256":"6c024577c21dc97f92e02a4b017adc3bddca5fa1eeb2e08e0690dfdc11ff75bd"},"schema_version":"1.0"},"canonical_sha256":"f0d1241ecc95d72b137078f6557664a28b15cef0d8ea55f8680eed7f959721da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:08.097137Z","signature_b64":"eo7XQuc1nMR1eCViy7lYOvx1j712NwGupXVuP00FE0Prufo+NhCfJ/pR/4OpmENlDD/Do+ulVRbeuWuDjIYMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0d1241ecc95d72b137078f6557664a28b15cef0d8ea55f8680eed7f959721da","last_reissued_at":"2026-05-17T23:46:08.096547Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:08.096547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05920","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vTpNI/qrnuhsgPfeeo+DOFA6xngf9p6oDYDVz3LfLwEpcgTrbcXP9IWpEq55NI408/3DT+n6rwAYctLh4RfYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:42:30.387011Z"},"content_sha256":"e1c7ea6b65a89671c1fee0a0bddb6dc4207a7af421f6c28d0d256810ce7a919f","schema_version":"1.0","event_id":"sha256:e1c7ea6b65a89671c1fee0a0bddb6dc4207a7af421f6c28d0d256810ce7a919f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6DISIHWMSXLSWE3QPD3FK5TEUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid Stochastic Gradient Descent Algorithms for Stochastic Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Dzung T. Phan, Lam M. Nguyen, Nhan H. Pham, Quoc Tran-Dinh","submitted_at":"2019-05-15T02:38:03Z","abstract_excerpt":"We introduce a hybrid stochastic estimator to design stochastic gradient algorithms for solving stochastic optimization problems. Such a hybrid estimator is a convex combination of two existing biased and unbiased estimators and leads to some useful property on its variance. We limit our consideration to a hybrid SARAH-SGD for nonconvex expectation problems. However, our idea can be extended to handle a broader class of estimators in both convex and nonconvex settings. We propose a new single-loop stochastic gradient descent algorithm that can achieve $O(\\max\\{\\sigma^3\\varepsilon^{-1},\\sigma\\v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05920","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Zxb3XfWaYxaIF2LDbYlOnAt/GzbE7awhF2jOBzardQqsd6o987rSmXe+1XtcCHo/brMsU1DSvSlAazFfMEqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:42:30.387696Z"},"content_sha256":"f7ffe1fd792d4f96ec4b5102bb8befc233573d8b0048e8dfd2650e825c220010","schema_version":"1.0","event_id":"sha256:f7ffe1fd792d4f96ec4b5102bb8befc233573d8b0048e8dfd2650e825c220010"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DISIHWMSXLSWE3QPD3FK5TEUK/bundle.json","state_url":"https://pith.science/pith/6DISIHWMSXLSWE3QPD3FK5TEUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DISIHWMSXLSWE3QPD3FK5TEUK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T15:42:30Z","links":{"resolver":"https://pith.science/pith/6DISIHWMSXLSWE3QPD3FK5TEUK","bundle":"https://pith.science/pith/6DISIHWMSXLSWE3QPD3FK5TEUK/bundle.json","state":"https://pith.science/pith/6DISIHWMSXLSWE3QPD3FK5TEUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DISIHWMSXLSWE3QPD3FK5TEUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6DISIHWMSXLSWE3QPD3FK5TEUK","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":"6c024577c21dc97f92e02a4b017adc3bddca5fa1eeb2e08e0690dfdc11ff75bd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-15T02:38:03Z","title_canon_sha256":"d542134fa1e5f437aa063a7c456b06d3331ba85a74d16cc0f757d91707815cd9"},"schema_version":"1.0","source":{"id":"1905.05920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05920","created_at":"2026-05-17T23:46:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05920v1","created_at":"2026-05-17T23:46:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05920","created_at":"2026-05-17T23:46:08Z"},{"alias_kind":"pith_short_12","alias_value":"6DISIHWMSXLS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6DISIHWMSXLSWE3Q","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6DISIHWM","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:f7ffe1fd792d4f96ec4b5102bb8befc233573d8b0048e8dfd2650e825c220010","target":"graph","created_at":"2026-05-17T23:46:08Z","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":"We introduce a hybrid stochastic estimator to design stochastic gradient algorithms for solving stochastic optimization problems. Such a hybrid estimator is a convex combination of two existing biased and unbiased estimators and leads to some useful property on its variance. We limit our consideration to a hybrid SARAH-SGD for nonconvex expectation problems. However, our idea can be extended to handle a broader class of estimators in both convex and nonconvex settings. We propose a new single-loop stochastic gradient descent algorithm that can achieve $O(\\max\\{\\sigma^3\\varepsilon^{-1},\\sigma\\v","authors_text":"Dzung T. Phan, Lam M. Nguyen, Nhan H. Pham, Quoc Tran-Dinh","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-15T02:38:03Z","title":"Hybrid Stochastic Gradient Descent Algorithms for Stochastic Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05920","kind":"arxiv","version":1},"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:e1c7ea6b65a89671c1fee0a0bddb6dc4207a7af421f6c28d0d256810ce7a919f","target":"record","created_at":"2026-05-17T23:46:08Z","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":"6c024577c21dc97f92e02a4b017adc3bddca5fa1eeb2e08e0690dfdc11ff75bd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-15T02:38:03Z","title_canon_sha256":"d542134fa1e5f437aa063a7c456b06d3331ba85a74d16cc0f757d91707815cd9"},"schema_version":"1.0","source":{"id":"1905.05920","kind":"arxiv","version":1}},"canonical_sha256":"f0d1241ecc95d72b137078f6557664a28b15cef0d8ea55f8680eed7f959721da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0d1241ecc95d72b137078f6557664a28b15cef0d8ea55f8680eed7f959721da","first_computed_at":"2026-05-17T23:46:08.096547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:08.096547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eo7XQuc1nMR1eCViy7lYOvx1j712NwGupXVuP00FE0Prufo+NhCfJ/pR/4OpmENlDD/Do+ulVRbeuWuDjIYMCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:08.097137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1c7ea6b65a89671c1fee0a0bddb6dc4207a7af421f6c28d0d256810ce7a919f","sha256:f7ffe1fd792d4f96ec4b5102bb8befc233573d8b0048e8dfd2650e825c220010"],"state_sha256":"1581b8c9d4ccf2f4d77a1f22d8f49c5f154ae17a9dd3cb12e3b540107f2ff388"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+hFqAndY+LDgwdIRCNwevnctH3lnB1GhqXyT9sfhtYZoPDc2UFp6AZFs/YJvotSmbszxlU9ugtSy+PIJYRXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:42:30.391196Z","bundle_sha256":"32462f47bd6ce2bd57c2ce10f1486945c9c030af538d96abe1f785dde1a0b565"}}