{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WJYSMSWXQQQ5G5CJIXYRHORQSM","short_pith_number":"pith:WJYSMSWX","canonical_record":{"source":{"id":"1901.09344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-27T09:36:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4b92016638e1cec589758e7dcde1c255f826b4889ecd6ce7cac56b8b2e0b4a61","abstract_canon_sha256":"c8eb627c0e7d63065fd5e22f330b8748b2498cb58ca36bdab3a79b04b4ff1bba"},"schema_version":"1.0"},"canonical_sha256":"b271264ad78421d3744945f113ba3093048f15a95977c67173f604af7269d264","source":{"kind":"arxiv","id":"1901.09344","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09344","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09344v1","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09344","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"WJYSMSWXQQQ5","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WJYSMSWXQQQ5G5CJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WJYSMSWX","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WJYSMSWXQQQ5G5CJIXYRHORQSM","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-27T09:36:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4b92016638e1cec589758e7dcde1c255f826b4889ecd6ce7cac56b8b2e0b4a61","abstract_canon_sha256":"c8eb627c0e7d63065fd5e22f330b8748b2498cb58ca36bdab3a79b04b4ff1bba"},"schema_version":"1.0"},"canonical_sha256":"b271264ad78421d3744945f113ba3093048f15a95977c67173f604af7269d264","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:25.038258Z","signature_b64":"KRRvVvEm89jU/JaN14yMziDnB0QQ/Hnz92ExaR1VMyspWf8wUjawL/uy39ats1cPcMQHyURD8lMRcz7NtGjODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b271264ad78421d3744945f113ba3093048f15a95977c67173f604af7269d264","last_reissued_at":"2026-05-17T23:55:25.037635Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:25.037635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09344","source_version":1,"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-05-17T23:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UucHy6uWNjpjBJ5nLKlewTmHKtS//yKINgFz5vw6hf9i2ctV5mGNIYyEeXiswDO4NQM6AsEz7ow/xqew3iBpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:33:07.617437Z"},"content_sha256":"ae50026e0985cd0c52d9448aa6327451f6aed450c8f938214302f8b35cc61d4f","schema_version":"1.0","event_id":"sha256:ae50026e0985cd0c52d9448aa6327451f6aed450c8f938214302f8b35cc61d4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WJYSMSWXQQQ5G5CJIXYRHORQSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Approximation of Smooth and Strongly Convex Functions: Beyond the $O(1/T)$ Convergence Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Lijun Zhang, Zhi-Hua Zhou","submitted_at":"2019-01-27T09:36:58Z","abstract_excerpt":"Stochastic approximation (SA) is a classical approach for stochastic convex optimization. Previous studies have demonstrated that the convergence rate of SA can be improved by introducing either smoothness or strong convexity condition. In this paper, we make use of smoothness and strong convexity simultaneously to boost the convergence rate. Let $\\lambda$ be the modulus of strong convexity, $\\kappa$ be the condition number, $F_*$ be the minimal risk, and $\\alpha>1$ be some small constant. First, we demonstrate that, in expectation, an $O(1/[\\lambda T^\\alpha] + \\kappa F_*/T)$ risk bound is att"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09344","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":""},"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-05-17T23:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rB1vmXZZNGkL/ZGeTq6m1qI2CpIV2Gs9oF6HCaWUCvv5gQxPZ9jfg41Y5aV/X1TtM55G4ioX7w8c9I8pi9nqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:33:07.618091Z"},"content_sha256":"45cc81193b5b3ce9249c04b3e125bf2f331f94648b259f634b5a8e600e4a0b2f","schema_version":"1.0","event_id":"sha256:45cc81193b5b3ce9249c04b3e125bf2f331f94648b259f634b5a8e600e4a0b2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJYSMSWXQQQ5G5CJIXYRHORQSM/bundle.json","state_url":"https://pith.science/pith/WJYSMSWXQQQ5G5CJIXYRHORQSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJYSMSWXQQQ5G5CJIXYRHORQSM/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-05-27T02:33:07Z","links":{"resolver":"https://pith.science/pith/WJYSMSWXQQQ5G5CJIXYRHORQSM","bundle":"https://pith.science/pith/WJYSMSWXQQQ5G5CJIXYRHORQSM/bundle.json","state":"https://pith.science/pith/WJYSMSWXQQQ5G5CJIXYRHORQSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJYSMSWXQQQ5G5CJIXYRHORQSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WJYSMSWXQQQ5G5CJIXYRHORQSM","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":"c8eb627c0e7d63065fd5e22f330b8748b2498cb58ca36bdab3a79b04b4ff1bba","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-27T09:36:58Z","title_canon_sha256":"4b92016638e1cec589758e7dcde1c255f826b4889ecd6ce7cac56b8b2e0b4a61"},"schema_version":"1.0","source":{"id":"1901.09344","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09344","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09344v1","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09344","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"WJYSMSWXQQQ5","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WJYSMSWXQQQ5G5CJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WJYSMSWX","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:45cc81193b5b3ce9249c04b3e125bf2f331f94648b259f634b5a8e600e4a0b2f","target":"graph","created_at":"2026-05-17T23:55:25Z","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"},"paper":{"abstract_excerpt":"Stochastic approximation (SA) is a classical approach for stochastic convex optimization. Previous studies have demonstrated that the convergence rate of SA can be improved by introducing either smoothness or strong convexity condition. In this paper, we make use of smoothness and strong convexity simultaneously to boost the convergence rate. Let $\\lambda$ be the modulus of strong convexity, $\\kappa$ be the condition number, $F_*$ be the minimal risk, and $\\alpha>1$ be some small constant. First, we demonstrate that, in expectation, an $O(1/[\\lambda T^\\alpha] + \\kappa F_*/T)$ risk bound is att","authors_text":"Lijun Zhang, Zhi-Hua Zhou","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-27T09:36:58Z","title":"Stochastic Approximation of Smooth and Strongly Convex Functions: Beyond the $O(1/T)$ Convergence Rate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09344","kind":"arxiv","version":1},"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:ae50026e0985cd0c52d9448aa6327451f6aed450c8f938214302f8b35cc61d4f","target":"record","created_at":"2026-05-17T23:55:25Z","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":"c8eb627c0e7d63065fd5e22f330b8748b2498cb58ca36bdab3a79b04b4ff1bba","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-27T09:36:58Z","title_canon_sha256":"4b92016638e1cec589758e7dcde1c255f826b4889ecd6ce7cac56b8b2e0b4a61"},"schema_version":"1.0","source":{"id":"1901.09344","kind":"arxiv","version":1}},"canonical_sha256":"b271264ad78421d3744945f113ba3093048f15a95977c67173f604af7269d264","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b271264ad78421d3744945f113ba3093048f15a95977c67173f604af7269d264","first_computed_at":"2026-05-17T23:55:25.037635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:25.037635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KRRvVvEm89jU/JaN14yMziDnB0QQ/Hnz92ExaR1VMyspWf8wUjawL/uy39ats1cPcMQHyURD8lMRcz7NtGjODg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:25.038258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09344","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae50026e0985cd0c52d9448aa6327451f6aed450c8f938214302f8b35cc61d4f","sha256:45cc81193b5b3ce9249c04b3e125bf2f331f94648b259f634b5a8e600e4a0b2f"],"state_sha256":"ad293b10530348825d48ffc16160324ff23da7724d54a798cab44d9da4734cc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"izyDBzJhNRWQBdk544U5LKI3c6c2abp1chNyHf0nL3yUDL5s3GeT8W+7bj8Dll2BSSPDF6WpZFrIz8WU2+gkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:33:07.623677Z","bundle_sha256":"02e04fe49b7eb4c73a61de45dd910c920f61d4e42a33bebb7e1b2f2927dc8a3f"}}