{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BFWA3IBYSMGOSVTTP72MDCOW6V","short_pith_number":"pith:BFWA3IBY","schema_version":"1.0","canonical_sha256":"096c0da038930ce956737ff4c189d6f56570c5e2a306b9c833c17c1d4cdc53eb","source":{"kind":"arxiv","id":"1902.00340","version":1},"attestation_state":"computed","paper":{"title":"Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anastasia Koloskova, Martin Jaggi, Sebastian U. Stich","submitted_at":"2019-02-01T14:11:20Z","abstract_excerpt":"We consider decentralized stochastic optimization with the objective function (e.g. data samples for machine learning task) being distributed over $n$ machines that can only communicate to their neighbors on a fixed communication graph. To reduce the communication bottleneck, the nodes compress (e.g. quantize or sparsify) their model updates. We cover both unbiased and biased compression operators with quality denoted by $\\omega \\leq 1$ ($\\omega=1$ meaning no compression). We (i) propose a novel gossip-based stochastic gradient descent algorithm, CHOCO-SGD, that converges at rate $\\mathcal{O}\\"},"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":"1902.00340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-01T14:11:20Z","cross_cats_sorted":["cs.DC","cs.DS","math.OC","stat.ML"],"title_canon_sha256":"f40ddff56301a143745a3d2dc246b393961707efb7d25d6740d2c946b4779b44","abstract_canon_sha256":"d59beb6b2a66dffae3973a1b244d23e9424966ac40890cb836f7da0ccd61ac88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:57.724648Z","signature_b64":"RbzAF648yAkcoxCc8/IRSSALsENpe4lcqj52RETnI1SdDgSbA+EziM/AsdaIFFkfjaGDmhJLX3ynZGh+EqWkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"096c0da038930ce956737ff4c189d6f56570c5e2a306b9c833c17c1d4cdc53eb","last_reissued_at":"2026-05-17T23:54:57.724085Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:57.724085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anastasia Koloskova, Martin Jaggi, Sebastian U. Stich","submitted_at":"2019-02-01T14:11:20Z","abstract_excerpt":"We consider decentralized stochastic optimization with the objective function (e.g. data samples for machine learning task) being distributed over $n$ machines that can only communicate to their neighbors on a fixed communication graph. To reduce the communication bottleneck, the nodes compress (e.g. quantize or sparsify) their model updates. We cover both unbiased and biased compression operators with quality denoted by $\\omega \\leq 1$ ($\\omega=1$ meaning no compression). We (i) propose a novel gossip-based stochastic gradient descent algorithm, CHOCO-SGD, that converges at rate $\\mathcal{O}\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00340","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":"1902.00340","created_at":"2026-05-17T23:54:57.724167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00340v1","created_at":"2026-05-17T23:54:57.724167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00340","created_at":"2026-05-17T23:54:57.724167+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFWA3IBYSMGO","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFWA3IBYSMGOSVTT","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFWA3IBY","created_at":"2026-05-18T12:33:12.712433+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/BFWA3IBYSMGOSVTTP72MDCOW6V","json":"https://pith.science/pith/BFWA3IBYSMGOSVTTP72MDCOW6V.json","graph_json":"https://pith.science/api/pith-number/BFWA3IBYSMGOSVTTP72MDCOW6V/graph.json","events_json":"https://pith.science/api/pith-number/BFWA3IBYSMGOSVTTP72MDCOW6V/events.json","paper":"https://pith.science/paper/BFWA3IBY"},"agent_actions":{"view_html":"https://pith.science/pith/BFWA3IBYSMGOSVTTP72MDCOW6V","download_json":"https://pith.science/pith/BFWA3IBYSMGOSVTTP72MDCOW6V.json","view_paper":"https://pith.science/paper/BFWA3IBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00340&json=true","fetch_graph":"https://pith.science/api/pith-number/BFWA3IBYSMGOSVTTP72MDCOW6V/graph.json","fetch_events":"https://pith.science/api/pith-number/BFWA3IBYSMGOSVTTP72MDCOW6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFWA3IBYSMGOSVTTP72MDCOW6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFWA3IBYSMGOSVTTP72MDCOW6V/action/storage_attestation","attest_author":"https://pith.science/pith/BFWA3IBYSMGOSVTTP72MDCOW6V/action/author_attestation","sign_citation":"https://pith.science/pith/BFWA3IBYSMGOSVTTP72MDCOW6V/action/citation_signature","submit_replication":"https://pith.science/pith/BFWA3IBYSMGOSVTTP72MDCOW6V/action/replication_record"}},"created_at":"2026-05-17T23:54:57.724167+00:00","updated_at":"2026-05-17T23:54:57.724167+00:00"}