{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5TYV2MO3O2GRJVMWVDAE4BBAWI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8214466387d6c6fe33085c3b7df44694853bbbf883078e8ed21af22a13709f95","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-27T19:52:24Z","title_canon_sha256":"9234037e2d3a2859a158e53046c39e0eba79cad44c13d5f28dc31c010f985ffb"},"schema_version":"1.0","source":{"id":"2002.12410","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.12410","created_at":"2026-07-05T07:33:05Z"},{"alias_kind":"arxiv_version","alias_value":"2002.12410v4","created_at":"2026-07-05T07:33:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.12410","created_at":"2026-07-05T07:33:05Z"},{"alias_kind":"pith_short_12","alias_value":"5TYV2MO3O2GR","created_at":"2026-07-05T07:33:05Z"},{"alias_kind":"pith_short_16","alias_value":"5TYV2MO3O2GRJVMW","created_at":"2026-07-05T07:33:05Z"},{"alias_kind":"pith_short_8","alias_value":"5TYV2MO3","created_at":"2026-07-05T07:33:05Z"}],"graph_snapshots":[{"event_id":"sha256:95879afd0e7c96a875589a3263ea05ef4bc11213160ae79a7d71e0ed057c8b11","target":"graph","created_at":"2026-07-05T07:33:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.12410/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the last few years, various communication compression techniques have emerged as an indispensable tool helping to alleviate the communication bottleneck in distributed learning. However, despite the fact biased compressors often show superior performance in practice when compared to the much more studied and understood unbiased compressors, very little is known about them. In this work we study three classes of biased compression operators, two of which are new, and their performance when applied to (stochastic) gradient descent and distributed (stochastic) gradient descent. We show for the","authors_text":"Aleksandr Beznosikov, Mher Safaryan, Peter Richt\\'arik, Samuel Horv\\'ath","cross_cats":["cs.DC","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-27T19:52:24Z","title":"On Biased Compression for Distributed Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.12410","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4546c6fdc48dadbc91742eac1afc6497e8a6b4ce1bf7b04f56fa1936d834b561","target":"record","created_at":"2026-07-05T07:33:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8214466387d6c6fe33085c3b7df44694853bbbf883078e8ed21af22a13709f95","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-27T19:52:24Z","title_canon_sha256":"9234037e2d3a2859a158e53046c39e0eba79cad44c13d5f28dc31c010f985ffb"},"schema_version":"1.0","source":{"id":"2002.12410","kind":"arxiv","version":4}},"canonical_sha256":"ecf15d31db768d14d596a8c04e0420b23a082db5af841404c55586f748820ed0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecf15d31db768d14d596a8c04e0420b23a082db5af841404c55586f748820ed0","first_computed_at":"2026-07-05T07:33:05.554174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:33:05.554174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pK5ja3puhQhxSDf+YIEGqLsOAR0WESdnqEW16uuqjCkXQEQbzwAKXqI9eCKk3rNYVn4uEcpKdUUvj+AP/MVGBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:33:05.554600Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.12410","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4546c6fdc48dadbc91742eac1afc6497e8a6b4ce1bf7b04f56fa1936d834b561","sha256:95879afd0e7c96a875589a3263ea05ef4bc11213160ae79a7d71e0ed057c8b11"],"state_sha256":"f18c84faca27c8d09beda937d92fc81f2eb7e27eb7af30ee8f45e579cec875c5"}