{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UEEIYZDP5FF2IRIDZKT3MI42WC","short_pith_number":"pith:UEEIYZDP","schema_version":"1.0","canonical_sha256":"a1088c646fe94ba44503caa7b6239ab08c76816cc743d8c4ea99aaebea40948b","source":{"kind":"arxiv","id":"1810.01187","version":4},"attestation_state":"computed","paper":{"title":"Thompson Sampling Algorithms for Cascading Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Vincent Y. F. Tan, Wang Chi Cheung, Zixin Zhong","submitted_at":"2018-10-02T11:55:54Z","abstract_excerpt":"Motivated by the pressing need for efficient optimization in online recommender systems, we revisit the cascading bandit model proposed by Kveton et al. (2015). While Thompson sampling (TS) algorithms have been shown to be empirically superior to Upper Confidence Bound (UCB) algorithms for cascading bandits, theoretical guarantees are only known for the latter. In this paper, we first provide a problem-dependent upper bound on the regret of a TS algorithm with Beta-Bernoulli updates; this upper bound is tighter than a recent derivation under a more general setting by Huyuk and Tekin (2019). Ne"},"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":"1810.01187","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-02T11:55:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"17b656ee685d7abeb476866094d8530c092be8671246654ae26b176823da4c2b","abstract_canon_sha256":"a75e4b105b2f8e685ce2fe818c62242b2cf6da45ec18318c7a61138771cdcafc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:40:24.858552Z","signature_b64":"5B2PXt6+OYq6b8Ak2oq/K3/w0QkBycAtQH6ZMT76Am4kXc/P5oLHorTgbZ9wpSct7mqObe2YaNK1G5Zj9KzJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1088c646fe94ba44503caa7b6239ab08c76816cc743d8c4ea99aaebea40948b","last_reissued_at":"2026-07-05T02:40:24.858151Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:40:24.858151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thompson Sampling Algorithms for Cascading Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Vincent Y. F. Tan, Wang Chi Cheung, Zixin Zhong","submitted_at":"2018-10-02T11:55:54Z","abstract_excerpt":"Motivated by the pressing need for efficient optimization in online recommender systems, we revisit the cascading bandit model proposed by Kveton et al. (2015). While Thompson sampling (TS) algorithms have been shown to be empirically superior to Upper Confidence Bound (UCB) algorithms for cascading bandits, theoretical guarantees are only known for the latter. In this paper, we first provide a problem-dependent upper bound on the regret of a TS algorithm with Beta-Bernoulli updates; this upper bound is tighter than a recent derivation under a more general setting by Huyuk and Tekin (2019). Ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01187","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.01187/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1810.01187","created_at":"2026-07-05T02:40:24.858215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01187v4","created_at":"2026-07-05T02:40:24.858215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01187","created_at":"2026-07-05T02:40:24.858215+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEEIYZDP5FF2","created_at":"2026-07-05T02:40:24.858215+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEEIYZDP5FF2IRID","created_at":"2026-07-05T02:40:24.858215+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEEIYZDP","created_at":"2026-07-05T02:40:24.858215+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/UEEIYZDP5FF2IRIDZKT3MI42WC","json":"https://pith.science/pith/UEEIYZDP5FF2IRIDZKT3MI42WC.json","graph_json":"https://pith.science/api/pith-number/UEEIYZDP5FF2IRIDZKT3MI42WC/graph.json","events_json":"https://pith.science/api/pith-number/UEEIYZDP5FF2IRIDZKT3MI42WC/events.json","paper":"https://pith.science/paper/UEEIYZDP"},"agent_actions":{"view_html":"https://pith.science/pith/UEEIYZDP5FF2IRIDZKT3MI42WC","download_json":"https://pith.science/pith/UEEIYZDP5FF2IRIDZKT3MI42WC.json","view_paper":"https://pith.science/paper/UEEIYZDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01187&json=true","fetch_graph":"https://pith.science/api/pith-number/UEEIYZDP5FF2IRIDZKT3MI42WC/graph.json","fetch_events":"https://pith.science/api/pith-number/UEEIYZDP5FF2IRIDZKT3MI42WC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEEIYZDP5FF2IRIDZKT3MI42WC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEEIYZDP5FF2IRIDZKT3MI42WC/action/storage_attestation","attest_author":"https://pith.science/pith/UEEIYZDP5FF2IRIDZKT3MI42WC/action/author_attestation","sign_citation":"https://pith.science/pith/UEEIYZDP5FF2IRIDZKT3MI42WC/action/citation_signature","submit_replication":"https://pith.science/pith/UEEIYZDP5FF2IRIDZKT3MI42WC/action/replication_record"}},"created_at":"2026-07-05T02:40:24.858215+00:00","updated_at":"2026-07-05T02:40:24.858215+00:00"}