Research map / Bandits and online learning / Multi-armed bandits
Rebounding Bandits for Modeling Satiation Effects
Liu Leqi, Fatma Kilinc-Karzan, Zachary Chase Lipton, Alan L Montgomery
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use w-lookahead planning instead of full-horizon T-lookahead | Rebounding bandits · T=30 | solve time: 1610s vs. within 2s | Improved |
| Use w-lookahead planning instead of full-horizon T-lookahead | Rebounding bandits · T=30 | expected cumulative reward | No clear effect |
Closest papers by meaning
- Uplifting Bandits (NeurIPS 2022 · similarity 0.88)
- Incentivized Bandit Learning with Self-Reinforcing User Preferences (ICML 2021 · similarity 0.88)
- Bandit Learning with Joint Effect of Incentivized Sampling, Delayed Sampling Feedback, and Self-Reinforcing User Preferences (ICLR 2022 · similarity 0.88)
- Incentivized Exploration with Stochastic Covariates: A Two-Stage Mechanism Design for Recommender System (ICML 2026 · similarity 0.88)
- Bandits Meet Mechanism Design to Combat Clickbait in Online Recommendation (ICLR 2024 · similarity 0.87)
- Greedy Algorithms for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
