{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NEV3NOT7LHU2M5JFRB2UUFNK6X","short_pith_number":"pith:NEV3NOT7","schema_version":"1.0","canonical_sha256":"692bb6ba7f59e9a6752588754a15aaf5ddd9ffb17d5b9d4270a9c934392f26d0","source":{"kind":"arxiv","id":"1509.03616","version":1},"attestation_state":"computed","paper":{"title":"On Accelerated Methods in Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andre Wibisono, Ashia C. Wilson","submitted_at":"2015-09-11T19:16:17Z","abstract_excerpt":"In convex optimization, there is an {\\em acceleration} phenomenon in which we can boost the convergence rate of certain gradient-based algorithms. We can observe this phenomenon in Nesterov's accelerated gradient descent, accelerated mirror descent, and accelerated cubic-regularized Newton's method, among others. In this paper, we show that the family of higher-order gradient methods in discrete time (generalizing gradient descent) corresponds to a family of first-order rescaled gradient flows in continuous time. On the other hand, the family of {\\em accelerated} higher-order gradient methods "},"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":"1509.03616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-11T19:16:17Z","cross_cats_sorted":[],"title_canon_sha256":"8472af690e5dd1a136cf4a38af8c7980d06b390005d5df787d67e4ef68acc365","abstract_canon_sha256":"6e6a07a5b9abf157f30b1802b0b74a487ec47588fa831e75d702308212e71230"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:17.316775Z","signature_b64":"XM3zJJaJKC5URLR6ndZJ41Ale+zwFlmFt89WutbyMUFOSrimjSUjiN9v1DXoUDOeAeaGH2r/XbiTrG1ZHzSbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"692bb6ba7f59e9a6752588754a15aaf5ddd9ffb17d5b9d4270a9c934392f26d0","last_reissued_at":"2026-05-18T01:33:17.316295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:17.316295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Accelerated Methods in Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andre Wibisono, Ashia C. Wilson","submitted_at":"2015-09-11T19:16:17Z","abstract_excerpt":"In convex optimization, there is an {\\em acceleration} phenomenon in which we can boost the convergence rate of certain gradient-based algorithms. We can observe this phenomenon in Nesterov's accelerated gradient descent, accelerated mirror descent, and accelerated cubic-regularized Newton's method, among others. In this paper, we show that the family of higher-order gradient methods in discrete time (generalizing gradient descent) corresponds to a family of first-order rescaled gradient flows in continuous time. On the other hand, the family of {\\em accelerated} higher-order gradient methods "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03616","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":"1509.03616","created_at":"2026-05-18T01:33:17.316376+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03616v1","created_at":"2026-05-18T01:33:17.316376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03616","created_at":"2026-05-18T01:33:17.316376+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEV3NOT7LHU2","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEV3NOT7LHU2M5JF","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEV3NOT7","created_at":"2026-05-18T12:29:32.376354+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/NEV3NOT7LHU2M5JFRB2UUFNK6X","json":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X.json","graph_json":"https://pith.science/api/pith-number/NEV3NOT7LHU2M5JFRB2UUFNK6X/graph.json","events_json":"https://pith.science/api/pith-number/NEV3NOT7LHU2M5JFRB2UUFNK6X/events.json","paper":"https://pith.science/paper/NEV3NOT7"},"agent_actions":{"view_html":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X","download_json":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X.json","view_paper":"https://pith.science/paper/NEV3NOT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03616&json=true","fetch_graph":"https://pith.science/api/pith-number/NEV3NOT7LHU2M5JFRB2UUFNK6X/graph.json","fetch_events":"https://pith.science/api/pith-number/NEV3NOT7LHU2M5JFRB2UUFNK6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X/action/storage_attestation","attest_author":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X/action/author_attestation","sign_citation":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X/action/citation_signature","submit_replication":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X/action/replication_record"}},"created_at":"2026-05-18T01:33:17.316376+00:00","updated_at":"2026-05-18T01:33:17.316376+00:00"}