{"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/scaling-multi-armed-bandit-algorithms","title":"Scaling Multi-Armed Bandit Algorithms","arxiv_id":null,"date":"2019-07-25","proceeding":"KDD 2019 7","authors":["Edouard Fouché","Junpei Komiyama","Klemens Böhm"],"abstract":"The Multi-Armed Bandit (MAB) is a fundamental model capturing\r\nthe dilemma between exploration and exploitation in sequential\r\ndecision making. At every time step, the decision maker selects a\r\nset of arms and observes a reward from each of the chosen arms.\r\nIn this paper, we present a variant of the problem, which we call\r\nthe Scaling MAB (S-MAB): The goal of the decision maker is not\r\nonly to maximize the cumulative rewards, i.e., choosing the arms\r\nwith the highest expected reward, but also to decide how many\r\narms to select so that, in expectation, the cost of selecting arms\r\ndoes not exceed the rewards. This problem is relevant to many real-\r\nworld applications, e.g., online advertising, financial investments\r\nor data stream monitoring. We propose an extension of Thompson\r\nSampling, which has strong theoretical guarantees and is reported\r\nto perform well in practice. Our extension dynamically controls the\r\nnumber of arms to draw. Furthermore, we combine the proposed\r\nmethod with ADWIN, a state-of-the-art change detector, to deal\r\nwith non-static environments. We illustrate the benefits of our\r\ncontribution via a real-world use case on predictive maintenance.","url_abs":"https://dl.acm.org/doi/10.1145/3292500.3330862","url_pdf":"https://www.google.com/url?sa=t&source=web&rct=j&opi=89978449&url=https://edouardfouche.com/publications/S-MAB_FOUCHE_KDD19.pdf&ved=2ahUKEwixw8HZvbGMAxXR9wIHHeuCM08QFnoECBQQAQ&usg=AOvVaw1WSvCiz4ITwfyLlxCFlrfT","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":"scaling-multi-armed-bandit-algorithms","repo_url":"https://github.com/PlaytikaOSS/pybandits","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"multi-armed-bandits","task_name":"Multi-Armed Bandits"},{"task_slug":"sequential-decision-making","task_name":"Sequential Decision Making"},{"task_slug":"thompson-sampling","task_name":"Thompson Sampling"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"PlaytikaOSS/pybandits","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":"bd12e8ef7be5644bb3d5f14c427e8fe1aacf7bdc48cfff0cd8aa2e5f0c194a5b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}