{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SRYMSZJZVGMDNFNY5LUJYO4ZYD","short_pith_number":"pith:SRYMSZJZ","schema_version":"1.0","canonical_sha256":"9470c96539a9983695b8eae89c3b99c0d58fa265c3bee05e15ba54331abec5d5","source":{"kind":"arxiv","id":"2208.03085","version":2},"attestation_state":"computed","paper":{"title":"Optimistic Gradient Descent Ascent in Zero-Sum and General-Sum Bilinear Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"\\'Etienne de Montbrun, J\\'er\\^ome Renault","submitted_at":"2022-08-05T10:42:26Z","abstract_excerpt":"We study the convergence of Optimistic Gradient Descent Ascent in unconstrained bilinear games. In a first part, we consider the zero-sum case and extend previous results by Daskalakis et al. in 2018, Liang and Stokes in 2019, and others: we prove, for any payoff matrix, the exponential convergence of OGDA to a saddle point and also provide a new, optimal, geometric ratio for the convergence. We also characterize the step sizes inducing convergence, and are able to deduce the optimal step size for the speed of convergence. In a second part, we introduce OGDA for general-sum bilinear games: we "},"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":"2208.03085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-08-05T10:42:26Z","cross_cats_sorted":[],"title_canon_sha256":"090967dca9228573e2041518b871ef54b16ef2e3057a0ce024a08cedd01fec46","abstract_canon_sha256":"e848f324b821297c8eb97b7726aa1dc8e464bbda52e0e8bcd2d4540eeb708eaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:18:48.205831Z","signature_b64":"Gsh2t3XwY75EAItO8OAXsyeTM2BXWGS7adZ3gMdydaiDX5Msp9u+zzdi8lQ60CHN+F0ID/McAZNk74edD4KxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9470c96539a9983695b8eae89c3b99c0d58fa265c3bee05e15ba54331abec5d5","last_reissued_at":"2026-07-05T05:18:48.205436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:18:48.205436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimistic Gradient Descent Ascent in Zero-Sum and General-Sum Bilinear Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"\\'Etienne de Montbrun, J\\'er\\^ome Renault","submitted_at":"2022-08-05T10:42:26Z","abstract_excerpt":"We study the convergence of Optimistic Gradient Descent Ascent in unconstrained bilinear games. In a first part, we consider the zero-sum case and extend previous results by Daskalakis et al. in 2018, Liang and Stokes in 2019, and others: we prove, for any payoff matrix, the exponential convergence of OGDA to a saddle point and also provide a new, optimal, geometric ratio for the convergence. We also characterize the step sizes inducing convergence, and are able to deduce the optimal step size for the speed of convergence. In a second part, we introduce OGDA for general-sum bilinear games: we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.03085","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/2208.03085/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":"2208.03085","created_at":"2026-07-05T05:18:48.205487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.03085v2","created_at":"2026-07-05T05:18:48.205487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.03085","created_at":"2026-07-05T05:18:48.205487+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRYMSZJZVGMD","created_at":"2026-07-05T05:18:48.205487+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRYMSZJZVGMDNFNY","created_at":"2026-07-05T05:18:48.205487+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRYMSZJZ","created_at":"2026-07-05T05:18:48.205487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05747","citing_title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SRYMSZJZVGMDNFNY5LUJYO4ZYD","json":"https://pith.science/pith/SRYMSZJZVGMDNFNY5LUJYO4ZYD.json","graph_json":"https://pith.science/api/pith-number/SRYMSZJZVGMDNFNY5LUJYO4ZYD/graph.json","events_json":"https://pith.science/api/pith-number/SRYMSZJZVGMDNFNY5LUJYO4ZYD/events.json","paper":"https://pith.science/paper/SRYMSZJZ"},"agent_actions":{"view_html":"https://pith.science/pith/SRYMSZJZVGMDNFNY5LUJYO4ZYD","download_json":"https://pith.science/pith/SRYMSZJZVGMDNFNY5LUJYO4ZYD.json","view_paper":"https://pith.science/paper/SRYMSZJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.03085&json=true","fetch_graph":"https://pith.science/api/pith-number/SRYMSZJZVGMDNFNY5LUJYO4ZYD/graph.json","fetch_events":"https://pith.science/api/pith-number/SRYMSZJZVGMDNFNY5LUJYO4ZYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRYMSZJZVGMDNFNY5LUJYO4ZYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRYMSZJZVGMDNFNY5LUJYO4ZYD/action/storage_attestation","attest_author":"https://pith.science/pith/SRYMSZJZVGMDNFNY5LUJYO4ZYD/action/author_attestation","sign_citation":"https://pith.science/pith/SRYMSZJZVGMDNFNY5LUJYO4ZYD/action/citation_signature","submit_replication":"https://pith.science/pith/SRYMSZJZVGMDNFNY5LUJYO4ZYD/action/replication_record"}},"created_at":"2026-07-05T05:18:48.205487+00:00","updated_at":"2026-07-05T05:18:48.205487+00:00"}