{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/break-your-bandit-routine-with-lsd-rewards-a","title":"A Last Switch Dependent Analysis of Satiation and Seasonality in Bandits","arxiv_id":"2110.11819","date":"2021-10-22","proceeding":null,"authors":["Pierre Laforgue","Giulia Clerici","Nicolò Cesa-Bianchi","Ran Gilad-Bachrach"],"abstract":"Motivated by the fact that humans like some level of unpredictability or novelty, and might therefore get quickly bored when interacting with a stationary policy, we introduce a novel non-stationary bandit problem, where the expected reward of an arm is fully determined by the time elapsed since the arm last took part in a switch of actions. Our model generalizes previous notions of delay-dependent rewards, and also relaxes most assumptions on the reward function. This enables the modeling of phenomena such as progressive satiation and periodic behaviours. Building upon the Combinatorial Semi-Bandits (CSB) framework, we design an algorithm and prove a bound on its regret with respect to the optimal non-stationary policy (which is NP-hard to compute). Similarly to previous works, our regret analysis is based on defining and solving an appropriate trade-off between approximation and estimation. Preliminary experiments confirm the superiority of our algorithm over both the oracle greedy approach and a vanilla CSB solver.","url_abs":"https://arxiv.org/abs/2110.11819v5","url_pdf":"https://arxiv.org/pdf/2110.11819v5.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":"break-your-bandit-routine-with-lsd-rewards-a","repo_url":"https://github.com/giuliaclerici/lsd_bandits","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2110.11819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.11819"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/giuliaclerici/lsd_bandits","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"6a9be0b4898e3ea9","entry":"gen_M_trickCSBOG","repo":"giuliaclerici/lsd_bandits","repo_kind":"official","path":"data_tools.py","file_url":"https://github.com/giuliaclerici/lsd_bandits/blob/HEAD/data_tools.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6a9be0b4898e3ea9"}},{"code_sha256_prefix":"2d65e1893d7c9c03","entry":"gen_M_trickOG","repo":"giuliaclerici/lsd_bandits","repo_kind":"official","path":"data_tools.py","file_url":"https://github.com/giuliaclerici/lsd_bandits/blob/HEAD/data_tools.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2d65e1893d7c9c03"}},{"code_sha256_prefix":"c7f98feebe6392b5","entry":"gen_c_x","repo":"giuliaclerici/lsd_bandits","repo_kind":"official","path":"algo_tools.py","file_url":"https://github.com/giuliaclerici/lsd_bandits/blob/HEAD/algo_tools.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c7f98feebe6392b5"}},{"code_sha256_prefix":"e9a3755183847a26","entry":"gen_c_y","repo":"giuliaclerici/lsd_bandits","repo_kind":"official","path":"algo_tools.py","file_url":"https://github.com/giuliaclerici/lsd_bandits/blob/HEAD/algo_tools.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e9a3755183847a26"}},{"code_sha256_prefix":"50446f0f16e7d61a","entry":"transition","repo":"giuliaclerici/lsd_bandits","repo_kind":"official","path":"algo_tools.py","file_url":"https://github.com/giuliaclerici/lsd_bandits/blob/HEAD/algo_tools.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"50446f0f16e7d61a"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}