{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:P2O7CXH7O52JXWSNIBLOYX543Q","short_pith_number":"pith:P2O7CXH7","schema_version":"1.0","canonical_sha256":"7e9df15cff77749bda4d4056ec5fbcdc01847fcaad61a7a78b49c4dd64ab398b","source":{"kind":"arxiv","id":"2507.21901","version":2},"attestation_state":"computed","paper":{"title":"Communication-Efficient Decentralized Stochastic Minimax Optimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali H. Sayed, Haoyuan Cai, Sulaiman A. Alghunaim","submitted_at":"2025-07-29T15:10:20Z","abstract_excerpt":"In this work, we study decentralized stochastic nonconvex Polyak--{\\L}ojasiewicz minimax problems and propose a communication-efficient algorithm. Motivated by the efficiency of local SGD in federated learning, we investigate decentralized minimax algorithms that perform multiple local updates between gossip rounds to improve communication efficiency. Existing results show that the local decentralized gradient descent-ascent algorithm requires an excessive number of local updates, on the order of $\\tilde{\\mathcal{O}}(\\kappa^2\\varepsilon^{-2})$ per communication round, to achieve the communicat"},"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.21901","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-29T15:10:20Z","cross_cats_sorted":[],"title_canon_sha256":"d1f3ce55bd399c36558a8d8206dfd7141573448e3dec2d46d1a774e3c1f47bcb","abstract_canon_sha256":"14f1767959e78410c0bc58f692b992c9cd417e379b4b873e49700d4aac25f7f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:04:56.376212Z","signature_b64":"7Pl20yCr4MMfH3N1rupZYAhrcBashc8QIhhKsAwRTeF5SFTqoXLc947+ZvEgwiC6D4PJ+e2A09dr9KqRfdRlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e9df15cff77749bda4d4056ec5fbcdc01847fcaad61a7a78b49c4dd64ab398b","last_reissued_at":"2026-05-20T01:04:56.375373Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:04:56.375373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-Efficient Decentralized Stochastic Minimax Optimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali H. Sayed, Haoyuan Cai, Sulaiman A. Alghunaim","submitted_at":"2025-07-29T15:10:20Z","abstract_excerpt":"In this work, we study decentralized stochastic nonconvex Polyak--{\\L}ojasiewicz minimax problems and propose a communication-efficient algorithm. Motivated by the efficiency of local SGD in federated learning, we investigate decentralized minimax algorithms that perform multiple local updates between gossip rounds to improve communication efficiency. Existing results show that the local decentralized gradient descent-ascent algorithm requires an excessive number of local updates, on the order of $\\tilde{\\mathcal{O}}(\\kappa^2\\varepsilon^{-2})$ per communication round, to achieve the communicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.21901","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/2507.21901/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.21901","created_at":"2026-05-20T01:04:56.375466+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.21901v2","created_at":"2026-05-20T01:04:56.375466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.21901","created_at":"2026-05-20T01:04:56.375466+00:00"},{"alias_kind":"pith_short_12","alias_value":"P2O7CXH7O52J","created_at":"2026-05-20T01:04:56.375466+00:00"},{"alias_kind":"pith_short_16","alias_value":"P2O7CXH7O52JXWSN","created_at":"2026-05-20T01:04:56.375466+00:00"},{"alias_kind":"pith_short_8","alias_value":"P2O7CXH7","created_at":"2026-05-20T01:04:56.375466+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/P2O7CXH7O52JXWSNIBLOYX543Q","json":"https://pith.science/pith/P2O7CXH7O52JXWSNIBLOYX543Q.json","graph_json":"https://pith.science/api/pith-number/P2O7CXH7O52JXWSNIBLOYX543Q/graph.json","events_json":"https://pith.science/api/pith-number/P2O7CXH7O52JXWSNIBLOYX543Q/events.json","paper":"https://pith.science/paper/P2O7CXH7"},"agent_actions":{"view_html":"https://pith.science/pith/P2O7CXH7O52JXWSNIBLOYX543Q","download_json":"https://pith.science/pith/P2O7CXH7O52JXWSNIBLOYX543Q.json","view_paper":"https://pith.science/paper/P2O7CXH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.21901&json=true","fetch_graph":"https://pith.science/api/pith-number/P2O7CXH7O52JXWSNIBLOYX543Q/graph.json","fetch_events":"https://pith.science/api/pith-number/P2O7CXH7O52JXWSNIBLOYX543Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P2O7CXH7O52JXWSNIBLOYX543Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P2O7CXH7O52JXWSNIBLOYX543Q/action/storage_attestation","attest_author":"https://pith.science/pith/P2O7CXH7O52JXWSNIBLOYX543Q/action/author_attestation","sign_citation":"https://pith.science/pith/P2O7CXH7O52JXWSNIBLOYX543Q/action/citation_signature","submit_replication":"https://pith.science/pith/P2O7CXH7O52JXWSNIBLOYX543Q/action/replication_record"}},"created_at":"2026-05-20T01:04:56.375466+00:00","updated_at":"2026-05-20T01:04:56.375466+00:00"}