{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VJMUI6FKDYNODQ4IIDA5JPGCLE","short_pith_number":"pith:VJMUI6FK","schema_version":"1.0","canonical_sha256":"aa594478aa1e1ae1c38840c1d4bcc259217f6d57d8eac302865b9cba58610b1f","source":{"kind":"arxiv","id":"1405.4544","version":2},"attestation_state":"computed","paper":{"title":"A distributed block coordinate descent method for training $l_1$ regularized linear classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dhruv Mahajan, S. Sathiya Keerthi, S. Sundararajan","submitted_at":"2014-05-18T20:07:41Z","abstract_excerpt":"Distributed training of $l_1$ regularized classifiers has received great attention recently. Most existing methods approach this problem by taking steps obtained from approximating the objective by a quadratic approximation that is decoupled at the individual variable level. These methods are designed for multicore and MPI platforms where communication costs are low. They are inefficient on systems such as Hadoop running on a cluster of commodity machines where communication costs are substantial. In this paper we design a distributed algorithm for $l_1$ regularization that is much better suit"},"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":"1405.4544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-18T20:07:41Z","cross_cats_sorted":[],"title_canon_sha256":"20f6d273878bd82139419b8fee94b1915170e84ffba28acdef9939f24259cf47","abstract_canon_sha256":"43033d37fede42275ff0920d3617fc7f9fe11403037e079dc488fbbc287c4529"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:59.222434Z","signature_b64":"3t6BR6hcGfJ9m1XV/xVMY96k/gdw/oEZfy/yHNOZFaiutJ0cc8k1PCzZsppbUxYxQ87neTEugKCUSPA59kgaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa594478aa1e1ae1c38840c1d4bcc259217f6d57d8eac302865b9cba58610b1f","last_reissued_at":"2026-05-18T00:56:59.221943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:59.221943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A distributed block coordinate descent method for training $l_1$ regularized linear classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dhruv Mahajan, S. Sathiya Keerthi, S. Sundararajan","submitted_at":"2014-05-18T20:07:41Z","abstract_excerpt":"Distributed training of $l_1$ regularized classifiers has received great attention recently. Most existing methods approach this problem by taking steps obtained from approximating the objective by a quadratic approximation that is decoupled at the individual variable level. These methods are designed for multicore and MPI platforms where communication costs are low. They are inefficient on systems such as Hadoop running on a cluster of commodity machines where communication costs are substantial. In this paper we design a distributed algorithm for $l_1$ regularization that is much better suit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4544","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":"1405.4544","created_at":"2026-05-18T00:56:59.222032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.4544v2","created_at":"2026-05-18T00:56:59.222032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4544","created_at":"2026-05-18T00:56:59.222032+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJMUI6FKDYNO","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJMUI6FKDYNODQ4I","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJMUI6FK","created_at":"2026-05-18T12:28:54.890064+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/VJMUI6FKDYNODQ4IIDA5JPGCLE","json":"https://pith.science/pith/VJMUI6FKDYNODQ4IIDA5JPGCLE.json","graph_json":"https://pith.science/api/pith-number/VJMUI6FKDYNODQ4IIDA5JPGCLE/graph.json","events_json":"https://pith.science/api/pith-number/VJMUI6FKDYNODQ4IIDA5JPGCLE/events.json","paper":"https://pith.science/paper/VJMUI6FK"},"agent_actions":{"view_html":"https://pith.science/pith/VJMUI6FKDYNODQ4IIDA5JPGCLE","download_json":"https://pith.science/pith/VJMUI6FKDYNODQ4IIDA5JPGCLE.json","view_paper":"https://pith.science/paper/VJMUI6FK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.4544&json=true","fetch_graph":"https://pith.science/api/pith-number/VJMUI6FKDYNODQ4IIDA5JPGCLE/graph.json","fetch_events":"https://pith.science/api/pith-number/VJMUI6FKDYNODQ4IIDA5JPGCLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJMUI6FKDYNODQ4IIDA5JPGCLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJMUI6FKDYNODQ4IIDA5JPGCLE/action/storage_attestation","attest_author":"https://pith.science/pith/VJMUI6FKDYNODQ4IIDA5JPGCLE/action/author_attestation","sign_citation":"https://pith.science/pith/VJMUI6FKDYNODQ4IIDA5JPGCLE/action/citation_signature","submit_replication":"https://pith.science/pith/VJMUI6FKDYNODQ4IIDA5JPGCLE/action/replication_record"}},"created_at":"2026-05-18T00:56:59.222032+00:00","updated_at":"2026-05-18T00:56:59.222032+00:00"}