{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QBNRECY53NHBIHVXBTIR62YMCV","short_pith_number":"pith:QBNRECY5","schema_version":"1.0","canonical_sha256":"805b120b1ddb4e141eb70cd11f6b0c1572a0cce065176d8b48e9bf98d3903c95","source":{"kind":"arxiv","id":"2008.01425","version":2},"attestation_state":"computed","paper":{"title":"PowerGossip: Practical Low-Rank Communication Compression in Decentralized Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Martin Jaggi, Sai Praneeth Karimireddy, Thijs Vogels","submitted_at":"2020-08-04T09:14:52Z","abstract_excerpt":"Lossy gradient compression has become a practical tool to overcome the communication bottleneck in centrally coordinated distributed training of machine learning models. However, algorithms for decentralized training with compressed communication over arbitrary connected networks have been more complicated, requiring additional memory and hyperparameters. We introduce a simple algorithm that directly compresses the model differences between neighboring workers using low-rank linear compressors applied on model differences. Inspired by the PowerSGD algorithm for centralized deep learning, this "},"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":"2008.01425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-08-04T09:14:52Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"e963d4975f63ef6c11249a7289d0d49eb05fc909b936942f0e213cb2512441c1","abstract_canon_sha256":"fa2f4593b786ab78ee59dc113da5d3763ca04b6d93e634a629495d07a1fdf323"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:58.530914Z","signature_b64":"Beq1zyXH1llBSnMzdu6hCd6fVOwj7n+eKtbfnKQGTCWZ+lWO1QrQSRZX96XzH1ErjIvQdLw+DNrM+PRYk0/GCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"805b120b1ddb4e141eb70cd11f6b0c1572a0cce065176d8b48e9bf98d3903c95","last_reissued_at":"2026-07-05T01:43:58.530575Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:58.530575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PowerGossip: Practical Low-Rank Communication Compression in Decentralized Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Martin Jaggi, Sai Praneeth Karimireddy, Thijs Vogels","submitted_at":"2020-08-04T09:14:52Z","abstract_excerpt":"Lossy gradient compression has become a practical tool to overcome the communication bottleneck in centrally coordinated distributed training of machine learning models. However, algorithms for decentralized training with compressed communication over arbitrary connected networks have been more complicated, requiring additional memory and hyperparameters. We introduce a simple algorithm that directly compresses the model differences between neighboring workers using low-rank linear compressors applied on model differences. Inspired by the PowerSGD algorithm for centralized deep learning, this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.01425","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.01425/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.01425","created_at":"2026-07-05T01:43:58.530631+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.01425v2","created_at":"2026-07-05T01:43:58.530631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.01425","created_at":"2026-07-05T01:43:58.530631+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBNRECY53NHB","created_at":"2026-07-05T01:43:58.530631+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBNRECY53NHBIHVX","created_at":"2026-07-05T01:43:58.530631+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBNRECY5","created_at":"2026-07-05T01:43:58.530631+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/QBNRECY53NHBIHVXBTIR62YMCV","json":"https://pith.science/pith/QBNRECY53NHBIHVXBTIR62YMCV.json","graph_json":"https://pith.science/api/pith-number/QBNRECY53NHBIHVXBTIR62YMCV/graph.json","events_json":"https://pith.science/api/pith-number/QBNRECY53NHBIHVXBTIR62YMCV/events.json","paper":"https://pith.science/paper/QBNRECY5"},"agent_actions":{"view_html":"https://pith.science/pith/QBNRECY53NHBIHVXBTIR62YMCV","download_json":"https://pith.science/pith/QBNRECY53NHBIHVXBTIR62YMCV.json","view_paper":"https://pith.science/paper/QBNRECY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.01425&json=true","fetch_graph":"https://pith.science/api/pith-number/QBNRECY53NHBIHVXBTIR62YMCV/graph.json","fetch_events":"https://pith.science/api/pith-number/QBNRECY53NHBIHVXBTIR62YMCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBNRECY53NHBIHVXBTIR62YMCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBNRECY53NHBIHVXBTIR62YMCV/action/storage_attestation","attest_author":"https://pith.science/pith/QBNRECY53NHBIHVXBTIR62YMCV/action/author_attestation","sign_citation":"https://pith.science/pith/QBNRECY53NHBIHVXBTIR62YMCV/action/citation_signature","submit_replication":"https://pith.science/pith/QBNRECY53NHBIHVXBTIR62YMCV/action/replication_record"}},"created_at":"2026-07-05T01:43:58.530631+00:00","updated_at":"2026-07-05T01:43:58.530631+00:00"}