{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2EHXGRU2RHFTDSITOEETQ46OIC","short_pith_number":"pith:2EHXGRU2","schema_version":"1.0","canonical_sha256":"d10f73469a89cb31c91371093873ce40b87151633977dae1bceda99a899a2f69","source":{"kind":"arxiv","id":"2506.08362","version":1},"attestation_state":"computed","paper":{"title":"Solving Convex-Concave Problems with $\\tilde{\\mathcal{O}}(\\epsilon^{-4/7})$ Second-Order Oracle Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chengchang Liu, Jingzhao Zhang, Lesi Chen, Luo Luo","submitted_at":"2025-06-10T02:20:48Z","abstract_excerpt":"Previous algorithms can solve convex-concave minimax problems $\\min_{x \\in \\mathcal{X}} \\max_{y \\in \\mathcal{Y}} f(x,y)$ with $\\mathcal{O}(\\epsilon^{-2/3})$ second-order oracle calls using Newton-type methods. This result has been speculated to be optimal because the upper bound is achieved by a natural generalization of the optimal first-order method. In this work, we show an improved upper bound of $\\tilde{\\mathcal{O}}(\\epsilon^{-4/7})$ by generalizing the optimal second-order method for convex optimization to solve the convex-concave minimax problem. We further apply a similar technique to "},"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":"2506.08362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-10T02:20:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cf183407b429bb5a9dcedad1d05dfbdb40cb3dbc7e17d10eaf402aa7aa0bc748","abstract_canon_sha256":"fcad092882895b8c29401c73e3eba33c7e0f3efc59898d8e9fe99de3510c9cdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:48.554596Z","signature_b64":"q+HgDQoykj+pXQ9dhJKRTpKAZLM98HNGOImjDfwpjxwhBLB3z69hUQHeifkXxZQlKwNrczURqgraM/xVQXZeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d10f73469a89cb31c91371093873ce40b87151633977dae1bceda99a899a2f69","last_reissued_at":"2026-07-05T11:18:48.554112Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:48.554112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Convex-Concave Problems with $\\tilde{\\mathcal{O}}(\\epsilon^{-4/7})$ Second-Order Oracle Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chengchang Liu, Jingzhao Zhang, Lesi Chen, Luo Luo","submitted_at":"2025-06-10T02:20:48Z","abstract_excerpt":"Previous algorithms can solve convex-concave minimax problems $\\min_{x \\in \\mathcal{X}} \\max_{y \\in \\mathcal{Y}} f(x,y)$ with $\\mathcal{O}(\\epsilon^{-2/3})$ second-order oracle calls using Newton-type methods. This result has been speculated to be optimal because the upper bound is achieved by a natural generalization of the optimal first-order method. In this work, we show an improved upper bound of $\\tilde{\\mathcal{O}}(\\epsilon^{-4/7})$ by generalizing the optimal second-order method for convex optimization to solve the convex-concave minimax problem. We further apply a similar technique to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08362","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/2506.08362/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":"2506.08362","created_at":"2026-07-05T11:18:48.554170+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.08362v1","created_at":"2026-07-05T11:18:48.554170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08362","created_at":"2026-07-05T11:18:48.554170+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EHXGRU2RHFT","created_at":"2026-07-05T11:18:48.554170+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EHXGRU2RHFTDSIT","created_at":"2026-07-05T11:18:48.554170+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EHXGRU2","created_at":"2026-07-05T11:18:48.554170+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16875","citing_title":"Stochastic Optimization and Data Science","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2EHXGRU2RHFTDSITOEETQ46OIC","json":"https://pith.science/pith/2EHXGRU2RHFTDSITOEETQ46OIC.json","graph_json":"https://pith.science/api/pith-number/2EHXGRU2RHFTDSITOEETQ46OIC/graph.json","events_json":"https://pith.science/api/pith-number/2EHXGRU2RHFTDSITOEETQ46OIC/events.json","paper":"https://pith.science/paper/2EHXGRU2"},"agent_actions":{"view_html":"https://pith.science/pith/2EHXGRU2RHFTDSITOEETQ46OIC","download_json":"https://pith.science/pith/2EHXGRU2RHFTDSITOEETQ46OIC.json","view_paper":"https://pith.science/paper/2EHXGRU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.08362&json=true","fetch_graph":"https://pith.science/api/pith-number/2EHXGRU2RHFTDSITOEETQ46OIC/graph.json","fetch_events":"https://pith.science/api/pith-number/2EHXGRU2RHFTDSITOEETQ46OIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EHXGRU2RHFTDSITOEETQ46OIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EHXGRU2RHFTDSITOEETQ46OIC/action/storage_attestation","attest_author":"https://pith.science/pith/2EHXGRU2RHFTDSITOEETQ46OIC/action/author_attestation","sign_citation":"https://pith.science/pith/2EHXGRU2RHFTDSITOEETQ46OIC/action/citation_signature","submit_replication":"https://pith.science/pith/2EHXGRU2RHFTDSITOEETQ46OIC/action/replication_record"}},"created_at":"2026-07-05T11:18:48.554170+00:00","updated_at":"2026-07-05T11:18:48.554170+00:00"}