{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JTC76LYQES27ZJUQFPF6X3KSQ4","short_pith_number":"pith:JTC76LYQ","schema_version":"1.0","canonical_sha256":"4cc5ff2f1024b5fca6902bcbebed52871ae3f9a9e543da567801a61df866feac","source":{"kind":"arxiv","id":"1306.4653","version":4},"attestation_state":"computed","paper":{"title":"Multiarmed Bandits With Limited Expert Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Satyen Kale","submitted_at":"2013-06-19T19:25:51Z","abstract_excerpt":"We solve the COLT 2013 open problem of \\citet{SCB} on minimizing regret in the setting of advice-efficient multiarmed bandits with expert advice. We give an algorithm for the setting of K arms and N experts out of which we are allowed to query and use only M experts' advices in each round, which has a regret bound of \\tilde{O}\\bigP{\\sqrt{\\frac{\\min\\{K, M\\} N}{M} T}} after T rounds. We also prove that any algorithm for this problem must have expected regret at least \\tilde{\\Omega}\\bigP{\\sqrt{\\frac{\\min\\{K, M\\} N}{M}T}}, thus showing that our upper bound is nearly tight."},"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":"1306.4653","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-06-19T19:25:51Z","cross_cats_sorted":[],"title_canon_sha256":"691c22f9f65a3cf84a06923e0492e9e003d7d4e7383cd67f69b7a4867d68eda2","abstract_canon_sha256":"9d672e0ed0d9aa8220865e85aa451e00ca1f1ae5b439d32e89b39d33223c6b24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:03.878676Z","signature_b64":"oeGRfqUJX7K9bJEamzAbGrrYAnXMhFurdprOYdAETR+w9k3fIhZGWkOBAl0dzV4iV2SL77ll+h+indAyDi28Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cc5ff2f1024b5fca6902bcbebed52871ae3f9a9e543da567801a61df866feac","last_reissued_at":"2026-05-18T03:19:03.877993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:03.877993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiarmed Bandits With Limited Expert Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Satyen Kale","submitted_at":"2013-06-19T19:25:51Z","abstract_excerpt":"We solve the COLT 2013 open problem of \\citet{SCB} on minimizing regret in the setting of advice-efficient multiarmed bandits with expert advice. We give an algorithm for the setting of K arms and N experts out of which we are allowed to query and use only M experts' advices in each round, which has a regret bound of \\tilde{O}\\bigP{\\sqrt{\\frac{\\min\\{K, M\\} N}{M} T}} after T rounds. We also prove that any algorithm for this problem must have expected regret at least \\tilde{\\Omega}\\bigP{\\sqrt{\\frac{\\min\\{K, M\\} N}{M}T}}, thus showing that our upper bound is nearly tight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4653","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":"1306.4653","created_at":"2026-05-18T03:19:03.878102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4653v4","created_at":"2026-05-18T03:19:03.878102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4653","created_at":"2026-05-18T03:19:03.878102+00:00"},{"alias_kind":"pith_short_12","alias_value":"JTC76LYQES27","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JTC76LYQES27ZJUQ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JTC76LYQ","created_at":"2026-05-18T12:27:49.015174+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/JTC76LYQES27ZJUQFPF6X3KSQ4","json":"https://pith.science/pith/JTC76LYQES27ZJUQFPF6X3KSQ4.json","graph_json":"https://pith.science/api/pith-number/JTC76LYQES27ZJUQFPF6X3KSQ4/graph.json","events_json":"https://pith.science/api/pith-number/JTC76LYQES27ZJUQFPF6X3KSQ4/events.json","paper":"https://pith.science/paper/JTC76LYQ"},"agent_actions":{"view_html":"https://pith.science/pith/JTC76LYQES27ZJUQFPF6X3KSQ4","download_json":"https://pith.science/pith/JTC76LYQES27ZJUQFPF6X3KSQ4.json","view_paper":"https://pith.science/paper/JTC76LYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4653&json=true","fetch_graph":"https://pith.science/api/pith-number/JTC76LYQES27ZJUQFPF6X3KSQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/JTC76LYQES27ZJUQFPF6X3KSQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JTC76LYQES27ZJUQFPF6X3KSQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JTC76LYQES27ZJUQFPF6X3KSQ4/action/storage_attestation","attest_author":"https://pith.science/pith/JTC76LYQES27ZJUQFPF6X3KSQ4/action/author_attestation","sign_citation":"https://pith.science/pith/JTC76LYQES27ZJUQFPF6X3KSQ4/action/citation_signature","submit_replication":"https://pith.science/pith/JTC76LYQES27ZJUQFPF6X3KSQ4/action/replication_record"}},"created_at":"2026-05-18T03:19:03.878102+00:00","updated_at":"2026-05-18T03:19:03.878102+00:00"}