{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6PV3XVEAF34O24TU5AVF32XYFC","short_pith_number":"pith:6PV3XVEA","schema_version":"1.0","canonical_sha256":"f3ebbbd4802ef8ed7274e82a5deaf8288e108713a86c59578b60216ba360955d","source":{"kind":"arxiv","id":"2403.07806","version":2},"attestation_state":"computed","paper":{"title":"A Stochastic GDA Method With Backtracking For Solving 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, Qiushui Xu, Xuan Zhang","submitted_at":"2024-03-12T16:43:55Z","abstract_excerpt":"We propose a stochastic GDA (gradient descent ascent) method with backtracking (SGDA-B) to solve nonconvex-concave (NCC) minimax problems of the form: $\\min_{\\mathbf{x}} \\max_y \\sum_{i=1}^N g_i(x_i)+f(\\mathbf{x},y)-h(y)$, where $h$ and $g_i$ for $i=1,\\cdots,N$ are closed, convex functions, and for some $L,\\mu\\geq 0$, $f$ is $L$-smooth and $f(\\mathbf{x},\\cdot)$ is $\\mu$-strongly concave for all $\\mathbf{x}$ in the problem domain. We consider the stochastic setting where one only has an access to an unbiased stochastic oracle of $\\nabla f$ with a finite variance bound $\\sigma^2$. While most of t"},"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":"2403.07806","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-12T16:43:55Z","cross_cats_sorted":[],"title_canon_sha256":"ef6ddf029beec39b12af93659ff6cf777ebd69f628df4d2802410223f09e494a","abstract_canon_sha256":"2170f5d0e63772307d58cb65886881f902fd4a5118b2bc3e048735ebbd5e70ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:15.141547Z","signature_b64":"f3XVLT+pa39/86x2PJEtZGdj6UyecWqGnW9IuQj97QmZKOjaLKWvwOIfV3JZHgrDwGcTa5s7m5xhrNXwoklMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3ebbbd4802ef8ed7274e82a5deaf8288e108713a86c59578b60216ba360955d","last_reissued_at":"2026-05-18T02:45:15.141045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:15.141045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Stochastic GDA Method With Backtracking For Solving 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, Qiushui Xu, Xuan Zhang","submitted_at":"2024-03-12T16:43:55Z","abstract_excerpt":"We propose a stochastic GDA (gradient descent ascent) method with backtracking (SGDA-B) to solve nonconvex-concave (NCC) minimax problems of the form: $\\min_{\\mathbf{x}} \\max_y \\sum_{i=1}^N g_i(x_i)+f(\\mathbf{x},y)-h(y)$, where $h$ and $g_i$ for $i=1,\\cdots,N$ are closed, convex functions, and for some $L,\\mu\\geq 0$, $f$ is $L$-smooth and $f(\\mathbf{x},\\cdot)$ is $\\mu$-strongly concave for all $\\mathbf{x}$ in the problem domain. We consider the stochastic setting where one only has an access to an unbiased stochastic oracle of $\\nabla f$ with a finite variance bound $\\sigma^2$. While most of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.07806","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":""},"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":"2403.07806","created_at":"2026-05-18T02:45:15.141126+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.07806v2","created_at":"2026-05-18T02:45:15.141126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07806","created_at":"2026-05-18T02:45:15.141126+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PV3XVEAF34O","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PV3XVEAF34O24TU","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PV3XVEA","created_at":"2026-05-18T12:33:37.589309+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/6PV3XVEAF34O24TU5AVF32XYFC","json":"https://pith.science/pith/6PV3XVEAF34O24TU5AVF32XYFC.json","graph_json":"https://pith.science/api/pith-number/6PV3XVEAF34O24TU5AVF32XYFC/graph.json","events_json":"https://pith.science/api/pith-number/6PV3XVEAF34O24TU5AVF32XYFC/events.json","paper":"https://pith.science/paper/6PV3XVEA"},"agent_actions":{"view_html":"https://pith.science/pith/6PV3XVEAF34O24TU5AVF32XYFC","download_json":"https://pith.science/pith/6PV3XVEAF34O24TU5AVF32XYFC.json","view_paper":"https://pith.science/paper/6PV3XVEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.07806&json=true","fetch_graph":"https://pith.science/api/pith-number/6PV3XVEAF34O24TU5AVF32XYFC/graph.json","fetch_events":"https://pith.science/api/pith-number/6PV3XVEAF34O24TU5AVF32XYFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PV3XVEAF34O24TU5AVF32XYFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PV3XVEAF34O24TU5AVF32XYFC/action/storage_attestation","attest_author":"https://pith.science/pith/6PV3XVEAF34O24TU5AVF32XYFC/action/author_attestation","sign_citation":"https://pith.science/pith/6PV3XVEAF34O24TU5AVF32XYFC/action/citation_signature","submit_replication":"https://pith.science/pith/6PV3XVEAF34O24TU5AVF32XYFC/action/replication_record"}},"created_at":"2026-05-18T02:45:15.141126+00:00","updated_at":"2026-05-18T02:45:15.141126+00:00"}