{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2G563JAFGFHE5EAYTSTXDDPX5Z","short_pith_number":"pith:2G563JAF","schema_version":"1.0","canonical_sha256":"d1bbeda405314e4e90189ca7718df7ee4e80021cdd68d0f9bbccba4bc1bb5817","source":{"kind":"arxiv","id":"1803.04209","version":1},"attestation_state":"computed","paper":{"title":"High Throughput Synchronous Distributed Stochastic Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DC","authors_text":"Frank Wood, Michael Teng","submitted_at":"2018-03-12T11:51:38Z","abstract_excerpt":"We introduce a new, high-throughput, synchronous, distributed, data-parallel, stochastic-gradient-descent learning algorithm. This algorithm uses amortized inference in a compute-cluster-specific, deep, generative, dynamical model to perform joint posterior predictive inference of the mini-batch gradient computation times of all worker-nodes in a parallel computing cluster. We show that a synchronous parameter server can, by utilizing such a model, choose an optimal cutoff time beyond which mini-batch gradient messages from slow workers are ignored that maximizes overall mini-batch gradient co"},"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.04209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T11:51:38Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"269a1da64d18874c4700eecd9a259aae0583421a6d12f916714b3e2823966d27","abstract_canon_sha256":"ed812cf7c4ea5ce1d975c89cff69e5dfa91c005b51ce892e1e072b006039023a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:19.155946Z","signature_b64":"78HM59lJlQ7K6aarwMTbBOMScuWJFr8bdwZ9akMle/a/YW+Xp8dKKlDfZbBB+2RSz0ppFng5IEX+4WokraqGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1bbeda405314e4e90189ca7718df7ee4e80021cdd68d0f9bbccba4bc1bb5817","last_reissued_at":"2026-05-18T00:21:19.155502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:19.155502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High Throughput Synchronous Distributed Stochastic Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DC","authors_text":"Frank Wood, Michael Teng","submitted_at":"2018-03-12T11:51:38Z","abstract_excerpt":"We introduce a new, high-throughput, synchronous, distributed, data-parallel, stochastic-gradient-descent learning algorithm. This algorithm uses amortized inference in a compute-cluster-specific, deep, generative, dynamical model to perform joint posterior predictive inference of the mini-batch gradient computation times of all worker-nodes in a parallel computing cluster. We show that a synchronous parameter server can, by utilizing such a model, choose an optimal cutoff time beyond which mini-batch gradient messages from slow workers are ignored that maximizes overall mini-batch gradient co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04209","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.04209","created_at":"2026-05-18T00:21:19.155564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04209v1","created_at":"2026-05-18T00:21:19.155564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04209","created_at":"2026-05-18T00:21:19.155564+00:00"},{"alias_kind":"pith_short_12","alias_value":"2G563JAFGFHE","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2G563JAFGFHE5EAY","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2G563JAF","created_at":"2026-05-18T12:32:02.567920+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/2G563JAFGFHE5EAYTSTXDDPX5Z","json":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z.json","graph_json":"https://pith.science/api/pith-number/2G563JAFGFHE5EAYTSTXDDPX5Z/graph.json","events_json":"https://pith.science/api/pith-number/2G563JAFGFHE5EAYTSTXDDPX5Z/events.json","paper":"https://pith.science/paper/2G563JAF"},"agent_actions":{"view_html":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z","download_json":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z.json","view_paper":"https://pith.science/paper/2G563JAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04209&json=true","fetch_graph":"https://pith.science/api/pith-number/2G563JAFGFHE5EAYTSTXDDPX5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/2G563JAFGFHE5EAYTSTXDDPX5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z/action/storage_attestation","attest_author":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z/action/author_attestation","sign_citation":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z/action/citation_signature","submit_replication":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z/action/replication_record"}},"created_at":"2026-05-18T00:21:19.155564+00:00","updated_at":"2026-05-18T00:21:19.155564+00:00"}