{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RDVB27TDF5PEQ54I65J2VN5RVG","short_pith_number":"pith:RDVB27TD","schema_version":"1.0","canonical_sha256":"88ea1d7e632f5e487788f753aab7b1a9b30e4c9977e43e316dd693a89899ab8e","source":{"kind":"arxiv","id":"2507.05508","version":1},"attestation_state":"computed","paper":{"title":"Beyond Communication Overhead: A Multilevel Monte Carlo Approach for Mitigating Compression Bias in Distributed Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bassel Hamoud, Kfir Y. Levy, Ze'ev Zukerman","submitted_at":"2025-07-07T22:06:04Z","abstract_excerpt":"Distributed learning methods have gained substantial momentum in recent years, with communication overhead often emerging as a critical bottleneck. Gradient compression techniques alleviate communication costs but involve an inherent trade-off between the empirical efficiency of biased compressors and the theoretical guarantees of unbiased compressors. In this work, we introduce a novel Multilevel Monte Carlo (MLMC) compression scheme that leverages biased compressors to construct statistically unbiased estimates. This approach effectively bridges the gap between biased and unbiased methods, c"},"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":"2507.05508","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-07T22:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"2e91f2c5df68d4acedfaaf723f2a6fb34e4ce5cc0c53456c9199a687d1821e59","abstract_canon_sha256":"eb291714ead1a3c1993ddedc8e1b87ad22a2bfdd906185abcded5987a4e3e778"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:31.542481Z","signature_b64":"dAADY4JURDwxiwX/HFnTFno4UXS2nL2MfmWKNR4mlcMoEqLTPSz1ZqVvlD7qmFrTiej1sqTIQBYgkCdCglrDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88ea1d7e632f5e487788f753aab7b1a9b30e4c9977e43e316dd693a89899ab8e","last_reissued_at":"2026-07-05T11:33:31.542062Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:31.542062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Communication Overhead: A Multilevel Monte Carlo Approach for Mitigating Compression Bias in Distributed Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bassel Hamoud, Kfir Y. Levy, Ze'ev Zukerman","submitted_at":"2025-07-07T22:06:04Z","abstract_excerpt":"Distributed learning methods have gained substantial momentum in recent years, with communication overhead often emerging as a critical bottleneck. Gradient compression techniques alleviate communication costs but involve an inherent trade-off between the empirical efficiency of biased compressors and the theoretical guarantees of unbiased compressors. In this work, we introduce a novel Multilevel Monte Carlo (MLMC) compression scheme that leverages biased compressors to construct statistically unbiased estimates. This approach effectively bridges the gap between biased and unbiased methods, c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05508","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.05508/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":"2507.05508","created_at":"2026-07-05T11:33:31.542121+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.05508v1","created_at":"2026-07-05T11:33:31.542121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05508","created_at":"2026-07-05T11:33:31.542121+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDVB27TDF5PE","created_at":"2026-07-05T11:33:31.542121+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDVB27TDF5PEQ54I","created_at":"2026-07-05T11:33:31.542121+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDVB27TD","created_at":"2026-07-05T11:33:31.542121+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/RDVB27TDF5PEQ54I65J2VN5RVG","json":"https://pith.science/pith/RDVB27TDF5PEQ54I65J2VN5RVG.json","graph_json":"https://pith.science/api/pith-number/RDVB27TDF5PEQ54I65J2VN5RVG/graph.json","events_json":"https://pith.science/api/pith-number/RDVB27TDF5PEQ54I65J2VN5RVG/events.json","paper":"https://pith.science/paper/RDVB27TD"},"agent_actions":{"view_html":"https://pith.science/pith/RDVB27TDF5PEQ54I65J2VN5RVG","download_json":"https://pith.science/pith/RDVB27TDF5PEQ54I65J2VN5RVG.json","view_paper":"https://pith.science/paper/RDVB27TD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.05508&json=true","fetch_graph":"https://pith.science/api/pith-number/RDVB27TDF5PEQ54I65J2VN5RVG/graph.json","fetch_events":"https://pith.science/api/pith-number/RDVB27TDF5PEQ54I65J2VN5RVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDVB27TDF5PEQ54I65J2VN5RVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDVB27TDF5PEQ54I65J2VN5RVG/action/storage_attestation","attest_author":"https://pith.science/pith/RDVB27TDF5PEQ54I65J2VN5RVG/action/author_attestation","sign_citation":"https://pith.science/pith/RDVB27TDF5PEQ54I65J2VN5RVG/action/citation_signature","submit_replication":"https://pith.science/pith/RDVB27TDF5PEQ54I65J2VN5RVG/action/replication_record"}},"created_at":"2026-07-05T11:33:31.542121+00:00","updated_at":"2026-07-05T11:33:31.542121+00:00"}