{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GXOPZNFYFSKKNCL2Z3Z2BF7HFN","short_pith_number":"pith:GXOPZNFY","schema_version":"1.0","canonical_sha256":"35dcfcb4b82c94a6897acef3a097e72b57fcdce4b0444655a0fe2ecd0078d629","source":{"kind":"arxiv","id":"1709.00537","version":2},"attestation_state":"computed","paper":{"title":"Communication-efficient Algorithm for Distributed Sparse Learning via Two-way Truncation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Jarvis Haupt, Jineng Ren","submitted_at":"2017-09-02T06:02:38Z","abstract_excerpt":"We propose a communicationally and computationally efficient algorithm for high-dimensional distributed sparse learning. At each iteration, local machines compute the gradient on local data and the master machine solves one shifted $l_1$ regularized minimization problem. The communication cost is reduced from constant times of the dimension number for the state-of-the-art algorithm to constant times of the sparsity number via Two-way Truncation procedure. Theoretically, we prove that the estimation error of the proposed algorithm decreases exponentially and matches that of the centralized meth"},"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":"1709.00537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-02T06:02:38Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"837965bd064c2c7108142970bb314fa1f3ed42e80586ce30af1fcf19cd4cec2f","abstract_canon_sha256":"20efb3567d2006e9f0eba88bb34e170dd72532f84c3790f21e839a0615d61f19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:40.673899Z","signature_b64":"G/O//OzHu7Sscwz2U0PPlvKPRiObikKRPPIH4bOqOGLymNEvgd3nu0hswGjeEgTwW3s6PaHE0nRbQuKE5IOeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35dcfcb4b82c94a6897acef3a097e72b57fcdce4b0444655a0fe2ecd0078d629","last_reissued_at":"2026-05-18T00:35:40.673384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:40.673384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-efficient Algorithm for Distributed Sparse Learning via Two-way Truncation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Jarvis Haupt, Jineng Ren","submitted_at":"2017-09-02T06:02:38Z","abstract_excerpt":"We propose a communicationally and computationally efficient algorithm for high-dimensional distributed sparse learning. At each iteration, local machines compute the gradient on local data and the master machine solves one shifted $l_1$ regularized minimization problem. The communication cost is reduced from constant times of the dimension number for the state-of-the-art algorithm to constant times of the sparsity number via Two-way Truncation procedure. Theoretically, we prove that the estimation error of the proposed algorithm decreases exponentially and matches that of the centralized meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00537","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":"1709.00537","created_at":"2026-05-18T00:35:40.673472+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00537v2","created_at":"2026-05-18T00:35:40.673472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00537","created_at":"2026-05-18T00:35:40.673472+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXOPZNFYFSKK","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXOPZNFYFSKKNCL2","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXOPZNFY","created_at":"2026-05-18T12:31:18.294218+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/GXOPZNFYFSKKNCL2Z3Z2BF7HFN","json":"https://pith.science/pith/GXOPZNFYFSKKNCL2Z3Z2BF7HFN.json","graph_json":"https://pith.science/api/pith-number/GXOPZNFYFSKKNCL2Z3Z2BF7HFN/graph.json","events_json":"https://pith.science/api/pith-number/GXOPZNFYFSKKNCL2Z3Z2BF7HFN/events.json","paper":"https://pith.science/paper/GXOPZNFY"},"agent_actions":{"view_html":"https://pith.science/pith/GXOPZNFYFSKKNCL2Z3Z2BF7HFN","download_json":"https://pith.science/pith/GXOPZNFYFSKKNCL2Z3Z2BF7HFN.json","view_paper":"https://pith.science/paper/GXOPZNFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00537&json=true","fetch_graph":"https://pith.science/api/pith-number/GXOPZNFYFSKKNCL2Z3Z2BF7HFN/graph.json","fetch_events":"https://pith.science/api/pith-number/GXOPZNFYFSKKNCL2Z3Z2BF7HFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXOPZNFYFSKKNCL2Z3Z2BF7HFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXOPZNFYFSKKNCL2Z3Z2BF7HFN/action/storage_attestation","attest_author":"https://pith.science/pith/GXOPZNFYFSKKNCL2Z3Z2BF7HFN/action/author_attestation","sign_citation":"https://pith.science/pith/GXOPZNFYFSKKNCL2Z3Z2BF7HFN/action/citation_signature","submit_replication":"https://pith.science/pith/GXOPZNFYFSKKNCL2Z3Z2BF7HFN/action/replication_record"}},"created_at":"2026-05-18T00:35:40.673472+00:00","updated_at":"2026-05-18T00:35:40.673472+00:00"}