{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZKJEPDWKAKQRO5Y6UFPFHDYXOJ","short_pith_number":"pith:ZKJEPDWK","schema_version":"1.0","canonical_sha256":"ca92478eca02a117771ea15e538f17724f7c689b8a6693fe3bc8bcdf85b99a03","source":{"kind":"arxiv","id":"2402.09807","version":1},"attestation_state":"computed","paper":{"title":"Two trust region type algorithms for solving nonconvex-strongly concave minimax problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Tongliang Yao, Zi Xu","submitted_at":"2024-02-15T09:13:59Z","abstract_excerpt":"In this paper, we propose a Minimax Trust Region (MINIMAX-TR) algorithm and a Minimax Trust Region Algorithm with Contractions and Expansions(MINIMAX-TRACE) algorithm for solving nonconvex-strongly concave minimax problems. Both algorithms can find an $(\\epsilon, \\sqrt{\\epsilon})$-second order stationary point(SSP) within $\\mathcal{O}(\\epsilon^{-1.5})$ iterations, which matches the best well known iteration complexity."},"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":"2402.09807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-15T09:13:59Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a918b49bd367e88904a415ec03794f5fe0fd5181259e6c1957d9669d36ecbb3c","abstract_canon_sha256":"63ccc1eca4f235903869fadda2a0a122ebc3eb37dfc09a1d0c7fa342ab5cbbb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:37.272030Z","signature_b64":"CjvFxE1Exzj9zIrla3P2p2IQrSCf0SS25G1tfCfwTBMe209Foc1PQtdRigQJ+8eZ/qYvAE0AU6PhuRDn+a4mAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca92478eca02a117771ea15e538f17724f7c689b8a6693fe3bc8bcdf85b99a03","last_reissued_at":"2026-07-05T07:45:37.271624Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:37.271624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two trust region type algorithms for solving nonconvex-strongly concave minimax problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Tongliang Yao, Zi Xu","submitted_at":"2024-02-15T09:13:59Z","abstract_excerpt":"In this paper, we propose a Minimax Trust Region (MINIMAX-TR) algorithm and a Minimax Trust Region Algorithm with Contractions and Expansions(MINIMAX-TRACE) algorithm for solving nonconvex-strongly concave minimax problems. Both algorithms can find an $(\\epsilon, \\sqrt{\\epsilon})$-second order stationary point(SSP) within $\\mathcal{O}(\\epsilon^{-1.5})$ iterations, which matches the best well known iteration complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09807","kind":"arxiv","version":1},"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/2402.09807/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":"2402.09807","created_at":"2026-07-05T07:45:37.271680+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.09807v1","created_at":"2026-07-05T07:45:37.271680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09807","created_at":"2026-07-05T07:45:37.271680+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKJEPDWKAKQR","created_at":"2026-07-05T07:45:37.271680+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKJEPDWKAKQRO5Y6","created_at":"2026-07-05T07:45:37.271680+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKJEPDWK","created_at":"2026-07-05T07:45:37.271680+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15769","citing_title":"Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ","json":"https://pith.science/pith/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ.json","graph_json":"https://pith.science/api/pith-number/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ/graph.json","events_json":"https://pith.science/api/pith-number/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ/events.json","paper":"https://pith.science/paper/ZKJEPDWK"},"agent_actions":{"view_html":"https://pith.science/pith/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ","download_json":"https://pith.science/pith/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ.json","view_paper":"https://pith.science/paper/ZKJEPDWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.09807&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZKJEPDWKAKQRO5Y6UFPFHDYXOJ/action/replication_record"}},"created_at":"2026-07-05T07:45:37.271680+00:00","updated_at":"2026-07-05T07:45:37.271680+00:00"}