{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:M33UUUI4XJ37FKTGSJ2BILSIOL","short_pith_number":"pith:M33UUUI4","schema_version":"1.0","canonical_sha256":"66f74a511cba77f2aa669274142e4872c350aa106e99fbb0bfd8ed984f087105","source":{"kind":"arxiv","id":"2503.21627","version":1},"attestation_state":"computed","paper":{"title":"Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Ali Dadras, Alp Yurtsever, Karlo Palenzuela, Tommy L\\\"ofstedt","submitted_at":"2025-03-27T15:48:34Z","abstract_excerpt":"Multiple local steps are key to communication-efficient federated learning. However, theoretical guarantees for such algorithms, without data heterogeneity-bounding assumptions, have been lacking in general non-smooth convex problems. Leveraging projection-efficient optimization methods, we propose FedMLS, a federated learning algorithm with provable improvements from multiple local steps. FedMLS attains an $\\epsilon$-suboptimal solution in $\\mathcal{O}(1/\\epsilon)$ communication rounds, requiring a total of $\\mathcal{O}(1/\\epsilon^2)$ stochastic subgradient oracle calls."},"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":"2503.21627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-27T15:48:34Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2dbfac29aa90785c1a0fd11e6e3158bcde81a3299a3e16293d53fee4e6556df3","abstract_canon_sha256":"1fb4777d4ddd76f154a51cdfc9d201673c284a541d0481385d2f6ef0bb56ec7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:40:28.252769Z","signature_b64":"7/N6cOGsLRL1Ee5r0GkOo5/rusiAboD+w5TK4ciL9bgbx4xXe7tiKHSshsIrI2v1n7WU2E6Joip7z/oPWeQgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66f74a511cba77f2aa669274142e4872c350aa106e99fbb0bfd8ed984f087105","last_reissued_at":"2026-07-05T10:40:28.252352Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:40:28.252352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Ali Dadras, Alp Yurtsever, Karlo Palenzuela, Tommy L\\\"ofstedt","submitted_at":"2025-03-27T15:48:34Z","abstract_excerpt":"Multiple local steps are key to communication-efficient federated learning. However, theoretical guarantees for such algorithms, without data heterogeneity-bounding assumptions, have been lacking in general non-smooth convex problems. Leveraging projection-efficient optimization methods, we propose FedMLS, a federated learning algorithm with provable improvements from multiple local steps. FedMLS attains an $\\epsilon$-suboptimal solution in $\\mathcal{O}(1/\\epsilon)$ communication rounds, requiring a total of $\\mathcal{O}(1/\\epsilon^2)$ stochastic subgradient oracle calls."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.21627","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/2503.21627/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":"2503.21627","created_at":"2026-07-05T10:40:28.252409+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.21627v1","created_at":"2026-07-05T10:40:28.252409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.21627","created_at":"2026-07-05T10:40:28.252409+00:00"},{"alias_kind":"pith_short_12","alias_value":"M33UUUI4XJ37","created_at":"2026-07-05T10:40:28.252409+00:00"},{"alias_kind":"pith_short_16","alias_value":"M33UUUI4XJ37FKTG","created_at":"2026-07-05T10:40:28.252409+00:00"},{"alias_kind":"pith_short_8","alias_value":"M33UUUI4","created_at":"2026-07-05T10:40:28.252409+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/M33UUUI4XJ37FKTGSJ2BILSIOL","json":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL.json","graph_json":"https://pith.science/api/pith-number/M33UUUI4XJ37FKTGSJ2BILSIOL/graph.json","events_json":"https://pith.science/api/pith-number/M33UUUI4XJ37FKTGSJ2BILSIOL/events.json","paper":"https://pith.science/paper/M33UUUI4"},"agent_actions":{"view_html":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL","download_json":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL.json","view_paper":"https://pith.science/paper/M33UUUI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.21627&json=true","fetch_graph":"https://pith.science/api/pith-number/M33UUUI4XJ37FKTGSJ2BILSIOL/graph.json","fetch_events":"https://pith.science/api/pith-number/M33UUUI4XJ37FKTGSJ2BILSIOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL/action/storage_attestation","attest_author":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL/action/author_attestation","sign_citation":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL/action/citation_signature","submit_replication":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL/action/replication_record"}},"created_at":"2026-07-05T10:40:28.252409+00:00","updated_at":"2026-07-05T10:40:28.252409+00:00"}