{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MTYLL5YGHOHA5IYGE7CAFVGZWO","short_pith_number":"pith:MTYLL5YG","schema_version":"1.0","canonical_sha256":"64f0b5f7063b8e0ea30627c402d4d9b3879ee781b2fb93b89ee3f4d8f7b44946","source":{"kind":"arxiv","id":"1702.07539","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds for Bandit Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alon Cohen, Tamir Hazan, Tomer Koren","submitted_at":"2017-02-24T11:17:33Z","abstract_excerpt":"We revisit the study of optimal regret rates in bandit combinatorial optimization---a fundamental framework for sequential decision making under uncertainty that abstracts numerous combinatorial prediction problems. We prove that the attainable regret in this setting grows as $\\widetilde{\\Theta}(k^{3/2}\\sqrt{dT})$ where $d$ is the dimension of the problem and $k$ is a bound over the maximal instantaneous loss, disproving a conjecture of Audibert, Bubeck, and Lugosi (2013) who argued that the optimal rate should be of the form $\\widetilde{\\Theta}(k\\sqrt{dT})$. Our bounds apply to several import"},"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":"1702.07539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-24T11:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"49511d19b799564cb6b87279e8a432226b0352652cca75053372434077f0ef26","abstract_canon_sha256":"052e41fa45e9995657fd5034f4e8594df1f37ebe11d3d47828b68f118b8c9779"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.979328Z","signature_b64":"b1z0ieXD1/abRgGNnbFHREIDU8tymhApBFLAjtWWf+Ft49XhHhkbriAb9nm6yf7+iiHulFp2Zo6567zOY4EeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64f0b5f7063b8e0ea30627c402d4d9b3879ee781b2fb93b89ee3f4d8f7b44946","last_reissued_at":"2026-05-18T00:50:02.978380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.978380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Bandit Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alon Cohen, Tamir Hazan, Tomer Koren","submitted_at":"2017-02-24T11:17:33Z","abstract_excerpt":"We revisit the study of optimal regret rates in bandit combinatorial optimization---a fundamental framework for sequential decision making under uncertainty that abstracts numerous combinatorial prediction problems. We prove that the attainable regret in this setting grows as $\\widetilde{\\Theta}(k^{3/2}\\sqrt{dT})$ where $d$ is the dimension of the problem and $k$ is a bound over the maximal instantaneous loss, disproving a conjecture of Audibert, Bubeck, and Lugosi (2013) who argued that the optimal rate should be of the form $\\widetilde{\\Theta}(k\\sqrt{dT})$. Our bounds apply to several import"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07539","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":"1702.07539","created_at":"2026-05-18T00:50:02.978555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07539v1","created_at":"2026-05-18T00:50:02.978555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07539","created_at":"2026-05-18T00:50:02.978555+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTYLL5YGHOHA","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTYLL5YGHOHA5IYG","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTYLL5YG","created_at":"2026-05-18T12:31:31.346846+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/MTYLL5YGHOHA5IYGE7CAFVGZWO","json":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO.json","graph_json":"https://pith.science/api/pith-number/MTYLL5YGHOHA5IYGE7CAFVGZWO/graph.json","events_json":"https://pith.science/api/pith-number/MTYLL5YGHOHA5IYGE7CAFVGZWO/events.json","paper":"https://pith.science/paper/MTYLL5YG"},"agent_actions":{"view_html":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO","download_json":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO.json","view_paper":"https://pith.science/paper/MTYLL5YG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07539&json=true","fetch_graph":"https://pith.science/api/pith-number/MTYLL5YGHOHA5IYGE7CAFVGZWO/graph.json","fetch_events":"https://pith.science/api/pith-number/MTYLL5YGHOHA5IYGE7CAFVGZWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO/action/storage_attestation","attest_author":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO/action/author_attestation","sign_citation":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO/action/citation_signature","submit_replication":"https://pith.science/pith/MTYLL5YGHOHA5IYGE7CAFVGZWO/action/replication_record"}},"created_at":"2026-05-18T00:50:02.978555+00:00","updated_at":"2026-05-18T00:50:02.978555+00:00"}