{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZHDCVXRQFXSDDRYD36DWG33BFN","short_pith_number":"pith:ZHDCVXRQ","schema_version":"1.0","canonical_sha256":"c9c62ade302de431c703df87636f612b7bc198ff6a237fab297a7548df87e660","source":{"kind":"arxiv","id":"2606.11773","version":1},"attestation_state":"computed","paper":{"title":"Last-Iterate Convergence of Optimistic Multiplicative Weight Update","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Francesco Orabona","submitted_at":"2026-06-10T07:57:32Z","abstract_excerpt":"Optimistic Gradient Descent Ascent (OGDA) and Optimistic Multiplicative-Weights Update (OMWU) are two very popular algorithms to solve convex/concave saddle-point problems, where OMWU is the non-Euclidean, entropic version of OGDA. It is known since the '80s that the last iterate of OGDA asymptotically converges to a saddle point in smooth problems. On the other hand, it is unknown if OMWU has the same property. In this paper, I show that OMWU converges asymptotically for smooth convex-concave saddle-point problems, with a small enough constant learning rate. The result does not require unique"},"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":"2606.11773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-10T07:57:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ce7d39385d141a36f97be0688b5352fcd937a1fbb97d860fe828899e3753157c","abstract_canon_sha256":"c01ee9c34800117d2c6fc2390e28263e768fa02b165d499c75cef06cef61eaf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:07.151307Z","signature_b64":"YfZsvriVcq4dgGOnuBJrsSB+G5tNBXZykyZqODxQnatsW1Z0Lk4FAhZ6MIscaf7wNy1Doc1qGcyGnmhH8U+9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9c62ade302de431c703df87636f612b7bc198ff6a237fab297a7548df87e660","last_reissued_at":"2026-06-11T01:10:07.150493Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:07.150493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Last-Iterate Convergence of Optimistic Multiplicative Weight Update","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Francesco Orabona","submitted_at":"2026-06-10T07:57:32Z","abstract_excerpt":"Optimistic Gradient Descent Ascent (OGDA) and Optimistic Multiplicative-Weights Update (OMWU) are two very popular algorithms to solve convex/concave saddle-point problems, where OMWU is the non-Euclidean, entropic version of OGDA. It is known since the '80s that the last iterate of OGDA asymptotically converges to a saddle point in smooth problems. On the other hand, it is unknown if OMWU has the same property. In this paper, I show that OMWU converges asymptotically for smooth convex-concave saddle-point problems, with a small enough constant learning rate. The result does not require unique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11773","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/2606.11773/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":"2606.11773","created_at":"2026-06-11T01:10:07.150631+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11773v1","created_at":"2026-06-11T01:10:07.150631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11773","created_at":"2026-06-11T01:10:07.150631+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHDCVXRQFXSD","created_at":"2026-06-11T01:10:07.150631+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHDCVXRQFXSDDRYD","created_at":"2026-06-11T01:10:07.150631+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHDCVXRQ","created_at":"2026-06-11T01:10:07.150631+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/ZHDCVXRQFXSDDRYD36DWG33BFN","json":"https://pith.science/pith/ZHDCVXRQFXSDDRYD36DWG33BFN.json","graph_json":"https://pith.science/api/pith-number/ZHDCVXRQFXSDDRYD36DWG33BFN/graph.json","events_json":"https://pith.science/api/pith-number/ZHDCVXRQFXSDDRYD36DWG33BFN/events.json","paper":"https://pith.science/paper/ZHDCVXRQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZHDCVXRQFXSDDRYD36DWG33BFN","download_json":"https://pith.science/pith/ZHDCVXRQFXSDDRYD36DWG33BFN.json","view_paper":"https://pith.science/paper/ZHDCVXRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11773&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHDCVXRQFXSDDRYD36DWG33BFN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHDCVXRQFXSDDRYD36DWG33BFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHDCVXRQFXSDDRYD36DWG33BFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHDCVXRQFXSDDRYD36DWG33BFN/action/storage_attestation","attest_author":"https://pith.science/pith/ZHDCVXRQFXSDDRYD36DWG33BFN/action/author_attestation","sign_citation":"https://pith.science/pith/ZHDCVXRQFXSDDRYD36DWG33BFN/action/citation_signature","submit_replication":"https://pith.science/pith/ZHDCVXRQFXSDDRYD36DWG33BFN/action/replication_record"}},"created_at":"2026-06-11T01:10:07.150631+00:00","updated_at":"2026-06-11T01:10:07.150631+00:00"}