{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U55U5U4ATVO2RHARZ73AF2ZWJA","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":"681f965f1e018a90f9c8ea25e690a05a07ac078e2f56431ef6799517f196f030","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-03T23:06:24Z","title_canon_sha256":"b78d796f3f30fa0f3d623c51ba8a0167bff248fe4faf9cd126deedcb8e360b5f"},"schema_version":"1.0","source":{"id":"1403.0628","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0628","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0628v2","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0628","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"U55U5U4ATVO2","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U55U5U4ATVO2RHAR","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U55U5U4A","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:07fae393ca1a71c206d2f8f1e812700c8e8583890f6aa4501f2905f3261e492c","target":"graph","created_at":"2026-05-18T02:51:24Z","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 study algorithms for online linear optimization in Hilbert spaces, focusing on the case where the player is unconstrained. We develop a novel characterization of a large class of minimax algorithms, recovering, and even improving, several previous results as immediate corollaries. Moreover, using our tools, we develop an algorithm that provides a regret bound of $\\mathcal{O}\\Big(U \\sqrt{T \\log(U \\sqrt{T} \\log^2 T +1)}\\Big)$, where $U$ is the $L_2$ norm of an arbitrary comparator and both $T$ and $U$ are unknown to the player. This bound is optimal up to $\\sqrt{\\log \\log T}$ terms. When $T$ ","authors_text":"Francesco Orabona, H. Brendan McMahan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-03T23:06:24Z","title":"Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0628","kind":"arxiv","version":2},"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:bb1f1e339e8d8436aa9e7a3cc2d2cfeba2ae29b2aa40ce5c167b64cc6eed1205","target":"record","created_at":"2026-05-18T02:51:24Z","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":"681f965f1e018a90f9c8ea25e690a05a07ac078e2f56431ef6799517f196f030","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-03T23:06:24Z","title_canon_sha256":"b78d796f3f30fa0f3d623c51ba8a0167bff248fe4faf9cd126deedcb8e360b5f"},"schema_version":"1.0","source":{"id":"1403.0628","kind":"arxiv","version":2}},"canonical_sha256":"a77b4ed3809d5da89c11cff602eb36483782ddd2220334724b8a67e450cc1f1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a77b4ed3809d5da89c11cff602eb36483782ddd2220334724b8a67e450cc1f1f","first_computed_at":"2026-05-18T02:51:24.015808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:24.015808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oy3nK05AsaNg7jfDOjUGXMRMKhFpbYUO/Zzjl6+ctBbS1o4dk1cKqnMA+QL18oDk5lUA3MBidBPeGVgYSuQlAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:24.016436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0628","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb1f1e339e8d8436aa9e7a3cc2d2cfeba2ae29b2aa40ce5c167b64cc6eed1205","sha256:07fae393ca1a71c206d2f8f1e812700c8e8583890f6aa4501f2905f3261e492c"],"state_sha256":"28478324e2aed06fadb9e34b82f36719e5f14e25a35ece26b05807fee4bd20a2"}