Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Cascading Bandits: Optimizing Recommendation Frequency in Delayed Feedback Environments
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Cascading Reinforcement Learning (ICLR 2024 · similarity 0.89)
- Contextual Combinatorial Cascading Bandits (ICML 2016 · similarity 0.89)
- Fighting Boredom in Recommender Systems with Linear Reinforcement Learning (NeurIPS 2018 · similarity 0.88)
- Non-Stationary Delayed Bandits with Intermediate Observations (ICML 2020 · similarity 0.88)
- Bandit Learning with Joint Effect of Incentivized Sampling, Delayed Sampling Feedback, and Self-Reinforcing User Preferences (ICLR 2022 · similarity 0.88)
- Bandits Meet Mechanism Design to Combat Clickbait in Online Recommendation (ICLR 2024 · similarity 0.87)
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.