{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KRHBG6PXM3VIPIPPCOSY5EYSL5","short_pith_number":"pith:KRHBG6PX","schema_version":"1.0","canonical_sha256":"544e1379f766ea87a1ef13a58e93125f75d800866b50b92351626c8765a7b215","source":{"kind":"arxiv","id":"2407.03571","version":2},"attestation_state":"computed","paper":{"title":"A Fully Parameter-Free Second-Order Algorithm for Convex-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":"Huiling Zhang, Junlin Wang, Zi Xu","submitted_at":"2024-07-04T01:46:07Z","abstract_excerpt":"In this paper, we study second-order algorithms for the convex-concave minimax problem, which has attracted much attention in many fields such as machine learning in recent years. We propose a Lipschitz-free cubic regularization (LF-CR) algorithm for solving the convex-concave minimax optimization problem without knowing the Lipschitz constant. It can be shown that the iteration complexity of the LF-CR algorithm to obtain an $\\epsilon$-optimal solution with respect to the restricted primal-dual gap is upper bounded by $\\mathcal{O}(\\rho^{2/3}\\|z_0-z^*\\|^2\\epsilon^{-2/3})$ , where $z_0=(x_0,y_0)"},"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":"2407.03571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-04T01:46:07Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"037396939479df90bf05548e7a58792f5b1379452919079267fb17d7d6da87ed","abstract_canon_sha256":"d6beb6dc8fc917a60abb525798b78117f41460ec7586fe5ef37a249959dd067d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:00.570467Z","signature_b64":"D4waZwM2JkQfge4rkdBSMB9qecDpb+j1FFgd+6ObT4YJ4MR0tPR4BjHYkWQ3CkPnWlbBIqrvxkwIwlMLwuSwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"544e1379f766ea87a1ef13a58e93125f75d800866b50b92351626c8765a7b215","last_reissued_at":"2026-07-05T12:06:00.569847Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:00.569847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fully Parameter-Free Second-Order Algorithm for Convex-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":"Huiling Zhang, Junlin Wang, Zi Xu","submitted_at":"2024-07-04T01:46:07Z","abstract_excerpt":"In this paper, we study second-order algorithms for the convex-concave minimax problem, which has attracted much attention in many fields such as machine learning in recent years. We propose a Lipschitz-free cubic regularization (LF-CR) algorithm for solving the convex-concave minimax optimization problem without knowing the Lipschitz constant. It can be shown that the iteration complexity of the LF-CR algorithm to obtain an $\\epsilon$-optimal solution with respect to the restricted primal-dual gap is upper bounded by $\\mathcal{O}(\\rho^{2/3}\\|z_0-z^*\\|^2\\epsilon^{-2/3})$ , where $z_0=(x_0,y_0)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.03571","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.03571/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":"2407.03571","created_at":"2026-07-05T12:06:00.569925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.03571v2","created_at":"2026-07-05T12:06:00.569925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.03571","created_at":"2026-07-05T12:06:00.569925+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRHBG6PXM3VI","created_at":"2026-07-05T12:06:00.569925+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRHBG6PXM3VIPIPP","created_at":"2026-07-05T12:06:00.569925+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRHBG6PX","created_at":"2026-07-05T12:06:00.569925+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":53,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5","json":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5.json","graph_json":"https://pith.science/api/pith-number/KRHBG6PXM3VIPIPPCOSY5EYSL5/graph.json","events_json":"https://pith.science/api/pith-number/KRHBG6PXM3VIPIPPCOSY5EYSL5/events.json","paper":"https://pith.science/paper/KRHBG6PX"},"agent_actions":{"view_html":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5","download_json":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5.json","view_paper":"https://pith.science/paper/KRHBG6PX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.03571&json=true","fetch_graph":"https://pith.science/api/pith-number/KRHBG6PXM3VIPIPPCOSY5EYSL5/graph.json","fetch_events":"https://pith.science/api/pith-number/KRHBG6PXM3VIPIPPCOSY5EYSL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5/action/storage_attestation","attest_author":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5/action/author_attestation","sign_citation":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5/action/citation_signature","submit_replication":"https://pith.science/pith/KRHBG6PXM3VIPIPPCOSY5EYSL5/action/replication_record"}},"created_at":"2026-07-05T12:06:00.569925+00:00","updated_at":"2026-07-05T12:06:00.569925+00:00"}