{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TPUJAOHVPZOXXHBUJSI6V2DS5K","short_pith_number":"pith:TPUJAOHV","schema_version":"1.0","canonical_sha256":"9be89038f57e5d7b9c344c91eae872eab2d38b355e7ea0a4018ea21de7d33f69","source":{"kind":"arxiv","id":"1907.04392","version":1},"attestation_state":"computed","paper":{"title":"Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-Ascent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.OC"],"primary_cat":"cs.GT","authors_text":"Gauthier Gidel, Georgios Piliouras, James P. Bailey","submitted_at":"2019-07-09T20:20:06Z","abstract_excerpt":"Gradient descent is arguably one of the most popular online optimization methods with a wide array of applications. However, the standard implementation where agents simultaneously update their strategies yields several undesirable properties; strategies diverge away from equilibrium and regret grows over time. In this paper, we eliminate these negative properties by introducing a different implementation to obtain finite regret via arbitrary fixed step-size. We obtain this surprising property by having agents take turns when updating their strategies. In this setting, we show that an agent th"},"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.04392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-09T20:20:06Z","cross_cats_sorted":["math.DS","math.OC"],"title_canon_sha256":"5c2977d4262c5651fc54007588d4651623b52cae024b378dee5163a300519bf2","abstract_canon_sha256":"e98ec9d1e184d0d886aab8ec63db0e3b791eb1c55af0af3930a1e6568330c10f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:01.884835Z","signature_b64":"CL7Nr0aC/bJei9cqIpeYe9ZUgAZ/R/qeskvcIRXVUhCQJxjLyuLZ96sgG2DGpv/W6/ApdNXS2dce3D3oecgUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9be89038f57e5d7b9c344c91eae872eab2d38b355e7ea0a4018ea21de7d33f69","last_reissued_at":"2026-05-17T23:41:01.884154Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:01.884154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-Ascent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.OC"],"primary_cat":"cs.GT","authors_text":"Gauthier Gidel, Georgios Piliouras, James P. Bailey","submitted_at":"2019-07-09T20:20:06Z","abstract_excerpt":"Gradient descent is arguably one of the most popular online optimization methods with a wide array of applications. However, the standard implementation where agents simultaneously update their strategies yields several undesirable properties; strategies diverge away from equilibrium and regret grows over time. In this paper, we eliminate these negative properties by introducing a different implementation to obtain finite regret via arbitrary fixed step-size. We obtain this surprising property by having agents take turns when updating their strategies. In this setting, we show that an agent th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04392","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.04392","created_at":"2026-05-17T23:41:01.884261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04392v1","created_at":"2026-05-17T23:41:01.884261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04392","created_at":"2026-05-17T23:41:01.884261+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPUJAOHVPZOX","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPUJAOHVPZOXXHBU","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPUJAOHV","created_at":"2026-05-18T12:33:30.264802+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/TPUJAOHVPZOXXHBUJSI6V2DS5K","json":"https://pith.science/pith/TPUJAOHVPZOXXHBUJSI6V2DS5K.json","graph_json":"https://pith.science/api/pith-number/TPUJAOHVPZOXXHBUJSI6V2DS5K/graph.json","events_json":"https://pith.science/api/pith-number/TPUJAOHVPZOXXHBUJSI6V2DS5K/events.json","paper":"https://pith.science/paper/TPUJAOHV"},"agent_actions":{"view_html":"https://pith.science/pith/TPUJAOHVPZOXXHBUJSI6V2DS5K","download_json":"https://pith.science/pith/TPUJAOHVPZOXXHBUJSI6V2DS5K.json","view_paper":"https://pith.science/paper/TPUJAOHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04392&json=true","fetch_graph":"https://pith.science/api/pith-number/TPUJAOHVPZOXXHBUJSI6V2DS5K/graph.json","fetch_events":"https://pith.science/api/pith-number/TPUJAOHVPZOXXHBUJSI6V2DS5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPUJAOHVPZOXXHBUJSI6V2DS5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPUJAOHVPZOXXHBUJSI6V2DS5K/action/storage_attestation","attest_author":"https://pith.science/pith/TPUJAOHVPZOXXHBUJSI6V2DS5K/action/author_attestation","sign_citation":"https://pith.science/pith/TPUJAOHVPZOXXHBUJSI6V2DS5K/action/citation_signature","submit_replication":"https://pith.science/pith/TPUJAOHVPZOXXHBUJSI6V2DS5K/action/replication_record"}},"created_at":"2026-05-17T23:41:01.884261+00:00","updated_at":"2026-05-17T23:41:01.884261+00:00"}