{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NVSOSVOQVURIH7NVNKONQP4TRQ","short_pith_number":"pith:NVSOSVOQ","canonical_record":{"source":{"id":"2002.10542","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-24T20:57:23Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e655bfa63d70b050efe28df39d9fc03413ea2d6536165e8dfd47ce7879384ecb","abstract_canon_sha256":"1831cec5344c00e645d1527ea5fd5661edc687627f53f38b3190596e79336abe"},"schema_version":"1.0"},"canonical_sha256":"6d64e955d0ad2283fdb56a9cd83f938c071785f4c22959f311696f6b9d598732","source":{"kind":"arxiv","id":"2002.10542","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.10542","created_at":"2026-07-05T02:25:09Z"},{"alias_kind":"arxiv_version","alias_value":"2002.10542v3","created_at":"2026-07-05T02:25:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10542","created_at":"2026-07-05T02:25:09Z"},{"alias_kind":"pith_short_12","alias_value":"NVSOSVOQVURI","created_at":"2026-07-05T02:25:09Z"},{"alias_kind":"pith_short_16","alias_value":"NVSOSVOQVURIH7NV","created_at":"2026-07-05T02:25:09Z"},{"alias_kind":"pith_short_8","alias_value":"NVSOSVOQ","created_at":"2026-07-05T02:25:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NVSOSVOQVURIH7NVNKONQP4TRQ","target":"record","payload":{"canonical_record":{"source":{"id":"2002.10542","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-24T20:57:23Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e655bfa63d70b050efe28df39d9fc03413ea2d6536165e8dfd47ce7879384ecb","abstract_canon_sha256":"1831cec5344c00e645d1527ea5fd5661edc687627f53f38b3190596e79336abe"},"schema_version":"1.0"},"canonical_sha256":"6d64e955d0ad2283fdb56a9cd83f938c071785f4c22959f311696f6b9d598732","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:25:09.839005Z","signature_b64":"2dNi481bLVbeV8mSwobUZrAUydk4sZqCw29cia0bO8XAC7QcyJzRERlW19cxChf37C8Fiukd4PcYR59PKKj5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d64e955d0ad2283fdb56a9cd83f938c071785f4c22959f311696f6b9d598732","last_reissued_at":"2026-07-05T02:25:09.838543Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:25:09.838543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.10542","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:25:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"alJAwQrE5VPRAX9qjA1EInYfp135k4ACYhGRfMuhO+EV+VQGLLGsaplOBzK3RCJtGVFMQSMkYbwmCneip+9GDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:46:54.978295Z"},"content_sha256":"1736fc8e7e65c4f51dddfce6cafd61e801b85997794aa6b505b4fcca49246e9f","schema_version":"1.0","event_id":"sha256:1736fc8e7e65c4f51dddfce6cafd61e801b85997794aa6b505b4fcca49246e9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NVSOSVOQVURIH7NVNKONQP4TRQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Issam Laradji, Nicolas Loizou, Sharan Vaswani, Simon Lacoste-Julien","submitted_at":"2020-02-24T20:57:23Z","abstract_excerpt":"We propose a stochastic variant of the classical Polyak step-size (Polyak, 1987) commonly used in the subgradient method. Although computing the Polyak step-size requires knowledge of the optimal function values, this information is readily available for typical modern machine learning applications. Consequently, the proposed stochastic Polyak step-size (SPS) is an attractive choice for setting the learning rate for stochastic gradient descent (SGD). We provide theoretical convergence guarantees for SGD equipped with SPS in different settings, including strongly convex, convex and non-convex f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10542","kind":"arxiv","version":3},"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/2002.10542/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:25:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRg8Hfvu1XpA5TG8FoDlk9wYxyYgsU0Wwi4sEors3TGIRly1z/94QITq5RtFx0TDsHzfJq/hbOsbS0i3U24DBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:46:54.978771Z"},"content_sha256":"fbf172dbde18347fa3ba87aa2b832d6e1f9ab563b6006ff827722aba020aa5ea","schema_version":"1.0","event_id":"sha256:fbf172dbde18347fa3ba87aa2b832d6e1f9ab563b6006ff827722aba020aa5ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVSOSVOQVURIH7NVNKONQP4TRQ/bundle.json","state_url":"https://pith.science/pith/NVSOSVOQVURIH7NVNKONQP4TRQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVSOSVOQVURIH7NVNKONQP4TRQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T02:46:54Z","links":{"resolver":"https://pith.science/pith/NVSOSVOQVURIH7NVNKONQP4TRQ","bundle":"https://pith.science/pith/NVSOSVOQVURIH7NVNKONQP4TRQ/bundle.json","state":"https://pith.science/pith/NVSOSVOQVURIH7NVNKONQP4TRQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVSOSVOQVURIH7NVNKONQP4TRQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NVSOSVOQVURIH7NVNKONQP4TRQ","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":"1831cec5344c00e645d1527ea5fd5661edc687627f53f38b3190596e79336abe","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-24T20:57:23Z","title_canon_sha256":"e655bfa63d70b050efe28df39d9fc03413ea2d6536165e8dfd47ce7879384ecb"},"schema_version":"1.0","source":{"id":"2002.10542","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.10542","created_at":"2026-07-05T02:25:09Z"},{"alias_kind":"arxiv_version","alias_value":"2002.10542v3","created_at":"2026-07-05T02:25:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10542","created_at":"2026-07-05T02:25:09Z"},{"alias_kind":"pith_short_12","alias_value":"NVSOSVOQVURI","created_at":"2026-07-05T02:25:09Z"},{"alias_kind":"pith_short_16","alias_value":"NVSOSVOQVURIH7NV","created_at":"2026-07-05T02:25:09Z"},{"alias_kind":"pith_short_8","alias_value":"NVSOSVOQ","created_at":"2026-07-05T02:25:09Z"}],"graph_snapshots":[{"event_id":"sha256:fbf172dbde18347fa3ba87aa2b832d6e1f9ab563b6006ff827722aba020aa5ea","target":"graph","created_at":"2026-07-05T02:25:09Z","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/2002.10542/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a stochastic variant of the classical Polyak step-size (Polyak, 1987) commonly used in the subgradient method. Although computing the Polyak step-size requires knowledge of the optimal function values, this information is readily available for typical modern machine learning applications. Consequently, the proposed stochastic Polyak step-size (SPS) is an attractive choice for setting the learning rate for stochastic gradient descent (SGD). We provide theoretical convergence guarantees for SGD equipped with SPS in different settings, including strongly convex, convex and non-convex f","authors_text":"Issam Laradji, Nicolas Loizou, Sharan Vaswani, Simon Lacoste-Julien","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-24T20:57:23Z","title":"Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10542","kind":"arxiv","version":3},"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:1736fc8e7e65c4f51dddfce6cafd61e801b85997794aa6b505b4fcca49246e9f","target":"record","created_at":"2026-07-05T02:25:09Z","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":"1831cec5344c00e645d1527ea5fd5661edc687627f53f38b3190596e79336abe","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-24T20:57:23Z","title_canon_sha256":"e655bfa63d70b050efe28df39d9fc03413ea2d6536165e8dfd47ce7879384ecb"},"schema_version":"1.0","source":{"id":"2002.10542","kind":"arxiv","version":3}},"canonical_sha256":"6d64e955d0ad2283fdb56a9cd83f938c071785f4c22959f311696f6b9d598732","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d64e955d0ad2283fdb56a9cd83f938c071785f4c22959f311696f6b9d598732","first_computed_at":"2026-07-05T02:25:09.838543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:25:09.838543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2dNi481bLVbeV8mSwobUZrAUydk4sZqCw29cia0bO8XAC7QcyJzRERlW19cxChf37C8Fiukd4PcYR59PKKj5Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:25:09.839005Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.10542","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1736fc8e7e65c4f51dddfce6cafd61e801b85997794aa6b505b4fcca49246e9f","sha256:fbf172dbde18347fa3ba87aa2b832d6e1f9ab563b6006ff827722aba020aa5ea"],"state_sha256":"27b9845fc23fea94e2c1331b586999fcbb2eeb999abc231c800c896520052041"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xIQUnkdtPR/sJZcDGFYmN+TxBYGzP6N69JWg1lZW3melzOTZJISyLROsIURA6omAEn+1gpulfNpu/pInrIkkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T02:46:54.980735Z","bundle_sha256":"8204a287a5e898e4711ac4773257e1284dc39a4ebff124fc280bb8d863b88383"}}