{"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/rotting-infinitely-many-armed-bandits-beyond","title":"An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints","arxiv_id":"2404.14202","date":"2024-04-22","proceeding":null,"authors":["Jung-hun Kim","Milan Vojnovic","Se-Young Yun"],"abstract":"In this study, we consider the infinitely many-armed bandit problems in a rested rotting setting, where the mean reward of an arm may decrease with each pull, while otherwise, it remains unchanged. We explore two scenarios regarding the rotting of rewards: one in which the cumulative amount of rotting is bounded by $V_T$, referred to as the slow-rotting case, and the other in which the cumulative number of rotting instances is bounded by $S_T$, referred to as the abrupt-rotting case. To address the challenge posed by rotting rewards, we introduce an algorithm that utilizes UCB with an adaptive sliding window, designed to manage the bias and variance trade-off arising due to rotting rewards. Our proposed algorithm achieves tight regret bounds for both slow and abrupt rotting scenarios. Lastly, we demonstrate the performance of our algorithm using numerical experiments.","url_abs":"https://arxiv.org/abs/2404.14202v3","url_pdf":"https://arxiv.org/pdf/2404.14202v3.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":"rotting-infinitely-many-armed-bandits-beyond","repo_url":"https://github.com/junghunkim7786/an-adaptive-approach-for-infinitely-many-armed-bandits-under-generalized-rotting-constraints","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2404.14202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.14202"}},"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/junghunkim7786/an-adaptive-approach-for-infinitely-many-armed-bandits-under-generalized-rotting-constraints","reach":null}],"summary":{"ran":1},"by_repo_kind":{"official":{"samples":1,"ran":1,"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":1,"samples":[{"code_sha256_prefix":"d89da9f8792dbd98","entry":"UCBT_AW","repo":"junghunkim7786/an-adaptive-approach-for-infinitely-many-armed-bandits-under-generalized-rotting-constraints","repo_kind":"official","path":"Algorithms.py","file_url":"https://github.com/junghunkim7786/an-adaptive-approach-for-infinitely-many-armed-bandits-under-generalized-rotting-constraints/blob/HEAD/Algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d89da9f8792dbd98"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}