{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YF2NDNA4LI6DYLUY4GXPYKXPP7","short_pith_number":"pith:YF2NDNA4","schema_version":"1.0","canonical_sha256":"c174d1b41c5a3c3c2e98e1aefc2aef7fd0bc45882abfa40e51cf49c14cb2499a","source":{"kind":"arxiv","id":"1901.10682","version":2},"attestation_state":"computed","paper":{"title":"On the Convergence of (Stochastic) Gradient Descent with Extrapolation for Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Rong Jin, Sen Yang, Tianbao Yang, Yi Xu, Zhuoning Yuan","submitted_at":"2019-01-30T05:59:17Z","abstract_excerpt":"Extrapolation is a well-known technique for solving convex optimization and variational inequalities and recently attracts some attention for non-convex optimization. Several recent works have empirically shown its success in some machine learning tasks. However, it has not been analyzed for non-convex minimization and there still remains a gap between the theory and the practice. In this paper, we analyze gradient descent and stochastic gradient descent with extrapolation for finding an approximate first-order stationary point in smooth non-convex optimization problems. Our convergence upper "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1901.10682","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-30T05:59:17Z","cross_cats_sorted":[],"title_canon_sha256":"22a83abb25886e51e9ad6470b645bee19e17bb5121f64c689319529dd227d227","abstract_canon_sha256":"63fbce6751ebb8a864fadc48bba18d016219f346a7d073225e82502a2dc804dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:42.385817Z","signature_b64":"ozetwNL3CUxqVDIUFRp5QyYuFHC6PPLSecnxQP3H6zZ/2/TZ+Kp8efrcdY9KFAS5v92YevDbDULzvJfBiE2AAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c174d1b41c5a3c3c2e98e1aefc2aef7fd0bc45882abfa40e51cf49c14cb2499a","last_reissued_at":"2026-05-17T23:54:42.385324Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:42.385324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Convergence of (Stochastic) Gradient Descent with Extrapolation for Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Rong Jin, Sen Yang, Tianbao Yang, Yi Xu, Zhuoning Yuan","submitted_at":"2019-01-30T05:59:17Z","abstract_excerpt":"Extrapolation is a well-known technique for solving convex optimization and variational inequalities and recently attracts some attention for non-convex optimization. Several recent works have empirically shown its success in some machine learning tasks. However, it has not been analyzed for non-convex minimization and there still remains a gap between the theory and the practice. In this paper, we analyze gradient descent and stochastic gradient descent with extrapolation for finding an approximate first-order stationary point in smooth non-convex optimization problems. Our convergence upper "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10682","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.10682","created_at":"2026-05-17T23:54:42.385394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10682v2","created_at":"2026-05-17T23:54:42.385394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10682","created_at":"2026-05-17T23:54:42.385394+00:00"},{"alias_kind":"pith_short_12","alias_value":"YF2NDNA4LI6D","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YF2NDNA4LI6DYLUY","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YF2NDNA4","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YF2NDNA4LI6DYLUY4GXPYKXPP7","json":"https://pith.science/pith/YF2NDNA4LI6DYLUY4GXPYKXPP7.json","graph_json":"https://pith.science/api/pith-number/YF2NDNA4LI6DYLUY4GXPYKXPP7/graph.json","events_json":"https://pith.science/api/pith-number/YF2NDNA4LI6DYLUY4GXPYKXPP7/events.json","paper":"https://pith.science/paper/YF2NDNA4"},"agent_actions":{"view_html":"https://pith.science/pith/YF2NDNA4LI6DYLUY4GXPYKXPP7","download_json":"https://pith.science/pith/YF2NDNA4LI6DYLUY4GXPYKXPP7.json","view_paper":"https://pith.science/paper/YF2NDNA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10682&json=true","fetch_graph":"https://pith.science/api/pith-number/YF2NDNA4LI6DYLUY4GXPYKXPP7/graph.json","fetch_events":"https://pith.science/api/pith-number/YF2NDNA4LI6DYLUY4GXPYKXPP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YF2NDNA4LI6DYLUY4GXPYKXPP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YF2NDNA4LI6DYLUY4GXPYKXPP7/action/storage_attestation","attest_author":"https://pith.science/pith/YF2NDNA4LI6DYLUY4GXPYKXPP7/action/author_attestation","sign_citation":"https://pith.science/pith/YF2NDNA4LI6DYLUY4GXPYKXPP7/action/citation_signature","submit_replication":"https://pith.science/pith/YF2NDNA4LI6DYLUY4GXPYKXPP7/action/replication_record"}},"created_at":"2026-05-17T23:54:42.385394+00:00","updated_at":"2026-05-17T23:54:42.385394+00:00"}