Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Linear Bandits with Feature Feedback
Urvashi Oswal, Aniruddha Bhargava, Robert Nowak
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 FF-OFUL instead of OFUL | Synthetic data with sparse θ* (k = 5, d = 40) · Synthetic data | average regret | Improved |
| Use FF-OFUL instead of OFUL | Synthetic data with dense θ* (k = d = 40) · Synthetic data | average regret | No clear effect |
| Use FF-OFUL instead of OFUL or explore-then-commit | Newsgroup data with oracle feature feedback · 20Newsgroup | average regret | Improved |
| Use FF-OFUL instead of OFUL or explore-then-commit | Newsgroup data with human feature feedback · 20Newsgroup | average regret | Improved |
Closest papers by meaning
- Linear Bandits with Partially Observable Features (ICML 2025 · similarity 0.91)
- Bandits with Ranking Feedback (NeurIPS 2024 · similarity 0.90)
- Near-Optimal Stochastic Linear Bandits with Delay (NeurIPS 2026 · similarity 0.90)
- Ensemble sampling for linear bandits: small ensembles suffice (NeurIPS 2024 · similarity 0.89)
- Generalized Linear Bandits with Limited Adaptivity (NeurIPS 2024 · similarity 0.89)
- 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.
