{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CHWFBCIV2FOY4ZCCB3PPGCMVSO","short_pith_number":"pith:CHWFBCIV","schema_version":"1.0","canonical_sha256":"11ec508915d15d8e64420edef309959398e7e263df628271e7b46fb0838a0745","source":{"kind":"arxiv","id":"1806.06573","version":2},"attestation_state":"computed","paper":{"title":"Distributed learning with compressed gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Hamid Reza Feyzmahdavian, Mikael Johansson, Sarit Khirirat","submitted_at":"2018-06-18T09:37:39Z","abstract_excerpt":"Asynchronous computation and gradient compression have emerged as two key techniques for achieving scalability in distributed optimization for large-scale machine learning. This paper presents a unified analysis framework for distributed gradient methods operating with staled and compressed gradients. Non-asymptotic bounds on convergence rates and information exchange are derived for several optimization algorithms. These bounds give explicit expressions for step-sizes and characterize how the amount of asynchrony and the compression accuracy affect iteration and communication complexity guara"},"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":"1806.06573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-18T09:37:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"46479d007b0a8a32a8997bcafe32687e3599d62827edd2db015962a1cc1a3fc3","abstract_canon_sha256":"e4edb5d910b67d76763876c8abc7e42cba2c6440da8e7e0a3c56d4518ab01e76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:38.684605Z","signature_b64":"Dxogciegnwzp0gVw833Qp69iAWc7yC7uUg02gyIETF1EOvnhk43SWHx2LGEqzuABgb2XNR4lJ6lHoAWn04geBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11ec508915d15d8e64420edef309959398e7e263df628271e7b46fb0838a0745","last_reissued_at":"2026-05-17T23:59:38.683895Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:38.683895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed learning with compressed gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Hamid Reza Feyzmahdavian, Mikael Johansson, Sarit Khirirat","submitted_at":"2018-06-18T09:37:39Z","abstract_excerpt":"Asynchronous computation and gradient compression have emerged as two key techniques for achieving scalability in distributed optimization for large-scale machine learning. This paper presents a unified analysis framework for distributed gradient methods operating with staled and compressed gradients. Non-asymptotic bounds on convergence rates and information exchange are derived for several optimization algorithms. These bounds give explicit expressions for step-sizes and characterize how the amount of asynchrony and the compression accuracy affect iteration and communication complexity guara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06573","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":"1806.06573","created_at":"2026-05-17T23:59:38.684039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.06573v2","created_at":"2026-05-17T23:59:38.684039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06573","created_at":"2026-05-17T23:59:38.684039+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHWFBCIV2FOY","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHWFBCIV2FOY4ZCC","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHWFBCIV","created_at":"2026-05-18T12:32:16.446611+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/CHWFBCIV2FOY4ZCCB3PPGCMVSO","json":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO.json","graph_json":"https://pith.science/api/pith-number/CHWFBCIV2FOY4ZCCB3PPGCMVSO/graph.json","events_json":"https://pith.science/api/pith-number/CHWFBCIV2FOY4ZCCB3PPGCMVSO/events.json","paper":"https://pith.science/paper/CHWFBCIV"},"agent_actions":{"view_html":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO","download_json":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO.json","view_paper":"https://pith.science/paper/CHWFBCIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.06573&json=true","fetch_graph":"https://pith.science/api/pith-number/CHWFBCIV2FOY4ZCCB3PPGCMVSO/graph.json","fetch_events":"https://pith.science/api/pith-number/CHWFBCIV2FOY4ZCCB3PPGCMVSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO/action/storage_attestation","attest_author":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO/action/author_attestation","sign_citation":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO/action/citation_signature","submit_replication":"https://pith.science/pith/CHWFBCIV2FOY4ZCCB3PPGCMVSO/action/replication_record"}},"created_at":"2026-05-17T23:59:38.684039+00:00","updated_at":"2026-05-17T23:59:38.684039+00:00"}