{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YIATG52FO2FWT3UDWHNBMFRD6S","short_pith_number":"pith:YIATG52F","schema_version":"1.0","canonical_sha256":"c201337745768b69ee83b1da161623f49a909245590f1a31a6ac3659c0650abe","source":{"kind":"arxiv","id":"2607.02053","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for Anytime Acceleration of Gradient Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chung-En Tsai, Ilyas Fatkhullin, Liang Zhang, Niao He","submitted_at":"2026-07-02T11:29:02Z","abstract_excerpt":"Recent work suggests that the convergence rate of gradient descent (GD) in smooth convex optimization can be significantly improved by employing large stepsizes that may violate the descent property. In particular, if the total number of iterations $n$ is given, an $O(n^{-1.271})$ convergence rate can be achieved for both function value and squared gradient norm minimization. On the other hand, in the setting of anytime convergence, where $n$ is not known in advance, the best known rates of GD are much slower: $O(n^{-1.119})$ for function value minimization and $O(n^{-1})$ for squared gradient"},"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":"2607.02053","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-02T11:29:02Z","cross_cats_sorted":[],"title_canon_sha256":"657e9310f1a6c6ee07112c586faa80e26b4093a4d9d493479ef8341f7ae49eb1","abstract_canon_sha256":"408c352b2dbe05829c1dfdde687caf919e937854f84b1d2d1dba9a63fe94c544"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:38.191212Z","signature_b64":"9RqDSM6GH/4sVFJnSmH0zMMTBAtKO4IKXT4LNYFCUjSiROr+n9oegVVmt8d5k0T6jHbGjUw86AWlqM7/26juDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c201337745768b69ee83b1da161623f49a909245590f1a31a6ac3659c0650abe","last_reissued_at":"2026-07-03T01:17:38.190787Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:38.190787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Anytime Acceleration of Gradient Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chung-En Tsai, Ilyas Fatkhullin, Liang Zhang, Niao He","submitted_at":"2026-07-02T11:29:02Z","abstract_excerpt":"Recent work suggests that the convergence rate of gradient descent (GD) in smooth convex optimization can be significantly improved by employing large stepsizes that may violate the descent property. In particular, if the total number of iterations $n$ is given, an $O(n^{-1.271})$ convergence rate can be achieved for both function value and squared gradient norm minimization. On the other hand, in the setting of anytime convergence, where $n$ is not known in advance, the best known rates of GD are much slower: $O(n^{-1.119})$ for function value minimization and $O(n^{-1})$ for squared gradient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02053","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.02053/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.02053","created_at":"2026-07-03T01:17:38.190850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.02053v1","created_at":"2026-07-03T01:17:38.190850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02053","created_at":"2026-07-03T01:17:38.190850+00:00"},{"alias_kind":"pith_short_12","alias_value":"YIATG52FO2FW","created_at":"2026-07-03T01:17:38.190850+00:00"},{"alias_kind":"pith_short_16","alias_value":"YIATG52FO2FWT3UD","created_at":"2026-07-03T01:17:38.190850+00:00"},{"alias_kind":"pith_short_8","alias_value":"YIATG52F","created_at":"2026-07-03T01:17:38.190850+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/YIATG52FO2FWT3UDWHNBMFRD6S","json":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S.json","graph_json":"https://pith.science/api/pith-number/YIATG52FO2FWT3UDWHNBMFRD6S/graph.json","events_json":"https://pith.science/api/pith-number/YIATG52FO2FWT3UDWHNBMFRD6S/events.json","paper":"https://pith.science/paper/YIATG52F"},"agent_actions":{"view_html":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S","download_json":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S.json","view_paper":"https://pith.science/paper/YIATG52F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.02053&json=true","fetch_graph":"https://pith.science/api/pith-number/YIATG52FO2FWT3UDWHNBMFRD6S/graph.json","fetch_events":"https://pith.science/api/pith-number/YIATG52FO2FWT3UDWHNBMFRD6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S/action/storage_attestation","attest_author":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S/action/author_attestation","sign_citation":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S/action/citation_signature","submit_replication":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S/action/replication_record"}},"created_at":"2026-07-03T01:17:38.190850+00:00","updated_at":"2026-07-03T01:17:38.190850+00:00"}