{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BZHWJGF2FUCUZPRJP5BKY5LITL","short_pith_number":"pith:BZHWJGF2","schema_version":"1.0","canonical_sha256":"0e4f6498ba2d054cbe297f42ac75689ac6309ce7b86ea3a5a5296a05f92ce379","source":{"kind":"arxiv","id":"2205.15084","version":4},"attestation_state":"computed","paper":{"title":"SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mert G\\\"urb\\\"uzbalaban, Necdet Serhat Aybat, Xuan Zhang","submitted_at":"2022-05-30T13:20:27Z","abstract_excerpt":"We propose a new stochastic method SAPD+ for solving nonconvex-concave minimax problems of the form $\\min\\max\\mathcal{L}(x,y)=f(x)+\\Phi(x,y)-g(y)$, where $f,g$ are closed convex and $\\Phi(x,y)$ is a smooth function that is weakly convex in $x$, (strongly) concave in $y$. Let $\\delta^2$ denote the variance bound for the unbiased stochastic oracle used within SAPD+ to estimate $\\nabla\\Phi$. When $\\delta>0$, for both strongly concave and merely concave settings, SAPD+ achieves the best known oracle complexities: $\\mathcal{O}\\Big(\\kappa_y\\max\\Big\\{1,\\frac{\\delta^2}{\\epsilon^2}\\Big\\}\\frac{L\\mathcal"},"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":"2205.15084","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-30T13:20:27Z","cross_cats_sorted":[],"title_canon_sha256":"20b53688c93b2c4c1505e7636b80f17ebade90b90fc8539d2316217ccc66c504","abstract_canon_sha256":"9952726789766587795c336a95719318333cbebabe1c5e5b08d69f0d750d46e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:49.967846Z","signature_b64":"RzLLWPYiupEHdJvn6iXw12YeOEdnB9F5utnlZa4OTbjahtVD13730TTa9FhwtvToQTTlmhsaHmy9AupZ+L90AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e4f6498ba2d054cbe297f42ac75689ac6309ce7b86ea3a5a5296a05f92ce379","last_reissued_at":"2026-07-05T09:19:49.967263Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:49.967263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mert G\\\"urb\\\"uzbalaban, Necdet Serhat Aybat, Xuan Zhang","submitted_at":"2022-05-30T13:20:27Z","abstract_excerpt":"We propose a new stochastic method SAPD+ for solving nonconvex-concave minimax problems of the form $\\min\\max\\mathcal{L}(x,y)=f(x)+\\Phi(x,y)-g(y)$, where $f,g$ are closed convex and $\\Phi(x,y)$ is a smooth function that is weakly convex in $x$, (strongly) concave in $y$. Let $\\delta^2$ denote the variance bound for the unbiased stochastic oracle used within SAPD+ to estimate $\\nabla\\Phi$. When $\\delta>0$, for both strongly concave and merely concave settings, SAPD+ achieves the best known oracle complexities: $\\mathcal{O}\\Big(\\kappa_y\\max\\Big\\{1,\\frac{\\delta^2}{\\epsilon^2}\\Big\\}\\frac{L\\mathcal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.15084","kind":"arxiv","version":4},"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/2205.15084/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":"2205.15084","created_at":"2026-07-05T09:19:49.967347+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.15084v4","created_at":"2026-07-05T09:19:49.967347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.15084","created_at":"2026-07-05T09:19:49.967347+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZHWJGF2FUCU","created_at":"2026-07-05T09:19:49.967347+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZHWJGF2FUCUZPRJ","created_at":"2026-07-05T09:19:49.967347+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZHWJGF2","created_at":"2026-07-05T09:19:49.967347+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2403.07806","citing_title":"A Stochastic GDA Method With Backtracking For Solving Nonconvex Concave Minimax Problems","ref_index":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BZHWJGF2FUCUZPRJP5BKY5LITL","json":"https://pith.science/pith/BZHWJGF2FUCUZPRJP5BKY5LITL.json","graph_json":"https://pith.science/api/pith-number/BZHWJGF2FUCUZPRJP5BKY5LITL/graph.json","events_json":"https://pith.science/api/pith-number/BZHWJGF2FUCUZPRJP5BKY5LITL/events.json","paper":"https://pith.science/paper/BZHWJGF2"},"agent_actions":{"view_html":"https://pith.science/pith/BZHWJGF2FUCUZPRJP5BKY5LITL","download_json":"https://pith.science/pith/BZHWJGF2FUCUZPRJP5BKY5LITL.json","view_paper":"https://pith.science/paper/BZHWJGF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.15084&json=true","fetch_graph":"https://pith.science/api/pith-number/BZHWJGF2FUCUZPRJP5BKY5LITL/graph.json","fetch_events":"https://pith.science/api/pith-number/BZHWJGF2FUCUZPRJP5BKY5LITL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZHWJGF2FUCUZPRJP5BKY5LITL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZHWJGF2FUCUZPRJP5BKY5LITL/action/storage_attestation","attest_author":"https://pith.science/pith/BZHWJGF2FUCUZPRJP5BKY5LITL/action/author_attestation","sign_citation":"https://pith.science/pith/BZHWJGF2FUCUZPRJP5BKY5LITL/action/citation_signature","submit_replication":"https://pith.science/pith/BZHWJGF2FUCUZPRJP5BKY5LITL/action/replication_record"}},"created_at":"2026-07-05T09:19:49.967347+00:00","updated_at":"2026-07-05T09:19:49.967347+00:00"}