{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R4QBFQ4K26APTBRPSAGQTWKRM6","short_pith_number":"pith:R4QBFQ4K","canonical_record":{"source":{"id":"1805.06792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-17T14:16:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"406a831ec0d252ca350936c4018a8908778b6537dbe917954749c6c3667793ca","abstract_canon_sha256":"f0051bf7ed23bd821abfdf265980362e629ccc60d17f2dfaa9ee784e8185fc26"},"schema_version":"1.0"},"canonical_sha256":"8f2012c38ad780f9862f900d09d95167bcf05d4f97a7b6de09ab4b814dff6243","source":{"kind":"arxiv","id":"1805.06792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06792","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06792v1","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06792","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"R4QBFQ4K26AP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R4QBFQ4K26APTBRP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R4QBFQ4K","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R4QBFQ4K26APTBRPSAGQTWKRM6","target":"record","payload":{"canonical_record":{"source":{"id":"1805.06792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-17T14:16:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"406a831ec0d252ca350936c4018a8908778b6537dbe917954749c6c3667793ca","abstract_canon_sha256":"f0051bf7ed23bd821abfdf265980362e629ccc60d17f2dfaa9ee784e8185fc26"},"schema_version":"1.0"},"canonical_sha256":"8f2012c38ad780f9862f900d09d95167bcf05d4f97a7b6de09ab4b814dff6243","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:43.337779Z","signature_b64":"z+XYzKQ0DJ0f22CsgSyayGd7OO73r+s6Hlf++b/Z7e++Y6LS5IEk1l99Lg2xZjboNvAVHHb+Z8vDutHbIwMSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f2012c38ad780f9862f900d09d95167bcf05d4f97a7b6de09ab4b814dff6243","last_reissued_at":"2026-05-18T00:15:43.337179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:43.337179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.06792","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cRtcT5ESJ/wVBPmh19L7oEx1mm49fCDFLT6lONcq/ACicrMzKCpoJ8gnp9I494ZnoD027ezrZSf5li3V/xARCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:29:16.710263Z"},"content_sha256":"a7cb3721be74afbe6c63499cf285805bfab773f6fe4e897c553c79f50639ab45","schema_version":"1.0","event_id":"sha256:a7cb3721be74afbe6c63499cf285805bfab773f6fe4e897c553c79f50639ab45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R4QBFQ4K26APTBRPSAGQTWKRM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Rates for Convex-Concave Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jacob Abernethy, Jun-Kun Wang, Kevin A. Lai, Kfir Y. Levy","submitted_at":"2018-05-17T14:16:54Z","abstract_excerpt":"We consider the use of no-regret algorithms to compute equilibria for particular classes of convex-concave games. While standard regret bounds would lead to convergence rates on the order of $O(T^{-1/2})$, recent work \\citep{RS13,SALS15} has established $O(1/T)$ rates by taking advantage of a particular class of optimistic prediction algorithms. In this work we go further, showing that for a particular class of games one achieves a $O(1/T^2)$ rate, and we show how this applies to the Frank-Wolfe method and recovers a similar bound \\citep{D15}. We also show that such no-regret techniques can ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06792","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oqU+NT0oOOLJ9glgQTuesSt72coIEtAlgR94Azbq1COp3hnXvHJy/ZygTGIIAtWYj/yduGWXj90RazB+5/BODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:29:16.710640Z"},"content_sha256":"28df8ed672ad48c0c903bbadfc4a933f631fae90e6d09ae99f9f8554f67e09a8","schema_version":"1.0","event_id":"sha256:28df8ed672ad48c0c903bbadfc4a933f631fae90e6d09ae99f9f8554f67e09a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R4QBFQ4K26APTBRPSAGQTWKRM6/bundle.json","state_url":"https://pith.science/pith/R4QBFQ4K26APTBRPSAGQTWKRM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R4QBFQ4K26APTBRPSAGQTWKRM6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T05:29:16Z","links":{"resolver":"https://pith.science/pith/R4QBFQ4K26APTBRPSAGQTWKRM6","bundle":"https://pith.science/pith/R4QBFQ4K26APTBRPSAGQTWKRM6/bundle.json","state":"https://pith.science/pith/R4QBFQ4K26APTBRPSAGQTWKRM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R4QBFQ4K26APTBRPSAGQTWKRM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R4QBFQ4K26APTBRPSAGQTWKRM6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f0051bf7ed23bd821abfdf265980362e629ccc60d17f2dfaa9ee784e8185fc26","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-17T14:16:54Z","title_canon_sha256":"406a831ec0d252ca350936c4018a8908778b6537dbe917954749c6c3667793ca"},"schema_version":"1.0","source":{"id":"1805.06792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06792","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06792v1","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06792","created_at":"2026-05-18T00:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"R4QBFQ4K26AP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R4QBFQ4K26APTBRP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R4QBFQ4K","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:28df8ed672ad48c0c903bbadfc4a933f631fae90e6d09ae99f9f8554f67e09a8","target":"graph","created_at":"2026-05-18T00:15:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider the use of no-regret algorithms to compute equilibria for particular classes of convex-concave games. While standard regret bounds would lead to convergence rates on the order of $O(T^{-1/2})$, recent work \\citep{RS13,SALS15} has established $O(1/T)$ rates by taking advantage of a particular class of optimistic prediction algorithms. In this work we go further, showing that for a particular class of games one achieves a $O(1/T^2)$ rate, and we show how this applies to the Frank-Wolfe method and recovers a similar bound \\citep{D15}. We also show that such no-regret techniques can ev","authors_text":"Jacob Abernethy, Jun-Kun Wang, Kevin A. Lai, Kfir Y. Levy","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-17T14:16:54Z","title":"Faster Rates for Convex-Concave Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06792","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a7cb3721be74afbe6c63499cf285805bfab773f6fe4e897c553c79f50639ab45","target":"record","created_at":"2026-05-18T00:15:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f0051bf7ed23bd821abfdf265980362e629ccc60d17f2dfaa9ee784e8185fc26","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-17T14:16:54Z","title_canon_sha256":"406a831ec0d252ca350936c4018a8908778b6537dbe917954749c6c3667793ca"},"schema_version":"1.0","source":{"id":"1805.06792","kind":"arxiv","version":1}},"canonical_sha256":"8f2012c38ad780f9862f900d09d95167bcf05d4f97a7b6de09ab4b814dff6243","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f2012c38ad780f9862f900d09d95167bcf05d4f97a7b6de09ab4b814dff6243","first_computed_at":"2026-05-18T00:15:43.337179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:43.337179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z+XYzKQ0DJ0f22CsgSyayGd7OO73r+s6Hlf++b/Z7e++Y6LS5IEk1l99Lg2xZjboNvAVHHb+Z8vDutHbIwMSDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:43.337779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7cb3721be74afbe6c63499cf285805bfab773f6fe4e897c553c79f50639ab45","sha256:28df8ed672ad48c0c903bbadfc4a933f631fae90e6d09ae99f9f8554f67e09a8"],"state_sha256":"77280a285fe8fe3a724729ae6f3d9efcb763786b48905dab43582473757e73b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9npoYUrDs+VuebWqa9EJY5QgPRjQO+3jLvNz7PFOhNI3r1/FTe2DJI71sof0sfOWs6PnHrvUq4mT5DsV/qwmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:29:16.712632Z","bundle_sha256":"a7285849ca7b41527d3953985990562f92c6224b5c67e199ead41a2c1779d65f"}}