{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TZCYOPBWGV6ZRJQWD6TODB3G5Y","short_pith_number":"pith:TZCYOPBW","schema_version":"1.0","canonical_sha256":"9e45873c36357d98a6161fa6e18766ee31e8366b7f950303fd38c6a92ac16b03","source":{"kind":"arxiv","id":"1806.10077","version":2},"attestation_state":"computed","paper":{"title":"Random Shuffling Beats SGD after Finite Epochs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Jeff Z. HaoChen, Suvrit Sra","submitted_at":"2018-06-26T15:54:31Z","abstract_excerpt":"A long-standing problem in the theory of stochastic gradient descent (SGD) is to prove that its without-replacement version RandomShuffle converges faster than the usual with-replacement version. We present the first (to our knowledge) non-asymptotic solution to this problem, which shows that after a \"reasonable\" number of epochs RandomShuffle indeed converges faster than SGD. Specifically, we prove that under strong convexity and second-order smoothness, the sequence generated by RandomShuffle converges to the optimal solution at the rate O(1/T^2 + n^3/T^3), where n is the number of component"},"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":"1806.10077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-26T15:54:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"af2be462385baa23508d0d97ca852453b47274dc6fe9b8c3aca3d19e9f3713dd","abstract_canon_sha256":"303f76b2262524086bcfb75df5aeb183cdc2e5f090674a59f240f03c950dbe20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:13.463708Z","signature_b64":"fpCAH4E7QZ+0MikYigrUA3VnVTAh/2JQuINeSLfhWrwUqUvfzgStEPUBw0xDXmHSDQJP6JAjWEX3ewjvi5xvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e45873c36357d98a6161fa6e18766ee31e8366b7f950303fd38c6a92ac16b03","last_reissued_at":"2026-07-05T00:10:13.463275Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:13.463275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Shuffling Beats SGD after Finite Epochs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Jeff Z. HaoChen, Suvrit Sra","submitted_at":"2018-06-26T15:54:31Z","abstract_excerpt":"A long-standing problem in the theory of stochastic gradient descent (SGD) is to prove that its without-replacement version RandomShuffle converges faster than the usual with-replacement version. We present the first (to our knowledge) non-asymptotic solution to this problem, which shows that after a \"reasonable\" number of epochs RandomShuffle indeed converges faster than SGD. Specifically, we prove that under strong convexity and second-order smoothness, the sequence generated by RandomShuffle converges to the optimal solution at the rate O(1/T^2 + n^3/T^3), where n is the number of component"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10077","kind":"arxiv","version":2},"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/1806.10077/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":"1806.10077","created_at":"2026-07-05T00:10:13.463338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10077v2","created_at":"2026-07-05T00:10:13.463338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10077","created_at":"2026-07-05T00:10:13.463338+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZCYOPBWGV6Z","created_at":"2026-07-05T00:10:13.463338+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZCYOPBWGV6ZRJQW","created_at":"2026-07-05T00:10:13.463338+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZCYOPBW","created_at":"2026-07-05T00:10:13.463338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TZCYOPBWGV6ZRJQWD6TODB3G5Y","json":"https://pith.science/pith/TZCYOPBWGV6ZRJQWD6TODB3G5Y.json","graph_json":"https://pith.science/api/pith-number/TZCYOPBWGV6ZRJQWD6TODB3G5Y/graph.json","events_json":"https://pith.science/api/pith-number/TZCYOPBWGV6ZRJQWD6TODB3G5Y/events.json","paper":"https://pith.science/paper/TZCYOPBW"},"agent_actions":{"view_html":"https://pith.science/pith/TZCYOPBWGV6ZRJQWD6TODB3G5Y","download_json":"https://pith.science/pith/TZCYOPBWGV6ZRJQWD6TODB3G5Y.json","view_paper":"https://pith.science/paper/TZCYOPBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10077&json=true","fetch_graph":"https://pith.science/api/pith-number/TZCYOPBWGV6ZRJQWD6TODB3G5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/TZCYOPBWGV6ZRJQWD6TODB3G5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZCYOPBWGV6ZRJQWD6TODB3G5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZCYOPBWGV6ZRJQWD6TODB3G5Y/action/storage_attestation","attest_author":"https://pith.science/pith/TZCYOPBWGV6ZRJQWD6TODB3G5Y/action/author_attestation","sign_citation":"https://pith.science/pith/TZCYOPBWGV6ZRJQWD6TODB3G5Y/action/citation_signature","submit_replication":"https://pith.science/pith/TZCYOPBWGV6ZRJQWD6TODB3G5Y/action/replication_record"}},"created_at":"2026-07-05T00:10:13.463338+00:00","updated_at":"2026-07-05T00:10:13.463338+00:00"}