{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:X3OPYVBLJR7K3J5YOAGQON2LGM","short_pith_number":"pith:X3OPYVBL","schema_version":"1.0","canonical_sha256":"bedcfc542b4c7eada7b8700d07374b3327d5c4ea00fcec6ecdd1bc354bb2dfd0","source":{"kind":"arxiv","id":"2309.16530","version":1},"attestation_state":"computed","paper":{"title":"Acceleration by Stepsize Hedging II: Silver Stepsize Schedule for Smooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jason M. Altschuler, Pablo A. Parrilo","submitted_at":"2023-09-28T15:42:54Z","abstract_excerpt":"We provide a concise, self-contained proof that the Silver Stepsize Schedule proposed in Part I directly applies to smooth (non-strongly) convex optimization. Specifically, we show that with these stepsizes, gradient descent computes an $\\epsilon$-minimizer in $O(\\epsilon^{-\\log_{\\rho} 2}) = O(\\epsilon^{-0.7864})$ iterations, where $\\rho = 1+\\sqrt{2}$ is the silver ratio. This is intermediate between the textbook unaccelerated rate $O(\\epsilon^{-1})$ and the accelerated rate $O(\\epsilon^{-1/2})$ due to Nesterov in 1983. The Silver Stepsize Schedule is a simple explicit fractal: the $i$-th step"},"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":"2309.16530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-28T15:42:54Z","cross_cats_sorted":[],"title_canon_sha256":"536b0c64b02658759cf59abaa95f276bcf7d75018e3bc685129ab91360ad2cad","abstract_canon_sha256":"df8917bcc36d03bd14e54c7feae26dd23ca49f4ca4140b5f8831a4182f6f19e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:51.382015Z","signature_b64":"2JCGVlbrFiqYtpI2m16bsLBAJXtlgj8pKWisq123hWenXT145xlSApqZZayoD0U4rgo8DkphcBHsMSSu6CEyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bedcfc542b4c7eada7b8700d07374b3327d5c4ea00fcec6ecdd1bc354bb2dfd0","last_reissued_at":"2026-07-05T09:39:51.381548Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:51.381548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Acceleration by Stepsize Hedging II: Silver Stepsize Schedule for Smooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jason M. Altschuler, Pablo A. Parrilo","submitted_at":"2023-09-28T15:42:54Z","abstract_excerpt":"We provide a concise, self-contained proof that the Silver Stepsize Schedule proposed in Part I directly applies to smooth (non-strongly) convex optimization. Specifically, we show that with these stepsizes, gradient descent computes an $\\epsilon$-minimizer in $O(\\epsilon^{-\\log_{\\rho} 2}) = O(\\epsilon^{-0.7864})$ iterations, where $\\rho = 1+\\sqrt{2}$ is the silver ratio. This is intermediate between the textbook unaccelerated rate $O(\\epsilon^{-1})$ and the accelerated rate $O(\\epsilon^{-1/2})$ due to Nesterov in 1983. The Silver Stepsize Schedule is a simple explicit fractal: the $i$-th step"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.16530","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/2309.16530/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":"2309.16530","created_at":"2026-07-05T09:39:51.381615+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.16530v1","created_at":"2026-07-05T09:39:51.381615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.16530","created_at":"2026-07-05T09:39:51.381615+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3OPYVBLJR7K","created_at":"2026-07-05T09:39:51.381615+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3OPYVBLJR7K3J5Y","created_at":"2026-07-05T09:39:51.381615+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3OPYVBL","created_at":"2026-07-05T09:39:51.381615+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17668","citing_title":"Anytime Acceleration of Gradient Descent","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X3OPYVBLJR7K3J5YOAGQON2LGM","json":"https://pith.science/pith/X3OPYVBLJR7K3J5YOAGQON2LGM.json","graph_json":"https://pith.science/api/pith-number/X3OPYVBLJR7K3J5YOAGQON2LGM/graph.json","events_json":"https://pith.science/api/pith-number/X3OPYVBLJR7K3J5YOAGQON2LGM/events.json","paper":"https://pith.science/paper/X3OPYVBL"},"agent_actions":{"view_html":"https://pith.science/pith/X3OPYVBLJR7K3J5YOAGQON2LGM","download_json":"https://pith.science/pith/X3OPYVBLJR7K3J5YOAGQON2LGM.json","view_paper":"https://pith.science/paper/X3OPYVBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.16530&json=true","fetch_graph":"https://pith.science/api/pith-number/X3OPYVBLJR7K3J5YOAGQON2LGM/graph.json","fetch_events":"https://pith.science/api/pith-number/X3OPYVBLJR7K3J5YOAGQON2LGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3OPYVBLJR7K3J5YOAGQON2LGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3OPYVBLJR7K3J5YOAGQON2LGM/action/storage_attestation","attest_author":"https://pith.science/pith/X3OPYVBLJR7K3J5YOAGQON2LGM/action/author_attestation","sign_citation":"https://pith.science/pith/X3OPYVBLJR7K3J5YOAGQON2LGM/action/citation_signature","submit_replication":"https://pith.science/pith/X3OPYVBLJR7K3J5YOAGQON2LGM/action/replication_record"}},"created_at":"2026-07-05T09:39:51.381615+00:00","updated_at":"2026-07-05T09:39:51.381615+00:00"}