{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DA35I75XRC2K2WHMPBC5ZDQSRJ","short_pith_number":"pith:DA35I75X","schema_version":"1.0","canonical_sha256":"1837d47fb788b4ad58ec7845dc8e128a518c593a5582b2f8442441f32169ab19","source":{"kind":"arxiv","id":"1305.2581","version":1},"attestation_state":"computed","paper":{"title":"Accelerated Mini-Batch Stochastic Dual Coordinate Ascent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Shai Shalev-Shwartz, Tong Zhang","submitted_at":"2013-05-12T12:46:25Z","abstract_excerpt":"Stochastic dual coordinate ascent (SDCA) is an effective technique for solving regularized loss minimization problems in machine learning. This paper considers an extension of SDCA under the mini-batch setting that is often used in practice. Our main contribution is to introduce an accelerated mini-batch version of SDCA and prove a fast convergence rate for this method. We discuss an implementation of our method over a parallel computing system, and compare the results to both the vanilla stochastic dual coordinate ascent and to the accelerated deterministic gradient descent method of \\cite{ne"},"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":"1305.2581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-05-12T12:46:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c742cd6c299d6c9612b8b96e3ad486817a5411c3b0f3dea47d675102f850027e","abstract_canon_sha256":"e3f6a25594e6177bfe6f3256010e36530add24d8b6d9f8377a933c33589dbfca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:57.457703Z","signature_b64":"tkN1BzP3pNaSMeF2nZa+QWGrzo5XTfty2B459DifGdDaGUes9gmAJKG0zRkMQOMgbgf8ixyV+ZUOtbiCCqATBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1837d47fb788b4ad58ec7845dc8e128a518c593a5582b2f8442441f32169ab19","last_reissued_at":"2026-05-18T03:25:57.457005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:57.457005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Mini-Batch Stochastic Dual Coordinate Ascent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Shai Shalev-Shwartz, Tong Zhang","submitted_at":"2013-05-12T12:46:25Z","abstract_excerpt":"Stochastic dual coordinate ascent (SDCA) is an effective technique for solving regularized loss minimization problems in machine learning. This paper considers an extension of SDCA under the mini-batch setting that is often used in practice. Our main contribution is to introduce an accelerated mini-batch version of SDCA and prove a fast convergence rate for this method. We discuss an implementation of our method over a parallel computing system, and compare the results to both the vanilla stochastic dual coordinate ascent and to the accelerated deterministic gradient descent method of \\cite{ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2581","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":"1305.2581","created_at":"2026-05-18T03:25:57.457116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2581v1","created_at":"2026-05-18T03:25:57.457116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2581","created_at":"2026-05-18T03:25:57.457116+00:00"},{"alias_kind":"pith_short_12","alias_value":"DA35I75XRC2K","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"DA35I75XRC2K2WHM","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"DA35I75X","created_at":"2026-05-18T12:27:40.988391+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/DA35I75XRC2K2WHMPBC5ZDQSRJ","json":"https://pith.science/pith/DA35I75XRC2K2WHMPBC5ZDQSRJ.json","graph_json":"https://pith.science/api/pith-number/DA35I75XRC2K2WHMPBC5ZDQSRJ/graph.json","events_json":"https://pith.science/api/pith-number/DA35I75XRC2K2WHMPBC5ZDQSRJ/events.json","paper":"https://pith.science/paper/DA35I75X"},"agent_actions":{"view_html":"https://pith.science/pith/DA35I75XRC2K2WHMPBC5ZDQSRJ","download_json":"https://pith.science/pith/DA35I75XRC2K2WHMPBC5ZDQSRJ.json","view_paper":"https://pith.science/paper/DA35I75X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2581&json=true","fetch_graph":"https://pith.science/api/pith-number/DA35I75XRC2K2WHMPBC5ZDQSRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DA35I75XRC2K2WHMPBC5ZDQSRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DA35I75XRC2K2WHMPBC5ZDQSRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DA35I75XRC2K2WHMPBC5ZDQSRJ/action/storage_attestation","attest_author":"https://pith.science/pith/DA35I75XRC2K2WHMPBC5ZDQSRJ/action/author_attestation","sign_citation":"https://pith.science/pith/DA35I75XRC2K2WHMPBC5ZDQSRJ/action/citation_signature","submit_replication":"https://pith.science/pith/DA35I75XRC2K2WHMPBC5ZDQSRJ/action/replication_record"}},"created_at":"2026-05-18T03:25:57.457116+00:00","updated_at":"2026-05-18T03:25:57.457116+00:00"}