{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V3UYT7TOZPH6H3LOWTX2S7LVGH","short_pith_number":"pith:V3UYT7TO","schema_version":"1.0","canonical_sha256":"aee989fe6ecbcfe3ed6eb4efa97d7531ea07f6084a29a11cc3fd1e8d8c26b8e8","source":{"kind":"arxiv","id":"1705.02766","version":1},"attestation_state":"computed","paper":{"title":"\"Convex Until Proven Guilty\": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aaron Sidford, John C. Duchi, Oliver Hinder, Yair Carmon","submitted_at":"2017-05-08T07:53:48Z","abstract_excerpt":"We develop and analyze a variant of Nesterov's accelerated gradient descent (AGD) for minimization of smooth non-convex functions. We prove that one of two cases occurs: either our AGD variant converges quickly, as if the function was convex, or we produce a certificate that the function is \"guilty\" of being non-convex. This non-convexity certificate allows us to exploit negative curvature and obtain deterministic, dimension-free acceleration of convergence for non-convex functions. For a function $f$ with Lipschitz continuous gradient and Hessian, we compute a point $x$ with $\\|\\nabla f(x)\\| "},"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":"1705.02766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-08T07:53:48Z","cross_cats_sorted":[],"title_canon_sha256":"aa1ef3e6d2ebbed71da22e9b241f186f070ce9946eae8cb8344f791df064fd29","abstract_canon_sha256":"8b5eacc46193a949f1f4d92adfb947621a7e19f6ab2d17d0c1bdfb52ed79de54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:53.685195Z","signature_b64":"WgFop3E5HnxNlyg2A+xmCmTfsauLooiqfn26MadMh9pCX4nnAOMs3VHDt9EFqxJztyk7fuGL9mmHYTBFIRHoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aee989fe6ecbcfe3ed6eb4efa97d7531ea07f6084a29a11cc3fd1e8d8c26b8e8","last_reissued_at":"2026-05-18T00:44:53.684625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:53.684625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"\"Convex Until Proven Guilty\": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aaron Sidford, John C. Duchi, Oliver Hinder, Yair Carmon","submitted_at":"2017-05-08T07:53:48Z","abstract_excerpt":"We develop and analyze a variant of Nesterov's accelerated gradient descent (AGD) for minimization of smooth non-convex functions. We prove that one of two cases occurs: either our AGD variant converges quickly, as if the function was convex, or we produce a certificate that the function is \"guilty\" of being non-convex. This non-convexity certificate allows us to exploit negative curvature and obtain deterministic, dimension-free acceleration of convergence for non-convex functions. For a function $f$ with Lipschitz continuous gradient and Hessian, we compute a point $x$ with $\\|\\nabla f(x)\\| "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02766","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.02766","created_at":"2026-05-18T00:44:53.684711+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02766v1","created_at":"2026-05-18T00:44:53.684711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02766","created_at":"2026-05-18T00:44:53.684711+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3UYT7TOZPH6","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3UYT7TOZPH6H3LO","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3UYT7TO","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2003.00295","citing_title":"Adaptive Federated Optimization","ref_index":168,"is_internal_anchor":true},{"citing_arxiv_id":"2401.01335","citing_title":"Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models","ref_index":66,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V3UYT7TOZPH6H3LOWTX2S7LVGH","json":"https://pith.science/pith/V3UYT7TOZPH6H3LOWTX2S7LVGH.json","graph_json":"https://pith.science/api/pith-number/V3UYT7TOZPH6H3LOWTX2S7LVGH/graph.json","events_json":"https://pith.science/api/pith-number/V3UYT7TOZPH6H3LOWTX2S7LVGH/events.json","paper":"https://pith.science/paper/V3UYT7TO"},"agent_actions":{"view_html":"https://pith.science/pith/V3UYT7TOZPH6H3LOWTX2S7LVGH","download_json":"https://pith.science/pith/V3UYT7TOZPH6H3LOWTX2S7LVGH.json","view_paper":"https://pith.science/paper/V3UYT7TO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02766&json=true","fetch_graph":"https://pith.science/api/pith-number/V3UYT7TOZPH6H3LOWTX2S7LVGH/graph.json","fetch_events":"https://pith.science/api/pith-number/V3UYT7TOZPH6H3LOWTX2S7LVGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3UYT7TOZPH6H3LOWTX2S7LVGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3UYT7TOZPH6H3LOWTX2S7LVGH/action/storage_attestation","attest_author":"https://pith.science/pith/V3UYT7TOZPH6H3LOWTX2S7LVGH/action/author_attestation","sign_citation":"https://pith.science/pith/V3UYT7TOZPH6H3LOWTX2S7LVGH/action/citation_signature","submit_replication":"https://pith.science/pith/V3UYT7TOZPH6H3LOWTX2S7LVGH/action/replication_record"}},"created_at":"2026-05-18T00:44:53.684711+00:00","updated_at":"2026-05-18T00:44:53.684711+00:00"}