{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MVBITVCRNBVBFUECRSVRPCMWEW","short_pith_number":"pith:MVBITVCR","schema_version":"1.0","canonical_sha256":"654289d451686a12d0828cab17899625a5c7c1b49882b1851d25268c53b5b2a4","source":{"kind":"arxiv","id":"2608.10418","version":1},"attestation_state":"computed","paper":{"title":"A lower bound for stepsize-based acceleration of gradient descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Jianhao Ma, Yuxin Chen","submitted_at":"2026-08-11T03:06:59Z","abstract_excerpt":"Recent work has shown that, for smooth convex optimization, plain gradient descent can be accelerated from its textbook convergence rate of $O(T^{-1})$ (where $T$ denotes the number of iterations) to $O\\big(T^{-\\log_2(1+\\sqrt{2})}\\big)$ using carefully designed stepsize schedules alone, without resorting to momentum or other algorithmic modifications. Despite this progress, however, little was known about lower bounds for such methods beyond the classical $\\Omega(T^{-2})$ benchmark for general first-order methods. In this work, we present a new lower bound of $\\Omega(T^{-1.9319})$ for the last"},"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":"2608.10418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-11T03:06:59Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"89e12b280f357e4e6d784bd253feed7c170e7dd70667fef70d5b47ae7e37f256","abstract_canon_sha256":"cf2e917064d646d236c7fe4fd8d9d4f00a1cc8a0f9ad180bcc74e3aebaa4f32b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-12T01:22:25.500049Z","signature_b64":"VXVOjbIaiuH7tXflBknNL+A66Wpl3ybjVyhU1tzzytRnj8nVV30oM405PWkPmz/leRQBhQUsJJ9iNaO0YG14Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"654289d451686a12d0828cab17899625a5c7c1b49882b1851d25268c53b5b2a4","last_reissued_at":"2026-08-12T01:22:25.498382Z","signature_status":"signed_v1","first_computed_at":"2026-08-12T01:22:25.498382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound for stepsize-based acceleration of gradient descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Jianhao Ma, Yuxin Chen","submitted_at":"2026-08-11T03:06:59Z","abstract_excerpt":"Recent work has shown that, for smooth convex optimization, plain gradient descent can be accelerated from its textbook convergence rate of $O(T^{-1})$ (where $T$ denotes the number of iterations) to $O\\big(T^{-\\log_2(1+\\sqrt{2})}\\big)$ using carefully designed stepsize schedules alone, without resorting to momentum or other algorithmic modifications. Despite this progress, however, little was known about lower bounds for such methods beyond the classical $\\Omega(T^{-2})$ benchmark for general first-order methods. In this work, we present a new lower bound of $\\Omega(T^{-1.9319})$ for the last"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.10418","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/2608.10418/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":"2608.10418","created_at":"2026-08-12T01:22:25.502212+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.10418v1","created_at":"2026-08-12T01:22:25.502212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.10418","created_at":"2026-08-12T01:22:25.502212+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVBITVCRNBVB","created_at":"2026-08-12T01:22:25.502212+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVBITVCRNBVBFUEC","created_at":"2026-08-12T01:22:25.502212+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVBITVCR","created_at":"2026-08-12T01:22:25.502212+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/MVBITVCRNBVBFUECRSVRPCMWEW","json":"https://pith.science/pith/MVBITVCRNBVBFUECRSVRPCMWEW.json","graph_json":"https://pith.science/api/pith-number/MVBITVCRNBVBFUECRSVRPCMWEW/graph.json","events_json":"https://pith.science/api/pith-number/MVBITVCRNBVBFUECRSVRPCMWEW/events.json","paper":"https://pith.science/paper/MVBITVCR"},"agent_actions":{"view_html":"https://pith.science/pith/MVBITVCRNBVBFUECRSVRPCMWEW","download_json":"https://pith.science/pith/MVBITVCRNBVBFUECRSVRPCMWEW.json","view_paper":"https://pith.science/paper/MVBITVCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.10418&json=true","fetch_graph":"https://pith.science/api/pith-number/MVBITVCRNBVBFUECRSVRPCMWEW/graph.json","fetch_events":"https://pith.science/api/pith-number/MVBITVCRNBVBFUECRSVRPCMWEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVBITVCRNBVBFUECRSVRPCMWEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVBITVCRNBVBFUECRSVRPCMWEW/action/storage_attestation","attest_author":"https://pith.science/pith/MVBITVCRNBVBFUECRSVRPCMWEW/action/author_attestation","sign_citation":"https://pith.science/pith/MVBITVCRNBVBFUECRSVRPCMWEW/action/citation_signature","submit_replication":"https://pith.science/pith/MVBITVCRNBVBFUECRSVRPCMWEW/action/replication_record"}},"created_at":"2026-08-12T01:22:25.502212+00:00","updated_at":"2026-08-12T01:22:25.502212+00:00"}