{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NAG57CRL3HO57BIUQ6XE2N7GFG","short_pith_number":"pith:NAG57CRL","schema_version":"1.0","canonical_sha256":"680ddf8a2bd9dddf851487ae4d37e629ad81b78c9651f66d09465d7722b41db7","source":{"kind":"arxiv","id":"1605.06619","version":1},"attestation_state":"computed","paper":{"title":"Make Workers Work Harder: Decoupled Asynchronous Proximal Stochastic Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Linli Xu, Qing Ling, Xiaowei Zhong, Yitan Li","submitted_at":"2016-05-21T10:27:50Z","abstract_excerpt":"Asynchronous parallel optimization algorithms for solving large-scale machine learning problems have drawn significant attention from academia to industry recently. This paper proposes a novel algorithm, decoupled asynchronous proximal stochastic gradient descent (DAP-SGD), to minimize an objective function that is the composite of the average of multiple empirical losses and a regularization term. Unlike the traditional asynchronous proximal stochastic gradient descent (TAP-SGD) in which the master carries much of the computation load, the proposed algorithm off-loads the majority of computat"},"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":"1605.06619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-21T10:27:50Z","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"title_canon_sha256":"47745e4b703a596a9274fff3b8d6fe323c8a2de7d967122bd8bb8ef655bfca4b","abstract_canon_sha256":"5016e4044ef9d5fb6533a9f750cc7c17490e271cff32aba8a6899a02ae3ac994"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:11.738728Z","signature_b64":"o7w3ZbVFDyyXzkygAgeMgXePqh4b/Lmy2TMsgofl7bThmvs162TsHfMKWASTk310SGwfGdAsBrcGyYvnQNeoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"680ddf8a2bd9dddf851487ae4d37e629ad81b78c9651f66d09465d7722b41db7","last_reissued_at":"2026-05-18T01:14:11.738215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:11.738215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Make Workers Work Harder: Decoupled Asynchronous Proximal Stochastic Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Linli Xu, Qing Ling, Xiaowei Zhong, Yitan Li","submitted_at":"2016-05-21T10:27:50Z","abstract_excerpt":"Asynchronous parallel optimization algorithms for solving large-scale machine learning problems have drawn significant attention from academia to industry recently. This paper proposes a novel algorithm, decoupled asynchronous proximal stochastic gradient descent (DAP-SGD), to minimize an objective function that is the composite of the average of multiple empirical losses and a regularization term. Unlike the traditional asynchronous proximal stochastic gradient descent (TAP-SGD) in which the master carries much of the computation load, the proposed algorithm off-loads the majority of computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06619","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":"1605.06619","created_at":"2026-05-18T01:14:11.738293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06619v1","created_at":"2026-05-18T01:14:11.738293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06619","created_at":"2026-05-18T01:14:11.738293+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAG57CRL3HO5","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAG57CRL3HO57BIU","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAG57CRL","created_at":"2026-05-18T12:30:32.724797+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/NAG57CRL3HO57BIUQ6XE2N7GFG","json":"https://pith.science/pith/NAG57CRL3HO57BIUQ6XE2N7GFG.json","graph_json":"https://pith.science/api/pith-number/NAG57CRL3HO57BIUQ6XE2N7GFG/graph.json","events_json":"https://pith.science/api/pith-number/NAG57CRL3HO57BIUQ6XE2N7GFG/events.json","paper":"https://pith.science/paper/NAG57CRL"},"agent_actions":{"view_html":"https://pith.science/pith/NAG57CRL3HO57BIUQ6XE2N7GFG","download_json":"https://pith.science/pith/NAG57CRL3HO57BIUQ6XE2N7GFG.json","view_paper":"https://pith.science/paper/NAG57CRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06619&json=true","fetch_graph":"https://pith.science/api/pith-number/NAG57CRL3HO57BIUQ6XE2N7GFG/graph.json","fetch_events":"https://pith.science/api/pith-number/NAG57CRL3HO57BIUQ6XE2N7GFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAG57CRL3HO57BIUQ6XE2N7GFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAG57CRL3HO57BIUQ6XE2N7GFG/action/storage_attestation","attest_author":"https://pith.science/pith/NAG57CRL3HO57BIUQ6XE2N7GFG/action/author_attestation","sign_citation":"https://pith.science/pith/NAG57CRL3HO57BIUQ6XE2N7GFG/action/citation_signature","submit_replication":"https://pith.science/pith/NAG57CRL3HO57BIUQ6XE2N7GFG/action/replication_record"}},"created_at":"2026-05-18T01:14:11.738293+00:00","updated_at":"2026-05-18T01:14:11.738293+00:00"}