{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JZTLYNT6AZ24EYQJ6ZSHJYHMZB","short_pith_number":"pith:JZTLYNT6","schema_version":"1.0","canonical_sha256":"4e66bc367e0675c26209f66474e0ecc8780e45fbd7e108d6d3943f75eba38160","source":{"kind":"arxiv","id":"1312.1031","version":2},"attestation_state":"computed","paper":{"title":"Analysis of Distributed Stochastic Dual Coordinate Ascent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Rong Jin, Shenghuo Zhu, Tianbao Yang, Yuanqing Lin","submitted_at":"2013-12-04T05:48:30Z","abstract_excerpt":"In \\citep{Yangnips13}, the author presented distributed stochastic dual coordinate ascent (DisDCA) algorithms for solving large-scale regularized loss minimization. Extraordinary performances have been observed and reported for the well-motivated updates, as referred to the practical updates, compared to the naive updates. However, no serious analysis has been provided to understand the updates and therefore the convergence rates. In the paper, we bridge the gap by providing a theoretical analysis of the convergence rates of the practical DisDCA algorithm. Our analysis helped by empirical stud"},"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":"1312.1031","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-04T05:48:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e0a10c4c88c7e4a03780d1cf5d649bb37a1858f75d48035da6f5aaa152f655f4","abstract_canon_sha256":"b73ea41b848119b5d2ce39cd5c7cac9192c99e6008c86972924ad9f0f626dd3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:48.120378Z","signature_b64":"IBYg42N7nCKsNRmj4UzszLv13QUslg7wxOgHQj8c6gqD9Oh7IbX1a2OPqjjIuUbYjNULMpqhNsztgYmN43tGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e66bc367e0675c26209f66474e0ecc8780e45fbd7e108d6d3943f75eba38160","last_reissued_at":"2026-05-18T02:55:48.119655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:48.119655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Distributed Stochastic Dual Coordinate Ascent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Rong Jin, Shenghuo Zhu, Tianbao Yang, Yuanqing Lin","submitted_at":"2013-12-04T05:48:30Z","abstract_excerpt":"In \\citep{Yangnips13}, the author presented distributed stochastic dual coordinate ascent (DisDCA) algorithms for solving large-scale regularized loss minimization. Extraordinary performances have been observed and reported for the well-motivated updates, as referred to the practical updates, compared to the naive updates. However, no serious analysis has been provided to understand the updates and therefore the convergence rates. In the paper, we bridge the gap by providing a theoretical analysis of the convergence rates of the practical DisDCA algorithm. Our analysis helped by empirical stud"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1031","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":"1312.1031","created_at":"2026-05-18T02:55:48.119771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1031v2","created_at":"2026-05-18T02:55:48.119771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1031","created_at":"2026-05-18T02:55:48.119771+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZTLYNT6AZ24","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZTLYNT6AZ24EYQJ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZTLYNT6","created_at":"2026-05-18T12:27:49.015174+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/JZTLYNT6AZ24EYQJ6ZSHJYHMZB","json":"https://pith.science/pith/JZTLYNT6AZ24EYQJ6ZSHJYHMZB.json","graph_json":"https://pith.science/api/pith-number/JZTLYNT6AZ24EYQJ6ZSHJYHMZB/graph.json","events_json":"https://pith.science/api/pith-number/JZTLYNT6AZ24EYQJ6ZSHJYHMZB/events.json","paper":"https://pith.science/paper/JZTLYNT6"},"agent_actions":{"view_html":"https://pith.science/pith/JZTLYNT6AZ24EYQJ6ZSHJYHMZB","download_json":"https://pith.science/pith/JZTLYNT6AZ24EYQJ6ZSHJYHMZB.json","view_paper":"https://pith.science/paper/JZTLYNT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1031&json=true","fetch_graph":"https://pith.science/api/pith-number/JZTLYNT6AZ24EYQJ6ZSHJYHMZB/graph.json","fetch_events":"https://pith.science/api/pith-number/JZTLYNT6AZ24EYQJ6ZSHJYHMZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZTLYNT6AZ24EYQJ6ZSHJYHMZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZTLYNT6AZ24EYQJ6ZSHJYHMZB/action/storage_attestation","attest_author":"https://pith.science/pith/JZTLYNT6AZ24EYQJ6ZSHJYHMZB/action/author_attestation","sign_citation":"https://pith.science/pith/JZTLYNT6AZ24EYQJ6ZSHJYHMZB/action/citation_signature","submit_replication":"https://pith.science/pith/JZTLYNT6AZ24EYQJ6ZSHJYHMZB/action/replication_record"}},"created_at":"2026-05-18T02:55:48.119771+00:00","updated_at":"2026-05-18T02:55:48.119771+00:00"}