Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Incentivized Exploration with Stochastic Covariates: A Two-Stage Mechanism Design for Recommender System
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
- Incentivizing Combinatorial Bandit Exploration (NeurIPS 2022 · similarity 0.91)
- Bandit Learning with Joint Effect of Incentivized Sampling, Delayed Sampling Feedback, and Self-Reinforcing User Preferences (ICLR 2022 · similarity 0.90)
- Bandits Meet Mechanism Design to Combat Clickbait in Online Recommendation (ICLR 2024 · similarity 0.90)
- Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts (NeurIPS 2025 · similarity 0.88)
- Gaussian Process Bandits for Top-k Recommendations (NeurIPS 2024 · similarity 0.88)
- Greedy Algorithms for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure (NeurIPS 2025 · similarity 0.88)
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.