{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TETIELRWFYU6M7PPPSZ5OACJ4E","short_pith_number":"pith:TETIELRW","schema_version":"1.0","canonical_sha256":"9926822e362e29e67def7cb3d70049e1330211da5b7b534e3fe6adf182e9a4c7","source":{"kind":"arxiv","id":"1902.04982","version":1},"attestation_state":"computed","paper":{"title":"Stable-Predictive Optimistic Counterfactual Regret Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.OC","stat.ML"],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Gabriele Farina, Noam Brown, Tuomas Sandholm","submitted_at":"2019-02-13T16:18:21Z","abstract_excerpt":"The CFR framework has been a powerful tool for solving large-scale extensive-form games in practice. However, the theoretical rate at which past CFR-based algorithms converge to the Nash equilibrium is on the order of $O(T^{-1/2})$, where $T$ is the number of iterations. In contrast, first-order methods can be used to achieve a $O(T^{-1})$ dependence on iterations, yet these methods have been less successful in practice. In this work we present the first CFR variant that breaks the square-root dependence on iterations. By combining and extending recent advances on predictive and stable regret "},"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":"1902.04982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-13T16:18:21Z","cross_cats_sorted":["cs.AI","cs.LG","math.OC","stat.ML"],"title_canon_sha256":"de1d5db7d993ce81306c18bd04baf6569f393bebcdffda6aca44632b4eda483f","abstract_canon_sha256":"9739ea985625448bef1dd7ac40e28a68499a90a953db6f51226e8dd56f6a892e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:03.743799Z","signature_b64":"+PIc3TfuBqA2uaTjPjLyCuVOHgRYQMxCaZfqscbxKHzc5c5FGnIa+8fPcGAVfwNciaAR09y4kGsXpksUhiMEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9926822e362e29e67def7cb3d70049e1330211da5b7b534e3fe6adf182e9a4c7","last_reissued_at":"2026-05-17T23:54:03.743246Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:03.743246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stable-Predictive Optimistic Counterfactual Regret Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.OC","stat.ML"],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Gabriele Farina, Noam Brown, Tuomas Sandholm","submitted_at":"2019-02-13T16:18:21Z","abstract_excerpt":"The CFR framework has been a powerful tool for solving large-scale extensive-form games in practice. However, the theoretical rate at which past CFR-based algorithms converge to the Nash equilibrium is on the order of $O(T^{-1/2})$, where $T$ is the number of iterations. In contrast, first-order methods can be used to achieve a $O(T^{-1})$ dependence on iterations, yet these methods have been less successful in practice. In this work we present the first CFR variant that breaks the square-root dependence on iterations. By combining and extending recent advances on predictive and stable regret "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04982","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":"1902.04982","created_at":"2026-05-17T23:54:03.743326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04982v1","created_at":"2026-05-17T23:54:03.743326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04982","created_at":"2026-05-17T23:54:03.743326+00:00"},{"alias_kind":"pith_short_12","alias_value":"TETIELRWFYU6","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"TETIELRWFYU6M7PP","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"TETIELRW","created_at":"2026-05-18T12:33:27.125529+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/TETIELRWFYU6M7PPPSZ5OACJ4E","json":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E.json","graph_json":"https://pith.science/api/pith-number/TETIELRWFYU6M7PPPSZ5OACJ4E/graph.json","events_json":"https://pith.science/api/pith-number/TETIELRWFYU6M7PPPSZ5OACJ4E/events.json","paper":"https://pith.science/paper/TETIELRW"},"agent_actions":{"view_html":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E","download_json":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E.json","view_paper":"https://pith.science/paper/TETIELRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04982&json=true","fetch_graph":"https://pith.science/api/pith-number/TETIELRWFYU6M7PPPSZ5OACJ4E/graph.json","fetch_events":"https://pith.science/api/pith-number/TETIELRWFYU6M7PPPSZ5OACJ4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E/action/storage_attestation","attest_author":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E/action/author_attestation","sign_citation":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E/action/citation_signature","submit_replication":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E/action/replication_record"}},"created_at":"2026-05-17T23:54:03.743326+00:00","updated_at":"2026-05-17T23:54:03.743326+00:00"}