{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BLH3GKBYYG6ORUCMMLIJ3OMHCX","short_pith_number":"pith:BLH3GKBY","canonical_record":{"source":{"id":"1806.07811","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T16:01:09Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"7a20016e8112fc1aa88c4019e28d68e475953db512ba7bc72d72d70c821bb52f","abstract_canon_sha256":"8db023fd2e7c79f74b8e481d1aa64a617ff1e4c6223f9cf48dd55c4576aa0295"},"schema_version":"1.0"},"canonical_sha256":"0acfb32838c1bce8d04c62d09db98715f339f9c947908e98f8e268cc62b914c8","source":{"kind":"arxiv","id":"1806.07811","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07811","created_at":"2026-07-05T01:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07811v2","created_at":"2026-07-05T01:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07811","created_at":"2026-07-05T01:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"BLH3GKBYYG6O","created_at":"2026-07-05T01:43:53Z"},{"alias_kind":"pith_short_16","alias_value":"BLH3GKBYYG6ORUCM","created_at":"2026-07-05T01:43:53Z"},{"alias_kind":"pith_short_8","alias_value":"BLH3GKBY","created_at":"2026-07-05T01:43:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BLH3GKBYYG6ORUCMMLIJ3OMHCX","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07811","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T16:01:09Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"7a20016e8112fc1aa88c4019e28d68e475953db512ba7bc72d72d70c821bb52f","abstract_canon_sha256":"8db023fd2e7c79f74b8e481d1aa64a617ff1e4c6223f9cf48dd55c4576aa0295"},"schema_version":"1.0"},"canonical_sha256":"0acfb32838c1bce8d04c62d09db98715f339f9c947908e98f8e268cc62b914c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:53.815972Z","signature_b64":"XSUE/PelrtPbdF3yTCWZYI6NkG5KW2CQfkbKRPiOZO3rjhFLVBNdyR2v2x/aOBwtqptU/8tr5eXzm8B53fDdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0acfb32838c1bce8d04c62d09db98715f339f9c947908e98f8e268cc62b914c8","last_reissued_at":"2026-07-05T01:43:53.815478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:53.815478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07811","source_version":2,"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-07-05T01:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cOVIvffR4+2VEFF/rdizNwB3xuAUiTozrCSxatNX/hK1jQYn9XSUyYWI5KzPcXEiLNpm3l7VaBKwGEI2JBocAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:18:03.878496Z"},"content_sha256":"d974ef3244f31e0aa764cb283065694886686947d7c8cc403ade7a6ec6f6cb63","schema_version":"1.0","event_id":"sha256:d974ef3244f31e0aa764cb283065694886686947d7c8cc403ade7a6ec6f6cb63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BLH3GKBYYG6ORUCMMLIJ3OMHCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Nested Variance Reduction for Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dongruo Zhou, Pan Xu, Quanquan Gu","submitted_at":"2018-06-20T16:01:09Z","abstract_excerpt":"We study finite-sum nonconvex optimization problems, where the objective function is an average of $n$ nonconvex functions. We propose a new stochastic gradient descent algorithm based on nested variance reduction. Compared with conventional stochastic variance reduced gradient (SVRG) algorithm that uses two reference points to construct a semi-stochastic gradient with diminishing variance in each iteration, our algorithm uses $K+1$ nested reference points to build a semi-stochastic gradient to further reduce its variance in each iteration. For smooth nonconvex functions, the proposed algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07811","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/1806.07811/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"},"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-07-05T01:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oR/Gt56WElboH3d5w0vADRrGV7FRTg9VuH4hyftgvIeLZsuY5Xws2DzdWzWLt3znBNXcYLjdEuZtCYejFaBGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:18:03.878982Z"},"content_sha256":"c7775d27f730b36b23d74c9b9a2d2b95d67f9b03302aa4982f092a4fa12189de","schema_version":"1.0","event_id":"sha256:c7775d27f730b36b23d74c9b9a2d2b95d67f9b03302aa4982f092a4fa12189de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLH3GKBYYG6ORUCMMLIJ3OMHCX/bundle.json","state_url":"https://pith.science/pith/BLH3GKBYYG6ORUCMMLIJ3OMHCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLH3GKBYYG6ORUCMMLIJ3OMHCX/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-08-05T17:18:03Z","links":{"resolver":"https://pith.science/pith/BLH3GKBYYG6ORUCMMLIJ3OMHCX","bundle":"https://pith.science/pith/BLH3GKBYYG6ORUCMMLIJ3OMHCX/bundle.json","state":"https://pith.science/pith/BLH3GKBYYG6ORUCMMLIJ3OMHCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLH3GKBYYG6ORUCMMLIJ3OMHCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BLH3GKBYYG6ORUCMMLIJ3OMHCX","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":"8db023fd2e7c79f74b8e481d1aa64a617ff1e4c6223f9cf48dd55c4576aa0295","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T16:01:09Z","title_canon_sha256":"7a20016e8112fc1aa88c4019e28d68e475953db512ba7bc72d72d70c821bb52f"},"schema_version":"1.0","source":{"id":"1806.07811","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07811","created_at":"2026-07-05T01:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07811v2","created_at":"2026-07-05T01:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07811","created_at":"2026-07-05T01:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"BLH3GKBYYG6O","created_at":"2026-07-05T01:43:53Z"},{"alias_kind":"pith_short_16","alias_value":"BLH3GKBYYG6ORUCM","created_at":"2026-07-05T01:43:53Z"},{"alias_kind":"pith_short_8","alias_value":"BLH3GKBY","created_at":"2026-07-05T01:43:53Z"}],"graph_snapshots":[{"event_id":"sha256:c7775d27f730b36b23d74c9b9a2d2b95d67f9b03302aa4982f092a4fa12189de","target":"graph","created_at":"2026-07-05T01:43:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1806.07811/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study finite-sum nonconvex optimization problems, where the objective function is an average of $n$ nonconvex functions. We propose a new stochastic gradient descent algorithm based on nested variance reduction. Compared with conventional stochastic variance reduced gradient (SVRG) algorithm that uses two reference points to construct a semi-stochastic gradient with diminishing variance in each iteration, our algorithm uses $K+1$ nested reference points to build a semi-stochastic gradient to further reduce its variance in each iteration. For smooth nonconvex functions, the proposed algorith","authors_text":"Dongruo Zhou, Pan Xu, Quanquan Gu","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T16:01:09Z","title":"Stochastic Nested Variance Reduction for Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07811","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:d974ef3244f31e0aa764cb283065694886686947d7c8cc403ade7a6ec6f6cb63","target":"record","created_at":"2026-07-05T01:43:53Z","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":"8db023fd2e7c79f74b8e481d1aa64a617ff1e4c6223f9cf48dd55c4576aa0295","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T16:01:09Z","title_canon_sha256":"7a20016e8112fc1aa88c4019e28d68e475953db512ba7bc72d72d70c821bb52f"},"schema_version":"1.0","source":{"id":"1806.07811","kind":"arxiv","version":2}},"canonical_sha256":"0acfb32838c1bce8d04c62d09db98715f339f9c947908e98f8e268cc62b914c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0acfb32838c1bce8d04c62d09db98715f339f9c947908e98f8e268cc62b914c8","first_computed_at":"2026-07-05T01:43:53.815478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:43:53.815478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XSUE/PelrtPbdF3yTCWZYI6NkG5KW2CQfkbKRPiOZO3rjhFLVBNdyR2v2x/aOBwtqptU/8tr5eXzm8B53fDdCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:43:53.815972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07811","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d974ef3244f31e0aa764cb283065694886686947d7c8cc403ade7a6ec6f6cb63","sha256:c7775d27f730b36b23d74c9b9a2d2b95d67f9b03302aa4982f092a4fa12189de"],"state_sha256":"598f673d03be6d73f2ba3cacb00e9ff99a3573265fcba592cbebfc3cf8bcc3a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sUoON4B5AUHU1d2cBKJTEHAiSUr0+3UBdlvrff9V5PFwHUJhMU9jwOqEdQZsa4etG1qaF0raHOTeJ8LRN/ejDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T17:18:03.882638Z","bundle_sha256":"d62494e32e2276350f5346b5837d13570c99302c1fc29c72cd2e5af3ec825061"}}