{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SEMBJZFTLORRQZGLLXNNI6SDQS","short_pith_number":"pith:SEMBJZFT","schema_version":"1.0","canonical_sha256":"911814e4b35ba31864cb5ddad47a4384afd96850a0ff0aa04086f3598338246b","source":{"kind":"arxiv","id":"2307.07113","version":1},"attestation_state":"computed","paper":{"title":"Variance-reduced accelerated methods for decentralized stochastic double-regularized nonconvex strongly-concave minimax problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Gabriel Mancino-Ball, Yangyang Xu","submitted_at":"2023-07-14T01:32:16Z","abstract_excerpt":"In this paper, we consider the decentralized, stochastic nonconvex strongly-concave (NCSC) minimax problem with nonsmooth regularization terms on both primal and dual variables, wherein a network of $m$ computing agents collaborate via peer-to-peer communications. We consider when the coupling function is in expectation or finite-sum form and the double regularizers are convex functions, applied separately to the primal and dual variables. Our algorithmic framework introduces a Lagrangian multiplier to eliminate the consensus constraint on the dual variable. Coupling this with variance-reducti"},"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":"2307.07113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-14T01:32:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e463fac3ca9cbc0693e095f2f6370c79afdeb86ef5f8160d0672fa08008e7bf2","abstract_canon_sha256":"c749bd2ad509e75d9823cfdf9abc6dbdbfd042c6d3f348a102f65156107bdbf7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:51.211979Z","signature_b64":"gGxBuyPlZFbCzpexXVPIf7l2kzEw7H+mXLMdp+frZsJo0uBpovV0o9YnqrCSx5Ezrs9tb4G6RAuTaNlJJBrTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"911814e4b35ba31864cb5ddad47a4384afd96850a0ff0aa04086f3598338246b","last_reissued_at":"2026-07-05T06:30:51.211471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:51.211471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variance-reduced accelerated methods for decentralized stochastic double-regularized nonconvex strongly-concave minimax problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Gabriel Mancino-Ball, Yangyang Xu","submitted_at":"2023-07-14T01:32:16Z","abstract_excerpt":"In this paper, we consider the decentralized, stochastic nonconvex strongly-concave (NCSC) minimax problem with nonsmooth regularization terms on both primal and dual variables, wherein a network of $m$ computing agents collaborate via peer-to-peer communications. We consider when the coupling function is in expectation or finite-sum form and the double regularizers are convex functions, applied separately to the primal and dual variables. Our algorithmic framework introduces a Lagrangian multiplier to eliminate the consensus constraint on the dual variable. Coupling this with variance-reducti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07113","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/2307.07113/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":"2307.07113","created_at":"2026-07-05T06:30:51.211530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.07113v1","created_at":"2026-07-05T06:30:51.211530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07113","created_at":"2026-07-05T06:30:51.211530+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEMBJZFTLORR","created_at":"2026-07-05T06:30:51.211530+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEMBJZFTLORRQZGL","created_at":"2026-07-05T06:30:51.211530+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEMBJZFT","created_at":"2026-07-05T06:30:51.211530+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19050","citing_title":"First-Order Methods for Solving Convex (Strongly) Concave Minimax Problems with Functional Constraints","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2606.12124","citing_title":"A Unified Zeroth-Order Approach for Decentralized Minimax Optimization","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2403.07806","citing_title":"A Stochastic GDA Method With Backtracking For Solving Nonconvex Concave Minimax Problems","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SEMBJZFTLORRQZGLLXNNI6SDQS","json":"https://pith.science/pith/SEMBJZFTLORRQZGLLXNNI6SDQS.json","graph_json":"https://pith.science/api/pith-number/SEMBJZFTLORRQZGLLXNNI6SDQS/graph.json","events_json":"https://pith.science/api/pith-number/SEMBJZFTLORRQZGLLXNNI6SDQS/events.json","paper":"https://pith.science/paper/SEMBJZFT"},"agent_actions":{"view_html":"https://pith.science/pith/SEMBJZFTLORRQZGLLXNNI6SDQS","download_json":"https://pith.science/pith/SEMBJZFTLORRQZGLLXNNI6SDQS.json","view_paper":"https://pith.science/paper/SEMBJZFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.07113&json=true","fetch_graph":"https://pith.science/api/pith-number/SEMBJZFTLORRQZGLLXNNI6SDQS/graph.json","fetch_events":"https://pith.science/api/pith-number/SEMBJZFTLORRQZGLLXNNI6SDQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEMBJZFTLORRQZGLLXNNI6SDQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEMBJZFTLORRQZGLLXNNI6SDQS/action/storage_attestation","attest_author":"https://pith.science/pith/SEMBJZFTLORRQZGLLXNNI6SDQS/action/author_attestation","sign_citation":"https://pith.science/pith/SEMBJZFTLORRQZGLLXNNI6SDQS/action/citation_signature","submit_replication":"https://pith.science/pith/SEMBJZFTLORRQZGLLXNNI6SDQS/action/replication_record"}},"created_at":"2026-07-05T06:30:51.211530+00:00","updated_at":"2026-07-05T06:30:51.211530+00:00"}