{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IDAEN2HTE5ZMJWCPSAHCBFI7IT","short_pith_number":"pith:IDAEN2HT","canonical_record":{"source":{"id":"1711.10456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-28T18:38:35Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"025d612ac0ef93cec1c5e0360c2a51885044e99e7d125389181751ec80c9ba1d","abstract_canon_sha256":"e2bcd47dffb007535c542127fca360d9f9499560a0d6989c0583f4bd321e8f2f"},"schema_version":"1.0"},"canonical_sha256":"40c046e8f32772c4d84f900e20951f44fc914fb51ee9aeb5b8dbd7dcdc5f177e","source":{"kind":"arxiv","id":"1711.10456","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10456","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10456v1","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10456","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"IDAEN2HTE5ZM","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IDAEN2HTE5ZMJWCP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IDAEN2HT","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IDAEN2HTE5ZMJWCPSAHCBFI7IT","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-28T18:38:35Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"025d612ac0ef93cec1c5e0360c2a51885044e99e7d125389181751ec80c9ba1d","abstract_canon_sha256":"e2bcd47dffb007535c542127fca360d9f9499560a0d6989c0583f4bd321e8f2f"},"schema_version":"1.0"},"canonical_sha256":"40c046e8f32772c4d84f900e20951f44fc914fb51ee9aeb5b8dbd7dcdc5f177e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:22.079377Z","signature_b64":"YGjWPrC9CkKBkxQ/TU9D66oVw/A+rD7/+XjDwn+wJKp5xXSW0PM64R2FJApb9vX6mq7tmTsWWI8kEUQ3lfvxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40c046e8f32772c4d84f900e20951f44fc914fb51ee9aeb5b8dbd7dcdc5f177e","last_reissued_at":"2026-05-18T00:29:22.078675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:22.078675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10456","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-18T00:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ookqK/Ok2cyD/5ozGUshJP/9mfL5EWnDjbyH0XLWtnVicBIzpS2lsKa/4XmZ5ocyJYj47zAvJeN3rgMNRgGCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:46:27.919024Z"},"content_sha256":"475f5d48718efd733d0147c273b406bc1b0b721dce79ad022a8b98adac4f46c5","schema_version":"1.0","event_id":"sha256:475f5d48718efd733d0147c273b406bc1b0b721dce79ad022a8b98adac4f46c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IDAEN2HTE5ZMJWCPSAHCBFI7IT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chi Jin, Michael I. Jordan, Praneeth Netrapalli","submitted_at":"2017-11-28T18:38:35Z","abstract_excerpt":"Nesterov's accelerated gradient descent (AGD), an instance of the general family of \"momentum methods\", provably achieves faster convergence rate than gradient descent (GD) in the convex setting. However, whether these methods are superior to GD in the nonconvex setting remains open. This paper studies a simple variant of AGD, and shows that it escapes saddle points and finds a second-order stationary point in $\\tilde{O}(1/\\epsilon^{7/4})$ iterations, faster than the $\\tilde{O}(1/\\epsilon^{2})$ iterations required by GD. To the best of our knowledge, this is the first Hessian-free algorithm to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10456","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-18T00:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yxG4QcxNTXglBa3sI0j/3CD3pUSbEsnHUzHW3ETHXoyuNUqWA0taSAcTDNiixY++y0B7KXE1xZH+O6dAs+IDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:46:27.919430Z"},"content_sha256":"a4c161eb4f22f0eec88cf2eb4b79ee36964caf8cfe9f42a8a09eecd81cb6fe8d","schema_version":"1.0","event_id":"sha256:a4c161eb4f22f0eec88cf2eb4b79ee36964caf8cfe9f42a8a09eecd81cb6fe8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDAEN2HTE5ZMJWCPSAHCBFI7IT/bundle.json","state_url":"https://pith.science/pith/IDAEN2HTE5ZMJWCPSAHCBFI7IT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDAEN2HTE5ZMJWCPSAHCBFI7IT/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-26T14:46:27Z","links":{"resolver":"https://pith.science/pith/IDAEN2HTE5ZMJWCPSAHCBFI7IT","bundle":"https://pith.science/pith/IDAEN2HTE5ZMJWCPSAHCBFI7IT/bundle.json","state":"https://pith.science/pith/IDAEN2HTE5ZMJWCPSAHCBFI7IT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDAEN2HTE5ZMJWCPSAHCBFI7IT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IDAEN2HTE5ZMJWCPSAHCBFI7IT","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":"e2bcd47dffb007535c542127fca360d9f9499560a0d6989c0583f4bd321e8f2f","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-28T18:38:35Z","title_canon_sha256":"025d612ac0ef93cec1c5e0360c2a51885044e99e7d125389181751ec80c9ba1d"},"schema_version":"1.0","source":{"id":"1711.10456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10456","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10456v1","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10456","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"IDAEN2HTE5ZM","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IDAEN2HTE5ZMJWCP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IDAEN2HT","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:a4c161eb4f22f0eec88cf2eb4b79ee36964caf8cfe9f42a8a09eecd81cb6fe8d","target":"graph","created_at":"2026-05-18T00:29:22Z","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":"Nesterov's accelerated gradient descent (AGD), an instance of the general family of \"momentum methods\", provably achieves faster convergence rate than gradient descent (GD) in the convex setting. However, whether these methods are superior to GD in the nonconvex setting remains open. This paper studies a simple variant of AGD, and shows that it escapes saddle points and finds a second-order stationary point in $\\tilde{O}(1/\\epsilon^{7/4})$ iterations, faster than the $\\tilde{O}(1/\\epsilon^{2})$ iterations required by GD. To the best of our knowledge, this is the first Hessian-free algorithm to","authors_text":"Chi Jin, Michael I. Jordan, Praneeth Netrapalli","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-28T18:38:35Z","title":"Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10456","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:475f5d48718efd733d0147c273b406bc1b0b721dce79ad022a8b98adac4f46c5","target":"record","created_at":"2026-05-18T00:29:22Z","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":"e2bcd47dffb007535c542127fca360d9f9499560a0d6989c0583f4bd321e8f2f","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-28T18:38:35Z","title_canon_sha256":"025d612ac0ef93cec1c5e0360c2a51885044e99e7d125389181751ec80c9ba1d"},"schema_version":"1.0","source":{"id":"1711.10456","kind":"arxiv","version":1}},"canonical_sha256":"40c046e8f32772c4d84f900e20951f44fc914fb51ee9aeb5b8dbd7dcdc5f177e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40c046e8f32772c4d84f900e20951f44fc914fb51ee9aeb5b8dbd7dcdc5f177e","first_computed_at":"2026-05-18T00:29:22.078675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:22.078675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YGjWPrC9CkKBkxQ/TU9D66oVw/A+rD7/+XjDwn+wJKp5xXSW0PM64R2FJApb9vX6mq7tmTsWWI8kEUQ3lfvxDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:22.079377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:475f5d48718efd733d0147c273b406bc1b0b721dce79ad022a8b98adac4f46c5","sha256:a4c161eb4f22f0eec88cf2eb4b79ee36964caf8cfe9f42a8a09eecd81cb6fe8d"],"state_sha256":"25e24cbc7cef326ecccf9fd74fd5c12dc6be4f3f2e795abf5f0faa81a6462588"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1uqS1QHCPI4l1QWl47NjcAAeiux66Diik0K70nmcGql+YP8zJgOpvqdyNFIthC9y9CStaz8AgOagrhnY77EZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:46:27.922945Z","bundle_sha256":"78d43730facbdcacb7b2636716fd9eae82e419773d04abf3a9277af5c8da11e1"}}