{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TPSW3FLPAVGFWRHZPYGACYKREF","short_pith_number":"pith:TPSW3FLP","schema_version":"1.0","canonical_sha256":"9be56d956f054c5b44f97e0c016151214fe49e3336e1a9ebff6546df2b83e478","source":{"kind":"arxiv","id":"2402.10475","version":2},"attestation_state":"computed","paper":{"title":"Fundamental Benefit of Alternating Updates in Minimax Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chulhee Yun, Hanseul Cho, Jaewook Lee","submitted_at":"2024-02-16T06:41:35Z","abstract_excerpt":"The Gradient Descent-Ascent (GDA) algorithm, designed to solve minimax optimization problems, takes the descent and ascent steps either simultaneously (Sim-GDA) or alternately (Alt-GDA). While Alt-GDA is commonly observed to converge faster, the performance gap between the two is not yet well understood theoretically, especially in terms of global convergence rates. To address this theory-practice gap, we present fine-grained convergence analyses of both algorithms for strongly-convex-strongly-concave and Lipschitz-gradient objectives. Our new iteration complexity upper bound of Alt-GDA is str"},"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.10475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-16T06:41:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e2635c20343d4f6cc665b1051aa3f2d00d40d1f14fa0dbaa8f70307a17324f78","abstract_canon_sha256":"9b4a47ee9490fd5d48979d7a20652cb55b6d2ebe8a9dfe22e401f40d49a02d4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:53.260331Z","signature_b64":"nwr4AsysUEm+z8zGw/gk9MLiZb6CaTq6fzgpm2ZpIXJGxPdGfHTK9NaYj3RJ797EG+Dgwo3N9LVrB7KN3CsdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9be56d956f054c5b44f97e0c016151214fe49e3336e1a9ebff6546df2b83e478","last_reissued_at":"2026-07-05T08:43:53.259893Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:53.259893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental Benefit of Alternating Updates in Minimax Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chulhee Yun, Hanseul Cho, Jaewook Lee","submitted_at":"2024-02-16T06:41:35Z","abstract_excerpt":"The Gradient Descent-Ascent (GDA) algorithm, designed to solve minimax optimization problems, takes the descent and ascent steps either simultaneously (Sim-GDA) or alternately (Alt-GDA). While Alt-GDA is commonly observed to converge faster, the performance gap between the two is not yet well understood theoretically, especially in terms of global convergence rates. To address this theory-practice gap, we present fine-grained convergence analyses of both algorithms for strongly-convex-strongly-concave and Lipschitz-gradient objectives. Our new iteration complexity upper bound of Alt-GDA is str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10475","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/2402.10475/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.10475","created_at":"2026-07-05T08:43:53.259955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.10475v2","created_at":"2026-07-05T08:43:53.259955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10475","created_at":"2026-07-05T08:43:53.259955+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPSW3FLPAVGF","created_at":"2026-07-05T08:43:53.259955+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPSW3FLPAVGFWRHZ","created_at":"2026-07-05T08:43:53.259955+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPSW3FLP","created_at":"2026-07-05T08:43:53.259955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17145","citing_title":"Negative Momentum for Convex-Concave Optimization","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF","json":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF.json","graph_json":"https://pith.science/api/pith-number/TPSW3FLPAVGFWRHZPYGACYKREF/graph.json","events_json":"https://pith.science/api/pith-number/TPSW3FLPAVGFWRHZPYGACYKREF/events.json","paper":"https://pith.science/paper/TPSW3FLP"},"agent_actions":{"view_html":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF","download_json":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF.json","view_paper":"https://pith.science/paper/TPSW3FLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.10475&json=true","fetch_graph":"https://pith.science/api/pith-number/TPSW3FLPAVGFWRHZPYGACYKREF/graph.json","fetch_events":"https://pith.science/api/pith-number/TPSW3FLPAVGFWRHZPYGACYKREF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF/action/storage_attestation","attest_author":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF/action/author_attestation","sign_citation":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF/action/citation_signature","submit_replication":"https://pith.science/pith/TPSW3FLPAVGFWRHZPYGACYKREF/action/replication_record"}},"created_at":"2026-07-05T08:43:53.259955+00:00","updated_at":"2026-07-05T08:43:53.259955+00:00"}