{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YSDEH727YZEZGZKUQLMJIE4FP4","short_pith_number":"pith:YSDEH727","schema_version":"1.0","canonical_sha256":"c48643ff5fc64993655482d89413857f2697f891e26dc03b86426fd6e42ea94d","source":{"kind":"arxiv","id":"2110.07098","version":5},"attestation_state":"computed","paper":{"title":"A Cubic Regularization Approach for Finding Local Minimax Points in Nonconvex Minimax Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Qunwei Li, Yi Zhou, Zhengyang Hu, Zhe Wang, Ziyi Chen","submitted_at":"2021-10-14T00:36:44Z","abstract_excerpt":"Gradient descent-ascent (GDA) is a widely used algorithm for minimax optimization. However, GDA has been proved to converge to stationary points for nonconvex minimax optimization, which are suboptimal compared with local minimax points. In this work, we develop cubic regularization (CR) type algorithms that globally converge to local minimax points in nonconvex-strongly-concave minimax optimization. We first show that local minimax points are equivalent to second-order stationary points of a certain envelope function. Then, inspired by the classic cubic regularization algorithm, we propose an"},"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":"2110.07098","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-10-14T00:36:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cd55130446579d3a9e4e23c734185580825027042d72ab9d66c765e6da0fc21d","abstract_canon_sha256":"812a792b65c9879fb1312257507b1695d509a9f2b14251eaf3cf28caf1160e15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:43:08.634778Z","signature_b64":"00BF/TF6voRWjjrm+OT6VyzcnXEK83pdeRa/QDVuC8mKga7ugHPyjjOLM175bePbSLWWdeD1ZGcc0qtxaCgXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c48643ff5fc64993655482d89413857f2697f891e26dc03b86426fd6e42ea94d","last_reissued_at":"2026-07-05T05:43:08.634323Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:43:08.634323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Cubic Regularization Approach for Finding Local Minimax Points in Nonconvex Minimax Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Qunwei Li, Yi Zhou, Zhengyang Hu, Zhe Wang, Ziyi Chen","submitted_at":"2021-10-14T00:36:44Z","abstract_excerpt":"Gradient descent-ascent (GDA) is a widely used algorithm for minimax optimization. However, GDA has been proved to converge to stationary points for nonconvex minimax optimization, which are suboptimal compared with local minimax points. In this work, we develop cubic regularization (CR) type algorithms that globally converge to local minimax points in nonconvex-strongly-concave minimax optimization. We first show that local minimax points are equivalent to second-order stationary points of a certain envelope function. Then, inspired by the classic cubic regularization algorithm, we propose an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.07098","kind":"arxiv","version":5},"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/2110.07098/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":"2110.07098","created_at":"2026-07-05T05:43:08.634377+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.07098v5","created_at":"2026-07-05T05:43:08.634377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.07098","created_at":"2026-07-05T05:43:08.634377+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSDEH727YZEZ","created_at":"2026-07-05T05:43:08.634377+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSDEH727YZEZGZKU","created_at":"2026-07-05T05:43:08.634377+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSDEH727","created_at":"2026-07-05T05:43:08.634377+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/YSDEH727YZEZGZKUQLMJIE4FP4","json":"https://pith.science/pith/YSDEH727YZEZGZKUQLMJIE4FP4.json","graph_json":"https://pith.science/api/pith-number/YSDEH727YZEZGZKUQLMJIE4FP4/graph.json","events_json":"https://pith.science/api/pith-number/YSDEH727YZEZGZKUQLMJIE4FP4/events.json","paper":"https://pith.science/paper/YSDEH727"},"agent_actions":{"view_html":"https://pith.science/pith/YSDEH727YZEZGZKUQLMJIE4FP4","download_json":"https://pith.science/pith/YSDEH727YZEZGZKUQLMJIE4FP4.json","view_paper":"https://pith.science/paper/YSDEH727","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.07098&json=true","fetch_graph":"https://pith.science/api/pith-number/YSDEH727YZEZGZKUQLMJIE4FP4/graph.json","fetch_events":"https://pith.science/api/pith-number/YSDEH727YZEZGZKUQLMJIE4FP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSDEH727YZEZGZKUQLMJIE4FP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSDEH727YZEZGZKUQLMJIE4FP4/action/storage_attestation","attest_author":"https://pith.science/pith/YSDEH727YZEZGZKUQLMJIE4FP4/action/author_attestation","sign_citation":"https://pith.science/pith/YSDEH727YZEZGZKUQLMJIE4FP4/action/citation_signature","submit_replication":"https://pith.science/pith/YSDEH727YZEZGZKUQLMJIE4FP4/action/replication_record"}},"created_at":"2026-07-05T05:43:08.634377+00:00","updated_at":"2026-07-05T05:43:08.634377+00:00"}