{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3R3BOGUBAO46SNWDTMPP7TID44","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5c37cd375bc3eb22132687129987b69c0d1955f0db1f2b99aacc52599b216dfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-22T15:00:32Z","title_canon_sha256":"fd883f88392cfb2293de2569c6b937421008147628d0f2fa8ac3e62161fdc80e"},"schema_version":"1.0","source":{"id":"2412.17050","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17050","created_at":"2026-07-05T10:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17050v2","created_at":"2026-07-05T10:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17050","created_at":"2026-07-05T10:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"3R3BOGUBAO46","created_at":"2026-07-05T10:16:40Z"},{"alias_kind":"pith_short_16","alias_value":"3R3BOGUBAO46SNWD","created_at":"2026-07-05T10:16:40Z"},{"alias_kind":"pith_short_8","alias_value":"3R3BOGUB","created_at":"2026-07-05T10:16:40Z"}],"graph_snapshots":[{"event_id":"sha256:08a084c1555bd6fcf786ce0f0a1bddc5bd5fe6058a74c30e933647e37a300197","target":"graph","created_at":"2026-07-05T10:16:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.17050/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The gradient descent (GD) method -- is a fundamental and likely the most popular optimization algorithm in machine learning (ML), with a history traced back to a paper in 1847 (Cauchy, 1847). It was studied under various assumptions, including so-called $(L_0,L_1)$-smoothness, which received noticeable attention in the ML community recently. In this paper, we provide a refined convergence analysis of gradient descent and its variants, assuming generalized smoothness. In particular, we show that $(L_0,L_1)$-GD has the following behavior in the convex setup: as long as $\\|\\nabla f(x^k)\\| \\geq \\f","authors_text":"Aleksandr Lobanov, Alexander Gasnikov, Eduard Gorbunov, Martin Tak\\'a\\v{c}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-22T15:00:32Z","title":"Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under $(L_0,L_1)$-Smoothness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17050","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a1ee1eda87b8dd7a16bb8c23f65ce1af014e90fbc0251aab32ac5e88fbaccdcb","target":"record","created_at":"2026-07-05T10:16:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5c37cd375bc3eb22132687129987b69c0d1955f0db1f2b99aacc52599b216dfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-22T15:00:32Z","title_canon_sha256":"fd883f88392cfb2293de2569c6b937421008147628d0f2fa8ac3e62161fdc80e"},"schema_version":"1.0","source":{"id":"2412.17050","kind":"arxiv","version":2}},"canonical_sha256":"dc76171a8103b9e936c39b1effcd03e72b9bdc0abd174d6725715238f67f898a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc76171a8103b9e936c39b1effcd03e72b9bdc0abd174d6725715238f67f898a","first_computed_at":"2026-07-05T10:16:40.373326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:16:40.373326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R+unk+IcNBmYVAfTKXCXIBv5T6vOMJESqtMEDovaxbjvc0Lxul6+5hO5R/YZ4YSEePYaXJyM2Mut4qWwjJvHCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:16:40.373877Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.17050","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1ee1eda87b8dd7a16bb8c23f65ce1af014e90fbc0251aab32ac5e88fbaccdcb","sha256:08a084c1555bd6fcf786ce0f0a1bddc5bd5fe6058a74c30e933647e37a300197"],"state_sha256":"afc9ba6b9ea6e245095b4bfcf2d3cd453da8e73c5b1949bbbb10b4b91e0d3b9e"}