{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7M433OED6PPSCMGFFE5FSRSCTV","short_pith_number":"pith:7M433OED","schema_version":"1.0","canonical_sha256":"fb39bdb883f3df2130c5293a5946429d6bd5e08d1d25e089253cf1b321569a14","source":{"kind":"arxiv","id":"2304.04169","version":2},"attestation_state":"computed","paper":{"title":"SLowcal-SGD: Slow Query Points Improve Local-SGD for Stochastic Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Kfir Y. Levy, Tehila Dahan","submitted_at":"2023-04-09T06:10:49Z","abstract_excerpt":"We consider distributed learning scenarios where M machines interact with a parameter server along several communication rounds in order to minimize a joint objective function. Focusing on the heterogeneous case, where different machines may draw samples from different data-distributions, we design the first local update method that provably benefits over the two most prominent distributed baselines: namely Minibatch-SGD and Local-SGD. Key to our approach is a slow querying technique that we customize to the distributed setting, which in turn enables a better mitigation of the bias caused by l"},"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":"2304.04169","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-04-09T06:10:49Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"aafe04e8b565ea77ee68e3fd02349b4a3fa6c1573259e91e7330b5f05e513ccf","abstract_canon_sha256":"338f8d844d671582e70bcb04505692e01096372cd5e1f0695b0d6e977944e558"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:40.332579Z","signature_b64":"n26yd+y+K+hgUnip+ASZFDkZut+x7Aypdukp10v15RLF5vdyyRwf+39NT9uECCkq5588IPRuetNt3bNSJKGyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb39bdb883f3df2130c5293a5946429d6bd5e08d1d25e089253cf1b321569a14","last_reissued_at":"2026-07-05T10:02:40.332121Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:40.332121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SLowcal-SGD: Slow Query Points Improve Local-SGD for Stochastic Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Kfir Y. Levy, Tehila Dahan","submitted_at":"2023-04-09T06:10:49Z","abstract_excerpt":"We consider distributed learning scenarios where M machines interact with a parameter server along several communication rounds in order to minimize a joint objective function. Focusing on the heterogeneous case, where different machines may draw samples from different data-distributions, we design the first local update method that provably benefits over the two most prominent distributed baselines: namely Minibatch-SGD and Local-SGD. Key to our approach is a slow querying technique that we customize to the distributed setting, which in turn enables a better mitigation of the bias caused by l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.04169","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/2304.04169/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":"2304.04169","created_at":"2026-07-05T10:02:40.332183+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.04169v2","created_at":"2026-07-05T10:02:40.332183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.04169","created_at":"2026-07-05T10:02:40.332183+00:00"},{"alias_kind":"pith_short_12","alias_value":"7M433OED6PPS","created_at":"2026-07-05T10:02:40.332183+00:00"},{"alias_kind":"pith_short_16","alias_value":"7M433OED6PPSCMGF","created_at":"2026-07-05T10:02:40.332183+00:00"},{"alias_kind":"pith_short_8","alias_value":"7M433OED","created_at":"2026-07-05T10:02:40.332183+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.13790","citing_title":"Local Steps Speed Up Local GD for Heterogeneous Distributed Logistic Regression","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7M433OED6PPSCMGFFE5FSRSCTV","json":"https://pith.science/pith/7M433OED6PPSCMGFFE5FSRSCTV.json","graph_json":"https://pith.science/api/pith-number/7M433OED6PPSCMGFFE5FSRSCTV/graph.json","events_json":"https://pith.science/api/pith-number/7M433OED6PPSCMGFFE5FSRSCTV/events.json","paper":"https://pith.science/paper/7M433OED"},"agent_actions":{"view_html":"https://pith.science/pith/7M433OED6PPSCMGFFE5FSRSCTV","download_json":"https://pith.science/pith/7M433OED6PPSCMGFFE5FSRSCTV.json","view_paper":"https://pith.science/paper/7M433OED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.04169&json=true","fetch_graph":"https://pith.science/api/pith-number/7M433OED6PPSCMGFFE5FSRSCTV/graph.json","fetch_events":"https://pith.science/api/pith-number/7M433OED6PPSCMGFFE5FSRSCTV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7M433OED6PPSCMGFFE5FSRSCTV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7M433OED6PPSCMGFFE5FSRSCTV/action/storage_attestation","attest_author":"https://pith.science/pith/7M433OED6PPSCMGFFE5FSRSCTV/action/author_attestation","sign_citation":"https://pith.science/pith/7M433OED6PPSCMGFFE5FSRSCTV/action/citation_signature","submit_replication":"https://pith.science/pith/7M433OED6PPSCMGFFE5FSRSCTV/action/replication_record"}},"created_at":"2026-07-05T10:02:40.332183+00:00","updated_at":"2026-07-05T10:02:40.332183+00:00"}