Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Regret in Online Recommendation Systems
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
- The Sample Complexity of Online One-Class Collaborative Filtering (ICML 2017 · similarity 0.89)
- Learning the Optimal Recommendation from Explorative Users (AAAI 2022 · similarity 0.89)
- Modeling Attrition in Recommender Systems with Departing Bandits (AAAI 2022 · similarity 0.88)
- Online Reciprocal Recommendation with Theoretical Performance Guarantees (NeurIPS 2018 · similarity 0.87)
- Cascading Bandits: Optimizing Recommendation Frequency in Delayed Feedback Environments (NeurIPS 2023 · similarity 0.87)
- Would You Like Your Data to Be Trained? A User Controllable Recommendation Framework (AAAI 2024 · similarity 0.85)
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.