Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Follow-ups Also Matter: Improving Contextual Bandits via Post-serving Contexts
Chaoqi Wang, Ziyu Ye, Zhe Feng, Ashwinkumar Badanidiyuru, Haifeng Xu
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 post-serving context information instead of relying on pre-serving context alone | poLinUCB · Synthetic polynomial, periodic, and linear environments | cumulative regret | Improved |
| Use poLinUCB instead of LinUCB(\widehat{\phi}) | Synthetic polynomial, periodic, and linear environments · Synthetic polynomial, periodic, and linear environments | cumulative regret | Improved |
| Use post-serving context information instead of relying on pre-serving context alone | poLinUCB · MovieLens | cumulative regret | Improved |
| Use poLinUCB instead of LinUCB(\widehat{\phi}) | MovieLens · MovieLens | cumulative regret | Improved |
Closest papers by meaning
- A Contextual Bandit Bake-off (JMLR 2021 · similarity 0.90)
- Active Context Selection Improves Simple Regret in Contextual Bandits (NeurIPS 2026 · similarity 0.89)
- Leveraging Offline Data in Linear Latent Contextual Bandits (ICML 2025 · similarity 0.89)
- High Probability Bound for Cross-Learning Contextual Bandits with Unknown Context Distributions (ICML 2025 · similarity 0.88)
- Efficient Contextual Bandits with Uninformed Feedback Graphs (ICML 2024 · similarity 0.88)
- Contextual Bandits for Unbounded Context Distributions (ICML 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.
