{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3XULHAMED7DXR53QKACTU4A6JF","short_pith_number":"pith:3XULHAME","schema_version":"1.0","canonical_sha256":"dde8b381841fc778f77050053a701e494a47b5c0145fd795cef991f12a02af33","source":{"kind":"arxiv","id":"2511.15606","version":2},"attestation_state":"computed","paper":{"title":"A Scenario Approach to the Robustness of Nonconvex-Nonconcave Minimax Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The scenario approach yields a probabilistic robustness guarantee for ε-stationary points in nonconvex-nonconcave minimax problems by proving monotonicity of the stationary residual.","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Guanpu Chen, Huan Peng, Karl Henrik Johansson","submitted_at":"2025-11-19T16:53:29Z","abstract_excerpt":"This paper investigates probabilistic robustness of nonconvex-nonconcave minimax problems via the scenario approach. Specifically, under convex strategy sets for all players, inspired by recent advances in scenario optimization, we first establish a probabilistic robustness guarantee for an $\\varepsilon$-stationary point, overcoming the dependence on the non-degeneracy assumption by proving the monotonicity of the stationary residual in the number of scenarios. Furthermore, in the presence of nonconvex strategy sets, we reveal the fundamental difficulty of obtaining a tight theoretical bound b"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2511.15606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-11-19T16:53:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b10dcbdd3f43f186243d07d5fe0db04a01fe9e5bb2a88dbce35e847846a39a24","abstract_canon_sha256":"a826d1f49940b00c68106b9ab83ec1c3c310a2447357b54f7640366ee1201b05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:33.196664Z","signature_b64":"ZUfi7fwviHD1a+OFwbiNN7NkF8kmyoGyjJ+y52FZP/yv4AnAbMxeJnoyyCaw/Aw6a2S6WX5l2CFER1arfPfBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dde8b381841fc778f77050053a701e494a47b5c0145fd795cef991f12a02af33","last_reissued_at":"2026-05-18T03:09:33.196177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:33.196177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Scenario Approach to the Robustness of Nonconvex-Nonconcave Minimax Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The scenario approach yields a probabilistic robustness guarantee for ε-stationary points in nonconvex-nonconcave minimax problems by proving monotonicity of the stationary residual.","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Guanpu Chen, Huan Peng, Karl Henrik Johansson","submitted_at":"2025-11-19T16:53:29Z","abstract_excerpt":"This paper investigates probabilistic robustness of nonconvex-nonconcave minimax problems via the scenario approach. Specifically, under convex strategy sets for all players, inspired by recent advances in scenario optimization, we first establish a probabilistic robustness guarantee for an $\\varepsilon$-stationary point, overcoming the dependence on the non-degeneracy assumption by proving the monotonicity of the stationary residual in the number of scenarios. Furthermore, in the presence of nonconvex strategy sets, we reveal the fundamental difficulty of obtaining a tight theoretical bound b"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we first establish a probabilistic robustness guarantee for an ε-stationary point, overcoming the dependence on the non-degeneracy assumption by proving the monotonicity of the stationary residual in the number of scenarios.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Convex strategy sets for all players together with the standard assumptions of the scenario optimization framework from prior literature.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Scenario approach establishes probabilistic robustness for epsilon-stationary points in convex-strategy minimax problems via monotonicity of residuals and a relaxed bound for global points in nonconvex cases.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The scenario approach yields a probabilistic robustness guarantee for ε-stationary points in nonconvex-nonconcave minimax problems by proving monotonicity of the stationary residual.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d787e7d4483c1dd6471b96f8441b617caaa5ea23829c7a8ef525ff2574c1a1cc"},"source":{"id":"2511.15606","kind":"arxiv","version":2},"verdict":{"id":"1009824b-670d-4ac9-b50c-341107243b4e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T20:28:17.304341Z","strongest_claim":"we first establish a probabilistic robustness guarantee for an ε-stationary point, overcoming the dependence on the non-degeneracy assumption by proving the monotonicity of the stationary residual in the number of scenarios.","one_line_summary":"Scenario approach establishes probabilistic robustness for epsilon-stationary points in convex-strategy minimax problems via monotonicity of residuals and a relaxed bound for global points in nonconvex cases.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Convex strategy sets for all players together with the standard assumptions of the scenario optimization framework from prior literature.","pith_extraction_headline":"The scenario approach yields a probabilistic robustness guarantee for ε-stationary points in nonconvex-nonconcave minimax problems by proving monotonicity of the stationary residual."},"references":{"count":3,"sample":[{"doi":"10.1109/tac.2025.3634219","year":2006,"title":"Aliprantis, C.D. and Border, K.C. (2006). Infinite Dimen- sional Analysis: A Hitchhiker’s Guide . Springer, 3rd edition. Assif, M., Chatterjee, D., and Banavar, R. (2020). Scenario approach for minmax ","work_id":"4e854a4c-0b6c-4c6f-b85c-7646230c3b01","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., and Bengio, Y. (2014). Generative adversarial nets. In Advances in Neural Information Processing Syste","work_id":"16e6f931-9cfe-4f8d-9896-d7eeb9e03a6f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Yang, J., Orvieto, A., Lucchi, A., and He, N. (2022). Faster single-loop algorithms for minimax optimization without strong concavity. In International Conference on Artificial Intelligence and Statist","work_id":"6612e46e-d64f-4d3b-9c78-271bb2a2bcfa","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":3,"snapshot_sha256":"b18315085263a7885b146acd8e1c5a3094a3c846fffeff9b34d565e5f7b1ca51","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":"2511.15606","created_at":"2026-05-18T03:09:33.196254+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.15606v2","created_at":"2026-05-18T03:09:33.196254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.15606","created_at":"2026-05-18T03:09:33.196254+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XULHAMED7DX","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XULHAMED7DXR53Q","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XULHAME","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/3XULHAMED7DXR53QKACTU4A6JF","json":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF.json","graph_json":"https://pith.science/api/pith-number/3XULHAMED7DXR53QKACTU4A6JF/graph.json","events_json":"https://pith.science/api/pith-number/3XULHAMED7DXR53QKACTU4A6JF/events.json","paper":"https://pith.science/paper/3XULHAME"},"agent_actions":{"view_html":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF","download_json":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF.json","view_paper":"https://pith.science/paper/3XULHAME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.15606&json=true","fetch_graph":"https://pith.science/api/pith-number/3XULHAMED7DXR53QKACTU4A6JF/graph.json","fetch_events":"https://pith.science/api/pith-number/3XULHAMED7DXR53QKACTU4A6JF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF/action/storage_attestation","attest_author":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF/action/author_attestation","sign_citation":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF/action/citation_signature","submit_replication":"https://pith.science/pith/3XULHAMED7DXR53QKACTU4A6JF/action/replication_record"}},"created_at":"2026-05-18T03:09:33.196254+00:00","updated_at":"2026-05-18T03:09:33.196254+00:00"}