{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WG3LB6PM6DSAJDGTFENNTF6E5F","short_pith_number":"pith:WG3LB6PM","schema_version":"1.0","canonical_sha256":"b1b6b0f9ecf0e4048cd3291ad997c4e9569221ad8b8ea761c7300ef35324d0f2","source":{"kind":"arxiv","id":"1803.08917","version":1},"attestation_state":"computed","paper":{"title":"Byzantine Stochastic Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dan Alistarh, Jerry Li, Zeyuan Allen-Zhu","submitted_at":"2018-03-23T17:58:54Z","abstract_excerpt":"This paper studies the problem of distributed stochastic optimization in an adversarial setting where, out of the $m$ machines which allegedly compute stochastic gradients every iteration, an $\\alpha$-fraction are Byzantine, and can behave arbitrarily and adversarially. Our main result is a variant of stochastic gradient descent (SGD) which finds $\\varepsilon$-approximate minimizers of convex functions in $T = \\tilde{O}\\big( \\frac{1}{\\varepsilon^2 m} + \\frac{\\alpha^2}{\\varepsilon^2} \\big)$ iterations. In contrast, traditional mini-batch SGD needs $T = O\\big( \\frac{1}{\\varepsilon^2 m} \\big)$ it"},"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":"1803.08917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-23T17:58:54Z","cross_cats_sorted":["cs.DC","cs.DS","math.OC","stat.ML"],"title_canon_sha256":"f16b9ac9e9d8f7efb74d2a72b8ec70e9f9b6d5f30c9c941428734d555831ab7e","abstract_canon_sha256":"246105f3947c747a3394db07c904f3f63f8df85a9c63691bd1a368c5f0711f2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:18.240004Z","signature_b64":"kAL5Bws5e9bJAbkfSsGaIQPy2hYUJQ1rfWmPp+66+LG6+4bZCP9r/ZTaMmz3avDjEL7svW5iwc/tK0GBjDXwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1b6b0f9ecf0e4048cd3291ad997c4e9569221ad8b8ea761c7300ef35324d0f2","last_reissued_at":"2026-05-18T00:20:18.239351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:18.239351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine Stochastic Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dan Alistarh, Jerry Li, Zeyuan Allen-Zhu","submitted_at":"2018-03-23T17:58:54Z","abstract_excerpt":"This paper studies the problem of distributed stochastic optimization in an adversarial setting where, out of the $m$ machines which allegedly compute stochastic gradients every iteration, an $\\alpha$-fraction are Byzantine, and can behave arbitrarily and adversarially. Our main result is a variant of stochastic gradient descent (SGD) which finds $\\varepsilon$-approximate minimizers of convex functions in $T = \\tilde{O}\\big( \\frac{1}{\\varepsilon^2 m} + \\frac{\\alpha^2}{\\varepsilon^2} \\big)$ iterations. In contrast, traditional mini-batch SGD needs $T = O\\big( \\frac{1}{\\varepsilon^2 m} \\big)$ it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08917","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.08917","created_at":"2026-05-18T00:20:18.239451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08917v1","created_at":"2026-05-18T00:20:18.239451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08917","created_at":"2026-05-18T00:20:18.239451+00:00"},{"alias_kind":"pith_short_12","alias_value":"WG3LB6PM6DSA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WG3LB6PM6DSAJDGT","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WG3LB6PM","created_at":"2026-05-18T12:32:59.047623+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/WG3LB6PM6DSAJDGTFENNTF6E5F","json":"https://pith.science/pith/WG3LB6PM6DSAJDGTFENNTF6E5F.json","graph_json":"https://pith.science/api/pith-number/WG3LB6PM6DSAJDGTFENNTF6E5F/graph.json","events_json":"https://pith.science/api/pith-number/WG3LB6PM6DSAJDGTFENNTF6E5F/events.json","paper":"https://pith.science/paper/WG3LB6PM"},"agent_actions":{"view_html":"https://pith.science/pith/WG3LB6PM6DSAJDGTFENNTF6E5F","download_json":"https://pith.science/pith/WG3LB6PM6DSAJDGTFENNTF6E5F.json","view_paper":"https://pith.science/paper/WG3LB6PM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08917&json=true","fetch_graph":"https://pith.science/api/pith-number/WG3LB6PM6DSAJDGTFENNTF6E5F/graph.json","fetch_events":"https://pith.science/api/pith-number/WG3LB6PM6DSAJDGTFENNTF6E5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WG3LB6PM6DSAJDGTFENNTF6E5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WG3LB6PM6DSAJDGTFENNTF6E5F/action/storage_attestation","attest_author":"https://pith.science/pith/WG3LB6PM6DSAJDGTFENNTF6E5F/action/author_attestation","sign_citation":"https://pith.science/pith/WG3LB6PM6DSAJDGTFENNTF6E5F/action/citation_signature","submit_replication":"https://pith.science/pith/WG3LB6PM6DSAJDGTFENNTF6E5F/action/replication_record"}},"created_at":"2026-05-18T00:20:18.239451+00:00","updated_at":"2026-05-18T00:20:18.239451+00:00"}