{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:E6YHGHLSVZOYZ6CIVUPZUQI5QG","short_pith_number":"pith:E6YHGHLS","schema_version":"1.0","canonical_sha256":"27b0731d72ae5d8cf848ad1f9a411d81a24fb0ecb84ff3ddc9de503d4925fd74","source":{"kind":"arxiv","id":"1907.01543","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Smooth Minimax Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Kiran Koshy Thekumparampil, Praneeth Netrapalli, Prateek Jain, Sewoong Oh","submitted_at":"2019-07-02T17:50:34Z","abstract_excerpt":"This paper studies first order methods for solving smooth minimax optimization problems $\\min_x \\max_y g(x,y)$ where $g(\\cdot,\\cdot)$ is smooth and $g(x,\\cdot)$ is concave for each $x$. In terms of $g(\\cdot,y)$, we consider two settings -- strongly convex and nonconvex -- and improve upon the best known rates in both. For strongly-convex $g(\\cdot, y),\\ \\forall y$, we propose a new algorithm combining Mirror-Prox and Nesterov's AGD, and show that it can find global optimum in $\\tilde{O}(1/k^2)$ iterations, improving over current state-of-the-art rate of $O(1/k)$. We use this result along with a"},"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":"1907.01543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-02T17:50:34Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"9c48ec5138ddcb6e8efcd1659eccb062610888a8c93b0445703b91fdafe65488","abstract_canon_sha256":"082697e1c53249771671ab252ea7569c44d791b5a66cbb50167a898c25fa651a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:40.077873Z","signature_b64":"OhnbV4Lh0u8+JAeP95kVsVJof9fF3L/kvJ6/bZq1Imhdh6HEV/wmRNwFsCNfAB8XwdAfDpnC/DHcHiQLLndABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27b0731d72ae5d8cf848ad1f9a411d81a24fb0ecb84ff3ddc9de503d4925fd74","last_reissued_at":"2026-05-17T23:41:40.077176Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:40.077176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Smooth Minimax Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Kiran Koshy Thekumparampil, Praneeth Netrapalli, Prateek Jain, Sewoong Oh","submitted_at":"2019-07-02T17:50:34Z","abstract_excerpt":"This paper studies first order methods for solving smooth minimax optimization problems $\\min_x \\max_y g(x,y)$ where $g(\\cdot,\\cdot)$ is smooth and $g(x,\\cdot)$ is concave for each $x$. In terms of $g(\\cdot,y)$, we consider two settings -- strongly convex and nonconvex -- and improve upon the best known rates in both. For strongly-convex $g(\\cdot, y),\\ \\forall y$, we propose a new algorithm combining Mirror-Prox and Nesterov's AGD, and show that it can find global optimum in $\\tilde{O}(1/k^2)$ iterations, improving over current state-of-the-art rate of $O(1/k)$. We use this result along with a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01543","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":""},"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":"1907.01543","created_at":"2026-05-17T23:41:40.077285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01543v1","created_at":"2026-05-17T23:41:40.077285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01543","created_at":"2026-05-17T23:41:40.077285+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6YHGHLSVZOY","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6YHGHLSVZOYZ6CI","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6YHGHLS","created_at":"2026-05-18T12:33:15.570797+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/E6YHGHLSVZOYZ6CIVUPZUQI5QG","json":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG.json","graph_json":"https://pith.science/api/pith-number/E6YHGHLSVZOYZ6CIVUPZUQI5QG/graph.json","events_json":"https://pith.science/api/pith-number/E6YHGHLSVZOYZ6CIVUPZUQI5QG/events.json","paper":"https://pith.science/paper/E6YHGHLS"},"agent_actions":{"view_html":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG","download_json":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG.json","view_paper":"https://pith.science/paper/E6YHGHLS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01543&json=true","fetch_graph":"https://pith.science/api/pith-number/E6YHGHLSVZOYZ6CIVUPZUQI5QG/graph.json","fetch_events":"https://pith.science/api/pith-number/E6YHGHLSVZOYZ6CIVUPZUQI5QG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG/action/storage_attestation","attest_author":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG/action/author_attestation","sign_citation":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG/action/citation_signature","submit_replication":"https://pith.science/pith/E6YHGHLSVZOYZ6CIVUPZUQI5QG/action/replication_record"}},"created_at":"2026-05-17T23:41:40.077285+00:00","updated_at":"2026-05-17T23:41:40.077285+00:00"}