{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YH5CIR35NWTMFCNIXQT2BMV5OP","short_pith_number":"pith:YH5CIR35","schema_version":"1.0","canonical_sha256":"c1fa24477d6da6c289a8bc27a0b2bd73e90ded201687cec8c16317b4be7cc955","source":{"kind":"arxiv","id":"2406.13041","version":3},"attestation_state":"computed","paper":{"title":"Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Ali H.Sayed, Haoyuan Cai, Sulaiman A. Alghunaim","submitted_at":"2024-06-18T20:14:52Z","abstract_excerpt":"Lower-bound analyses for nonconvex strongly-concave minimax optimization problems have shown that stochastic first-order algorithms require at least $\\mathcal{O}(\\varepsilon^{-4})$ sample complexity to find an $\\varepsilon$-stationary point. Some works indicate that this complexity can be improved to $\\mathcal{O}(\\varepsilon^{-3})$ when the stochastic loss gradient is Lipschitz continuous. The question of achieving enhanced convergence rates under distinct conditions, remains open. In this work, we address this question for optimization problems that are nonconvex in the minimization variable "},"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":"2406.13041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-18T20:14:52Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5906b5a3976c63800c1aecea45564b3497141ea0c40bddec7e1c1673c0abbd06","abstract_canon_sha256":"e54ecd7e00c08c9db0626d7b911a5757d571d41e73ccd65ca5259941bb6cf411"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:20.043426Z","signature_b64":"3ROKIFo81pXvhvvzm4TMXq7BYf/TSuw2G9zWk8ltp6JNrD6TGC4N2n70yvhN7BpflM9p7UT3ZXuQQNgrT/JBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1fa24477d6da6c289a8bc27a0b2bd73e90ded201687cec8c16317b4be7cc955","last_reissued_at":"2026-06-24T00:14:20.043005Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:20.043005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Ali H.Sayed, Haoyuan Cai, Sulaiman A. Alghunaim","submitted_at":"2024-06-18T20:14:52Z","abstract_excerpt":"Lower-bound analyses for nonconvex strongly-concave minimax optimization problems have shown that stochastic first-order algorithms require at least $\\mathcal{O}(\\varepsilon^{-4})$ sample complexity to find an $\\varepsilon$-stationary point. Some works indicate that this complexity can be improved to $\\mathcal{O}(\\varepsilon^{-3})$ when the stochastic loss gradient is Lipschitz continuous. The question of achieving enhanced convergence rates under distinct conditions, remains open. In this work, we address this question for optimization problems that are nonconvex in the minimization variable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.13041","kind":"arxiv","version":3},"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/2406.13041/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":"2406.13041","created_at":"2026-06-24T00:14:20.043060+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.13041v3","created_at":"2026-06-24T00:14:20.043060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.13041","created_at":"2026-06-24T00:14:20.043060+00:00"},{"alias_kind":"pith_short_12","alias_value":"YH5CIR35NWTM","created_at":"2026-06-24T00:14:20.043060+00:00"},{"alias_kind":"pith_short_16","alias_value":"YH5CIR35NWTMFCNI","created_at":"2026-06-24T00:14:20.043060+00:00"},{"alias_kind":"pith_short_8","alias_value":"YH5CIR35","created_at":"2026-06-24T00:14:20.043060+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.21901","citing_title":"Communication-Efficient Decentralized Stochastic Minimax Optimization","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YH5CIR35NWTMFCNIXQT2BMV5OP","json":"https://pith.science/pith/YH5CIR35NWTMFCNIXQT2BMV5OP.json","graph_json":"https://pith.science/api/pith-number/YH5CIR35NWTMFCNIXQT2BMV5OP/graph.json","events_json":"https://pith.science/api/pith-number/YH5CIR35NWTMFCNIXQT2BMV5OP/events.json","paper":"https://pith.science/paper/YH5CIR35"},"agent_actions":{"view_html":"https://pith.science/pith/YH5CIR35NWTMFCNIXQT2BMV5OP","download_json":"https://pith.science/pith/YH5CIR35NWTMFCNIXQT2BMV5OP.json","view_paper":"https://pith.science/paper/YH5CIR35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.13041&json=true","fetch_graph":"https://pith.science/api/pith-number/YH5CIR35NWTMFCNIXQT2BMV5OP/graph.json","fetch_events":"https://pith.science/api/pith-number/YH5CIR35NWTMFCNIXQT2BMV5OP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YH5CIR35NWTMFCNIXQT2BMV5OP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YH5CIR35NWTMFCNIXQT2BMV5OP/action/storage_attestation","attest_author":"https://pith.science/pith/YH5CIR35NWTMFCNIXQT2BMV5OP/action/author_attestation","sign_citation":"https://pith.science/pith/YH5CIR35NWTMFCNIXQT2BMV5OP/action/citation_signature","submit_replication":"https://pith.science/pith/YH5CIR35NWTMFCNIXQT2BMV5OP/action/replication_record"}},"created_at":"2026-06-24T00:14:20.043060+00:00","updated_at":"2026-06-24T00:14:20.043060+00:00"}