Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Variational Bayesian Optimistic Sampling
Brendan O'Donoghue, Tor Lattimore
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 the variational optimistic policy rather than Thompson sampling | VBOS versus Thompson sampling · Zero-sum game counterexample | regret: 1/4 | Mixed |
| Use Thompson sampling in the constructed game with an opponent playing [0, 1] | Thompson sampling · Zero-sum game counterexample | regret: 1/4 | Hurt |
| Use Thompson sampling for constrained bandits | Thompson sampling · Constrained bandits | regret | Hurt |
Closest papers by meaning
- Sparse Optimistic Information Directed Sampling (NeurIPS 2025 · similarity 0.90)
- Constrained Linear Thompson Sampling (NeurIPS 2025 · similarity 0.89)
- Bayesian Regret Minimization in Offline Bandits (ICML 2024 · similarity 0.89)
- Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization (ICML 2024 · similarity 0.88)
- Block Optimism for Nonstationary Bandits with Latent Linear Dynamics (NeurIPS 2026 · similarity 0.88)
- Efficient Model-Based Reinforcement Learning Through Optimistic Thompson Sampling (ICLR 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.
