{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XAR22ZN4H6VQDX42SEPQRA3ZOJ","short_pith_number":"pith:XAR22ZN4","schema_version":"1.0","canonical_sha256":"b823ad65bc3fab01df9a911f088379724bdb44bf6cf38eea804f00eec6a10768","source":{"kind":"arxiv","id":"2306.07905","version":2},"attestation_state":"computed","paper":{"title":"Omega: Optimistic EMA Gradients","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gauthier Gidel, Juan Ramirez, Quentin Bertrand, Rohan Sukumaran","submitted_at":"2023-06-13T16:56:13Z","abstract_excerpt":"Stochastic min-max optimization has gained interest in the machine learning community with the advancements in GANs and adversarial training. Although game optimization is fairly well understood in the deterministic setting, some issues persist in the stochastic regime. Recent work has shown that stochastic gradient descent-ascent methods such as the optimistic gradient are highly sensitive to noise or can fail to converge. Although alternative strategies exist, they can be prohibitively expensive. We introduce Omega, a method with optimistic-like updates that mitigates the impact of noise by "},"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":"2306.07905","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-13T16:56:13Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"eff1a8fcd55db72cafdb9b3f882bff1d36c2c8be082179bea730d31bdb7ab90e","abstract_canon_sha256":"9574fce6a1765276dfc68a674790963d04baa803c23977274fb2b562c2f49498"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:00:34.015495Z","signature_b64":"yk+iDMCSR/UsrnkSfk2oZLySA8FsfrAgC8c/RpFv1sUHShla9bNr3p0Kl2rN/frI0jcoJN3Zj0fhX7ADgg7HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b823ad65bc3fab01df9a911f088379724bdb44bf6cf38eea804f00eec6a10768","last_reissued_at":"2026-07-05T08:00:34.014934Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:00:34.014934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Omega: Optimistic EMA Gradients","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gauthier Gidel, Juan Ramirez, Quentin Bertrand, Rohan Sukumaran","submitted_at":"2023-06-13T16:56:13Z","abstract_excerpt":"Stochastic min-max optimization has gained interest in the machine learning community with the advancements in GANs and adversarial training. Although game optimization is fairly well understood in the deterministic setting, some issues persist in the stochastic regime. Recent work has shown that stochastic gradient descent-ascent methods such as the optimistic gradient are highly sensitive to noise or can fail to converge. Although alternative strategies exist, they can be prohibitively expensive. We introduce Omega, a method with optimistic-like updates that mitigates the impact of noise by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07905","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/2306.07905/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":"2306.07905","created_at":"2026-07-05T08:00:34.014994+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.07905v2","created_at":"2026-07-05T08:00:34.014994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07905","created_at":"2026-07-05T08:00:34.014994+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAR22ZN4H6VQ","created_at":"2026-07-05T08:00:34.014994+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAR22ZN4H6VQDX42","created_at":"2026-07-05T08:00:34.014994+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAR22ZN4","created_at":"2026-07-05T08:00:34.014994+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/XAR22ZN4H6VQDX42SEPQRA3ZOJ","json":"https://pith.science/pith/XAR22ZN4H6VQDX42SEPQRA3ZOJ.json","graph_json":"https://pith.science/api/pith-number/XAR22ZN4H6VQDX42SEPQRA3ZOJ/graph.json","events_json":"https://pith.science/api/pith-number/XAR22ZN4H6VQDX42SEPQRA3ZOJ/events.json","paper":"https://pith.science/paper/XAR22ZN4"},"agent_actions":{"view_html":"https://pith.science/pith/XAR22ZN4H6VQDX42SEPQRA3ZOJ","download_json":"https://pith.science/pith/XAR22ZN4H6VQDX42SEPQRA3ZOJ.json","view_paper":"https://pith.science/paper/XAR22ZN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.07905&json=true","fetch_graph":"https://pith.science/api/pith-number/XAR22ZN4H6VQDX42SEPQRA3ZOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XAR22ZN4H6VQDX42SEPQRA3ZOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAR22ZN4H6VQDX42SEPQRA3ZOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAR22ZN4H6VQDX42SEPQRA3ZOJ/action/storage_attestation","attest_author":"https://pith.science/pith/XAR22ZN4H6VQDX42SEPQRA3ZOJ/action/author_attestation","sign_citation":"https://pith.science/pith/XAR22ZN4H6VQDX42SEPQRA3ZOJ/action/citation_signature","submit_replication":"https://pith.science/pith/XAR22ZN4H6VQDX42SEPQRA3ZOJ/action/replication_record"}},"created_at":"2026-07-05T08:00:34.014994+00:00","updated_at":"2026-07-05T08:00:34.014994+00:00"}