{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ERZT6SV6A73RNM4EXJ23FCOREH","short_pith_number":"pith:ERZT6SV6","schema_version":"1.0","canonical_sha256":"24733f4abe07f716b384ba75b289d121fb0026d5836caca5bbd500407b2a28dc","source":{"kind":"arxiv","id":"1409.1458","version":2},"attestation_state":"computed","paper":{"title":"Communication-Efficient Distributed Dual Coordinate Ascent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jonathan Terhorst, Martin Jaggi, Martin Tak\\'a\\v{c}, Michael I. Jordan, Sanjay Krishnan, Thomas Hofmann, Virginia Smith","submitted_at":"2014-09-04T14:59:35Z","abstract_excerpt":"Communication remains the most significant bottleneck in the performance of distributed optimization algorithms for large-scale machine learning. In this paper, we propose a communication-efficient framework, CoCoA, that uses local computation in a primal-dual setting to dramatically reduce the amount of necessary communication. We provide a strong convergence rate analysis for this class of algorithms, as well as experiments on real-world distributed datasets with implementations in Spark. In our experiments, we find that as compared to state-of-the-art mini-batch versions of SGD and SDCA alg"},"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":"1409.1458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-04T14:59:35Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"b098eaa594e18f43c6aae1a33f66c7a8fe95d3d1bab1894a0bcc52b52de26d57","abstract_canon_sha256":"939cecde4b8e170e31be145d81a59e1e8ec99d9d2884c4f1244be60c11cb7a1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:41.002342Z","signature_b64":"64HoFX3ILeoyULbF48hSQezaaTdXLRKLhIp3sLl8VR8F24ecDYecDDYL8KLy0txmx3sSHkGM2frd7RGxWcDnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24733f4abe07f716b384ba75b289d121fb0026d5836caca5bbd500407b2a28dc","last_reissued_at":"2026-05-18T02:41:41.001734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:41.001734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-Efficient Distributed Dual Coordinate Ascent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jonathan Terhorst, Martin Jaggi, Martin Tak\\'a\\v{c}, Michael I. Jordan, Sanjay Krishnan, Thomas Hofmann, Virginia Smith","submitted_at":"2014-09-04T14:59:35Z","abstract_excerpt":"Communication remains the most significant bottleneck in the performance of distributed optimization algorithms for large-scale machine learning. In this paper, we propose a communication-efficient framework, CoCoA, that uses local computation in a primal-dual setting to dramatically reduce the amount of necessary communication. We provide a strong convergence rate analysis for this class of algorithms, as well as experiments on real-world distributed datasets with implementations in Spark. In our experiments, we find that as compared to state-of-the-art mini-batch versions of SGD and SDCA alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1458","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":"1409.1458","created_at":"2026-05-18T02:41:41.001801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.1458v2","created_at":"2026-05-18T02:41:41.001801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1458","created_at":"2026-05-18T02:41:41.001801+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERZT6SV6A73R","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERZT6SV6A73RNM4E","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERZT6SV6","created_at":"2026-05-18T12:28:28.263976+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/ERZT6SV6A73RNM4EXJ23FCOREH","json":"https://pith.science/pith/ERZT6SV6A73RNM4EXJ23FCOREH.json","graph_json":"https://pith.science/api/pith-number/ERZT6SV6A73RNM4EXJ23FCOREH/graph.json","events_json":"https://pith.science/api/pith-number/ERZT6SV6A73RNM4EXJ23FCOREH/events.json","paper":"https://pith.science/paper/ERZT6SV6"},"agent_actions":{"view_html":"https://pith.science/pith/ERZT6SV6A73RNM4EXJ23FCOREH","download_json":"https://pith.science/pith/ERZT6SV6A73RNM4EXJ23FCOREH.json","view_paper":"https://pith.science/paper/ERZT6SV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.1458&json=true","fetch_graph":"https://pith.science/api/pith-number/ERZT6SV6A73RNM4EXJ23FCOREH/graph.json","fetch_events":"https://pith.science/api/pith-number/ERZT6SV6A73RNM4EXJ23FCOREH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERZT6SV6A73RNM4EXJ23FCOREH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERZT6SV6A73RNM4EXJ23FCOREH/action/storage_attestation","attest_author":"https://pith.science/pith/ERZT6SV6A73RNM4EXJ23FCOREH/action/author_attestation","sign_citation":"https://pith.science/pith/ERZT6SV6A73RNM4EXJ23FCOREH/action/citation_signature","submit_replication":"https://pith.science/pith/ERZT6SV6A73RNM4EXJ23FCOREH/action/replication_record"}},"created_at":"2026-05-18T02:41:41.001801+00:00","updated_at":"2026-05-18T02:41:41.001801+00:00"}