{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ROIKUZIPKDY2W5HT3HR3SWQDXY","short_pith_number":"pith:ROIKUZIP","schema_version":"1.0","canonical_sha256":"8b90aa650f50f1ab74f3d9e3b95a03be139c63bd3b535800b8e71567292b485c","source":{"kind":"arxiv","id":"1609.06804","version":2},"attestation_state":"computed","paper":{"title":"Decoupled Asynchronous Proximal Stochastic Gradient Descent with Variance Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Bin Gu, Heng Huang, Zhouyuan Huo","submitted_at":"2016-09-22T02:50:09Z","abstract_excerpt":"In the era of big data, optimizing large scale machine learning problems becomes a challenging task and draws significant attention. Asynchronous optimization algorithms come out as a promising solution. Recently, decoupled asynchronous proximal stochastic gradient descent (DAP-SGD) is proposed to minimize a composite function. It is claimed to be able to off-loads the computation bottleneck from server to workers by allowing workers to evaluate the proximal operators, therefore, server just need to do element-wise operations. However, it still suffers from slow convergence rate because of the"},"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":"1609.06804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-22T02:50:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3ea0dc7c1d9c32ccd76527e5cf99b794ba738b34f93b4d57614d035b30fd596d","abstract_canon_sha256":"5857900924c95579a341dc4b9af4cf29fc13e15147c51bc1da3a6f193ff405a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:40.370049Z","signature_b64":"+VSQpu198QryKxyr7PO5LVMSmx46bVRoDuyC8dgfsGejcwO2cO3b4xoQdtWXVCUW3V7C047jgIy8zsQizG7ICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b90aa650f50f1ab74f3d9e3b95a03be139c63bd3b535800b8e71567292b485c","last_reissued_at":"2026-05-18T01:03:40.369536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:40.369536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoupled Asynchronous Proximal Stochastic Gradient Descent with Variance Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Bin Gu, Heng Huang, Zhouyuan Huo","submitted_at":"2016-09-22T02:50:09Z","abstract_excerpt":"In the era of big data, optimizing large scale machine learning problems becomes a challenging task and draws significant attention. Asynchronous optimization algorithms come out as a promising solution. Recently, decoupled asynchronous proximal stochastic gradient descent (DAP-SGD) is proposed to minimize a composite function. It is claimed to be able to off-loads the computation bottleneck from server to workers by allowing workers to evaluate the proximal operators, therefore, server just need to do element-wise operations. However, it still suffers from slow convergence rate because of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06804","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":""},"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":"1609.06804","created_at":"2026-05-18T01:03:40.369615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06804v2","created_at":"2026-05-18T01:03:40.369615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06804","created_at":"2026-05-18T01:03:40.369615+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROIKUZIPKDY2","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROIKUZIPKDY2W5HT","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROIKUZIP","created_at":"2026-05-18T12:30:41.710351+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/ROIKUZIPKDY2W5HT3HR3SWQDXY","json":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY.json","graph_json":"https://pith.science/api/pith-number/ROIKUZIPKDY2W5HT3HR3SWQDXY/graph.json","events_json":"https://pith.science/api/pith-number/ROIKUZIPKDY2W5HT3HR3SWQDXY/events.json","paper":"https://pith.science/paper/ROIKUZIP"},"agent_actions":{"view_html":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY","download_json":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY.json","view_paper":"https://pith.science/paper/ROIKUZIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06804&json=true","fetch_graph":"https://pith.science/api/pith-number/ROIKUZIPKDY2W5HT3HR3SWQDXY/graph.json","fetch_events":"https://pith.science/api/pith-number/ROIKUZIPKDY2W5HT3HR3SWQDXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY/action/storage_attestation","attest_author":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY/action/author_attestation","sign_citation":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY/action/citation_signature","submit_replication":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY/action/replication_record"}},"created_at":"2026-05-18T01:03:40.369615+00:00","updated_at":"2026-05-18T01:03:40.369615+00:00"}