{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QB5PV7NPD3GK46APG56TCASLB3","short_pith_number":"pith:QB5PV7NP","canonical_record":{"source":{"id":"1604.03584","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-12T21:02:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7436cfb330b0636a86ea72e49f23b74e1f67b5d828feaf0aa57710651fcaa68e","abstract_canon_sha256":"865a92f95fa3355f07567360b617cec19a20b569d91f50ae7d0eed6302188c8f"},"schema_version":"1.0"},"canonical_sha256":"807afafdaf1eccae780f377d31024b0ef59ea73d3b8a389d5ed18bb1c36400db","source":{"kind":"arxiv","id":"1604.03584","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03584","created_at":"2026-05-18T00:54:36Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03584v4","created_at":"2026-05-18T00:54:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03584","created_at":"2026-05-18T00:54:36Z"},{"alias_kind":"pith_short_12","alias_value":"QB5PV7NPD3GK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QB5PV7NPD3GK46AP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QB5PV7NP","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QB5PV7NPD3GK46APG56TCASLB3","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03584","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-12T21:02:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7436cfb330b0636a86ea72e49f23b74e1f67b5d828feaf0aa57710651fcaa68e","abstract_canon_sha256":"865a92f95fa3355f07567360b617cec19a20b569d91f50ae7d0eed6302188c8f"},"schema_version":"1.0"},"canonical_sha256":"807afafdaf1eccae780f377d31024b0ef59ea73d3b8a389d5ed18bb1c36400db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:36.940134Z","signature_b64":"AaGPg+Xe2bMHU1pdaL9UnwNOSWlnNzuuMHIi0IvJyESJ1uJhDsrcxpyWuKeaG9LcLGOT3BC+t6DjcyIJz6ipCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"807afafdaf1eccae780f377d31024b0ef59ea73d3b8a389d5ed18bb1c36400db","last_reissued_at":"2026-05-18T00:54:36.939311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:36.939311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03584","source_version":4,"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-18T00:54:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YwTXQKITLKXrCify/KjflWfb+ZHf+0p/N4ZCbwfq8a01WSdeklsOli9iMFPnsGbJe+tvbHkW5ZpPJ8C9PRj5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:52:26.051161Z"},"content_sha256":"cc5eecf8d00e1f9c8d8d98b3eefec44dd68c886b470932b99a9a973adf880b2b","schema_version":"1.0","event_id":"sha256:cc5eecf8d00e1f9c8d8d98b3eefec44dd68c886b470932b99a9a973adf880b2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QB5PV7NPD3GK46APG56TCASLB3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Stochastic Gradient Descent with Variance Reduction for Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Heng Huang, Zhouyuan Huo","submitted_at":"2016-04-12T21:02:38Z","abstract_excerpt":"We provide the first theoretical analysis on the convergence rate of the asynchronous stochastic variance reduced gradient (SVRG) descent algorithm on non-convex optimization. Recent studies have shown that the asynchronous stochastic gradient descent (SGD) based algorithms with variance reduction converge with a linear convergent rate on convex problems. However, there is no work to analyze asynchronous SGD with variance reduction technique on non-convex problem. In this paper, we study two asynchronous parallel implementations of SVRG: one is on a distributed memory system and the other is o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03584","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"},"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-18T00:54:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odzSBuqdgJahuFERco6k1OjMeckUyCOAX6cNUjxIGHvG+nPmewgOMUXIzL3a9ovWmUWbpgLfmtBrFiM1kpNnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:52:26.051855Z"},"content_sha256":"205ba879d532a95151f4529e415f38b736c4bb1111a9e38630982e777655cb35","schema_version":"1.0","event_id":"sha256:205ba879d532a95151f4529e415f38b736c4bb1111a9e38630982e777655cb35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QB5PV7NPD3GK46APG56TCASLB3/bundle.json","state_url":"https://pith.science/pith/QB5PV7NPD3GK46APG56TCASLB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QB5PV7NPD3GK46APG56TCASLB3/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-27T10:52:26Z","links":{"resolver":"https://pith.science/pith/QB5PV7NPD3GK46APG56TCASLB3","bundle":"https://pith.science/pith/QB5PV7NPD3GK46APG56TCASLB3/bundle.json","state":"https://pith.science/pith/QB5PV7NPD3GK46APG56TCASLB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QB5PV7NPD3GK46APG56TCASLB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QB5PV7NPD3GK46APG56TCASLB3","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":"865a92f95fa3355f07567360b617cec19a20b569d91f50ae7d0eed6302188c8f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-12T21:02:38Z","title_canon_sha256":"7436cfb330b0636a86ea72e49f23b74e1f67b5d828feaf0aa57710651fcaa68e"},"schema_version":"1.0","source":{"id":"1604.03584","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03584","created_at":"2026-05-18T00:54:36Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03584v4","created_at":"2026-05-18T00:54:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03584","created_at":"2026-05-18T00:54:36Z"},{"alias_kind":"pith_short_12","alias_value":"QB5PV7NPD3GK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QB5PV7NPD3GK46AP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QB5PV7NP","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:205ba879d532a95151f4529e415f38b736c4bb1111a9e38630982e777655cb35","target":"graph","created_at":"2026-05-18T00:54:36Z","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 provide the first theoretical analysis on the convergence rate of the asynchronous stochastic variance reduced gradient (SVRG) descent algorithm on non-convex optimization. Recent studies have shown that the asynchronous stochastic gradient descent (SGD) based algorithms with variance reduction converge with a linear convergent rate on convex problems. However, there is no work to analyze asynchronous SGD with variance reduction technique on non-convex problem. In this paper, we study two asynchronous parallel implementations of SVRG: one is on a distributed memory system and the other is o","authors_text":"Heng Huang, Zhouyuan Huo","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-12T21:02:38Z","title":"Asynchronous Stochastic Gradient Descent with Variance Reduction for Non-Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03584","kind":"arxiv","version":4},"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:cc5eecf8d00e1f9c8d8d98b3eefec44dd68c886b470932b99a9a973adf880b2b","target":"record","created_at":"2026-05-18T00:54:36Z","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":"865a92f95fa3355f07567360b617cec19a20b569d91f50ae7d0eed6302188c8f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-12T21:02:38Z","title_canon_sha256":"7436cfb330b0636a86ea72e49f23b74e1f67b5d828feaf0aa57710651fcaa68e"},"schema_version":"1.0","source":{"id":"1604.03584","kind":"arxiv","version":4}},"canonical_sha256":"807afafdaf1eccae780f377d31024b0ef59ea73d3b8a389d5ed18bb1c36400db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"807afafdaf1eccae780f377d31024b0ef59ea73d3b8a389d5ed18bb1c36400db","first_computed_at":"2026-05-18T00:54:36.939311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:36.939311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AaGPg+Xe2bMHU1pdaL9UnwNOSWlnNzuuMHIi0IvJyESJ1uJhDsrcxpyWuKeaG9LcLGOT3BC+t6DjcyIJz6ipCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:36.940134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03584","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc5eecf8d00e1f9c8d8d98b3eefec44dd68c886b470932b99a9a973adf880b2b","sha256:205ba879d532a95151f4529e415f38b736c4bb1111a9e38630982e777655cb35"],"state_sha256":"d5bd0ba42b88767f8d3e8072f2003cbc8a954546852b97ebd148d87227f633d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lANkx4V6T50zuh35JpCz7VLpS1xobJlpGsWoyIeW2AhIdZu88j651pcTJobqz8o3hKJAxk/Ec/gplwhuXJzmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:52:26.055276Z","bundle_sha256":"af09ea254cad9861d960f92a0d8e937900f674ca04d94de5bf6818e6a2ee9a69"}}