{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EAHDIPXEBQKHENNVMFDNJ6W7DH","short_pith_number":"pith:EAHDIPXE","schema_version":"1.0","canonical_sha256":"200e343ee40c147235b56146d4fadf19f7c0d1a1ab3d0a70716c30ae69b09626","source":{"kind":"arxiv","id":"1804.05929","version":1},"attestation_state":"computed","paper":{"title":"UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fang Liu, Ness Shroff, Sinong Wang, Swapna Buccapatnam","submitted_at":"2018-04-16T20:44:28Z","abstract_excerpt":"In this work, we address the open problem of finding low-complexity near-optimal multi-armed bandit algorithms for sequential decision making problems. Existing bandit algorithms are either sub-optimal and computationally simple (e.g., UCB1) or optimal and computationally complex (e.g., kl-UCB). We propose a boosting approach to Upper Confidence Bound based algorithms for stochastic bandits, that we call UCBoost. Specifically, we propose two types of UCBoost algorithms. We show that UCBoost($D$) enjoys $O(1)$ complexity for each arm per round as well as regret guarantee that is $1/e$-close to "},"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":"1804.05929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T20:44:28Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"3f0e591712354cb8d8edb253c9db244e9b0f6f3b0e9f94c87053b958a57653e2","abstract_canon_sha256":"4ab5d2f6c9cd15db8ffb8002dc6e27d603287114a1e73709a7aa77bfa718e984"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:22.323229Z","signature_b64":"vDTcbievhpZ2McEj5RoI26H/PkacimhOL1ZexFmfF21AMTSEpQ2uStabQHjv1yaAw0S+vG9F36WIyol7pcHzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"200e343ee40c147235b56146d4fadf19f7c0d1a1ab3d0a70716c30ae69b09626","last_reissued_at":"2026-05-18T00:18:22.322525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:22.322525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fang Liu, Ness Shroff, Sinong Wang, Swapna Buccapatnam","submitted_at":"2018-04-16T20:44:28Z","abstract_excerpt":"In this work, we address the open problem of finding low-complexity near-optimal multi-armed bandit algorithms for sequential decision making problems. Existing bandit algorithms are either sub-optimal and computationally simple (e.g., UCB1) or optimal and computationally complex (e.g., kl-UCB). We propose a boosting approach to Upper Confidence Bound based algorithms for stochastic bandits, that we call UCBoost. Specifically, we propose two types of UCBoost algorithms. We show that UCBoost($D$) enjoys $O(1)$ complexity for each arm per round as well as regret guarantee that is $1/e$-close to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05929","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":"1804.05929","created_at":"2026-05-18T00:18:22.322630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05929v1","created_at":"2026-05-18T00:18:22.322630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05929","created_at":"2026-05-18T00:18:22.322630+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAHDIPXEBQKH","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAHDIPXEBQKHENNV","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAHDIPXE","created_at":"2026-05-18T12:32:22.470017+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/EAHDIPXEBQKHENNVMFDNJ6W7DH","json":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH.json","graph_json":"https://pith.science/api/pith-number/EAHDIPXEBQKHENNVMFDNJ6W7DH/graph.json","events_json":"https://pith.science/api/pith-number/EAHDIPXEBQKHENNVMFDNJ6W7DH/events.json","paper":"https://pith.science/paper/EAHDIPXE"},"agent_actions":{"view_html":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH","download_json":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH.json","view_paper":"https://pith.science/paper/EAHDIPXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05929&json=true","fetch_graph":"https://pith.science/api/pith-number/EAHDIPXEBQKHENNVMFDNJ6W7DH/graph.json","fetch_events":"https://pith.science/api/pith-number/EAHDIPXEBQKHENNVMFDNJ6W7DH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH/action/storage_attestation","attest_author":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH/action/author_attestation","sign_citation":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH/action/citation_signature","submit_replication":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH/action/replication_record"}},"created_at":"2026-05-18T00:18:22.322630+00:00","updated_at":"2026-05-18T00:18:22.322630+00:00"}