{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5YAI45Y2OR3SBUNDWUHCZPVB3I","short_pith_number":"pith:5YAI45Y2","schema_version":"1.0","canonical_sha256":"ee008e771a747720d1a3b50e2cbea1da171536622b8a75ef88bb9d5a91966f3b","source":{"kind":"arxiv","id":"1705.08030","version":1},"attestation_state":"computed","paper":{"title":"Parallel Stochastic Gradient Descent with Sound Combiners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Madanlal Musuvathi, Saeed Maleki, Todd Mytkowicz","submitted_at":"2017-05-22T22:32:28Z","abstract_excerpt":"Stochastic gradient descent (SGD) is a well known method for regression and classification tasks. However, it is an inherently sequential algorithm at each step, the processing of the current example depends on the parameters learned from the previous examples. Prior approaches to parallelizing linear learners using SGD, such as HOGWILD! and ALLREDUCE, do not honor these dependencies across threads and thus can potentially suffer poor convergence rates and/or poor scalability. This paper proposes SYMSGD, a parallel SGD algorithm that, to a first-order approximation, retains the sequential sema"},"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":"1705.08030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-22T22:32:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1897fbe6f5393c0d2de4163980421d9c64d0552a3e7b204fe5797cf077734038","abstract_canon_sha256":"c831a81780437897f6596e40378b2af139ccec7cd33d8037623238fa4c1f1e9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:49.505007Z","signature_b64":"PNbS4bvCblEQQ1hD94H8ps1WzVASArD/bSqDC/jH+PlALJrIZCjaIVNqDUw/KIxPCL2HD7N2DAB0ztreQwsUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee008e771a747720d1a3b50e2cbea1da171536622b8a75ef88bb9d5a91966f3b","last_reissued_at":"2026-05-18T00:43:49.504408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:49.504408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Stochastic Gradient Descent with Sound Combiners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Madanlal Musuvathi, Saeed Maleki, Todd Mytkowicz","submitted_at":"2017-05-22T22:32:28Z","abstract_excerpt":"Stochastic gradient descent (SGD) is a well known method for regression and classification tasks. However, it is an inherently sequential algorithm at each step, the processing of the current example depends on the parameters learned from the previous examples. Prior approaches to parallelizing linear learners using SGD, such as HOGWILD! and ALLREDUCE, do not honor these dependencies across threads and thus can potentially suffer poor convergence rates and/or poor scalability. This paper proposes SYMSGD, a parallel SGD algorithm that, to a first-order approximation, retains the sequential sema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08030","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":"1705.08030","created_at":"2026-05-18T00:43:49.504507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08030v1","created_at":"2026-05-18T00:43:49.504507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08030","created_at":"2026-05-18T00:43:49.504507+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YAI45Y2OR3S","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YAI45Y2OR3SBUND","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YAI45Y2","created_at":"2026-05-18T12:31:03.183658+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/5YAI45Y2OR3SBUNDWUHCZPVB3I","json":"https://pith.science/pith/5YAI45Y2OR3SBUNDWUHCZPVB3I.json","graph_json":"https://pith.science/api/pith-number/5YAI45Y2OR3SBUNDWUHCZPVB3I/graph.json","events_json":"https://pith.science/api/pith-number/5YAI45Y2OR3SBUNDWUHCZPVB3I/events.json","paper":"https://pith.science/paper/5YAI45Y2"},"agent_actions":{"view_html":"https://pith.science/pith/5YAI45Y2OR3SBUNDWUHCZPVB3I","download_json":"https://pith.science/pith/5YAI45Y2OR3SBUNDWUHCZPVB3I.json","view_paper":"https://pith.science/paper/5YAI45Y2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08030&json=true","fetch_graph":"https://pith.science/api/pith-number/5YAI45Y2OR3SBUNDWUHCZPVB3I/graph.json","fetch_events":"https://pith.science/api/pith-number/5YAI45Y2OR3SBUNDWUHCZPVB3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YAI45Y2OR3SBUNDWUHCZPVB3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YAI45Y2OR3SBUNDWUHCZPVB3I/action/storage_attestation","attest_author":"https://pith.science/pith/5YAI45Y2OR3SBUNDWUHCZPVB3I/action/author_attestation","sign_citation":"https://pith.science/pith/5YAI45Y2OR3SBUNDWUHCZPVB3I/action/citation_signature","submit_replication":"https://pith.science/pith/5YAI45Y2OR3SBUNDWUHCZPVB3I/action/replication_record"}},"created_at":"2026-05-18T00:43:49.504507+00:00","updated_at":"2026-05-18T00:43:49.504507+00:00"}