{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UVJFY4EOJ2KC3U3ZKEB5KDQV5P","short_pith_number":"pith:UVJFY4EO","schema_version":"1.0","canonical_sha256":"a5525c708e4e942dd3795103d50e15ebe0848ecfd54c41794934cc59d5950451","source":{"kind":"arxiv","id":"1504.02089","version":4},"attestation_state":"computed","paper":{"title":"The Computational Power of Optimization in Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Tomer Koren","submitted_at":"2015-04-08T19:54:27Z","abstract_excerpt":"We consider the fundamental problem of prediction with expert advice where the experts are \"optimizable\": there is a black-box optimization oracle that can be used to compute, in constant time, the leading expert in retrospect at any point in time. In this setting, we give a novel online algorithm that attains vanishing regret with respect to $N$ experts in total $\\widetilde{O}(\\sqrt{N})$ computation time. We also give a lower bound showing that this running time cannot be improved (up to log factors) in the oracle model, thereby exhibiting a quadratic speedup as compared to the standard, orac"},"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":"1504.02089","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-08T19:54:27Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b84ecd48117d08d5032bd667ac51267305ad90d55d9866b773844c1cb677f0ed","abstract_canon_sha256":"079c051a09d20dece5ab56d3154c8a0d3aedd351f17425e45656a77b10f65365"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:49.177789Z","signature_b64":"JcSpmNuQpoSf1Sb+o3+31q0JboMqiGNPObGGtwe7OpNpKEWnuPfNdOFL1naSck3lgiW++eFqq+zn6joESJD+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5525c708e4e942dd3795103d50e15ebe0848ecfd54c41794934cc59d5950451","last_reissued_at":"2026-05-18T01:21:49.177261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:49.177261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computational Power of Optimization in Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Tomer Koren","submitted_at":"2015-04-08T19:54:27Z","abstract_excerpt":"We consider the fundamental problem of prediction with expert advice where the experts are \"optimizable\": there is a black-box optimization oracle that can be used to compute, in constant time, the leading expert in retrospect at any point in time. In this setting, we give a novel online algorithm that attains vanishing regret with respect to $N$ experts in total $\\widetilde{O}(\\sqrt{N})$ computation time. We also give a lower bound showing that this running time cannot be improved (up to log factors) in the oracle model, thereby exhibiting a quadratic speedup as compared to the standard, orac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02089","kind":"arxiv","version":4},"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":"1504.02089","created_at":"2026-05-18T01:21:49.177350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02089v4","created_at":"2026-05-18T01:21:49.177350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02089","created_at":"2026-05-18T01:21:49.177350+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVJFY4EOJ2KC","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVJFY4EOJ2KC3U3Z","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVJFY4EO","created_at":"2026-05-18T12:29:44.643036+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/UVJFY4EOJ2KC3U3ZKEB5KDQV5P","json":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P.json","graph_json":"https://pith.science/api/pith-number/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/graph.json","events_json":"https://pith.science/api/pith-number/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/events.json","paper":"https://pith.science/paper/UVJFY4EO"},"agent_actions":{"view_html":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P","download_json":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P.json","view_paper":"https://pith.science/paper/UVJFY4EO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02089&json=true","fetch_graph":"https://pith.science/api/pith-number/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/graph.json","fetch_events":"https://pith.science/api/pith-number/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/action/storage_attestation","attest_author":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/action/author_attestation","sign_citation":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/action/citation_signature","submit_replication":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/action/replication_record"}},"created_at":"2026-05-18T01:21:49.177350+00:00","updated_at":"2026-05-18T01:21:49.177350+00:00"}