{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/cascading-bandits-for-large-scale","title":"Cascading Bandits for Large-Scale Recommendation Problems","arxiv_id":"1603.05359","date":"2016-03-17","proceeding":null,"authors":["Shi Zong","Hao Ni","Kenny Sung","Nan Rosemary Ke","Zheng Wen","Branislav Kveton"],"abstract":"Most recommender systems recommend a list of items. The user examines the\nlist, from the first item to the last, and often chooses the first attractive\nitem and does not examine the rest. This type of user behavior can be modeled\nby the cascade model. In this work, we study cascading bandits, an online\nlearning variant of the cascade model where the goal is to recommend $K$ most\nattractive items from a large set of $L$ candidate items. We propose two\nalgorithms for solving this problem, which are based on the idea of linear\ngeneralization. The key idea in our solutions is that we learn a predictor of\nthe attraction probabilities of items from their features, as opposing to\nlearning the attraction probability of each item independently as in the\nexisting work. This results in practical learning algorithms whose regret does\nnot depend on the number of items $L$. We bound the regret of one algorithm and\ncomprehensively evaluate the other on a range of recommendation problems. The\nalgorithm performs well and outperforms all baselines.","url_abs":"http://arxiv.org/abs/1603.05359v2","url_pdf":"http://arxiv.org/pdf/1603.05359v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"cascading-bandits-for-large-scale","repo_url":"https://github.com/niravnb/Movie-Recommendation-using-Cascading-Bandits","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"multi-armed-bandits","task_name":"Multi-Armed Bandits"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"thompson-sampling","task_name":"Thompson Sampling"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1603.05359","atlas_url":"https://app.syntology.ai/?focus=1603.05359","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1603.05359"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1603.05359\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1603.05359"},"call":"get_concepts_for_paper(arxiv_id=\"1603.05359\")"}],"by_repo":[{"repo":"niravnb/Movie-Recommendation-using-Cascading-Bandits","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b5bb1e3c84004a461e5c4abbe639e8ecea542b913f28c5fd1eb594c2341cf55f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}