{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UPDLCFEHQW73RJLJAB4KHXFBE5","short_pith_number":"pith:UPDLCFEH","schema_version":"1.0","canonical_sha256":"a3c6b1148785bfb8a5690078a3dca1275a5344bd6d81ea8e4325f5bcc73a1aa1","source":{"kind":"arxiv","id":"1807.10455","version":3},"attestation_state":"computed","paper":{"title":"Acceleration through Optimistic No-Regret Dynamics","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","submitted_at":"2018-07-27T06:51:04Z","abstract_excerpt":"We consider the problem of minimizing a smooth convex function by reducing the optimization to computing the Nash equilibrium of a particular zero-sum convex-concave game. Zero-sum games can be solved using online learning dynamics, where a classical technique involves simulating two no-regret algorithms that play against each other and, after $T$ rounds, the average iterate is guaranteed to solve the original optimization problem with error decaying as $O(\\log T/T)$. In this paper we show that the technique can be enhanced to a rate of $O(1/T^2)$ by extending recent work \\cite{RS13,SALS15} 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":"1807.10455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-27T06:51:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eb7b6c5c8399b67ba75d5ae08fa2acbc1f06fd14d910f875160f73c8cc02a2ed","abstract_canon_sha256":"83d21445e679b85879005b16a92ebe1265626f5250f2cfef740cd928d252bec2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:39.363982Z","signature_b64":"jn0ifacoQcAD/VHof7YGFRpy4cOumb+d0r2Gb0bIvreYQubTHrNJE6PEkmq3P+Ws6+RdOJ0z9Jdd0m8kWiFgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3c6b1148785bfb8a5690078a3dca1275a5344bd6d81ea8e4325f5bcc73a1aa1","last_reissued_at":"2026-05-18T00:00:39.363512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:39.363512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Acceleration through Optimistic No-Regret Dynamics","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","submitted_at":"2018-07-27T06:51:04Z","abstract_excerpt":"We consider the problem of minimizing a smooth convex function by reducing the optimization to computing the Nash equilibrium of a particular zero-sum convex-concave game. Zero-sum games can be solved using online learning dynamics, where a classical technique involves simulating two no-regret algorithms that play against each other and, after $T$ rounds, the average iterate is guaranteed to solve the original optimization problem with error decaying as $O(\\log T/T)$. In this paper we show that the technique can be enhanced to a rate of $O(1/T^2)$ by extending recent work \\cite{RS13,SALS15} th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10455","kind":"arxiv","version":3},"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":"1807.10455","created_at":"2026-05-18T00:00:39.363592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10455v3","created_at":"2026-05-18T00:00:39.363592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10455","created_at":"2026-05-18T00:00:39.363592+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPDLCFEHQW73","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPDLCFEHQW73RJLJ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPDLCFEH","created_at":"2026-05-18T12:32:56.356000+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/UPDLCFEHQW73RJLJAB4KHXFBE5","json":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5.json","graph_json":"https://pith.science/api/pith-number/UPDLCFEHQW73RJLJAB4KHXFBE5/graph.json","events_json":"https://pith.science/api/pith-number/UPDLCFEHQW73RJLJAB4KHXFBE5/events.json","paper":"https://pith.science/paper/UPDLCFEH"},"agent_actions":{"view_html":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5","download_json":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5.json","view_paper":"https://pith.science/paper/UPDLCFEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10455&json=true","fetch_graph":"https://pith.science/api/pith-number/UPDLCFEHQW73RJLJAB4KHXFBE5/graph.json","fetch_events":"https://pith.science/api/pith-number/UPDLCFEHQW73RJLJAB4KHXFBE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5/action/storage_attestation","attest_author":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5/action/author_attestation","sign_citation":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5/action/citation_signature","submit_replication":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5/action/replication_record"}},"created_at":"2026-05-18T00:00:39.363592+00:00","updated_at":"2026-05-18T00:00:39.363592+00:00"}