{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S5U3EE5HEMUUEJRRAJTJNKERZ4","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":"4fd092f3bc7d2a783822d8b4b3a53b4b0526bebf3b16fe94d2fa967d85931856","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-02T19:47:47Z","title_canon_sha256":"39b22bff3a4219a6f75576d686f133fc2378fdf4062d07411527fb35538ff41d"},"schema_version":"1.0","source":{"id":"1909.00843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00843","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00843v1","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00843","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"S5U3EE5HEMUU","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"pith_short_16","alias_value":"S5U3EE5HEMUUEJRR","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"pith_short_8","alias_value":"S5U3EE5H","created_at":"2026-07-05T00:01:13Z"}],"graph_snapshots":[{"event_id":"sha256:8af37a54bddfc931e46c1d5dc7f813f49e4638976cac26849a7af047e20c29cb","target":"graph","created_at":"2026-07-05T00:01:13Z","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/1909.00843/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider stochastic gradient descent algorithms for minimizing a non-smooth, strongly-convex function. Several forms of this algorithm, including suffix averaging, are known to achieve the optimal $O(1/T)$ convergence rate in expectation. We consider a simple, non-uniform averaging strategy of Lacoste-Julien et al. (2011) and prove that it achieves the optimal $O(1/T)$ convergence rate with high probability. Our proof uses a recently developed generalization of Freedman's inequality. Finally, we compare several of these algorithms experimentally and show that this non-uniform averaging stra","authors_text":"Christopher Liaw, Nicholas J. A. Harvey, Sikander Randhawa","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-02T19:47:47Z","title":"Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00843","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:22f786936d3c91b92e7ac571a660766551173da71618803e529cc9498d15e6df","target":"record","created_at":"2026-07-05T00:01:13Z","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":"4fd092f3bc7d2a783822d8b4b3a53b4b0526bebf3b16fe94d2fa967d85931856","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-02T19:47:47Z","title_canon_sha256":"39b22bff3a4219a6f75576d686f133fc2378fdf4062d07411527fb35538ff41d"},"schema_version":"1.0","source":{"id":"1909.00843","kind":"arxiv","version":1}},"canonical_sha256":"9769b213a72329422631026696a891cf3d0b3a5a151f9c3b31390fcc60dddb4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9769b213a72329422631026696a891cf3d0b3a5a151f9c3b31390fcc60dddb4e","first_computed_at":"2026-07-05T00:01:13.261348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:01:13.261348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s3MaKkML+UioQbNh/cUbv/FNrk4tPJLYv/c8vX1fbQKozBv/vTw1c8mIqDgWe08B8Inok/aO/Vwce6soiT9QBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:01:13.261715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.00843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22f786936d3c91b92e7ac571a660766551173da71618803e529cc9498d15e6df","sha256:8af37a54bddfc931e46c1d5dc7f813f49e4638976cac26849a7af047e20c29cb"],"state_sha256":"b2396ce8765932f79660587ec2c9d0db5678abb471c4b17ef922c41c8b53da42"}